8.57/8.62 c SCIP version 1.1.0.7
8.57/8.62 c LP-Solver SoPlex 1.4.1
8.57/8.62 c user parameter file <scip.set> not found - using default parameters
8.57/8.62 c read problem <HOME/instance-1868640-1245130322.opb>
8.57/8.62 c original problem has 201731 variables (201731 bin, 0 int, 0 impl, 0 cont) and 592525 constraints
11.08/11.14 c No objective function, only one solution is needed.
11.08/11.14 c start presolving problem
11.08/11.14 c presolving:
23.97/24.07 c (round 1) 8524 del vars, 11074 del conss, 3521 chg bounds, 6548 chg sides, 14490 chg coeffs, 0 upgd conss, 13700352 impls, 0 clqs
24.77/24.85 c (round 2) 8799 del vars, 22387 del conss, 3598 chg bounds, 6548 chg sides, 14490 chg coeffs, 0 upgd conss, 13703994 impls, 0 clqs
25.27/25.37 c (round 3) 9020 del vars, 22919 del conss, 3814 chg bounds, 6548 chg sides, 14490 chg coeffs, 0 upgd conss, 13704530 impls, 0 clqs
25.77/25.89 c (round 4) 9137 del vars, 23196 del conss, 3926 chg bounds, 6548 chg sides, 14490 chg coeffs, 0 upgd conss, 13705110 impls, 0 clqs
26.37/26.42 c (round 5) 9346 del vars, 23537 del conss, 4135 chg bounds, 6548 chg sides, 14490 chg coeffs, 0 upgd conss, 13705760 impls, 0 clqs
26.87/26.95 c (round 6) 9630 del vars, 24127 del conss, 4420 chg bounds, 6548 chg sides, 14490 chg coeffs, 0 upgd conss, 13712071 impls, 0 clqs
27.38/27.49 c (round 7) 9968 del vars, 24870 del conss, 4755 chg bounds, 6548 chg sides, 14490 chg coeffs, 0 upgd conss, 13727267 impls, 0 clqs
27.96/28.06 c (round 8) 10295 del vars, 25735 del conss, 5087 chg bounds, 6548 chg sides, 14490 chg coeffs, 0 upgd conss, 13735202 impls, 0 clqs
28.47/28.59 c (round 9) 10558 del vars, 26545 del conss, 5335 chg bounds, 6548 chg sides, 14490 chg coeffs, 0 upgd conss, 13737858 impls, 0 clqs
29.07/29.17 c (round 10) 10842 del vars, 27197 del conss, 5619 chg bounds, 6548 chg sides, 14490 chg coeffs, 0 upgd conss, 13742812 impls, 0 clqs
29.67/29.71 c (round 11) 11002 del vars, 27845 del conss, 5786 chg bounds, 6548 chg sides, 14490 chg coeffs, 0 upgd conss, 13754801 impls, 0 clqs
30.17/30.25 c (round 12) 11030 del vars, 28193 del conss, 5813 chg bounds, 6548 chg sides, 14490 chg coeffs, 0 upgd conss, 13764139 impls, 0 clqs
30.67/30.77 c (round 13) 11058 del vars, 28261 del conss, 5835 chg bounds, 6548 chg sides, 14490 chg coeffs, 0 upgd conss, 13764765 impls, 0 clqs
31.16/31.28 c (round 14) 11086 del vars, 28319 del conss, 5863 chg bounds, 6548 chg sides, 14490 chg coeffs, 0 upgd conss, 13764873 impls, 0 clqs
31.76/31.82 c (round 15) 11114 del vars, 28389 del conss, 5891 chg bounds, 6548 chg sides, 14490 chg coeffs, 0 upgd conss, 13765493 impls, 0 clqs
32.26/32.33 c (round 16) 11142 del vars, 28459 del conss, 5919 chg bounds, 6548 chg sides, 14490 chg coeffs, 0 upgd conss, 13766501 impls, 0 clqs
32.76/32.85 c (round 17) 11171 del vars, 28532 del conss, 5951 chg bounds, 6548 chg sides, 14490 chg coeffs, 0 upgd conss, 13768037 impls, 0 clqs
33.26/33.37 c (round 18) 11202 del vars, 28616 del conss, 5979 chg bounds, 6548 chg sides, 14490 chg coeffs, 0 upgd conss, 13768879 impls, 0 clqs
33.76/33.89 c (round 19) 11228 del vars, 28681 del conss, 6005 chg bounds, 6548 chg sides, 14490 chg coeffs, 0 upgd conss, 13769441 impls, 0 clqs
34.26/34.40 c (round 20) 11252 del vars, 28745 del conss, 6029 chg bounds, 6548 chg sides, 14490 chg coeffs, 0 upgd conss, 13769907 impls, 0 clqs
34.86/34.90 c (round 21) 11276 del vars, 28805 del conss, 6053 chg bounds, 6548 chg sides, 14490 chg coeffs, 0 upgd conss, 13770213 impls, 0 clqs
35.66/35.76 c (round 22) 11304 del vars, 28899 del conss, 6081 chg bounds, 6548 chg sides, 14490 chg coeffs, 0 upgd conss, 13770585 impls, 0 clqs
40.25/40.37 c (round 23) 11304 del vars, 29551 del conss, 6081 chg bounds, 6548 chg sides, 14490 chg coeffs, 562921 upgd conss, 13770843 impls, 0 clqs
150.29/150.40 c presolving (24 rounds):
150.29/150.40 c 11304 deleted vars, 29551 deleted constraints, 6081 tightened bounds, 0 added holes, 6548 changed sides, 14490 changed coefficients
150.29/150.40 c 13770843 implications, 0 cliques
150.29/150.40 c presolved problem has 190427 variables (190427 bin, 0 int, 0 impl, 0 cont) and 562974 constraints
150.29/150.40 c 12778 constraints of type <knapsack>
150.29/150.40 c 550196 constraints of type <logicor>
150.29/150.40 c transformed objective value is always integral (scale: 1)
150.29/150.40 c Presolving Time: 133.04
150.29/150.40 c SATUNSAT-LIN
150.29/150.40 c -----------------------------------------------------------------------------------------------
150.29/150.40 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
150.29/150.40 c # [type: int, range: [-1,2147483647], default: 0]
150.29/150.40 c separating/flowcover/freq = c -1
150.29/150.40 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
150.29/150.40 c # [type: int, range: [-1,2147483647], default: 0]
150.29/150.40 c separating/cmir/freq = c -1
150.29/150.40 c # additional number of allowed LP iterations
150.29/150.40 c # [type: int, range: [0,2147483647], default: 1000]
150.29/150.40 c heuristics/veclendiving/maxlpiterofs = c 1500
150.29/150.40 c # maximal fraction of diving LP iterations compared to node LP iterations
150.29/150.40 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
150.29/150.40 c heuristics/veclendiving/maxlpiterquot = c 0.075
150.29/150.40 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
150.29/150.40 c # [type: int, range: [-1,2147483647], default: 10]
150.29/150.40 c heuristics/veclendiving/freq = c -1
150.29/150.40 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
150.29/150.40 c # [type: int, range: [-1,2147483647], default: 1]
150.29/150.40 c heuristics/simplerounding/freq = c -1
150.29/150.40 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
150.29/150.40 c # [type: int, range: [-1,2147483647], default: 10]
150.29/150.40 c heuristics/shifting/freq = c -1
150.29/150.40 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
150.29/150.40 c # [type: int, range: [-1,2147483647], default: 1]
150.29/150.40 c heuristics/rounding/freq = c -1
150.29/150.40 c # additional number of allowed LP iterations
150.29/150.40 c # [type: int, range: [0,2147483647], default: 1000]
150.29/150.40 c heuristics/rootsoldiving/maxlpiterofs = c 1500
150.29/150.40 c # maximal fraction of diving LP iterations compared to node LP iterations
150.29/150.40 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
150.29/150.40 c heuristics/rootsoldiving/maxlpiterquot = c 0.015
150.29/150.40 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
150.29/150.40 c # [type: int, range: [-1,2147483647], default: 20]
150.29/150.40 c heuristics/rootsoldiving/freq = c -1
150.29/150.40 c # number of nodes added to the contingent of the total nodes
150.29/150.40 c # [type: longint, range: [0,9223372036854775807], default: 500]
150.29/150.40 c heuristics/rens/nodesofs = c 2000
150.29/150.40 c # minimum percentage of integer variables that have to be fixable
150.29/150.40 c # [type: real, range: [0,1], default: 0.5]
150.29/150.40 c heuristics/rens/minfixingrate = c 0.3
150.29/150.40 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
150.29/150.40 c # [type: int, range: [-1,2147483647], default: 0]
150.29/150.40 c heuristics/rens/freq = c -1
150.29/150.40 c # additional number of allowed LP iterations
150.29/150.40 c # [type: int, range: [0,2147483647], default: 1000]
150.29/150.40 c heuristics/pscostdiving/maxlpiterofs = c 1500
150.29/150.40 c # maximal fraction of diving LP iterations compared to node LP iterations
150.29/150.40 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
150.29/150.40 c heuristics/pscostdiving/maxlpiterquot = c 0.075
150.29/150.40 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
150.29/150.40 c # [type: int, range: [-1,2147483647], default: 10]
150.29/150.40 c heuristics/pscostdiving/freq = c -1
150.29/150.40 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
150.29/150.40 c # [type: int, range: [-1,2147483647], default: 1]
150.29/150.40 c heuristics/oneopt/freq = c -1
150.29/150.40 c # additional number of allowed LP iterations
150.29/150.40 c # [type: int, range: [0,2147483647], default: 1000]
150.29/150.40 c heuristics/objpscostdiving/maxlpiterofs = c 1500
150.29/150.40 c # maximal fraction of diving LP iterations compared to total iteration number
150.29/150.40 c # [type: real, range: [0,1], default: 0.01]
150.29/150.40 c heuristics/objpscostdiving/maxlpiterquot = c 0.015
150.29/150.40 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
150.29/150.40 c # [type: int, range: [-1,2147483647], default: 20]
150.29/150.40 c heuristics/objpscostdiving/freq = c -1
150.29/150.40 c # additional number of allowed LP iterations
150.29/150.40 c # [type: int, range: [0,2147483647], default: 1000]
150.29/150.40 c heuristics/linesearchdiving/maxlpiterofs = c 1500
150.29/150.40 c # maximal fraction of diving LP iterations compared to node LP iterations
150.29/150.40 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
150.29/150.40 c heuristics/linesearchdiving/maxlpiterquot = c 0.075
150.29/150.40 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
150.29/150.40 c # [type: int, range: [-1,2147483647], default: 10]
150.29/150.40 c heuristics/linesearchdiving/freq = c -1
150.29/150.40 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
150.29/150.40 c # [type: int, range: [-1,2147483647], default: 10]
150.29/150.40 c heuristics/intshifting/freq = c -1
150.29/150.40 c # maximal fraction of diving LP iterations compared to node LP iterations
150.29/150.40 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
150.29/150.40 c heuristics/intdiving/maxlpiterquot = c 0.075
150.29/150.40 c # additional number of allowed LP iterations
150.29/150.40 c # [type: int, range: [0,2147483647], default: 1000]
150.29/150.40 c heuristics/guideddiving/maxlpiterofs = c 1500
150.29/150.40 c # maximal fraction of diving LP iterations compared to node LP iterations
150.29/150.40 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
150.29/150.40 c heuristics/guideddiving/maxlpiterquot = c 0.075
150.29/150.40 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
150.29/150.40 c # [type: int, range: [-1,2147483647], default: 10]
150.29/150.40 c heuristics/guideddiving/freq = c -1
150.29/150.40 c # additional number of allowed LP iterations
150.29/150.40 c # [type: int, range: [0,2147483647], default: 1000]
150.29/150.40 c heuristics/fracdiving/maxlpiterofs = c 1500
150.29/150.40 c # maximal fraction of diving LP iterations compared to node LP iterations
150.29/150.40 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
150.29/150.40 c heuristics/fracdiving/maxlpiterquot = c 0.075
150.29/150.40 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
150.29/150.40 c # [type: int, range: [-1,2147483647], default: 10]
150.29/150.40 c heuristics/fracdiving/freq = c -1
150.29/150.40 c # additional number of allowed LP iterations
150.29/150.40 c # [type: int, range: [0,2147483647], default: 1000]
150.29/150.40 c heuristics/feaspump/maxlpiterofs = c 2000
150.29/150.40 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
150.29/150.40 c # [type: int, range: [-1,2147483647], default: 20]
150.29/150.40 c heuristics/feaspump/freq = c -1
150.29/150.40 c # minimum percentage of integer variables that have to be fixed
150.29/150.40 c # [type: real, range: [0,1], default: 0.666]
150.29/150.40 c heuristics/crossover/minfixingrate = c 0.5
150.29/150.40 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
150.29/150.40 c # [type: real, range: [0,1], default: 0.1]
150.29/150.40 c heuristics/crossover/nodesquot = c 0.15
150.29/150.40 c # number of nodes without incumbent change that heuristic should wait
150.29/150.40 c # [type: longint, range: [0,9223372036854775807], default: 200]
150.29/150.40 c heuristics/crossover/nwaitingnodes = c 100
150.29/150.40 c # number of nodes added to the contingent of the total nodes
150.29/150.40 c # [type: longint, range: [0,9223372036854775807], default: 500]
150.29/150.40 c heuristics/crossover/nodesofs = c 750
150.29/150.40 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
150.29/150.40 c # [type: int, range: [-1,2147483647], default: 30]
150.29/150.40 c heuristics/crossover/freq = c -1
150.29/150.40 c # additional number of allowed LP iterations
150.29/150.40 c # [type: int, range: [0,2147483647], default: 1000]
150.29/150.40 c heuristics/coefdiving/maxlpiterofs = c 1500
150.29/150.40 c # maximal fraction of diving LP iterations compared to node LP iterations
150.29/150.40 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
150.29/150.40 c heuristics/coefdiving/maxlpiterquot = c 0.075
150.29/150.40 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
150.29/150.40 c # [type: int, range: [-1,2147483647], default: 10]
150.29/150.40 c heuristics/coefdiving/freq = c -1
150.29/150.40 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
150.29/150.40 c # [type: int, range: [-1,2147483647], default: -1]
150.29/150.40 c presolving/probing/maxrounds = c 0
150.29/150.40 c # should presolving try to simplify knapsacks
150.29/150.40 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
150.29/150.40 c constraints/knapsack/simplifyinequalities = c TRUE
150.29/150.40 c # should disaggregation of knapsack constraints be allowed in preprocessing?
150.29/150.40 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
150.29/150.40 c constraints/knapsack/disaggregation = c FALSE
150.29/150.40 c # maximal number of cardinality inequalities lifted per separation round (-1: unlimited)
150.29/150.40 c # [type: int, range: [-1,2147483647], default: -1]
150.29/150.40 c constraints/knapsack/maxnumcardlift = c 0
150.29/150.40 c # should presolving try to simplify inequalities
150.39/150.58 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
150.39/150.58 c constraints/linear/simplifyinequalities = c TRUE
150.39/150.58 c # maximal number of separation rounds in the root node (-1: unlimited)
150.39/150.58 c # [type: int, range: [-1,2147483647], default: -1]
150.39/150.58 c separating/maxroundsroot = c 5
150.39/150.58 c # maximal number of separation rounds per node (-1: unlimited)
150.39/150.58 c # [type: int, range: [-1,2147483647], default: 5]
150.39/150.58 c separating/maxrounds = c 1
150.39/150.58 c # solving stops, if the given number of solutions were found (-1: no limit)
150.39/150.58 c # [type: int, range: [-1,2147483647], default: -1]
150.39/150.58 c limits/solutions = c 1
150.39/150.58 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
150.39/150.58 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
150.39/150.58 c limits/memory = c 1620
150.39/150.58 c # maximal time in seconds to run
150.39/150.58 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
150.39/150.58 c limits/time = c 1791
150.39/150.58 c # frequency for displaying node information lines
150.39/150.58 c # [type: int, range: [-1,2147483647], default: 100]
150.39/150.58 c display/freq = c 10000
150.39/150.58 c -----------------------------------------------------------------------------------------------
150.39/150.58 c start solving problem
150.39/150.58 c
153.08/153.26 EMALLC01 malloc: Out of memory - cannot allocate 72060672 bytes
153.08/153.26 c [src/scip/lpi_spx.cpp:918] Warning: SoPlex threw an exception: XMALLC01 malloc: Could not allocate enough memory
153.08/153.26 c [src/scip/lp.c:5513] ERROR: Error <-6> in function call
153.08/153.26 c [src/scip/lp.c:5789] ERROR: Error <-6> in function call
153.08/153.26 c [src/scip/lp.c:10503] ERROR: Error <-6> in function call
153.08/153.26 c [src/scip/solve.c:670] ERROR: Error <-6> in function call
153.08/153.27 c [src/scip/solve.c:1842] ERROR: Error <-6> in function call
153.08/153.27 c [src/scip/solve.c:2513] ERROR: Error <-6> in function call
153.08/153.27 c [src/scip/solve.c:3110] ERROR: Error <-6> in function call
153.08/153.27 c [src/scip/scip.c:5251] ERROR: Error <-6> in function call
153.08/153.27 c [src/cmain.c:772] ERROR: Error <-6> in function call
153.08/153.27 c [src/cmain.c:1137] ERROR: Error <-6> in function call
153.08/153.27 c [src/cmain.c:1217] ERROR: Error <-6> in function call
153.08/153.27 c SCIP Error (-6): c error in LP solverc
153.08/153.27 c Time complete: 153.13.