Trace number 2704179

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) 36.9294 36.9376

General information on the benchmark

Namenormalized-PB06/SATUNSAT-SMALLINT/submitted-PB06/liu/
dbst/normalized-dbst_v40_e600_d20_mw10_6.opb.PB06.opb
MD5SUMf5d8cf0048d52cf223a3574d281ac8f8
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.89356
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 350
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-2704179-1278550040.opb>
15.69/15.76	c original problem has 2800 variables (2800 bin, 0 int, 0 impl, 0 cont) and 990001 constraints
15.69/15.76	c problem read
15.69/15.76	c No objective function, only one solution is needed.
15.69/15.76	c presolving settings loaded
19.29/19.39	c presolving:
28.09/28.12	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.79/29.84	c (round 2) 0 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 3238 chg coeffs, 990000 upgd conss, 2400 impls, 80 clqs
31.59/31.66	c presolving (3 rounds):
31.59/31.66	c  0 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 3397 changed coefficients
31.59/31.66	c  5520 implications, 80 cliques
31.59/31.66	c presolved problem has 2800 variables (2800 bin, 0 int, 0 impl, 0 cont) and 990001 constraints
31.59/31.66	c    3160 constraints of type <knapsack>
31.59/31.66	c    1280 constraints of type <setppc>
31.59/31.66	c       1 constraints of type <linear>
31.59/31.66	c  985560 constraints of type <logicor>
31.59/31.66	c transformed objective value is always integral (scale: 1)
31.59/31.66	c Presolving Time: 12.80
31.59/31.66	c - non default parameters ----------------------------------------------------------------------
31.59/31.66	c # SCIP version 1.2.1.3
31.59/31.66	c 
31.59/31.66	c # frequency for displaying node information lines
31.59/31.66	c # [type: int, range: [-1,2147483647], default: 100]
31.59/31.66	c display/freq = 10000
31.59/31.66	c 
31.59/31.66	c # maximal time in seconds to run
31.59/31.66	c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
31.59/31.66	c limits/time = 1774.25
31.59/31.66	c 
31.59/31.66	c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
31.59/31.66	c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
31.59/31.66	c limits/memory = 1620
31.59/31.66	c 
31.59/31.66	c # solving stops, if the given number of solutions were found (-1: no limit)
31.59/31.66	c # [type: int, range: [-1,2147483647], default: -1]
31.59/31.66	c limits/solutions = 1
31.59/31.66	c 
31.59/31.66	c # maximal number of separation rounds per node (-1: unlimited)
31.59/31.66	c # [type: int, range: [-1,2147483647], default: 5]
31.59/31.66	c separating/maxrounds = 1
31.59/31.66	c 
31.59/31.66	c # maximal number of separation rounds in the root node (-1: unlimited)
31.59/31.66	c # [type: int, range: [-1,2147483647], default: -1]
31.59/31.66	c separating/maxroundsroot = 5
31.59/31.66	c 
31.59/31.66	c # default clock type (1: CPU user seconds, 2: wall clock time)
31.59/31.66	c # [type: int, range: [1,2], default: 1]
31.59/31.66	c timing/clocktype = 2
31.59/31.66	c 
31.59/31.66	c # should presolving try to simplify inequalities
31.59/31.66	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
31.59/31.66	c constraints/linear/simplifyinequalities = TRUE
31.59/31.66	c 
31.59/31.66	c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
31.59/31.66	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
31.59/31.66	c constraints/indicator/addCouplingCons = TRUE
31.59/31.66	c 
31.59/31.66	c # should disaggregation of knapsack constraints be allowed in preprocessing?
31.59/31.66	c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
31.59/31.66	c constraints/knapsack/disaggregation = FALSE
31.59/31.66	c 
31.59/31.66	c # should presolving try to simplify knapsacks
31.59/31.66	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
31.59/31.66	c constraints/knapsack/simplifyinequalities = TRUE
31.59/31.66	c 
31.59/31.66	c # maximal number of presolving rounds the presolver participates in (-1: no limit)
31.59/31.66	c # [type: int, range: [-1,2147483647], default: -1]
31.59/31.66	c presolving/probing/maxrounds = 0
31.59/31.66	c 
31.59/31.66	c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
31.59/31.66	c # [type: int, range: [-1,2147483647], default: 10]
31.59/31.66	c heuristics/coefdiving/freq = -1
31.59/31.66	c 
31.59/31.66	c # maximal fraction of diving LP iterations compared to node LP iterations
31.59/31.66	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
31.59/31.66	c heuristics/coefdiving/maxlpiterquot = 0.075
31.59/31.66	c 
31.59/31.66	c # additional number of allowed LP iterations
31.59/31.66	c # [type: int, range: [0,2147483647], default: 1000]
31.59/31.66	c heuristics/coefdiving/maxlpiterofs = 1500
31.59/31.66	c 
31.59/31.66	c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
31.59/31.66	c # [type: int, range: [-1,2147483647], default: 30]
31.59/31.66	c heuristics/crossover/freq = -1
31.59/31.66	c 
31.59/31.66	c # number of nodes added to the contingent of the total nodes
31.59/31.66	c # [type: longint, range: [0,9223372036854775807], default: 500]
31.59/31.66	c heuristics/crossover/nodesofs = 750
31.59/31.66	c 
31.59/31.66	c # number of nodes without incumbent change that heuristic should wait
31.59/31.66	c # [type: longint, range: [0,9223372036854775807], default: 200]
31.59/31.66	c heuristics/crossover/nwaitingnodes = 100
31.59/31.66	c 
31.59/31.66	c # contingent of sub problem nodes in relation to the number of nodes of the original problem
31.59/31.66	c # [type: real, range: [0,1], default: 0.1]
31.59/31.66	c heuristics/crossover/nodesquot = 0.15
31.59/31.66	c 
31.59/31.66	c # minimum percentage of integer variables that have to be fixed 
31.59/31.66	c # [type: real, range: [0,1], default: 0.666]
31.59/31.66	c heuristics/crossover/minfixingrate = 0.5
31.59/31.66	c 
31.59/31.66	c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
31.59/31.66	c # [type: int, range: [-1,2147483647], default: 20]
31.59/31.66	c heuristics/feaspump/freq = -1
31.59/31.66	c 
31.59/31.66	c # additional number of allowed LP iterations
31.59/31.66	c # [type: int, range: [0,2147483647], default: 1000]
31.59/31.66	c heuristics/feaspump/maxlpiterofs = 2000
31.59/31.66	c 
31.59/31.66	c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
31.59/31.66	c # [type: int, range: [-1,2147483647], default: 10]
31.59/31.66	c heuristics/fracdiving/freq = -1
31.59/31.66	c 
31.59/31.66	c # maximal fraction of diving LP iterations compared to node LP iterations
31.59/31.66	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
31.59/31.66	c heuristics/fracdiving/maxlpiterquot = 0.075
31.59/31.66	c 
31.59/31.66	c # additional number of allowed LP iterations
31.59/31.66	c # [type: int, range: [0,2147483647], default: 1000]
31.59/31.66	c heuristics/fracdiving/maxlpiterofs = 1500
31.59/31.66	c 
31.59/31.66	c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
31.59/31.66	c # [type: int, range: [-1,2147483647], default: 10]
31.59/31.66	c heuristics/guideddiving/freq = -1
31.59/31.66	c 
31.59/31.66	c # maximal fraction of diving LP iterations compared to node LP iterations
31.59/31.66	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
31.59/31.66	c heuristics/guideddiving/maxlpiterquot = 0.075
31.59/31.66	c 
31.59/31.66	c # additional number of allowed LP iterations
31.59/31.66	c # [type: int, range: [0,2147483647], default: 1000]
31.59/31.66	c heuristics/guideddiving/maxlpiterofs = 1500
31.59/31.66	c 
31.59/31.66	c # maximal fraction of diving LP iterations compared to node LP iterations
31.59/31.66	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
31.59/31.66	c heuristics/intdiving/maxlpiterquot = 0.075
31.59/31.66	c 
31.59/31.66	c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
31.59/31.66	c # [type: int, range: [-1,2147483647], default: 10]
31.59/31.66	c heuristics/intshifting/freq = -1
31.59/31.66	c 
31.59/31.66	c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
31.59/31.66	c # [type: int, range: [-1,2147483647], default: 10]
31.59/31.66	c heuristics/linesearchdiving/freq = -1
31.59/31.66	c 
31.59/31.66	c # maximal fraction of diving LP iterations compared to node LP iterations
31.59/31.66	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
31.59/31.66	c heuristics/linesearchdiving/maxlpiterquot = 0.075
31.59/31.66	c 
31.59/31.66	c # additional number of allowed LP iterations
31.59/31.66	c # [type: int, range: [0,2147483647], default: 1000]
31.59/31.66	c heuristics/linesearchdiving/maxlpiterofs = 1500
31.59/31.66	c 
31.59/31.66	c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
31.59/31.66	c # [type: int, range: [-1,2147483647], default: 1]
31.59/31.66	c heuristics/nlp/freq = -1
31.59/31.66	c 
31.59/31.66	c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
31.59/31.66	c # [type: int, range: [-1,2147483647], default: 20]
31.59/31.66	c heuristics/objpscostdiving/freq = -1
31.59/31.66	c 
31.59/31.66	c # maximal fraction of diving LP iterations compared to total iteration number
31.59/31.66	c # [type: real, range: [0,1], default: 0.01]
31.59/31.66	c heuristics/objpscostdiving/maxlpiterquot = 0.015
31.59/31.66	c 
31.59/31.66	c # additional number of allowed LP iterations
31.59/31.66	c # [type: int, range: [0,2147483647], default: 1000]
31.59/31.66	c heuristics/objpscostdiving/maxlpiterofs = 1500
31.59/31.66	c 
31.59/31.66	c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
31.59/31.66	c # [type: int, range: [-1,2147483647], default: 1]
31.59/31.66	c heuristics/oneopt/freq = -1
31.59/31.66	c 
31.59/31.66	c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
31.59/31.66	c # [type: int, range: [-1,2147483647], default: 10]
31.59/31.66	c heuristics/pscostdiving/freq = -1
31.59/31.66	c 
31.59/31.66	c # maximal fraction of diving LP iterations compared to node LP iterations
31.59/31.66	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
31.59/31.66	c heuristics/pscostdiving/maxlpiterquot = 0.075
31.59/31.66	c 
31.59/31.66	c # additional number of allowed LP iterations
31.59/31.66	c # [type: int, range: [0,2147483647], default: 1000]
31.59/31.66	c heuristics/pscostdiving/maxlpiterofs = 1500
31.59/31.66	c 
31.59/31.66	c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
31.59/31.66	c # [type: int, range: [-1,2147483647], default: 0]
31.59/31.66	c heuristics/rens/freq = -1
31.59/31.66	c 
31.59/31.66	c # minimum percentage of integer variables that have to be fixable 
31.59/31.66	c # [type: real, range: [0,1], default: 0.5]
31.59/31.66	c heuristics/rens/minfixingrate = 0.3
31.59/31.66	c 
31.59/31.66	c # number of nodes added to the contingent of the total nodes
31.59/31.66	c # [type: longint, range: [0,9223372036854775807], default: 500]
31.59/31.66	c heuristics/rens/nodesofs = 2000
31.59/31.66	c 
31.59/31.66	c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
31.59/31.66	c # [type: int, range: [-1,2147483647], default: 20]
31.59/31.66	c heuristics/rootsoldiving/freq = -1
31.59/31.66	c 
31.59/31.66	c # maximal fraction of diving LP iterations compared to node LP iterations
31.59/31.66	c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
31.59/31.66	c heuristics/rootsoldiving/maxlpiterquot = 0.015
31.59/31.66	c 
31.59/31.66	c # additional number of allowed LP iterations
31.59/31.66	c # [type: int, range: [0,2147483647], default: 1000]
31.59/31.66	c heuristics/rootsoldiving/maxlpiterofs = 1500
31.59/31.66	c 
31.59/31.66	c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
31.59/31.66	c # [type: int, range: [-1,2147483647], default: 1]
31.59/31.66	c heuristics/rounding/freq = -1
31.59/31.66	c 
31.59/31.66	c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
31.59/31.66	c # [type: int, range: [-1,2147483647], default: 10]
31.59/31.66	c heuristics/shifting/freq = -1
31.59/31.66	c 
31.59/31.66	c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
31.59/31.66	c # [type: int, range: [-1,2147483647], default: 1]
31.59/31.66	c heuristics/simplerounding/freq = -1
31.59/31.66	c 
31.59/31.66	c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
31.59/31.66	c # [type: int, range: [-1,2147483647], default: 0]
31.59/31.66	c heuristics/trivial/freq = -1
31.59/31.66	c 
31.59/31.66	c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
31.59/31.66	c # [type: int, range: [-1,2147483647], default: 1]
31.59/31.66	c heuristics/trysol/freq = -1
31.59/31.66	c 
31.59/31.66	c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
31.59/31.66	c # [type: int, range: [-1,2147483647], default: 10]
31.59/31.66	c heuristics/veclendiving/freq = -1
31.59/31.66	c 
31.59/31.66	c # maximal fraction of diving LP iterations compared to node LP iterations
31.59/31.66	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
31.59/31.66	c heuristics/veclendiving/maxlpiterquot = 0.075
31.59/31.66	c 
31.59/31.66	c # additional number of allowed LP iterations
31.59/31.66	c # [type: int, range: [0,2147483647], default: 1000]
31.59/31.66	c heuristics/veclendiving/maxlpiterofs = 1500
31.59/31.66	c 
31.59/31.66	c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
31.59/31.66	c # [type: int, range: [-1,2147483647], default: 1]
31.59/31.66	c heuristics/zirounding/freq = -1
31.59/31.66	c 
31.59/31.66	c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
31.59/31.66	c # [type: int, range: [-1,2147483647], default: 0]
31.59/31.66	c separating/cmir/freq = -1
31.59/31.66	c 
31.59/31.66	c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
31.59/31.66	c # [type: int, range: [-1,2147483647], default: 0]
31.59/31.66	c separating/flowcover/freq = -1
31.59/31.66	c 
31.59/31.66	c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
31.59/31.66	c # [type: int, range: [-1,2147483647], default: -1]
31.59/31.66	c separating/rapidlearning/freq = 0
31.59/31.66	c 
31.59/31.66	c -----------------------------------------------------------------------------------------------
31.59/31.66	c start solving
31.68/31.72	c 
36.69/36.70	c pressed CTRL-C 1 times (5 times for forcing termination)
36.69/36.77	EMALLC02 realloc: Out of memory - cannot allocate 7920008 bytes
36.69/36.78	c [src/scip/lpi_spx.cpp:1201] Warning: SoPlex threw an exception: XMALLC02 realloc: Could not allocate enough memory
36.69/36.78	c [src/scip/lp.c:5561] ERROR: Error <-6> in function call
36.69/36.78	c [src/scip/lp.c:5837] ERROR: Error <-6> in function call
36.69/36.78	c [src/scip/lp.c:11248] ERROR: Error <-6> in function call
36.69/36.78	c [src/scip/solve.c:801] ERROR: Error <-6> in function call
36.69/36.78	c [src/scip/solve.c:1912] ERROR: Error <-6> in function call
36.69/36.78	c [src/scip/solve.c:2591] ERROR: Error <-6> in function call
36.69/36.78	c [src/scip/solve.c:3206] ERROR: Error <-6> in function call
36.69/36.78	c [src/scip/scip.c:6312] ERROR: Error <-6> in function call
36.69/36.78	c [src/cmain.c:674] ERROR: Error <-6> in function call
36.69/36.78	c [src/cmain.c:849] ERROR: Error <-6> in function call
36.69/36.78	c [src/cmain.c:925] ERROR: Error <-6> in function call
36.69/36.78	c SCIP Error (-6): c error in LP solverc 
36.69/36.78	c Time complete: 36.76.

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-2704179-1278550040/watcher-2704179-1278550040 -o /tmp/evaluation-result-2704179-1278550040/solver-2704179-1278550040 -C 1800 -W 2000 -M 1800 HOME/pbscip.linux.x86_64.gnu.opt.spx -f HOME/instance-2704179-1278550040.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.00 1.02 0.97 3/106 30318
/proc/meminfo: memFree=1823968/2059040 swapFree=4108700/4192956
[pid=30318] ppid=30316 vsize=7904 CPUtime=0
/proc/30318/stat : 30318 (pbscip.linux.x8) R 30316 30318 29926 0 -1 4202496 1044 0 0 0 0 0 0 0 20 0 1 0 23215426 8093696 956 1992294400 4194304 8395647 140734727783472 18446744073709551615 7382157 0 0 4096 0 0 0 0 17 1 0 0 0
/proc/30318/statm: 1976 965 365 1026 0 946 0

[startup+0.0416681 s]
/proc/loadavg: 1.00 1.02 0.97 3/106 30318
/proc/meminfo: memFree=1823968/2059040 swapFree=4108700/4192956
[pid=30318] ppid=30316 vsize=12360 CPUtime=0.03
/proc/30318/stat : 30318 (pbscip.linux.x8) R 30316 30318 29926 0 -1 4202496 2374 0 0 0 3 0 0 0 20 0 1 0 23215426 12656640 2286 1992294400 4194304 8395647 140734727783472 18446744073709551615 7382056 0 0 4096 0 0 0 0 17 1 0 0 0
/proc/30318/statm: 3090 2286 390 1026 0 2060 0
Current children cumulated CPU time (s) 0.03
Current children cumulated vsize (KiB) 12360

[startup+0.10067 s]
/proc/loadavg: 1.00 1.02 0.97 3/106 30318
/proc/meminfo: memFree=1823968/2059040 swapFree=4108700/4192956
[pid=30318] ppid=30316 vsize=14840 CPUtime=0.09
/proc/30318/stat : 30318 (pbscip.linux.x8) R 30316 30318 29926 0 -1 4202496 2993 0 0 0 9 0 0 0 20 0 1 0 23215426 15196160 2905 1992294400 4194304 8395647 140734727783472 18446744073709551615 7301280 0 0 4096 0 0 0 0 17 1 0 0 0
/proc/30318/statm: 3710 2905 390 1026 0 2680 0
Current children cumulated CPU time (s) 0.09
Current children cumulated vsize (KiB) 14840

[startup+0.300684 s]
/proc/loadavg: 1.00 1.02 0.97 3/106 30318
/proc/meminfo: memFree=1823968/2059040 swapFree=4108700/4192956
[pid=30318] ppid=30316 vsize=19600 CPUtime=0.29
/proc/30318/stat : 30318 (pbscip.linux.x8) R 30316 30318 29926 0 -1 4202496 4173 0 0 0 28 1 0 0 20 0 1 0 23215426 20070400 4085 1992294400 4194304 8395647 140734727783472 18446744073709551615 7370214 0 0 4096 0 0 0 0 17 1 0 0 0
/proc/30318/statm: 4900 4085 390 1026 0 3870 0
Current children cumulated CPU time (s) 0.29
Current children cumulated vsize (KiB) 19600

[startup+0.700712 s]
/proc/loadavg: 1.00 1.02 0.97 3/106 30318
/proc/meminfo: memFree=1823968/2059040 swapFree=4108700/4192956
[pid=30318] ppid=30316 vsize=28948 CPUtime=0.69
/proc/30318/stat : 30318 (pbscip.linux.x8) R 30316 30318 29926 0 -1 4202496 6522 0 0 0 67 2 0 0 21 0 1 0 23215426 29642752 6434 1992294400 4194304 8395647 140734727783472 18446744073709551615 4327576 0 0 4096 0 0 0 0 17 1 0 0 0
/proc/30318/statm: 7237 6434 390 1026 0 6207 0
Current children cumulated CPU time (s) 0.69
Current children cumulated vsize (KiB) 28948

[startup+1.50077 s]
/proc/loadavg: 1.00 1.02 0.97 2/107 30319
/proc/meminfo: memFree=1792092/2059040 swapFree=4108700/4192956
[pid=30318] ppid=30316 vsize=46608 CPUtime=1.49
/proc/30318/stat : 30318 (pbscip.linux.x8) R 30316 30318 29926 0 -1 4202496 10890 0 0 0 145 4 0 0 23 0 1 0 23215426 47726592 10802 1992294400 4194304 8395647 140734727783472 18446744073709551615 7279835 0 0 4096 0 0 0 0 17 1 0 0 0
/proc/30318/statm: 11652 10802 390 1026 0 10622 0
Current children cumulated CPU time (s) 1.49
Current children cumulated vsize (KiB) 46608

[startup+3.10088 s]
/proc/loadavg: 1.00 1.02 0.97 2/107 30319
/proc/meminfo: memFree=1765680/2059040 swapFree=4108700/4192956
[pid=30318] ppid=30316 vsize=84132 CPUtime=3.09
/proc/30318/stat : 30318 (pbscip.linux.x8) R 30316 30318 29926 0 -1 4202496 20251 0 0 0 301 8 0 0 25 0 1 0 23215426 86151168 20163 1992294400 4194304 8395647 140734727783472 18446744073709551615 6349011 0 0 4096 0 0 0 0 17 1 0 0 0
/proc/30318/statm: 21033 20163 390 1026 0 20003 0
Current children cumulated CPU time (s) 3.09
Current children cumulated vsize (KiB) 84132

[startup+6.3011 s]
/proc/loadavg: 1.00 1.02 0.97 2/107 30319
/proc/meminfo: memFree=1691652/2059040 swapFree=4108700/4192956
[pid=30318] ppid=30316 vsize=156488 CPUtime=6.29
/proc/30318/stat : 30318 (pbscip.linux.x8) R 30316 30318 29926 0 -1 4202496 38424 0 0 0 613 16 0 0 25 0 1 0 23215426 160243712 38336 1992294400 4194304 8395647 140734727783472 18446744073709551615 7301391 0 0 4096 0 0 0 0 17 1 0 0 0
/proc/30318/statm: 39122 38336 390 1026 0 38092 0
Current children cumulated CPU time (s) 6.29
Current children cumulated vsize (KiB) 156488

[startup+12.7015 s]
/proc/loadavg: 1.00 1.02 0.97 2/107 30319
/proc/meminfo: memFree=1542852/2059040 swapFree=4108700/4192956
[pid=30318] ppid=30316 vsize=302668 CPUtime=12.69
/proc/30318/stat : 30318 (pbscip.linux.x8) R 30316 30318 29926 0 -1 4202496 74908 0 0 0 1239 30 0 0 25 0 1 0 23215426 309932032 74820 1992294400 4194304 8395647 140734727783472 18446744073709551615 7274942 0 0 4096 0 0 0 0 17 1 0 0 0
/proc/30318/statm: 75667 74820 390 1026 0 74637 0
Current children cumulated CPU time (s) 12.69
Current children cumulated vsize (KiB) 302668

[startup+25.5004 s]
/proc/loadavg: 1.00 1.02 0.97 2/107 30319
/proc/meminfo: memFree=545644/2059040 swapFree=4108700/4192956
[pid=30318] ppid=30316 vsize=1315844 CPUtime=25.49
/proc/30318/stat : 30318 (pbscip.linux.x8) R 30316 30318 29926 0 -1 4202496 350649 0 0 0 2424 125 0 0 25 0 1 0 23215426 1347424256 326821 1992294400 4194304 8395647 140734727783472 18446744073709551615 4212641 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/30318/statm: 328961 326821 471 1026 0 327931 0
Current children cumulated CPU time (s) 25.49
Current children cumulated vsize (KiB) 1315844



Maximum VSize exceeded: sending SIGTERM then SIGKILL

[startup+36.7012 s]
/proc/loadavg: 1.00 1.02 0.97 2/107 30319
/proc/meminfo: memFree=135328/2059040 swapFree=4108700/4192956
[pid=30318] ppid=30316 vsize=1852504 CPUtime=36.69
/proc/30318/stat : 30318 (pbscip.linux.x8) R 30316 30318 29926 0 -1 4202496 449615 0 0 0 3511 158 0 0 25 0 1 0 23215426 1896964096 421866 1992294400 4194304 8395647 140734727783472 18446744073709551615 6679307 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/30318/statm: 463126 421866 550 1026 0 462096 0
Current children cumulated CPU time (s) 36.69
Current children cumulated vsize (KiB) 1852504

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

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

[startup+36.8092 s]
/proc/loadavg: 1.00 1.02 0.97 2/107 30319
/proc/meminfo: memFree=135328/2059040 swapFree=4108700/4192956
[pid=30318] ppid=30316 vsize=0 CPUtime=36.79
/proc/30318/stat : 30318 (pbscip.linux.x8) R 30316 30318 29926 0 -1 4202500 459704 0 0 0 3514 165 0 0 25 0 1 0 23215426 0 0 1992294400 0 0 0 0 0 0 0 4096 16384 18446744073709551615 0 0 17 1 0 0 0
/proc/30318/statm: 0 0 0 0 0 0 0
Current children cumulated CPU time (s) 36.79
Current children cumulated vsize (KiB) 0

[startup+36.9012 s]
/proc/loadavg: 1.00 1.02 0.97 2/107 30319
/proc/meminfo: memFree=135328/2059040 swapFree=4108700/4192956
[pid=30318] ppid=30316 vsize=0 CPUtime=36.88
/proc/30318/stat : 30318 (pbscip.linux.x8) R 30316 30318 29926 0 -1 4202500 459704 0 0 0 3514 174 0 0 25 0 1 0 23215426 0 0 1992294400 0 0 0 0 0 0 0 4096 16384 18446744073709551615 0 0 17 1 0 0 0
/proc/30318/statm: 0 0 0 0 0 0 0
Current children cumulated CPU time (s) 36.88
Current children cumulated vsize (KiB) 0

Child status: 255
Real time (s): 36.9376
CPU time (s): 36.9294
CPU user time (s): 35.1467
CPU system time (s): 1.78273
CPU usage (%): 99.9777
Max. virtual memory (cumulated for all children) (KiB): 1852504

getrusage(RUSAGE_CHILDREN,...) data:
user time used= 35.1467
system time used= 1.78273
maximum resident set size= 0
integral shared memory size= 0
integral unshared data size= 0
integral unshared stack size= 0
page reclaims= 459704
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= 1
involuntary context switches= 484

runsolver used 0.057991 second user time and 0.19597 second system time

The end

Launcher Data 

Begin job on node034 at 2010-07-08 02:47:22
IDJOB=2704179
IDBENCH=1386
IDSOLVER=1213
FILE ID=node034/2704179-1278550040
PBS_JOBID= 11239505
Free space on /tmp= 62368 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_6.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-2704179-1278550040/watcher-2704179-1278550040 -o /tmp/evaluation-result-2704179-1278550040/solver-2704179-1278550040 -C 1800 -W 2000 -M 1800  HOME/pbscip.linux.x86_64.gnu.opt.spx -f HOME/instance-2704179-1278550040.opb -t 1800 -m 1800

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

MD5SUM BENCH= f5d8cf0048d52cf223a3574d281ac8f8
RANDOM SEED=1357752742

node034.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.216
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.43
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.216
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	: 5599.46
clflush size	: 64
cache_alignment	: 128
address sizes	: 36 bits physical, 48 bits virtual
power management:


/proc/meminfo:
MemTotal:      2059040 kB
MemFree:       1824372 kB
Buffers:          6496 kB
Cached:         127512 kB
SwapCached:      41008 kB
Active:          98120 kB
Inactive:        78588 kB
HighTotal:           0 kB
HighFree:            0 kB
LowTotal:      2059040 kB
LowFree:       1824372 kB
SwapTotal:     4192956 kB
SwapFree:      4108700 kB
Dirty:           44592 kB
Writeback:           0 kB
AnonPages:       10152 kB
Mapped:           6884 kB
Slab:            35932 kB
PageTables:       4152 kB
NFS_Unstable:        0 kB
Bounce:              0 kB
CommitLimit:   5222476 kB
Committed_AS:   183464 kB
VmallocTotal: 34359738367 kB
VmallocUsed:    264948 kB
VmallocChunk: 34359471699 kB
HugePages_Total:     0
HugePages_Free:      0
HugePages_Rsvd:      0
Hugepagesize:     2048 kB

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