12.29/12.39 c SCIP version 1.1.0.7
12.29/12.39 c LP-Solver SoPlex 1.4.1
12.29/12.39 c user parameter file <scip.set> not found - using default parameters
12.29/12.39 c read problem <HOME/instance-1884247-1245256236.opb>
12.29/12.39 c original problem has 276402 variables (276402 bin, 0 int, 0 impl, 0 cont) and 798348 constraints
15.69/15.77 c No objective function, only one solution is needed.
15.69/15.77 c start presolving problem
15.69/15.77 c presolving:
28.39/28.41 c (round 1) 99662 del vars, 44010 del conss, 12475 chg bounds, 268 chg sides, 3336 chg coeffs, 0 upgd conss, 9724924 impls, 0 clqs
31.58/31.64 c (round 2) 100359 del vars, 171579 del conss, 12574 chg bounds, 315 chg sides, 3395 chg coeffs, 0 upgd conss, 9741312 impls, 0 clqs
32.08/32.18 c (round 3) 100500 del vars, 171921 del conss, 12642 chg bounds, 317 chg sides, 3399 chg coeffs, 0 upgd conss, 9741590 impls, 0 clqs
32.68/32.70 c (round 4) 100538 del vars, 172161 del conss, 12677 chg bounds, 319 chg sides, 3403 chg coeffs, 0 upgd conss, 9741731 impls, 0 clqs
33.98/34.06 c (round 5) 100558 del vars, 172200 del conss, 12691 chg bounds, 319 chg sides, 3403 chg coeffs, 0 upgd conss, 9741847 impls, 0 clqs
34.98/35.01 c (round 6) 100576 del vars, 172238 del conss, 12703 chg bounds, 320 chg sides, 3405 chg coeffs, 0 upgd conss, 9741866 impls, 0 clqs
35.88/35.95 c (round 7) 100597 del vars, 172280 del conss, 12715 chg bounds, 322 chg sides, 3410 chg coeffs, 0 upgd conss, 9741878 impls, 0 clqs
38.07/38.18 c (round 8) 100614 del vars, 172317 del conss, 12727 chg bounds, 327 chg sides, 3420 chg coeffs, 0 upgd conss, 9741887 impls, 0 clqs
43.68/43.73 c (round 9) 100631 del vars, 172362 del conss, 12740 chg bounds, 340 chg sides, 3446 chg coeffs, 0 upgd conss, 9741900 impls, 0 clqs
53.26/53.39 c (round 10) 100642 del vars, 173032 del conss, 12751 chg bounds, 351 chg sides, 3468 chg coeffs, 623014 upgd conss, 9741911 impls, 0 clqs
54.96/55.02 c (round 11) 100643 del vars, 173058 del conss, 12751 chg bounds, 351 chg sides, 3468 chg coeffs, 624680 upgd conss, 9741911 impls, 0 clqs
56.26/56.37 c presolving (12 rounds):
56.26/56.37 c 100643 deleted vars, 173058 deleted constraints, 12751 tightened bounds, 0 added holes, 351 changed sides, 3468 changed coefficients
56.26/56.37 c 9741911 implications, 0 cliques
56.26/56.37 c presolved problem has 175759 variables (175759 bin, 0 int, 0 impl, 0 cont) and 625290 constraints
56.26/56.37 c 636 constraints of type <linear>
56.26/56.37 c 624654 constraints of type <logicor>
56.26/56.37 c transformed objective value is always integral (scale: 1)
56.26/56.37 c Presolving Time: 28.74
56.26/56.37 c SATUNSAT-LIN
56.26/56.37 c -----------------------------------------------------------------------------------------------
56.26/56.37 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
56.26/56.37 c # [type: int, range: [-1,2147483647], default: 0]
56.26/56.37 c separating/flowcover/freq = c -1
56.26/56.37 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
56.26/56.37 c # [type: int, range: [-1,2147483647], default: 0]
56.26/56.37 c separating/cmir/freq = c -1
56.26/56.37 c # additional number of allowed LP iterations
56.26/56.37 c # [type: int, range: [0,2147483647], default: 1000]
56.26/56.37 c heuristics/veclendiving/maxlpiterofs = c 1500
56.26/56.37 c # maximal fraction of diving LP iterations compared to node LP iterations
56.26/56.37 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
56.26/56.37 c heuristics/veclendiving/maxlpiterquot = c 0.075
56.26/56.37 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
56.26/56.37 c # [type: int, range: [-1,2147483647], default: 10]
56.26/56.37 c heuristics/veclendiving/freq = c -1
56.26/56.37 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
56.26/56.37 c # [type: int, range: [-1,2147483647], default: 1]
56.26/56.37 c heuristics/simplerounding/freq = c -1
56.26/56.37 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
56.26/56.37 c # [type: int, range: [-1,2147483647], default: 10]
56.26/56.37 c heuristics/shifting/freq = c -1
56.26/56.37 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
56.26/56.37 c # [type: int, range: [-1,2147483647], default: 1]
56.26/56.37 c heuristics/rounding/freq = c -1
56.26/56.37 c # additional number of allowed LP iterations
56.26/56.37 c # [type: int, range: [0,2147483647], default: 1000]
56.26/56.37 c heuristics/rootsoldiving/maxlpiterofs = c 1500
56.26/56.37 c # maximal fraction of diving LP iterations compared to node LP iterations
56.26/56.37 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
56.26/56.37 c heuristics/rootsoldiving/maxlpiterquot = c 0.015
56.26/56.37 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
56.26/56.37 c # [type: int, range: [-1,2147483647], default: 20]
56.26/56.37 c heuristics/rootsoldiving/freq = c -1
56.26/56.37 c # number of nodes added to the contingent of the total nodes
56.26/56.37 c # [type: longint, range: [0,9223372036854775807], default: 500]
56.26/56.37 c heuristics/rens/nodesofs = c 2000
56.26/56.37 c # minimum percentage of integer variables that have to be fixable
56.26/56.37 c # [type: real, range: [0,1], default: 0.5]
56.26/56.37 c heuristics/rens/minfixingrate = c 0.3
56.26/56.37 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
56.26/56.37 c # [type: int, range: [-1,2147483647], default: 0]
56.26/56.37 c heuristics/rens/freq = c -1
56.26/56.37 c # additional number of allowed LP iterations
56.26/56.37 c # [type: int, range: [0,2147483647], default: 1000]
56.26/56.37 c heuristics/pscostdiving/maxlpiterofs = c 1500
56.26/56.37 c # maximal fraction of diving LP iterations compared to node LP iterations
56.26/56.37 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
56.26/56.37 c heuristics/pscostdiving/maxlpiterquot = c 0.075
56.26/56.37 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
56.26/56.37 c # [type: int, range: [-1,2147483647], default: 10]
56.26/56.37 c heuristics/pscostdiving/freq = c -1
56.26/56.37 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
56.26/56.37 c # [type: int, range: [-1,2147483647], default: 1]
56.26/56.37 c heuristics/oneopt/freq = c -1
56.26/56.37 c # additional number of allowed LP iterations
56.26/56.37 c # [type: int, range: [0,2147483647], default: 1000]
56.26/56.37 c heuristics/objpscostdiving/maxlpiterofs = c 1500
56.26/56.37 c # maximal fraction of diving LP iterations compared to total iteration number
56.26/56.37 c # [type: real, range: [0,1], default: 0.01]
56.26/56.37 c heuristics/objpscostdiving/maxlpiterquot = c 0.015
56.26/56.37 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
56.26/56.37 c # [type: int, range: [-1,2147483647], default: 20]
56.26/56.37 c heuristics/objpscostdiving/freq = c -1
56.26/56.37 c # additional number of allowed LP iterations
56.26/56.37 c # [type: int, range: [0,2147483647], default: 1000]
56.26/56.37 c heuristics/linesearchdiving/maxlpiterofs = c 1500
56.26/56.37 c # maximal fraction of diving LP iterations compared to node LP iterations
56.26/56.37 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
56.26/56.37 c heuristics/linesearchdiving/maxlpiterquot = c 0.075
56.26/56.37 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
56.26/56.37 c # [type: int, range: [-1,2147483647], default: 10]
56.26/56.37 c heuristics/linesearchdiving/freq = c -1
56.26/56.37 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
56.26/56.37 c # [type: int, range: [-1,2147483647], default: 10]
56.26/56.37 c heuristics/intshifting/freq = c -1
56.26/56.37 c # maximal fraction of diving LP iterations compared to node LP iterations
56.26/56.37 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
56.26/56.37 c heuristics/intdiving/maxlpiterquot = c 0.075
56.26/56.37 c # additional number of allowed LP iterations
56.26/56.37 c # [type: int, range: [0,2147483647], default: 1000]
56.26/56.37 c heuristics/guideddiving/maxlpiterofs = c 1500
56.26/56.37 c # maximal fraction of diving LP iterations compared to node LP iterations
56.26/56.37 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
56.26/56.37 c heuristics/guideddiving/maxlpiterquot = c 0.075
56.26/56.37 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
56.26/56.37 c # [type: int, range: [-1,2147483647], default: 10]
56.26/56.37 c heuristics/guideddiving/freq = c -1
56.26/56.37 c # additional number of allowed LP iterations
56.26/56.37 c # [type: int, range: [0,2147483647], default: 1000]
56.26/56.37 c heuristics/fracdiving/maxlpiterofs = c 1500
56.26/56.37 c # maximal fraction of diving LP iterations compared to node LP iterations
56.26/56.37 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
56.26/56.37 c heuristics/fracdiving/maxlpiterquot = c 0.075
56.26/56.37 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
56.26/56.37 c # [type: int, range: [-1,2147483647], default: 10]
56.26/56.37 c heuristics/fracdiving/freq = c -1
56.26/56.37 c # additional number of allowed LP iterations
56.26/56.37 c # [type: int, range: [0,2147483647], default: 1000]
56.26/56.37 c heuristics/feaspump/maxlpiterofs = c 2000
56.26/56.37 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
56.26/56.37 c # [type: int, range: [-1,2147483647], default: 20]
56.26/56.37 c heuristics/feaspump/freq = c -1
56.26/56.37 c # minimum percentage of integer variables that have to be fixed
56.26/56.37 c # [type: real, range: [0,1], default: 0.666]
56.26/56.37 c heuristics/crossover/minfixingrate = c 0.5
56.26/56.37 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
56.26/56.37 c # [type: real, range: [0,1], default: 0.1]
56.26/56.37 c heuristics/crossover/nodesquot = c 0.15
56.26/56.37 c # number of nodes without incumbent change that heuristic should wait
56.26/56.37 c # [type: longint, range: [0,9223372036854775807], default: 200]
56.26/56.37 c heuristics/crossover/nwaitingnodes = c 100
56.26/56.37 c # number of nodes added to the contingent of the total nodes
56.26/56.37 c # [type: longint, range: [0,9223372036854775807], default: 500]
56.26/56.37 c heuristics/crossover/nodesofs = c 750
56.26/56.37 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
56.26/56.37 c # [type: int, range: [-1,2147483647], default: 30]
56.26/56.37 c heuristics/crossover/freq = c -1
56.26/56.37 c # additional number of allowed LP iterations
56.26/56.37 c # [type: int, range: [0,2147483647], default: 1000]
56.26/56.37 c heuristics/coefdiving/maxlpiterofs = c 1500
56.26/56.37 c # maximal fraction of diving LP iterations compared to node LP iterations
56.26/56.37 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
56.26/56.37 c heuristics/coefdiving/maxlpiterquot = c 0.075
56.26/56.37 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
56.26/56.37 c # [type: int, range: [-1,2147483647], default: 10]
56.26/56.37 c heuristics/coefdiving/freq = c -1
56.26/56.37 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
56.26/56.37 c # [type: int, range: [-1,2147483647], default: -1]
56.26/56.37 c presolving/probing/maxrounds = c 0
56.26/56.37 c # should presolving try to simplify knapsacks
56.26/56.37 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
56.26/56.37 c constraints/knapsack/simplifyinequalities = c TRUE
56.26/56.37 c # should disaggregation of knapsack constraints be allowed in preprocessing?
56.26/56.37 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
56.26/56.37 c constraints/knapsack/disaggregation = c FALSE
56.26/56.37 c # maximal number of cardinality inequalities lifted per separation round (-1: unlimited)
56.26/56.37 c # [type: int, range: [-1,2147483647], default: -1]
56.26/56.37 c constraints/knapsack/maxnumcardlift = c 0
56.26/56.37 c # should presolving try to simplify inequalities
56.45/56.56 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
56.45/56.56 c constraints/linear/simplifyinequalities = c TRUE
56.45/56.56 c # maximal number of separation rounds in the root node (-1: unlimited)
56.45/56.56 c # [type: int, range: [-1,2147483647], default: -1]
56.45/56.56 c separating/maxroundsroot = c 5
56.45/56.56 c # maximal number of separation rounds per node (-1: unlimited)
56.45/56.56 c # [type: int, range: [-1,2147483647], default: 5]
56.45/56.56 c separating/maxrounds = c 1
56.45/56.56 c # solving stops, if the given number of solutions were found (-1: no limit)
56.45/56.56 c # [type: int, range: [-1,2147483647], default: -1]
56.45/56.56 c limits/solutions = c 1
56.45/56.56 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
56.45/56.56 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
56.45/56.56 c limits/memory = c 1620
56.45/56.56 c # maximal time in seconds to run
56.45/56.56 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
56.45/56.56 c limits/time = c 1791
56.45/56.56 c # frequency for displaying node information lines
56.45/56.56 c # [type: int, range: [-1,2147483647], default: 100]
56.45/56.56 c display/freq = c 10000
56.45/56.56 c -----------------------------------------------------------------------------------------------
56.45/56.56 c start solving problem
56.45/56.56 c
58.86/58.93 EMALLC02 realloc: Out of memory - cannot allocate 1462256 bytes
58.86/58.94 c [src/scip/lpi_spx.cpp:811] Warning: SoPlex threw an exception: XMALLC02 realloc: Could not allocate enough memory
58.86/58.94 c [src/scip/lp.c:5300] ERROR: Error <-6> in function call
58.86/58.94 c [src/scip/lp.c:5788] ERROR: Error <-6> in function call
58.86/58.94 c [src/scip/lp.c:10503] ERROR: Error <-6> in function call
58.86/58.94 c [src/scip/solve.c:670] ERROR: Error <-6> in function call
58.86/58.94 c [src/scip/solve.c:1842] ERROR: Error <-6> in function call
58.86/58.94 c [src/scip/solve.c:2513] ERROR: Error <-6> in function call
58.86/58.94 c [src/scip/solve.c:3110] ERROR: Error <-6> in function call
58.86/58.94 c [src/scip/scip.c:5251] ERROR: Error <-6> in function call
58.86/58.94 c [src/cmain.c:772] ERROR: Error <-6> in function call
58.86/58.94 c [src/cmain.c:1137] ERROR: Error <-6> in function call
58.86/58.94 c [src/cmain.c:1217] ERROR: Error <-6> in function call
58.86/58.94 c SCIP Error (-6): c error in LP solverc
58.86/58.94 c Time complete: 58.89.