Trace number 2704181

Some explanations

A solver is run under the control of another program named runsolver. runsolver is in charge of imposing the CPU time limit and the memory limit to the solver. It also monitors some information about the process. The trace of the execution of a solver is divided into four (or five) parts:
  1. SOLVER DATA
    This is the output of the solver (stdout and stderr).
    Note that some very long lines in this section may be truncated by your web browser ! In such a case, you may want to use the "Download as text" link to get the trace as a text file.

    When the --timestamp option is passed to the runsolver program, each line output by the solver is prepended with a timestamp which indicates at what time the line was output by the solver. Times are relative to the start of the program, given in seconds. The first timestamp (if present) is estimated CPU time. The last timestamp is wall clock time.

    As some 'v lines' may be very long (sometimes several megabytes), the 'v line' output by your solver may be split on several lines to help limit the size of the trace recorded in the database. In any case, the exact output of your solver is preserved in a trace file.
  2. VERIFIER DATA
    The output of the solver is piped to a verifier program which will search a value line "v " and, if found, will check that the given interpretation satisfies all constraints.
  3. CONVERSION SCRIPT DATA (Optionnal)
    When a conversion script is used, this section shows the messages that were output by the conversion script.
  4. WATCHER DATA
    This is the informations gathered by the runsolver program. It first prints the different limits. There's a first limit on CPU time set to X seconds (see the parameters in the trace). After this time has ellapsed, runsolver sends a SIGTERM and 2 seconds later a SIGKILL to the solver. For safety, there's also another limit set to X+30 seconds which will send a SIGXPU to the solver. The last limit is on the virtual memory used by the process (see the parameters in the trace).
    Every ten seconds, the runsolver process fetches the content of /proc/loadavg, /proc/pid/stat and /proc/pid/statm (see man proc) and prints it as raw data. This is only recorded in case we need to investigate the behaviour of a solver. The memory used by the solver (vsize) is also given every ten seconds.
    When the solver exits, runsolver prints some informations such as status and time. CPU usage is the ratio CPU Time/Real Time.
  5. LAUNCHER DATA
    These informations are related to the script which will launch the solver. The most important informations are the command line given to the solver, the md5sum of the different files and the dump of the /proc/cpuinfo and /proc/meminfo which provides some useful information on the computer.

Solver answer on this benchmark

Solver NameAnswerCPU timeWall clock time
SCIPspx SCIP 1.2.1.3 with SoPlex 1.4.2 (CVS Version 30.5.2010) as LP solver? (MO) 35.2856 35.3064

General information on the benchmark

Namenormalized-PB06/SATUNSAT-SMALLINT/submitted-PB06/liu/
dbst/normalized-dbst_v40_e600_d20_mw10_0.opb.PB06.opb
MD5SUMe436f4a609b5bae6a8ddfe1313c390fe
Bench CategoryDEC-SMALLINT (no optimisation, small integers)
Best result obtained on this benchmarkSAT
Best value of the objective obtained on this benchmark0
Best CPU time to get the best result obtained on this benchmark2.82357
Has Objective FunctionNO
SatisfiableYES
(Un)Satisfiability was provedYES
Best value of the objective function
Optimality of the best value was proved NO
Number of variables2800
Total number of constraints990001
Number of constraints which are clauses986760
Number of constraints which are cardinality constraints (but not clauses)81
Number of constraints which are nor clauses,nor cardinality constraints3160
Minimum length of a constraint2
Maximum length of a constraint1200
Number of terms in the objective function 0
Biggest coefficient in the objective function 0
Number of bits for the biggest coefficient in the objective function 0
Sum of the numbers in the objective function 0
Number of bits of the sum of numbers in the objective function 0
Biggest number in a constraint 338
Number of bits of the biggest number in a constraint 9
Biggest sum of numbers in a constraint 1239
Number of bits of the biggest sum of numbers11
Number of products (including duplicates)0
Sum of products size (including duplicates)0
Number of different products0
Sum of products size0

Solver Data 

0.00/0.00	c SCIP version 1.2.1.3 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.4.2]
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-2704181-1278550042.opb>
15.08/15.13	c original problem has 2800 variables (2800 bin, 0 int, 0 impl, 0 cont) and 990001 constraints
15.08/15.13	c problem read
15.08/15.13	c No objective function, only one solution is needed.
15.08/15.13	c presolving settings loaded
18.48/18.59	c presolving:
26.67/26.79	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.38/28.43	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.08/30.17	c presolving (3 rounds):
30.08/30.17	c  0 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 3414 changed coefficients
30.08/30.17	c  5520 implications, 80 cliques
30.08/30.17	c presolved problem has 2800 variables (2800 bin, 0 int, 0 impl, 0 cont) and 990001 constraints
30.08/30.17	c    3160 constraints of type <knapsack>
30.08/30.17	c    1280 constraints of type <setppc>
30.08/30.17	c       1 constraints of type <linear>
30.08/30.17	c  985560 constraints of type <logicor>
30.08/30.17	c transformed objective value is always integral (scale: 1)
30.08/30.17	c Presolving Time: 12.09
30.08/30.17	c - non default parameters ----------------------------------------------------------------------
30.08/30.17	c # SCIP version 1.2.1.3
30.08/30.17	c 
30.08/30.17	c # frequency for displaying node information lines
30.08/30.17	c # [type: int, range: [-1,2147483647], default: 100]
30.08/30.17	c display/freq = 10000
30.08/30.17	c 
30.08/30.17	c # maximal time in seconds to run
30.08/30.17	c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
30.08/30.17	c limits/time = 1774.89
30.08/30.17	c 
30.08/30.17	c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
30.08/30.17	c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
30.08/30.17	c limits/memory = 1620
30.08/30.17	c 
30.08/30.17	c # solving stops, if the given number of solutions were found (-1: no limit)
30.08/30.17	c # [type: int, range: [-1,2147483647], default: -1]
30.08/30.17	c limits/solutions = 1
30.08/30.17	c 
30.08/30.17	c # maximal number of separation rounds per node (-1: unlimited)
30.08/30.17	c # [type: int, range: [-1,2147483647], default: 5]
30.08/30.17	c separating/maxrounds = 1
30.08/30.17	c 
30.08/30.17	c # maximal number of separation rounds in the root node (-1: unlimited)
30.08/30.17	c # [type: int, range: [-1,2147483647], default: -1]
30.08/30.17	c separating/maxroundsroot = 5
30.08/30.17	c 
30.08/30.17	c # default clock type (1: CPU user seconds, 2: wall clock time)
30.08/30.17	c # [type: int, range: [1,2], default: 1]
30.08/30.17	c timing/clocktype = 2
30.08/30.17	c 
30.08/30.17	c # should presolving try to simplify inequalities
30.08/30.17	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
30.08/30.17	c constraints/linear/simplifyinequalities = TRUE
30.08/30.17	c 
30.08/30.17	c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
30.08/30.17	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
30.08/30.17	c constraints/indicator/addCouplingCons = TRUE
30.08/30.17	c 
30.08/30.17	c # should disaggregation of knapsack constraints be allowed in preprocessing?
30.08/30.17	c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
30.08/30.17	c constraints/knapsack/disaggregation = FALSE
30.08/30.17	c 
30.08/30.17	c # should presolving try to simplify knapsacks
30.08/30.17	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
30.08/30.17	c constraints/knapsack/simplifyinequalities = TRUE
30.08/30.17	c 
30.08/30.17	c # maximal number of presolving rounds the presolver participates in (-1: no limit)
30.08/30.17	c # [type: int, range: [-1,2147483647], default: -1]
30.08/30.17	c presolving/probing/maxrounds = 0
30.08/30.17	c 
30.08/30.17	c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
30.08/30.17	c # [type: int, range: [-1,2147483647], default: 10]
30.08/30.17	c heuristics/coefdiving/freq = -1
30.08/30.17	c 
30.08/30.17	c # maximal fraction of diving LP iterations compared to node LP iterations
30.08/30.17	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
30.08/30.17	c heuristics/coefdiving/maxlpiterquot = 0.075
30.08/30.17	c 
30.08/30.17	c # additional number of allowed LP iterations
30.08/30.17	c # [type: int, range: [0,2147483647], default: 1000]
30.08/30.17	c heuristics/coefdiving/maxlpiterofs = 1500
30.08/30.17	c 
30.08/30.17	c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
30.08/30.17	c # [type: int, range: [-1,2147483647], default: 30]
30.08/30.17	c heuristics/crossover/freq = -1
30.08/30.17	c 
30.08/30.17	c # number of nodes added to the contingent of the total nodes
30.08/30.17	c # [type: longint, range: [0,9223372036854775807], default: 500]
30.08/30.17	c heuristics/crossover/nodesofs = 750
30.08/30.17	c 
30.08/30.17	c # number of nodes without incumbent change that heuristic should wait
30.08/30.17	c # [type: longint, range: [0,9223372036854775807], default: 200]
30.08/30.17	c heuristics/crossover/nwaitingnodes = 100
30.08/30.17	c 
30.08/30.17	c # contingent of sub problem nodes in relation to the number of nodes of the original problem
30.08/30.17	c # [type: real, range: [0,1], default: 0.1]
30.08/30.17	c heuristics/crossover/nodesquot = 0.15
30.08/30.17	c 
30.08/30.17	c # minimum percentage of integer variables that have to be fixed 
30.08/30.17	c # [type: real, range: [0,1], default: 0.666]
30.08/30.17	c heuristics/crossover/minfixingrate = 0.5
30.08/30.17	c 
30.08/30.17	c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
30.08/30.17	c # [type: int, range: [-1,2147483647], default: 20]
30.08/30.17	c heuristics/feaspump/freq = -1
30.08/30.17	c 
30.08/30.17	c # additional number of allowed LP iterations
30.08/30.17	c # [type: int, range: [0,2147483647], default: 1000]
30.08/30.17	c heuristics/feaspump/maxlpiterofs = 2000
30.08/30.17	c 
30.08/30.17	c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
30.08/30.17	c # [type: int, range: [-1,2147483647], default: 10]
30.08/30.17	c heuristics/fracdiving/freq = -1
30.08/30.17	c 
30.08/30.17	c # maximal fraction of diving LP iterations compared to node LP iterations
30.08/30.17	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
30.08/30.17	c heuristics/fracdiving/maxlpiterquot = 0.075
30.08/30.17	c 
30.08/30.17	c # additional number of allowed LP iterations
30.08/30.17	c # [type: int, range: [0,2147483647], default: 1000]
30.08/30.17	c heuristics/fracdiving/maxlpiterofs = 1500
30.08/30.17	c 
30.08/30.17	c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
30.08/30.17	c # [type: int, range: [-1,2147483647], default: 10]
30.08/30.17	c heuristics/guideddiving/freq = -1
30.08/30.17	c 
30.08/30.17	c # maximal fraction of diving LP iterations compared to node LP iterations
30.08/30.17	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
30.08/30.17	c heuristics/guideddiving/maxlpiterquot = 0.075
30.08/30.17	c 
30.08/30.17	c # additional number of allowed LP iterations
30.08/30.17	c # [type: int, range: [0,2147483647], default: 1000]
30.08/30.17	c heuristics/guideddiving/maxlpiterofs = 1500
30.08/30.17	c 
30.08/30.17	c # maximal fraction of diving LP iterations compared to node LP iterations
30.08/30.17	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
30.08/30.17	c heuristics/intdiving/maxlpiterquot = 0.075
30.08/30.17	c 
30.08/30.17	c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
30.08/30.17	c # [type: int, range: [-1,2147483647], default: 10]
30.08/30.17	c heuristics/intshifting/freq = -1
30.08/30.17	c 
30.08/30.17	c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
30.08/30.17	c # [type: int, range: [-1,2147483647], default: 10]
30.08/30.17	c heuristics/linesearchdiving/freq = -1
30.08/30.17	c 
30.08/30.17	c # maximal fraction of diving LP iterations compared to node LP iterations
30.08/30.17	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
30.08/30.17	c heuristics/linesearchdiving/maxlpiterquot = 0.075
30.08/30.17	c 
30.08/30.17	c # additional number of allowed LP iterations
30.08/30.17	c # [type: int, range: [0,2147483647], default: 1000]
30.08/30.17	c heuristics/linesearchdiving/maxlpiterofs = 1500
30.08/30.17	c 
30.08/30.17	c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
30.08/30.17	c # [type: int, range: [-1,2147483647], default: 1]
30.08/30.17	c heuristics/nlp/freq = -1
30.08/30.17	c 
30.08/30.17	c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
30.08/30.17	c # [type: int, range: [-1,2147483647], default: 20]
30.08/30.17	c heuristics/objpscostdiving/freq = -1
30.08/30.17	c 
30.08/30.17	c # maximal fraction of diving LP iterations compared to total iteration number
30.08/30.17	c # [type: real, range: [0,1], default: 0.01]
30.08/30.17	c heuristics/objpscostdiving/maxlpiterquot = 0.015
30.08/30.17	c 
30.08/30.17	c # additional number of allowed LP iterations
30.08/30.17	c # [type: int, range: [0,2147483647], default: 1000]
30.08/30.17	c heuristics/objpscostdiving/maxlpiterofs = 1500
30.08/30.17	c 
30.08/30.17	c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
30.08/30.17	c # [type: int, range: [-1,2147483647], default: 1]
30.08/30.17	c heuristics/oneopt/freq = -1
30.08/30.17	c 
30.08/30.17	c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
30.08/30.17	c # [type: int, range: [-1,2147483647], default: 10]
30.08/30.17	c heuristics/pscostdiving/freq = -1
30.08/30.17	c 
30.08/30.17	c # maximal fraction of diving LP iterations compared to node LP iterations
30.08/30.17	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
30.08/30.17	c heuristics/pscostdiving/maxlpiterquot = 0.075
30.08/30.17	c 
30.08/30.17	c # additional number of allowed LP iterations
30.08/30.17	c # [type: int, range: [0,2147483647], default: 1000]
30.08/30.17	c heuristics/pscostdiving/maxlpiterofs = 1500
30.08/30.17	c 
30.08/30.17	c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
30.08/30.17	c # [type: int, range: [-1,2147483647], default: 0]
30.08/30.17	c heuristics/rens/freq = -1
30.08/30.17	c 
30.08/30.17	c # minimum percentage of integer variables that have to be fixable 
30.08/30.17	c # [type: real, range: [0,1], default: 0.5]
30.08/30.17	c heuristics/rens/minfixingrate = 0.3
30.08/30.17	c 
30.08/30.17	c # number of nodes added to the contingent of the total nodes
30.08/30.17	c # [type: longint, range: [0,9223372036854775807], default: 500]
30.08/30.17	c heuristics/rens/nodesofs = 2000
30.08/30.17	c 
30.08/30.17	c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
30.08/30.17	c # [type: int, range: [-1,2147483647], default: 20]
30.08/30.17	c heuristics/rootsoldiving/freq = -1
30.08/30.17	c 
30.08/30.17	c # maximal fraction of diving LP iterations compared to node LP iterations
30.08/30.17	c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
30.08/30.17	c heuristics/rootsoldiving/maxlpiterquot = 0.015
30.08/30.17	c 
30.08/30.17	c # additional number of allowed LP iterations
30.08/30.17	c # [type: int, range: [0,2147483647], default: 1000]
30.08/30.17	c heuristics/rootsoldiving/maxlpiterofs = 1500
30.08/30.17	c 
30.08/30.17	c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
30.08/30.17	c # [type: int, range: [-1,2147483647], default: 1]
30.08/30.17	c heuristics/rounding/freq = -1
30.08/30.17	c 
30.08/30.17	c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
30.08/30.17	c # [type: int, range: [-1,2147483647], default: 10]
30.08/30.17	c heuristics/shifting/freq = -1
30.08/30.17	c 
30.08/30.17	c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
30.08/30.17	c # [type: int, range: [-1,2147483647], default: 1]
30.08/30.17	c heuristics/simplerounding/freq = -1
30.08/30.17	c 
30.08/30.17	c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
30.08/30.17	c # [type: int, range: [-1,2147483647], default: 0]
30.08/30.17	c heuristics/trivial/freq = -1
30.08/30.17	c 
30.08/30.17	c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
30.08/30.17	c # [type: int, range: [-1,2147483647], default: 1]
30.08/30.17	c heuristics/trysol/freq = -1
30.08/30.17	c 
30.08/30.17	c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
30.08/30.17	c # [type: int, range: [-1,2147483647], default: 10]
30.08/30.17	c heuristics/veclendiving/freq = -1
30.08/30.17	c 
30.08/30.17	c # maximal fraction of diving LP iterations compared to node LP iterations
30.08/30.17	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
30.08/30.17	c heuristics/veclendiving/maxlpiterquot = 0.075
30.08/30.17	c 
30.08/30.17	c # additional number of allowed LP iterations
30.08/30.17	c # [type: int, range: [0,2147483647], default: 1000]
30.08/30.17	c heuristics/veclendiving/maxlpiterofs = 1500
30.08/30.17	c 
30.08/30.17	c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
30.08/30.17	c # [type: int, range: [-1,2147483647], default: 1]
30.08/30.17	c heuristics/zirounding/freq = -1
30.08/30.17	c 
30.08/30.17	c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
30.08/30.17	c # [type: int, range: [-1,2147483647], default: 0]
30.08/30.17	c separating/cmir/freq = -1
30.08/30.17	c 
30.08/30.17	c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
30.08/30.17	c # [type: int, range: [-1,2147483647], default: 0]
30.08/30.17	c separating/flowcover/freq = -1
30.08/30.17	c 
30.08/30.17	c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
30.08/30.17	c # [type: int, range: [-1,2147483647], default: -1]
30.08/30.17	c separating/rapidlearning/freq = 0
30.08/30.17	c 
30.08/30.17	c -----------------------------------------------------------------------------------------------
30.08/30.17	c start solving
30.18/30.23	c 
35.09/35.11	c pressed CTRL-C 1 times (5 times for forcing termination)
35.09/35.14	EMALLC02 realloc: Out of memory - cannot allocate 7920008 bytes
35.09/35.15	c [src/scip/lpi_spx.cpp:1201] Warning: SoPlex threw an exception: XMALLC02 realloc: Could not allocate enough memory
35.09/35.15	c [src/scip/lp.c:5561] ERROR: Error <-6> in function call
35.09/35.15	c [src/scip/lp.c:5837] ERROR: Error <-6> in function call
35.09/35.15	c [src/scip/lp.c:11248] ERROR: Error <-6> in function call
35.09/35.15	c [src/scip/solve.c:801] ERROR: Error <-6> in function call
35.09/35.15	c [src/scip/solve.c:1912] ERROR: Error <-6> in function call
35.09/35.15	c [src/scip/solve.c:2591] ERROR: Error <-6> in function call
35.09/35.15	c [src/scip/solve.c:3206] ERROR: Error <-6> in function call
35.09/35.15	c [src/scip/scip.c:6312] ERROR: Error <-6> in function call
35.09/35.15	c [src/cmain.c:674] ERROR: Error <-6> in function call
35.09/35.15	c [src/cmain.c:849] ERROR: Error <-6> in function call
35.09/35.15	c [src/cmain.c:925] ERROR: Error <-6> in function call
35.09/35.15	c SCIP Error (-6): c error in LP solverc 
35.09/35.15	c Time complete: 35.13.

Verifier Data 

ERROR: no interpretation found !

Watcher Data 

runsolver version 3.2.9 (svn:492) (c) roussel@cril.univ-artois.fr

command line: BIN/runsolver --timestamp -w /tmp/evaluation-result-2704181-1278550042/watcher-2704181-1278550042 -o /tmp/evaluation-result-2704181-1278550042/solver-2704181-1278550042 -C 1800 -W 2000 -M 1800 HOME/pbscip.linux.x86_64.gnu.opt.spx -f HOME/instance-2704181-1278550042.opb -t 1800 -m 1800 

Enforcing CPUTime limit (soft limit, will send SIGTERM then SIGKILL): 1800 seconds
Enforcing CPUTime limit (hard limit, will send SIGXCPU): 1830 seconds
Enforcing wall clock limit (soft limit, will send SIGTERM then SIGKILL): 2000 seconds
Enforcing VSIZE limit (soft limit, will send SIGTERM then SIGKILL): 1843200 KiB
Enforcing VSIZE limit (hard limit, stack expansion will fail with SIGSEGV, brk() and mmap() will return ENOMEM): 1894400 KiB
Current StackSize limit: 10240 KiB


[startup+0 s]
/proc/loadavg: 1.41 1.14 0.98 3/105 30831
/proc/meminfo: memFree=1921444/2059040 swapFree=4136016/4192956
[pid=30831] ppid=30829 vsize=7904 CPUtime=0
/proc/30831/stat : 30831 (pbscip.linux.x8) R 30829 30831 30219 0 -1 4202496 1179 0 0 0 0 0 0 0 22 0 1 0 23212572 8093696 1090 1992294400 4194304 8395647 140733426103968 18446744073709551615 7382157 0 0 4096 0 0 0 0 17 1 0 0 0
/proc/30831/statm: 1976 1098 365 1026 0 946 0

[startup+0.039772 s]
/proc/loadavg: 1.41 1.14 0.98 3/105 30831
/proc/meminfo: memFree=1921444/2059040 swapFree=4136016/4192956
[pid=30831] ppid=30829 vsize=12360 CPUtime=0.03
/proc/30831/stat : 30831 (pbscip.linux.x8) R 30829 30831 30219 0 -1 4202496 2375 0 0 0 3 0 0 0 22 0 1 0 23212572 12656640 2286 1992294400 4194304 8395647 140733426103968 18446744073709551615 7382031 0 0 4096 0 0 0 0 17 1 0 0 0
/proc/30831/statm: 3090 2286 390 1026 0 2060 0
Current children cumulated CPU time (s) 0.03
Current children cumulated vsize (KiB) 12360

[startup+0.100777 s]
/proc/loadavg: 1.41 1.14 0.98 3/105 30831
/proc/meminfo: memFree=1921444/2059040 swapFree=4136016/4192956
[pid=30831] ppid=30829 vsize=14840 CPUtime=0.09
/proc/30831/stat : 30831 (pbscip.linux.x8) R 30829 30831 30219 0 -1 4202496 2994 0 0 0 9 0 0 0 22 0 1 0 23212572 15196160 2905 1992294400 4194304 8395647 140733426103968 18446744073709551615 5758032 0 0 4096 0 0 0 0 17 1 0 0 0
/proc/30831/statm: 3710 2905 390 1026 0 2680 0
Current children cumulated CPU time (s) 0.09
Current children cumulated vsize (KiB) 14840

[startup+0.300798 s]
/proc/loadavg: 1.41 1.14 0.98 3/105 30831
/proc/meminfo: memFree=1921444/2059040 swapFree=4136016/4192956
[pid=30831] ppid=30829 vsize=19796 CPUtime=0.29
/proc/30831/stat : 30831 (pbscip.linux.x8) R 30829 30831 30219 0 -1 4202496 4225 0 0 0 28 1 0 0 22 0 1 0 23212572 20271104 4136 1992294400 4194304 8395647 140733426103968 18446744073709551615 7370128 0 0 4096 0 0 0 0 17 1 0 0 0
/proc/30831/statm: 4949 4136 390 1026 0 3919 0
Current children cumulated CPU time (s) 0.29
Current children cumulated vsize (KiB) 19796

[startup+0.70084 s]
/proc/loadavg: 1.41 1.14 0.98 3/105 30831
/proc/meminfo: memFree=1921444/2059040 swapFree=4136016/4192956
[pid=30831] ppid=30829 vsize=29020 CPUtime=0.69
/proc/30831/stat : 30831 (pbscip.linux.x8) R 30829 30831 30219 0 -1 4202496 6527 0 0 0 67 2 0 0 24 0 1 0 23212572 29716480 6438 1992294400 4194304 8395647 140733426103968 18446744073709551615 5755739 0 0 4096 0 0 0 0 17 1 0 0 0
/proc/30831/statm: 7255 6438 390 1026 0 6225 0
Current children cumulated CPU time (s) 0.69
Current children cumulated vsize (KiB) 29020

[startup+1.50093 s]
/proc/loadavg: 1.41 1.14 0.98 2/106 30832
/proc/meminfo: memFree=1888452/2059040 swapFree=4136016/4192956
[pid=30831] ppid=30829 vsize=48668 CPUtime=1.49
/proc/30831/stat : 30831 (pbscip.linux.x8) R 30829 30831 30219 0 -1 4202496 11431 0 0 0 146 3 0 0 25 0 1 0 23212572 49836032 11342 1992294400 4194304 8395647 140733426103968 18446744073709551615 7382056 0 0 4096 0 0 0 0 17 1 0 0 0
/proc/30831/statm: 12167 11342 390 1026 0 11137 0
Current children cumulated CPU time (s) 1.49
Current children cumulated vsize (KiB) 48668

[startup+3.10109 s]
/proc/loadavg: 1.45 1.16 0.99 2/106 30832
/proc/meminfo: memFree=1862040/2059040 swapFree=4136016/4192956
[pid=30831] ppid=30829 vsize=87416 CPUtime=3.09
/proc/30831/stat : 30831 (pbscip.linux.x8) R 30829 30831 30219 0 -1 4202496 21106 0 0 0 302 7 0 0 25 0 1 0 23212572 89513984 21017 1992294400 4194304 8395647 140733426103968 18446744073709551615 5759093 0 0 4096 0 0 0 0 17 1 0 0 0
/proc/30831/statm: 21854 21017 390 1026 0 20824 0
Current children cumulated CPU time (s) 3.09
Current children cumulated vsize (KiB) 87416

[startup+6.30143 s]
/proc/loadavg: 1.45 1.16 0.99 2/106 30832
/proc/meminfo: memFree=1783176/2059040 swapFree=4136016/4192956
[pid=30831] ppid=30829 vsize=164072 CPUtime=6.29
/proc/30831/stat : 30831 (pbscip.linux.x8) R 30829 30831 30219 0 -1 4202496 40183 0 0 0 614 15 0 0 25 0 1 0 23212572 168009728 40094 1992294400 4194304 8395647 140733426103968 18446744073709551615 7382031 0 0 4096 0 0 0 0 17 1 0 0 0
/proc/30831/statm: 41018 40094 390 1026 0 39988 0
Current children cumulated CPU time (s) 6.29
Current children cumulated vsize (KiB) 164072

[startup+12.7011 s]
/proc/loadavg: 1.38 1.15 0.99 2/106 30832
/proc/meminfo: memFree=1629168/2059040 swapFree=4136016/4192956
[pid=30831] ppid=30829 vsize=315444 CPUtime=12.68
/proc/30831/stat : 30831 (pbscip.linux.x8) R 30829 30831 30219 0 -1 4202496 77860 0 0 0 1239 29 0 0 25 0 1 0 23212572 323014656 77771 1992294400 4194304 8395647 140733426103968 18446744073709551615 4246004 0 0 4096 0 0 0 0 17 1 0 0 0
/proc/30831/statm: 78861 77771 390 1026 0 77831 0
Current children cumulated CPU time (s) 12.68
Current children cumulated vsize (KiB) 315444

[startup+25.5014 s]
/proc/loadavg: 1.32 1.15 0.99 2/106 30832
/proc/meminfo: memFree=617948/2059040 swapFree=4136016/4192956
[pid=30831] ppid=30829 vsize=1312452 CPUtime=25.47
/proc/30831/stat : 30831 (pbscip.linux.x8) R 30829 30831 30219 0 -1 4202496 349751 0 0 0 2428 119 0 0 25 0 1 0 23212572 1343950848 325922 1992294400 4194304 8395647 140733426103968 18446744073709551615 6345233 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/30831/statm: 328113 325922 471 1026 0 327083 0
Current children cumulated CPU time (s) 25.47
Current children cumulated vsize (KiB) 1312452



Maximum VSize exceeded: sending SIGTERM then SIGKILL

[startup+35.1005 s]
/proc/loadavg: 1.27 1.14 0.99 2/106 30832
/proc/meminfo: memFree=224124/2059040 swapFree=4136016/4192956
[pid=30831] ppid=30829 vsize=1866408 CPUtime=35.09
/proc/30831/stat : 30831 (pbscip.linux.x8) R 30829 30831 30219 0 -1 4202496 453542 0 0 0 3355 154 0 0 25 0 1 0 23212572 1911201792 425492 1992294400 4194304 8395647 140733426103968 18446744073709551615 6672044 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/30831/statm: 466602 425500 549 1026 0 465572 0
Current children cumulated CPU time (s) 35.09
Current children cumulated vsize (KiB) 1866408

Sending SIGTERM to process tree (bottom up)
Sleeping 2 seconds

Solver just ended. Dumping a history of the last processes samples

[startup+35.2165 s]
/proc/loadavg: 1.27 1.14 0.99 2/106 30832
/proc/meminfo: memFree=224124/2059040 swapFree=4136016/4192956
[pid=30831] ppid=30829 vsize=0 CPUtime=35.19
/proc/30831/stat : 30831 (pbscip.linux.x8) R 30829 30831 30219 0 -1 4202500 458988 0 0 0 3356 163 0 0 25 0 1 0 23212572 0 0 1992294400 0 0 0 0 0 0 0 4096 16384 18446744073709551615 0 0 17 1 0 0 0
/proc/30831/statm: 0 0 0 0 0 0 0
Current children cumulated CPU time (s) 35.19
Current children cumulated vsize (KiB) 0

[startup+35.3005 s]
/proc/loadavg: 1.27 1.14 0.99 2/106 30832
/proc/meminfo: memFree=224124/2059040 swapFree=4136016/4192956
[pid=30831] ppid=30829 vsize=0 CPUtime=35.27
/proc/30831/stat : 30831 (pbscip.linux.x8) R 30829 30831 30219 0 -1 4202500 458988 0 0 0 3356 171 0 0 25 0 1 0 23212572 0 0 1992294400 0 0 0 0 0 0 0 4096 16384 18446744073709551615 0 0 17 1 0 0 0
/proc/30831/statm: 0 0 0 0 0 0 0
Current children cumulated CPU time (s) 35.27
Current children cumulated vsize (KiB) 0

Child status: 255
Real time (s): 35.3064
CPU time (s): 35.2856
CPU user time (s): 33.5649
CPU system time (s): 1.72074
CPU usage (%): 99.9411
Max. virtual memory (cumulated for all children) (KiB): 1866408

getrusage(RUSAGE_CHILDREN,...) data:
user time used= 33.5649
system time used= 1.72074
maximum resident set size= 0
integral shared memory size= 0
integral unshared data size= 0
integral unshared stack size= 0
page reclaims= 458988
page faults= 0
swaps= 0
block input operations= 0
block output operations= 0
messages sent= 0
messages received= 0
signals received= 0
voluntary context switches= 4
involuntary context switches= 187

runsolver used 0.054991 second user time and 0.19597 second system time

The end

Launcher Data 

Begin job on node082 at 2010-07-08 02:47:24
IDJOB=2704181
IDBENCH=1388
IDSOLVER=1213
FILE ID=node082/2704181-1278550042
PBS_JOBID= 11239481
Free space on /tmp= 62356 MiB

SOLVER NAME= SCIPspx SCIP 1.2.1.3 with SoPlex 1.4.2 (CVS Version 30.5.2010) as LP solver
BENCH NAME= PB06//final/normalized-PB06/SATUNSAT-SMALLINT/submitted-PB06/liu/dbst/normalized-dbst_v40_e600_d20_mw10_0.opb.PB06.opb
COMMAND LINE= HOME/pbscip.linux.x86_64.gnu.opt.spx -f BENCHNAME -t TIMEOUT -m MEMLIMIT
RUNSOLVER COMMAND LINE= BIN/runsolver --timestamp -w /tmp/evaluation-result-2704181-1278550042/watcher-2704181-1278550042 -o /tmp/evaluation-result-2704181-1278550042/solver-2704181-1278550042 -C 1800 -W 2000 -M 1800  HOME/pbscip.linux.x86_64.gnu.opt.spx -f HOME/instance-2704181-1278550042.opb -t 1800 -m 1800

TIME LIMIT= 1800 seconds
MEMORY LIMIT= 1800 MiB
MAX NB THREAD= 0

MD5SUM BENCH= e436f4a609b5bae6a8ddfe1313c390fe
RANDOM SEED=1474721807

node082.alineos.net Linux 2.6.18-164.el5 #1 SMP Thu Sep 3 03:28:30 EDT 2009

/proc/cpuinfo:
processor	: 0
vendor_id	: GenuineIntel
cpu family	: 15
model		: 4
model name	:                   Intel(R) Xeon(TM) CPU 3.00GHz
stepping	: 3
cpu MHz		: 3000.260
cache size	: 2048 KB
physical id	: 0
siblings	: 1
core id		: 0
cpu cores	: 1
apicid		: 0
fpu		: yes
fpu_exception	: yes
cpuid level	: 5
wp		: yes
flags		: fpu vme de pse tsc msr pae mce cx8 apic sep mtrr pge mca cmov pat pse36 clflush dts acpi mmx fxsr sse sse2 ss ht tm syscall nx lm constant_tsc pni monitor ds_cpl cid cx16 xtpr
bogomips	: 6000.52
clflush size	: 64
cache_alignment	: 128
address sizes	: 36 bits physical, 48 bits virtual
power management:

processor	: 1
vendor_id	: GenuineIntel
cpu family	: 15
model		: 4
model name	:                   Intel(R) Xeon(TM) CPU 3.00GHz
stepping	: 3
cpu MHz		: 3000.260
cache size	: 2048 KB
physical id	: 3
siblings	: 1
core id		: 0
cpu cores	: 1
apicid		: 6
fpu		: yes
fpu_exception	: yes
cpuid level	: 5
wp		: yes
flags		: fpu vme de pse tsc msr pae mce cx8 apic sep mtrr pge mca cmov pat pse36 clflush dts acpi mmx fxsr sse sse2 ss ht tm syscall nx lm constant_tsc pni monitor ds_cpl cid cx16 xtpr
bogomips	: 5999.41
clflush size	: 64
cache_alignment	: 128
address sizes	: 36 bits physical, 48 bits virtual
power management:


/proc/meminfo:
MemTotal:      2059040 kB
MemFree:       1922692 kB
Buffers:           472 kB
Cached:          67208 kB
SwapCached:       8792 kB
Active:          64604 kB
Inactive:        14844 kB
HighTotal:           0 kB
HighFree:            0 kB
LowTotal:      2059040 kB
LowFree:       1922692 kB
SwapTotal:     4192956 kB
SwapFree:      4136016 kB
Dirty:           44456 kB
Writeback:           0 kB
AnonPages:       10632 kB
Mapped:           6836 kB
Slab:            35028 kB
PageTables:       4088 kB
NFS_Unstable:        0 kB
Bounce:              0 kB
CommitLimit:   5222476 kB
Committed_AS:   179116 kB
VmallocTotal: 34359738367 kB
VmallocUsed:    264964 kB
VmallocChunk: 34359471699 kB
HugePages_Total:     0
HugePages_Free:      0
HugePages_Rsvd:      0
Hugepagesize:     2048 kB

Free space on /tmp at the end= 62348 MiB
End job on node082 at 2010-07-08 02:48:01