0.00/0.00 c SCIP version 1.2.1.2 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: Clp 1.11.1] [Expressions interpreter: NONE]
0.00/0.00 c Copyright (c) 2002-2010 Konrad-Zuse-Zentrum fuer Informationstechnik Berlin (ZIB)
0.00/0.00 c
0.00/0.00 c user parameter file <scip.set> not found - using default parameters
0.00/0.00 c reading problem <HOME/instance-2665455-1276339467.opb>
10.39/10.46 c original problem has 201731 variables (201731 bin, 0 int, 0 impl, 0 cont) and 592525 constraints
10.39/10.46 c problem read
10.39/10.47 c No objective function, only one solution is needed.
10.39/10.49 c presolving settings loaded
13.59/13.61 c presolving:
27.18/27.22 c (round 1) 8525 del vars, 11075 del conss, 3521 chg bounds, 6548 chg sides, 14490 chg coeffs, 0 upgd conss, 13700352 impls, 0 clqs
28.08/28.19 c (round 2) 8801 del vars, 22390 del conss, 3599 chg bounds, 6548 chg sides, 14490 chg coeffs, 0 upgd conss, 13703994 impls, 0 clqs
28.78/28.87 c (round 3) 9020 del vars, 22919 del conss, 3813 chg bounds, 6548 chg sides, 14490 chg coeffs, 0 upgd conss, 13704530 impls, 0 clqs
29.48/29.54 c (round 4) 9137 del vars, 23196 del conss, 3925 chg bounds, 6548 chg sides, 14490 chg coeffs, 0 upgd conss, 13705110 impls, 0 clqs
30.18/30.22 c (round 5) 9346 del vars, 23537 del conss, 4134 chg bounds, 6548 chg sides, 14490 chg coeffs, 0 upgd conss, 13705760 impls, 0 clqs
30.88/30.91 c (round 6) 9630 del vars, 24127 del conss, 4419 chg bounds, 6548 chg sides, 14490 chg coeffs, 0 upgd conss, 13712071 impls, 0 clqs
31.57/31.60 c (round 7) 9968 del vars, 24870 del conss, 4754 chg bounds, 6548 chg sides, 14490 chg coeffs, 0 upgd conss, 13727267 impls, 0 clqs
32.27/32.32 c (round 8) 10295 del vars, 25735 del conss, 5086 chg bounds, 6548 chg sides, 14490 chg coeffs, 0 upgd conss, 13735202 impls, 0 clqs
32.98/33.01 c (round 9) 10558 del vars, 26545 del conss, 5334 chg bounds, 6548 chg sides, 14490 chg coeffs, 0 upgd conss, 13737858 impls, 0 clqs
33.67/33.74 c (round 10) 10842 del vars, 27197 del conss, 5618 chg bounds, 6548 chg sides, 14490 chg coeffs, 0 upgd conss, 13742812 impls, 0 clqs
34.37/34.43 c (round 11) 11002 del vars, 27845 del conss, 5785 chg bounds, 6548 chg sides, 14490 chg coeffs, 0 upgd conss, 13754801 impls, 0 clqs
35.08/35.12 c (round 12) 11030 del vars, 28193 del conss, 5812 chg bounds, 6548 chg sides, 14490 chg coeffs, 0 upgd conss, 13764139 impls, 0 clqs
35.67/35.77 c (round 13) 11058 del vars, 28261 del conss, 5834 chg bounds, 6548 chg sides, 14490 chg coeffs, 0 upgd conss, 13764765 impls, 0 clqs
36.36/36.42 c (round 14) 11086 del vars, 28319 del conss, 5862 chg bounds, 6548 chg sides, 14490 chg coeffs, 0 upgd conss, 13764873 impls, 0 clqs
36.97/37.08 c (round 15) 11114 del vars, 28389 del conss, 5890 chg bounds, 6548 chg sides, 14490 chg coeffs, 0 upgd conss, 13765493 impls, 0 clqs
37.66/37.75 c (round 16) 11142 del vars, 28459 del conss, 5918 chg bounds, 6548 chg sides, 14490 chg coeffs, 0 upgd conss, 13766501 impls, 0 clqs
38.37/38.43 c (round 17) 11171 del vars, 28532 del conss, 5950 chg bounds, 6548 chg sides, 14490 chg coeffs, 0 upgd conss, 13768037 impls, 0 clqs
39.07/39.11 c (round 18) 11202 del vars, 28616 del conss, 5978 chg bounds, 6548 chg sides, 14490 chg coeffs, 0 upgd conss, 13768879 impls, 0 clqs
39.67/39.78 c (round 19) 11228 del vars, 28681 del conss, 6004 chg bounds, 6548 chg sides, 14490 chg coeffs, 0 upgd conss, 13769441 impls, 0 clqs
40.37/40.45 c (round 20) 11252 del vars, 28745 del conss, 6028 chg bounds, 6548 chg sides, 14490 chg coeffs, 0 upgd conss, 13769907 impls, 0 clqs
41.06/41.11 c (round 21) 11276 del vars, 28805 del conss, 6052 chg bounds, 6548 chg sides, 14490 chg coeffs, 0 upgd conss, 13770213 impls, 0 clqs
42.16/42.28 c (round 22) 11304 del vars, 28899 del conss, 6080 chg bounds, 6548 chg sides, 14490 chg coeffs, 0 upgd conss, 13770585 impls, 0 clqs
47.56/47.64 c (round 23) 11304 del vars, 29551 del conss, 6080 chg bounds, 6548 chg sides, 14490 chg coeffs, 562921 upgd conss, 13770843 impls, 0 clqs
49.47/49.59 c presolving (24 rounds):
49.47/49.59 c 11304 deleted vars, 29551 deleted constraints, 6080 tightened bounds, 0 added holes, 6548 changed sides, 14490 changed coefficients
49.47/49.59 c 13770843 implications, 0 cliques
49.47/49.59 c presolved problem has 190427 variables (190427 bin, 0 int, 0 impl, 0 cont) and 562974 constraints
49.47/49.59 c 12778 constraints of type <knapsack>
49.47/49.59 c 550196 constraints of type <logicor>
49.47/49.59 c transformed objective value is always integral (scale: 1)
49.47/49.59 c Presolving Time: 29.28
49.47/49.59 c - non default parameters ----------------------------------------------------------------------
49.47/49.59 c # SCIP version 1.2.1.2
49.47/49.59 c
49.47/49.59 c # frequency for displaying node information lines
49.47/49.59 c # [type: int, range: [-1,2147483647], default: 100]
49.47/49.59 c display/freq = 10000
49.47/49.59 c
49.47/49.59 c # maximal time in seconds to run
49.47/49.59 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
49.47/49.59 c limits/time = 1789.52
49.47/49.59 c
49.47/49.59 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
49.47/49.59 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
49.47/49.59 c limits/memory = 1620
49.47/49.59 c
49.47/49.59 c # solving stops, if the given number of solutions were found (-1: no limit)
49.47/49.59 c # [type: int, range: [-1,2147483647], default: -1]
49.47/49.59 c limits/solutions = 1
49.47/49.59 c
49.47/49.59 c # maximal number of separation rounds per node (-1: unlimited)
49.47/49.59 c # [type: int, range: [-1,2147483647], default: 5]
49.47/49.59 c separating/maxrounds = 1
49.47/49.59 c
49.47/49.59 c # maximal number of separation rounds in the root node (-1: unlimited)
49.47/49.59 c # [type: int, range: [-1,2147483647], default: -1]
49.47/49.59 c separating/maxroundsroot = 5
49.47/49.59 c
49.47/49.59 c # should presolving try to simplify inequalities
49.47/49.59 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
49.47/49.59 c constraints/linear/simplifyinequalities = TRUE
49.47/49.59 c
49.47/49.59 c # should disaggregation of knapsack constraints be allowed in preprocessing?
49.47/49.59 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
49.47/49.59 c constraints/knapsack/disaggregation = FALSE
49.47/49.59 c
49.47/49.59 c # should presolving try to simplify knapsacks
49.47/49.59 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
49.47/49.59 c constraints/knapsack/simplifyinequalities = TRUE
49.47/49.59 c
49.47/49.59 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
49.47/49.59 c # [type: int, range: [-1,2147483647], default: -1]
49.47/49.59 c presolving/probing/maxrounds = 0
49.47/49.59 c
49.47/49.59 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
49.47/49.59 c # [type: int, range: [-1,2147483647], default: 10]
49.47/49.59 c heuristics/coefdiving/freq = -1
49.47/49.59 c
49.47/49.59 c # maximal fraction of diving LP iterations compared to node LP iterations
49.47/49.59 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
49.47/49.59 c heuristics/coefdiving/maxlpiterquot = 0.075
49.47/49.59 c
49.47/49.59 c # additional number of allowed LP iterations
49.47/49.59 c # [type: int, range: [0,2147483647], default: 1000]
49.47/49.59 c heuristics/coefdiving/maxlpiterofs = 1500
49.47/49.59 c
49.47/49.59 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
49.47/49.59 c # [type: int, range: [-1,2147483647], default: 30]
49.47/49.59 c heuristics/crossover/freq = -1
49.47/49.59 c
49.47/49.59 c # number of nodes added to the contingent of the total nodes
49.47/49.59 c # [type: longint, range: [0,9223372036854775807], default: 500]
49.47/49.59 c heuristics/crossover/nodesofs = 750
49.47/49.59 c
49.47/49.59 c # number of nodes without incumbent change that heuristic should wait
49.47/49.59 c # [type: longint, range: [0,9223372036854775807], default: 200]
49.47/49.59 c heuristics/crossover/nwaitingnodes = 100
49.47/49.59 c
49.47/49.59 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
49.47/49.59 c # [type: real, range: [0,1], default: 0.1]
49.47/49.59 c heuristics/crossover/nodesquot = 0.15
49.47/49.59 c
49.47/49.59 c # minimum percentage of integer variables that have to be fixed
49.47/49.59 c # [type: real, range: [0,1], default: 0.666]
49.47/49.59 c heuristics/crossover/minfixingrate = 0.5
49.47/49.59 c
49.47/49.59 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
49.47/49.59 c # [type: int, range: [-1,2147483647], default: 20]
49.47/49.59 c heuristics/feaspump/freq = -1
49.47/49.59 c
49.47/49.59 c # additional number of allowed LP iterations
49.47/49.59 c # [type: int, range: [0,2147483647], default: 1000]
49.47/49.59 c heuristics/feaspump/maxlpiterofs = 2000
49.47/49.59 c
49.47/49.59 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
49.47/49.59 c # [type: int, range: [-1,2147483647], default: 10]
49.47/49.59 c heuristics/fracdiving/freq = -1
49.47/49.59 c
49.47/49.59 c # maximal fraction of diving LP iterations compared to node LP iterations
49.47/49.59 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
49.47/49.59 c heuristics/fracdiving/maxlpiterquot = 0.075
49.47/49.59 c
49.47/49.59 c # additional number of allowed LP iterations
49.47/49.59 c # [type: int, range: [0,2147483647], default: 1000]
49.47/49.59 c heuristics/fracdiving/maxlpiterofs = 1500
49.47/49.59 c
49.47/49.59 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
49.47/49.59 c # [type: int, range: [-1,2147483647], default: 10]
49.47/49.59 c heuristics/guideddiving/freq = -1
49.47/49.59 c
49.47/49.59 c # maximal fraction of diving LP iterations compared to node LP iterations
49.47/49.59 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
49.47/49.59 c heuristics/guideddiving/maxlpiterquot = 0.075
49.47/49.59 c
49.47/49.59 c # additional number of allowed LP iterations
49.47/49.59 c # [type: int, range: [0,2147483647], default: 1000]
49.47/49.59 c heuristics/guideddiving/maxlpiterofs = 1500
49.47/49.59 c
49.47/49.59 c # maximal fraction of diving LP iterations compared to node LP iterations
49.47/49.59 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
49.47/49.59 c heuristics/intdiving/maxlpiterquot = 0.075
49.47/49.59 c
49.47/49.59 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
49.47/49.59 c # [type: int, range: [-1,2147483647], default: 10]
49.47/49.59 c heuristics/intshifting/freq = -1
49.47/49.59 c
49.47/49.59 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
49.47/49.59 c # [type: int, range: [-1,2147483647], default: 10]
49.47/49.59 c heuristics/linesearchdiving/freq = -1
49.47/49.59 c
49.47/49.59 c # maximal fraction of diving LP iterations compared to node LP iterations
49.47/49.59 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
49.47/49.59 c heuristics/linesearchdiving/maxlpiterquot = 0.075
49.47/49.59 c
49.47/49.59 c # additional number of allowed LP iterations
49.47/49.59 c # [type: int, range: [0,2147483647], default: 1000]
49.47/49.59 c heuristics/linesearchdiving/maxlpiterofs = 1500
49.47/49.59 c
49.47/49.59 c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
49.47/49.59 c # [type: int, range: [-1,2147483647], default: 1]
49.47/49.59 c heuristics/nlp/freq = -1
49.47/49.59 c
49.47/49.59 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
49.47/49.59 c # [type: int, range: [-1,2147483647], default: 20]
49.47/49.59 c heuristics/objpscostdiving/freq = -1
49.47/49.59 c
49.47/49.59 c # maximal fraction of diving LP iterations compared to total iteration number
49.47/49.59 c # [type: real, range: [0,1], default: 0.01]
49.47/49.59 c heuristics/objpscostdiving/maxlpiterquot = 0.015
49.47/49.59 c
49.47/49.59 c # additional number of allowed LP iterations
49.47/49.59 c # [type: int, range: [0,2147483647], default: 1000]
49.47/49.59 c heuristics/objpscostdiving/maxlpiterofs = 1500
49.47/49.59 c
49.47/49.59 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
49.47/49.59 c # [type: int, range: [-1,2147483647], default: 1]
49.47/49.59 c heuristics/oneopt/freq = -1
49.47/49.59 c
49.47/49.59 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
49.47/49.59 c # [type: int, range: [-1,2147483647], default: 10]
49.47/49.59 c heuristics/pscostdiving/freq = -1
49.47/49.59 c
49.47/49.59 c # maximal fraction of diving LP iterations compared to node LP iterations
49.47/49.59 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
49.47/49.59 c heuristics/pscostdiving/maxlpiterquot = 0.075
49.47/49.59 c
49.47/49.59 c # additional number of allowed LP iterations
49.47/49.59 c # [type: int, range: [0,2147483647], default: 1000]
49.47/49.59 c heuristics/pscostdiving/maxlpiterofs = 1500
49.47/49.59 c
49.47/49.59 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
49.47/49.59 c # [type: int, range: [-1,2147483647], default: 0]
49.47/49.59 c heuristics/rens/freq = -1
49.47/49.59 c
49.47/49.59 c # minimum percentage of integer variables that have to be fixable
49.47/49.59 c # [type: real, range: [0,1], default: 0.5]
49.47/49.59 c heuristics/rens/minfixingrate = 0.3
49.47/49.59 c
49.47/49.59 c # number of nodes added to the contingent of the total nodes
49.47/49.59 c # [type: longint, range: [0,9223372036854775807], default: 500]
49.47/49.59 c heuristics/rens/nodesofs = 2000
49.47/49.59 c
49.47/49.59 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
49.47/49.59 c # [type: int, range: [-1,2147483647], default: 20]
49.47/49.59 c heuristics/rootsoldiving/freq = -1
49.47/49.59 c
49.47/49.59 c # maximal fraction of diving LP iterations compared to node LP iterations
49.47/49.59 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
49.47/49.59 c heuristics/rootsoldiving/maxlpiterquot = 0.015
49.47/49.59 c
49.47/49.59 c # additional number of allowed LP iterations
49.47/49.59 c # [type: int, range: [0,2147483647], default: 1000]
49.47/49.59 c heuristics/rootsoldiving/maxlpiterofs = 1500
49.47/49.59 c
49.47/49.59 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
49.47/49.59 c # [type: int, range: [-1,2147483647], default: 1]
49.47/49.59 c heuristics/rounding/freq = -1
49.47/49.59 c
49.47/49.59 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
49.47/49.59 c # [type: int, range: [-1,2147483647], default: 10]
49.47/49.59 c heuristics/shifting/freq = -1
49.47/49.59 c
49.47/49.59 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
49.47/49.59 c # [type: int, range: [-1,2147483647], default: 1]
49.47/49.59 c heuristics/simplerounding/freq = -1
49.47/49.59 c
49.47/49.59 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
49.47/49.59 c # [type: int, range: [-1,2147483647], default: 0]
49.47/49.59 c heuristics/trivial/freq = -1
49.47/49.59 c
49.47/49.59 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
49.47/49.59 c # [type: int, range: [-1,2147483647], default: 1]
49.47/49.59 c heuristics/trysol/freq = -1
49.47/49.59 c
49.47/49.59 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
49.47/49.59 c # [type: int, range: [-1,2147483647], default: 10]
49.47/49.59 c heuristics/veclendiving/freq = -1
49.47/49.59 c
49.47/49.59 c # maximal fraction of diving LP iterations compared to node LP iterations
49.47/49.59 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
49.47/49.59 c heuristics/veclendiving/maxlpiterquot = 0.075
49.47/49.59 c
49.47/49.59 c # additional number of allowed LP iterations
49.47/49.59 c # [type: int, range: [0,2147483647], default: 1000]
49.47/49.59 c heuristics/veclendiving/maxlpiterofs = 1500
49.47/49.59 c
49.47/49.59 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
49.47/49.59 c # [type: int, range: [-1,2147483647], default: 1]
49.47/49.59 c heuristics/zirounding/freq = -1
49.47/49.59 c
49.47/49.59 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
49.47/49.59 c # [type: int, range: [-1,2147483647], default: 0]
49.47/49.59 c separating/cmir/freq = -1
49.47/49.59 c
49.47/49.59 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
49.47/49.59 c # [type: int, range: [-1,2147483647], default: 0]
49.47/49.59 c separating/flowcover/freq = -1
49.47/49.59 c
49.47/49.59 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
49.47/49.59 c # [type: int, range: [-1,2147483647], default: -1]
49.47/49.59 c separating/rapidlearning/freq = 0
49.47/49.59 c
49.47/49.59 c -----------------------------------------------------------------------------------------------
49.47/49.59 c start solving
49.66/49.79 c
51.87/51.90 c pressed CTRL-C 1 times (5 times for forcing termination)
52.16/52.27 c [src/blockmemshell/memory.c:853] ERROR: Insufficient memory for allocation of 524352 bytes
52.16/52.27 c [src/scip/lp.c:237] ERROR: Insufficient memory for new chunk
52.16/52.27 c [src/scip/lp.c:237] ERROR: No memory in function call
52.16/52.27 c [src/scip/lp.c:963] ERROR: Error <-1> in function call
52.16/52.27 c [src/scip/lp.c:1628] ERROR: Error <-1> in function call
52.16/52.27 c [src/scip/lp.c:5483] ERROR: Error <-1> in function call
52.16/52.27 c [src/scip/lp.c:5812] ERROR: Error <-1> in function call
52.16/52.27 c [src/scip/lp.c:11214] ERROR: Error <-1> in function call
52.16/52.27 c [src/scip/solve.c:807] ERROR: Error <-1> in function call
52.16/52.27 c [src/scip/solve.c:1863] ERROR: Error <-1> in function call
52.16/52.27 c [src/scip/solve.c:2577] ERROR: Error <-1> in function call
52.16/52.27 c [src/scip/solve.c:3189] ERROR: Error <-1> in function call
52.16/52.27 c [src/scip/scip.c:6167] ERROR: Error <-1> in function call
52.16/52.27 c [src/cmain.c:657] ERROR: Error <-1> in function call
52.16/52.27 c [src/cmain.c:832] ERROR: Error <-1> in function call
52.16/52.27 c [src/cmain.c:908] ERROR: Error <-1> in function call
52.16/52.27 c SCIP Error (-1): c insufficient memory errorc
52.16/52.27 c Time complete: 52.23.