13.79/13.84 c SCIP version 1.1.0.7
13.79/13.84 c LP-Solver SoPlex 1.4.1
13.79/13.84 c user parameter file <scip.set> not found - using default parameters
13.79/13.84 c read problem <HOME/instance-1868442-1245126407.opb>
13.79/13.84 c original problem has 2800 variables (2800 bin, 0 int, 0 impl, 0 cont) and 990001 constraints
16.79/16.81 c No objective function, only one solution is needed.
16.79/16.81 c start presolving problem
16.79/16.81 c presolving:
26.18/26.24 c (round 1) 0 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 990000 upgd conss, 2400 impls, 80 clqs
28.28/28.33 c (round 2) 0 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 3241 chg coeffs, 990000 upgd conss, 2400 impls, 80 clqs
30.47/30.55 c presolving (3 rounds):
30.47/30.55 c 0 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 3414 changed coefficients
30.47/30.55 c 5520 implications, 80 cliques
30.47/30.55 c presolved problem has 2800 variables (2800 bin, 0 int, 0 impl, 0 cont) and 990001 constraints
30.47/30.55 c 3160 constraints of type <knapsack>
30.47/30.55 c 80 constraints of type <setppc>
30.47/30.55 c 1 constraints of type <linear>
30.47/30.55 c 986760 constraints of type <logicor>
30.47/30.55 c transformed objective value is always integral (scale: 1)
30.47/30.55 c Presolving Time: 11.17
30.47/30.55 c SATUNSAT-LIN
30.47/30.55 c -----------------------------------------------------------------------------------------------
30.47/30.55 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
30.47/30.55 c # [type: int, range: [-1,2147483647], default: 0]
30.47/30.55 c separating/flowcover/freq = c -1
30.47/30.55 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
30.47/30.55 c # [type: int, range: [-1,2147483647], default: 0]
30.47/30.55 c separating/cmir/freq = c -1
30.47/30.55 c # additional number of allowed LP iterations
30.47/30.55 c # [type: int, range: [0,2147483647], default: 1000]
30.47/30.55 c heuristics/veclendiving/maxlpiterofs = c 1500
30.47/30.55 c # maximal fraction of diving LP iterations compared to node LP iterations
30.47/30.55 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
30.47/30.55 c heuristics/veclendiving/maxlpiterquot = c 0.075
30.47/30.55 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
30.47/30.55 c # [type: int, range: [-1,2147483647], default: 10]
30.47/30.55 c heuristics/veclendiving/freq = c -1
30.47/30.55 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
30.47/30.55 c # [type: int, range: [-1,2147483647], default: 1]
30.47/30.55 c heuristics/simplerounding/freq = c -1
30.47/30.55 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
30.47/30.55 c # [type: int, range: [-1,2147483647], default: 10]
30.47/30.55 c heuristics/shifting/freq = c -1
30.47/30.55 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
30.47/30.55 c # [type: int, range: [-1,2147483647], default: 1]
30.47/30.55 c heuristics/rounding/freq = c -1
30.47/30.55 c # additional number of allowed LP iterations
30.47/30.55 c # [type: int, range: [0,2147483647], default: 1000]
30.47/30.55 c heuristics/rootsoldiving/maxlpiterofs = c 1500
30.47/30.55 c # maximal fraction of diving LP iterations compared to node LP iterations
30.47/30.55 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
30.47/30.55 c heuristics/rootsoldiving/maxlpiterquot = c 0.015
30.47/30.55 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
30.47/30.55 c # [type: int, range: [-1,2147483647], default: 20]
30.47/30.55 c heuristics/rootsoldiving/freq = c -1
30.47/30.55 c # number of nodes added to the contingent of the total nodes
30.47/30.55 c # [type: longint, range: [0,9223372036854775807], default: 500]
30.47/30.55 c heuristics/rens/nodesofs = c 2000
30.47/30.55 c # minimum percentage of integer variables that have to be fixable
30.47/30.55 c # [type: real, range: [0,1], default: 0.5]
30.47/30.55 c heuristics/rens/minfixingrate = c 0.3
30.47/30.55 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
30.47/30.55 c # [type: int, range: [-1,2147483647], default: 0]
30.47/30.55 c heuristics/rens/freq = c -1
30.47/30.55 c # additional number of allowed LP iterations
30.47/30.55 c # [type: int, range: [0,2147483647], default: 1000]
30.47/30.55 c heuristics/pscostdiving/maxlpiterofs = c 1500
30.47/30.55 c # maximal fraction of diving LP iterations compared to node LP iterations
30.47/30.55 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
30.47/30.55 c heuristics/pscostdiving/maxlpiterquot = c 0.075
30.47/30.55 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
30.47/30.55 c # [type: int, range: [-1,2147483647], default: 10]
30.47/30.55 c heuristics/pscostdiving/freq = c -1
30.47/30.55 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
30.47/30.55 c # [type: int, range: [-1,2147483647], default: 1]
30.47/30.55 c heuristics/oneopt/freq = c -1
30.47/30.55 c # additional number of allowed LP iterations
30.47/30.55 c # [type: int, range: [0,2147483647], default: 1000]
30.47/30.55 c heuristics/objpscostdiving/maxlpiterofs = c 1500
30.47/30.55 c # maximal fraction of diving LP iterations compared to total iteration number
30.47/30.55 c # [type: real, range: [0,1], default: 0.01]
30.47/30.55 c heuristics/objpscostdiving/maxlpiterquot = c 0.015
30.47/30.55 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
30.47/30.55 c # [type: int, range: [-1,2147483647], default: 20]
30.47/30.55 c heuristics/objpscostdiving/freq = c -1
30.47/30.55 c # additional number of allowed LP iterations
30.47/30.55 c # [type: int, range: [0,2147483647], default: 1000]
30.47/30.55 c heuristics/linesearchdiving/maxlpiterofs = c 1500
30.47/30.55 c # maximal fraction of diving LP iterations compared to node LP iterations
30.47/30.55 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
30.47/30.55 c heuristics/linesearchdiving/maxlpiterquot = c 0.075
30.47/30.55 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
30.47/30.55 c # [type: int, range: [-1,2147483647], default: 10]
30.47/30.55 c heuristics/linesearchdiving/freq = c -1
30.47/30.55 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
30.47/30.55 c # [type: int, range: [-1,2147483647], default: 10]
30.47/30.55 c heuristics/intshifting/freq = c -1
30.47/30.55 c # maximal fraction of diving LP iterations compared to node LP iterations
30.47/30.55 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
30.47/30.55 c heuristics/intdiving/maxlpiterquot = c 0.075
30.47/30.55 c # additional number of allowed LP iterations
30.47/30.55 c # [type: int, range: [0,2147483647], default: 1000]
30.47/30.55 c heuristics/guideddiving/maxlpiterofs = c 1500
30.47/30.55 c # maximal fraction of diving LP iterations compared to node LP iterations
30.47/30.55 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
30.47/30.55 c heuristics/guideddiving/maxlpiterquot = c 0.075
30.47/30.55 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
30.47/30.55 c # [type: int, range: [-1,2147483647], default: 10]
30.47/30.55 c heuristics/guideddiving/freq = c -1
30.47/30.55 c # additional number of allowed LP iterations
30.47/30.55 c # [type: int, range: [0,2147483647], default: 1000]
30.47/30.55 c heuristics/fracdiving/maxlpiterofs = c 1500
30.47/30.55 c # maximal fraction of diving LP iterations compared to node LP iterations
30.47/30.55 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
30.47/30.55 c heuristics/fracdiving/maxlpiterquot = c 0.075
30.47/30.55 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
30.47/30.55 c # [type: int, range: [-1,2147483647], default: 10]
30.47/30.55 c heuristics/fracdiving/freq = c -1
30.47/30.55 c # additional number of allowed LP iterations
30.47/30.55 c # [type: int, range: [0,2147483647], default: 1000]
30.47/30.55 c heuristics/feaspump/maxlpiterofs = c 2000
30.47/30.55 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
30.47/30.55 c # [type: int, range: [-1,2147483647], default: 20]
30.47/30.55 c heuristics/feaspump/freq = c -1
30.47/30.55 c # minimum percentage of integer variables that have to be fixed
30.47/30.55 c # [type: real, range: [0,1], default: 0.666]
30.47/30.55 c heuristics/crossover/minfixingrate = c 0.5
30.47/30.55 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
30.47/30.55 c # [type: real, range: [0,1], default: 0.1]
30.47/30.55 c heuristics/crossover/nodesquot = c 0.15
30.47/30.55 c # number of nodes without incumbent change that heuristic should wait
30.47/30.55 c # [type: longint, range: [0,9223372036854775807], default: 200]
30.47/30.55 c heuristics/crossover/nwaitingnodes = c 100
30.47/30.55 c # number of nodes added to the contingent of the total nodes
30.47/30.55 c # [type: longint, range: [0,9223372036854775807], default: 500]
30.47/30.55 c heuristics/crossover/nodesofs = c 750
30.47/30.55 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
30.47/30.55 c # [type: int, range: [-1,2147483647], default: 30]
30.47/30.55 c heuristics/crossover/freq = c -1
30.47/30.55 c # additional number of allowed LP iterations
30.47/30.55 c # [type: int, range: [0,2147483647], default: 1000]
30.47/30.55 c heuristics/coefdiving/maxlpiterofs = c 1500
30.47/30.55 c # maximal fraction of diving LP iterations compared to node LP iterations
30.47/30.55 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
30.47/30.55 c heuristics/coefdiving/maxlpiterquot = c 0.075
30.47/30.55 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
30.47/30.55 c # [type: int, range: [-1,2147483647], default: 10]
30.47/30.55 c heuristics/coefdiving/freq = c -1
30.47/30.55 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
30.47/30.55 c # [type: int, range: [-1,2147483647], default: -1]
30.47/30.55 c presolving/probing/maxrounds = c 0
30.47/30.55 c # should presolving try to simplify knapsacks
30.47/30.55 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
30.47/30.55 c constraints/knapsack/simplifyinequalities = c TRUE
30.47/30.55 c # should disaggregation of knapsack constraints be allowed in preprocessing?
30.47/30.55 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
30.47/30.55 c constraints/knapsack/disaggregation = c FALSE
30.47/30.55 c # maximal number of cardinality inequalities lifted per separation round (-1: unlimited)
30.47/30.55 c # [type: int, range: [-1,2147483647], default: -1]
30.47/30.55 c constraints/knapsack/maxnumcardlift = c 0
30.47/30.55 c # should presolving try to simplify inequalities
30.57/30.61 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
30.57/30.61 c constraints/linear/simplifyinequalities = c TRUE
30.57/30.61 c # maximal number of separation rounds in the root node (-1: unlimited)
30.57/30.61 c # [type: int, range: [-1,2147483647], default: -1]
30.57/30.61 c separating/maxroundsroot = c 5
30.57/30.61 c # maximal number of separation rounds per node (-1: unlimited)
30.57/30.61 c # [type: int, range: [-1,2147483647], default: 5]
30.57/30.61 c separating/maxrounds = c 1
30.57/30.61 c # solving stops, if the given number of solutions were found (-1: no limit)
30.57/30.61 c # [type: int, range: [-1,2147483647], default: -1]
30.57/30.61 c limits/solutions = c 1
30.57/30.61 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
30.57/30.61 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
30.57/30.61 c limits/memory = c 1620
30.57/30.61 c # maximal time in seconds to run
30.57/30.61 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
30.57/30.61 c limits/time = c 1791
30.57/30.61 c # frequency for displaying node information lines
30.57/30.61 c # [type: int, range: [-1,2147483647], default: 100]
30.57/30.61 c display/freq = c 10000
30.57/30.61 c -----------------------------------------------------------------------------------------------
30.57/30.61 c start solving problem
30.57/30.61 c
35.77/35.85 EMALLC02 realloc: Out of memory - cannot allocate 6133504 bytes
35.77/35.87 c [src/scip/lpi_spx.cpp:918] Warning: SoPlex threw an exception: XMALLC02 realloc: Could not allocate enough memory
35.77/35.87 c [src/scip/lp.c:5513] ERROR: Error <-6> in function call
35.77/35.87 c [src/scip/lp.c:5789] ERROR: Error <-6> in function call
35.77/35.87 c [src/scip/lp.c:10503] ERROR: Error <-6> in function call
35.77/35.87 c [src/scip/solve.c:670] ERROR: Error <-6> in function call
35.77/35.87 c [src/scip/solve.c:1842] ERROR: Error <-6> in function call
35.77/35.87 c [src/scip/solve.c:2513] ERROR: Error <-6> in function call
35.77/35.87 c [src/scip/solve.c:3110] ERROR: Error <-6> in function call
35.77/35.87 c [src/scip/scip.c:5251] ERROR: Error <-6> in function call
35.77/35.87 c [src/cmain.c:772] ERROR: Error <-6> in function call
35.77/35.87 c [src/cmain.c:1137] ERROR: Error <-6> in function call
35.77/35.87 c [src/cmain.c:1217] ERROR: Error <-6> in function call
35.77/35.87 c SCIP Error (-6): c error in LP solverc
35.77/35.87 c Time complete: 35.84.