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