(pyenv) joey@yunzhuang-TM1801:~/Software/scipoptsuite-8.0.0/build$ gdb --args gcg -f '/home/joey/Projects/gcg-exp/dec_int/brazil3.mps.gz' GNU gdb (Ubuntu 9.2-0ubuntu1~20.04.1) 9.2 Copyright (C) 2020 Free Software Foundation, Inc. License GPLv3+: GNU GPL version 3 or later This is free software: you are free to change and redistribute it. There is NO WARRANTY, to the extent permitted by law. Type "show copying" and "show warranty" for details. This GDB was configured as "x86_64-linux-gnu". Type "show configuration" for configuration details. For bug reporting instructions, please see: . Find the GDB manual and other documentation resources online at: . For help, type "help". Type "apropos word" to search for commands related to "word"... Reading symbols from gcg... (gdb) set logging on Copying output to gdb.txt. Copying debug output to gdb.txt. (gdb) run Starting program: /home/joey/Software/scipoptsuite-8.0.0/build/bin/gcg -f /home/joey/Projects/gcg-exp/dec_int/brazil3.mps.gz [Thread debugging using libthread_db enabled] Using host libthread_db library "/lib/x86_64-linux-gnu/libthread_db.so.1". [New Thread 0x7ffff114b700 (LWP 94285)] [New Thread 0x7ffff094a700 (LWP 94286)] [New Thread 0x7fffee149700 (LWP 94287)] [New Thread 0x7fffe9948700 (LWP 94288)] [New Thread 0x7fffe7147700 (LWP 94289)] [New Thread 0x7fffe6946700 (LWP 94290)] [New Thread 0x7fffe2145700 (LWP 94291)] GCG version 3.5.0 [GitHash: b54569ac6] Copyright (C) 2010-2021 Operations Research, RWTH Aachen University Konrad-Zuse-Zentrum fuer Informationstechnik Berlin (ZIB) SCIP version 8.0.0 [precision: 8 byte] [memory: block] [mode: debug] [LP solver: SoPlex 6.0.0] [GitHash: a740f0891e] Copyright (C) 2002-2021 Konrad-Zuse-Zentrum fuer Informationstechnik Berlin (ZIB) External libraries: Readline 8.0 GNU library for command line editing (gnu.org/s/readline) SoPlex 6.0.0 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: 71a5873d] CppAD 20180000.0 Algorithmic Differentiation of C++ algorithms developed by B. Bell (github.com/coin-or/CppAD) ZLIB 1.2.11 General purpose compression library by J. Gailly and M. Adler (zlib.net) ZIMPL 3.5.1 Zuse Institute Mathematical Programming Language developed by T. Koch (zimpl.zib.de) bliss 0.73.3p A Tool for Computing Automorphism Groups of Graphs by T. Junttila and P. Kaski (http://www.tcs.hut.fi/Software/bliss/) Cliquer A set of C routines for finding cliques in an arbitrary weighted graph by S. Niskanen and P. Ostergard (https://users.aalto.fi/~pat/cliquer.html) user parameter file not found - using default parameters read problem ============ original problem has 23968 variables (23874 bin, 94 int, 0 impl, 0 cont) and 14646 constraints solve problem ============= presolving: (round 1, fast) 16740 del vars, 8686 del conss, 53 add conss, 1164 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 0 impls, 3930 clqs (round 2, fast) 18408 del vars, 9803 del conss, 90 add conss, 1220 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 0 impls, 3941 clqs (round 3, exhaustive) 18408 del vars, 11050 del conss, 90 add conss, 1236 chg bounds, 114 chg sides, 0 chg coeffs, 0 upgd conss, 0 impls, 3941 clqs (round 4, exhaustive) 18408 del vars, 11060 del conss, 90 add conss, 1236 chg bounds, 124 chg sides, 0 chg coeffs, 0 upgd conss, 0 impls, 3941 clqs (round 5, exhaustive) 18408 del vars, 11060 del conss, 90 add conss, 1236 chg bounds, 124 chg sides, 0 chg coeffs, 3266 upgd conss, 0 impls, 3941 clqs (round 6, medium) 18958 del vars, 11060 del conss, 90 add conss, 1236 chg bounds, 674 chg sides, 550 chg coeffs, 3266 upgd conss, 0 impls, 3391 clqs (round 7, fast) 18958 del vars, 11610 del conss, 90 add conss, 1236 chg bounds, 674 chg sides, 550 chg coeffs, 3266 upgd conss, 0 impls, 3391 clqs (round 8, exhaustive) 18958 del vars, 12080 del conss, 139 add conss, 1236 chg bounds, 674 chg sides, 550 chg coeffs, 3266 upgd conss, 0 impls, 3391 clqs (round 9, exhaustive) 18958 del vars, 12342 del conss, 139 add conss, 1236 chg bounds, 674 chg sides, 550 chg coeffs, 3266 upgd conss, 0 impls, 3391 clqs (round 10, exhaustive) 18958 del vars, 12342 del conss, 139 add conss, 1236 chg bounds, 686 chg sides, 550 chg coeffs, 3266 upgd conss, 0 impls, 3391 clqs (round 11, exhaustive) 18958 del vars, 12342 del conss, 139 add conss, 1236 chg bounds, 686 chg sides, 550 chg coeffs, 3278 upgd conss, 0 impls, 3391 clqs (round 12, exhaustive) 18958 del vars, 12348 del conss, 139 add conss, 1236 chg bounds, 686 chg sides, 550 chg coeffs, 3278 upgd conss, 0 impls, 3391 clqs (1.6s) probing: 51/6545 (0.8%) - 0 fixings, 0 aggregations, 0 implications, 0 bound changes (1.6s) probing aborted: 50/50 successive totally useless probings presolving (13 rounds: 13 fast, 10 medium, 9 exhaustive): 18958 deleted vars, 12348 deleted constraints, 139 added constraints, 1236 tightened bounds, 0 added holes, 686 changed sides, 550 changed coefficients 0 implications, 3391 cliques presolved problem has 6550 variables (6545 bin, 5 int, 0 impl, 0 cont) and 2437 constraints 5 constraints of type 1891 constraints of type 49 constraints of type 398 constraints of type 94 constraints of type transformed objective value is always integral (scale: 1) Presolving Time: 1.57 Consclassifier "nonzeros" yields a classification with 36 different constraint classes Consclassifier "constypes" yields a classification with 6 different constraint classes Consclassifier "constypes according to miplib" yields a classification with 9 different constraint classes Consclassifier "gamsdomain" yields a classification with 1 different constraint classes Consclassifier "gamssymbols" yields a classification with 1 different constraint classes Conspartition "gamssymbols" is not considered since it offers the same structure as "gamsdomain" conspartition Varclassifier "gamsdomain" yields a classification with 1 different variable classes Varclassifier "gamssymbols" yields a classification with 1 different variable classes Varpartition "gamssymbols" is not considered since it offers the same structure as "gamsdomain" Varclassifier "vartypes" yields a classification with 2 different variable classes Varclassifier "varobjvals" yields a classification with 4 different variable classes Varclassifier "varobjvalsigns" yields a classification with 3 different variable classes the current consclass distribution includes 36 classes but only 18 are allowed for GCGconshdlrDecompCalcCandidatesNBlocks() in dec_consclass: there are 4 different constraint classes the current consclass distribution includes 36 classes but only 9 are allowed for propagatePartialdec() of cons class detector the current constraint classifier "constypes" consists of 6 different classes the current constraint classifier "constypes according to miplib" consists of 9 different classes the current constraint classifier "gamsdomain" consists of 1 different classes dec_consclass found 575 new partialdecs dec_densemasterconss found 1 new partialdec dec_neighborhoodmaster found 1 new partialdec POSTPROCESSING of decompositions. Added 146 new decomps. Found 712 finished decompositions. Measured running time per detector: Detector postprocess worked on 146 finished decompositions and took a total time of 0.493 Detector consclass worked on 689 finished decompositions and took a total time of 0.377 Detector neighborhoodmaster worked on 1 finished decompositions and took a total time of 0.001 Detector connectedbase worked on 711 finished decompositions and took a total time of 11.064 Detector varclass worked on 21 finished decompositions and took a total time of 0.055 Detection Time: 31.23 A Dantzig-Wolfe reformulation is applied to solve the original problem. Chosen structure has 168 blocks, 292 master-only (static) variables, and 851 linking constraints. This decomposition has a maxwhite score of 0.644247. Master problem is a set partitioning problem. gcg: /home/joey/Software/scipoptsuite-8.0.0/gcg/src/scip_misc.c:636: GCGconsGetVals: Assertion `nvals > 0' failed. Thread 1 "gcg" received signal SIGABRT, Aborted. __GI_raise (sig=sig@entry=6) at ../sysdeps/unix/sysv/linux/raise.c:50 50 ../sysdeps/unix/sysv/linux/raise.c: No such file or directory. #0 __GI_raise (sig=sig@entry=6) at ../sysdeps/unix/sysv/linux/raise.c:50 #1 0x00007ffff5d68859 in __GI_abort () at abort.c:79 #2 0x00007ffff5d68729 in __assert_fail_base (fmt=0x7ffff5efe588 "%s%s%s:%u: %s%sAssertion `%s' failed.\n%n", assertion=0x5555558bd73c "nvals > 0", file=0x5555558bd630 "/home/joey/Software/scipoptsuite-8.0.0/gcg/src/scip_misc.c", line=636, function=) at assert.c:92 #3 0x00007ffff5d7a006 in __GI___assert_fail (assertion=0x5555558bd73c "nvals > 0", file=0x5555558bd630 "/home/joey/Software/scipoptsuite-8.0.0/gcg/src/scip_misc.c", line=636, function=0x5555558bd890 <__PRETTY_FUNCTION__.27501> "GCGconsGetVals") at assert.c:101 #4 0x000055555583e248 in GCGconsGetVals (scip=0x555555983480, cons=0x7fffdc03c0f8, vals=0x7fffdb34e010, nvals=0) at /home/joey/Software/scipoptsuite-8.0.0/gcg/src/scip_misc.c:636 #5 0x00005555556742f6 in gcg::PARTIALDECOMP::checkIdenticalBlocksBrute (this=0x55555c817c40, b1=68, b2=69, varmap=std::vector of length 6550, capacity 6550 = {...}, varmap2=0x7fffdbe3f000, identical=0x7fffffffc518) at /home/joey/Software/scipoptsuite-8.0.0/gcg/src/class_partialdecomp.cpp:2028 #6 0x000055555566fcd1 in gcg::PARTIALDECOMP::calcAggregationInformation (this=0x55555c817c40, ignoreDetectionLimits=true) at /home/joey/Software/scipoptsuite-8.0.0/gcg/src/class_partialdecomp.cpp:1198 #7 0x00005555556d9430 in GCGconshdlrDecompArePricingprobsIdenticalForPartialdecid (scip=0x555555983480, partialdecid=1178, probnr1=0, probnr2=1, identical=0x7fffffffc6e0) at /home/joey/Software/scipoptsuite-8.0.0/gcg/src/cons_decomp.cpp:3691 #8 0x0000555555829775 in pricingprobsAreIdenticalFromDetectionInfo (scip=0x555555983480, relaxdata=0x555555a398b0, hashorig2pricingvar=0x7fffda8d8010, probnr1=1, probnr2=0, varmap=0x7fffdbe3d228, identical=0x7fffffffc6e0) at /home/joey/Software/scipoptsuite-8.0.0/gcg/src/relax_gcg.c:827 #9 0x0000555555829d9d in checkIdenticalBlocks (scip=0x555555983480, relaxdata=0x555555a398b0, hashorig2pricingvar=0x7fffda8d8010) at /home/joey/Software/scipoptsuite-8.0.0/gcg/src/relax_gcg.c:955 #10 0x000055555583013d in createMaster (scip=0x555555983480, relaxdata=0x555555a398b0) at /home/joey/Software/scipoptsuite-8.0.0/gcg/src/relax_gcg.c:1970 #11 0x0000555555832651 in initRelaxator (scip=0x555555983480, relax=0x555555a3c4b0) at /home/joey/Software/scipoptsuite-8.0.0/gcg/src/relax_gcg.c:2635 #12 0x0000555555833477 in relaxInitsolGcg (scip=0x555555983480, relax=0x555555a3c4b0) at /home/joey/Software/scipoptsuite-8.0.0/gcg/src/relax_gcg.c:2899 #13 0x00007ffff73501c3 in SCIPrelaxInitsol (relax=0x555555a3c4b0, set=0x555555988370) at /home/joey/Software/scipoptsuite-8.0.0/scip/src/scip/relax.c:309 #14 0x00007ffff74421b6 in SCIPsetInitsolPlugins (set=0x555555988370, blkmem=0x555555986290, stat=0x555555bfe860) at /home/joey/Software/scipoptsuite-8.0.0/scip/src/scip/set.c:5538 #15 0x00007ffff73e3eec in initSolve (scip=0x555555983480, solved=0) at /home/joey/Software/scipoptsuite-8.0.0/scip/src/scip/scip_solve.c:1674 #16 0x00007ffff73e9253 in SCIPsolve (scip=0x555555983480) at /home/joey/Software/scipoptsuite-8.0.0/scip/src/scip/scip_solve.c:2734 #17 0x000055555583c4ee in GCGsolve (scip=0x555555983480) at /home/joey/Software/scipoptsuite-8.0.0/gcg/src/relax_gcg.c:5415 #18 0x0000555555632af6 in fromCommandLine (scip=0x555555983480, filename=0x7fffffffdb1d "/home/joey/Projects/gcg-exp/dec_int/brazil3.mps.gz", decname=0x0) at /home/joey/Software/scipoptsuite-8.0.0/gcg/src/main.c:105 #19 0x00005555556337c9 in SCIPprocessGCGShellArguments (scip=0x555555983480, argc=3, argv=0x7fffffffd708, defaultsetname=0x55555587a788 "gcg.set") at /home/joey/Software/scipoptsuite-8.0.0/gcg/src/main.c:364 #20 0x0000555555633a76 in SCIPrunGCGShell (argc=3, argv=0x7fffffffd708, defaultsetname=0x55555587a788 "gcg.set") at /home/joey/Software/scipoptsuite-8.0.0/gcg/src/main.c:422 #21 0x0000555555633b3d in main (argc=3, argv=0x7fffffffd708) at /home/joey/Software/scipoptsuite-8.0.0/gcg/src/main.c:446