Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r106-tall-167814482400181.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is DBSingleClientW-PT-d0m04, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r106-tall-167814482400181
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 6.6K Feb 26 15:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Feb 26 15:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K Feb 26 15:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K Feb 26 15:23 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 15:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 15:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 15:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 15:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K Feb 26 15:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 15:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 97K Feb 26 15:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 119K Mar 5 18:22 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME DBSingleClientW-PT-d0m04-UpperBounds-00
FORMULA_NAME DBSingleClientW-PT-d0m04-UpperBounds-01
FORMULA_NAME DBSingleClientW-PT-d0m04-UpperBounds-02
FORMULA_NAME DBSingleClientW-PT-d0m04-UpperBounds-03
FORMULA_NAME DBSingleClientW-PT-d0m04-UpperBounds-04
FORMULA_NAME DBSingleClientW-PT-d0m04-UpperBounds-05
FORMULA_NAME DBSingleClientW-PT-d0m04-UpperBounds-06
FORMULA_NAME DBSingleClientW-PT-d0m04-UpperBounds-07
FORMULA_NAME DBSingleClientW-PT-d0m04-UpperBounds-08
FORMULA_NAME DBSingleClientW-PT-d0m04-UpperBounds-09
FORMULA_NAME DBSingleClientW-PT-d0m04-UpperBounds-10
FORMULA_NAME DBSingleClientW-PT-d0m04-UpperBounds-11
FORMULA_NAME DBSingleClientW-PT-d0m04-UpperBounds-12
FORMULA_NAME DBSingleClientW-PT-d0m04-UpperBounds-13
FORMULA_NAME DBSingleClientW-PT-d0m04-UpperBounds-14
FORMULA_NAME DBSingleClientW-PT-d0m04-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678349040090

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d0m04
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-09 08:04:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-09 08:04:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 08:04:01] [INFO ] Load time of PNML (sax parser for PT used): 52 ms
[2023-03-09 08:04:01] [INFO ] Transformed 553 places.
[2023-03-09 08:04:01] [INFO ] Transformed 150 transitions.
[2023-03-09 08:04:01] [INFO ] Parsed PT model containing 553 places and 150 transitions and 600 arcs in 111 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
Deduced a syphon composed of 444 places in 2 ms
Reduce places removed 444 places and 0 transitions.
FORMULA DBSingleClientW-PT-d0m04-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m04-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m04-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m04-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m04-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m04-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m04-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m04-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m04-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m04-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m04-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 150 rows 109 cols
[2023-03-09 08:04:01] [INFO ] Computed 6 place invariants in 21 ms
Incomplete random walk after 10000 steps, including 2297 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 5) seen :3
FORMULA DBSingleClientW-PT-d0m04-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 1033 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 976 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10000 steps, including 982 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 1029 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 4) seen :1
[2023-03-09 08:04:01] [INFO ] Invariant cache hit.
[2023-03-09 08:04:02] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-09 08:04:02] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 3 ms returned sat
[2023-03-09 08:04:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:04:02] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2023-03-09 08:04:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:04:02] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 08:04:02] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2023-03-09 08:04:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:04:02] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2023-03-09 08:04:02] [INFO ] State equation strengthened by 74 read => feed constraints.
[2023-03-09 08:04:02] [INFO ] [Nat]Added 74 Read/Feed constraints in 9 ms returned sat
[2023-03-09 08:04:02] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 4 ms to minimize.
[2023-03-09 08:04:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 93 ms
[2023-03-09 08:04:02] [INFO ] Computed and/alt/rep : 39/69/39 causal constraints (skipped 110 transitions) in 17 ms.
[2023-03-09 08:04:02] [INFO ] Added : 2 causal constraints over 1 iterations in 49 ms. Result :sat
Minimization took 22 ms.
[2023-03-09 08:04:02] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 08:04:02] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned unsat
[2023-03-09 08:04:02] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 08:04:02] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2023-03-09 08:04:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:04:02] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2023-03-09 08:04:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:04:02] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 08:04:02] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 8 ms returned sat
[2023-03-09 08:04:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:04:02] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2023-03-09 08:04:02] [INFO ] [Nat]Added 74 Read/Feed constraints in 6 ms returned sat
[2023-03-09 08:04:02] [INFO ] Computed and/alt/rep : 39/69/39 causal constraints (skipped 110 transitions) in 16 ms.
[2023-03-09 08:04:02] [INFO ] Added : 1 causal constraints over 1 iterations in 47 ms. Result :sat
Minimization took 19 ms.
[2023-03-09 08:04:02] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 08:04:02] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2023-03-09 08:04:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:04:02] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2023-03-09 08:04:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:04:02] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 08:04:02] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2023-03-09 08:04:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:04:02] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2023-03-09 08:04:02] [INFO ] [Nat]Added 74 Read/Feed constraints in 9 ms returned sat
[2023-03-09 08:04:02] [INFO ] Computed and/alt/rep : 39/69/39 causal constraints (skipped 110 transitions) in 21 ms.
[2023-03-09 08:04:03] [INFO ] Added : 6 causal constraints over 2 iterations in 96 ms. Result :sat
Minimization took 19 ms.
Current structural bounds on expressions (after SMT) : [52, 1, 4, 4] Max seen :[1, 1, 2, 0]
FORMULA DBSingleClientW-PT-d0m04-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 3 out of 109 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 109/109 places, 150/150 transitions.
Graph (complete) has 332 edges and 109 vertex of which 101 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 101 transition count 137
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 37 place count 78 transition count 97
Iterating global reduction 1 with 23 rules applied. Total rules applied 60 place count 78 transition count 97
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 62 place count 78 transition count 95
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 73 place count 67 transition count 84
Iterating global reduction 2 with 11 rules applied. Total rules applied 84 place count 67 transition count 84
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 86 place count 67 transition count 82
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 89 place count 64 transition count 76
Iterating global reduction 3 with 3 rules applied. Total rules applied 92 place count 64 transition count 76
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 93 place count 64 transition count 75
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 94 place count 63 transition count 74
Iterating global reduction 4 with 1 rules applied. Total rules applied 95 place count 63 transition count 74
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 96 place count 62 transition count 73
Iterating global reduction 4 with 1 rules applied. Total rules applied 97 place count 62 transition count 73
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 99 place count 62 transition count 71
Applied a total of 99 rules in 43 ms. Remains 62 /109 variables (removed 47) and now considering 71/150 (removed 79) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 62/109 places, 71/150 transitions.
// Phase 1: matrix 71 rows 62 cols
[2023-03-09 08:04:03] [INFO ] Computed 2 place invariants in 18 ms
Incomplete random walk after 1000000 steps, including 228910 resets, run finished after 712 ms. (steps per millisecond=1404 ) properties (out of 3) seen :3
Incomplete Best-First random walk after 1000001 steps, including 101141 resets, run finished after 395 ms. (steps per millisecond=2531 ) properties (out of 3) seen :3
Incomplete Best-First random walk after 1000001 steps, including 100119 resets, run finished after 391 ms. (steps per millisecond=2557 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 1000000 steps, including 101791 resets, run finished after 334 ms. (steps per millisecond=2994 ) properties (out of 3) seen :4
[2023-03-09 08:04:04] [INFO ] Invariant cache hit.
[2023-03-09 08:04:05] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-09 08:04:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:04:05] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2023-03-09 08:04:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:04:05] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 08:04:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:04:05] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2023-03-09 08:04:05] [INFO ] State equation strengthened by 21 read => feed constraints.
[2023-03-09 08:04:05] [INFO ] [Nat]Added 21 Read/Feed constraints in 2 ms returned sat
[2023-03-09 08:04:05] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
[2023-03-09 08:04:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 48 ms
[2023-03-09 08:04:05] [INFO ] Computed and/alt/rep : 20/42/20 causal constraints (skipped 50 transitions) in 6 ms.
[2023-03-09 08:04:05] [INFO ] Added : 2 causal constraints over 1 iterations in 22 ms. Result :sat
Minimization took 10 ms.
[2023-03-09 08:04:05] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 08:04:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:04:05] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2023-03-09 08:04:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:04:05] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 08:04:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:04:05] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2023-03-09 08:04:05] [INFO ] [Nat]Added 21 Read/Feed constraints in 3 ms returned sat
[2023-03-09 08:04:05] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 0 ms to minimize.
[2023-03-09 08:04:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 40 ms
[2023-03-09 08:04:05] [INFO ] Computed and/alt/rep : 20/42/20 causal constraints (skipped 50 transitions) in 6 ms.
[2023-03-09 08:04:05] [INFO ] Added : 1 causal constraints over 1 iterations in 18 ms. Result :sat
Minimization took 11 ms.
[2023-03-09 08:04:05] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-09 08:04:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:04:05] [INFO ] [Real]Absence check using state equation in 12 ms returned unsat
Current structural bounds on expressions (after SMT) : [52, 4, 1] Max seen :[1, 2, 1]
FORMULA DBSingleClientW-PT-d0m04-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 2 out of 62 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 62/62 places, 71/71 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 61 transition count 70
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 61 transition count 70
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 60 transition count 69
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 60 transition count 69
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 59 transition count 67
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 59 transition count 67
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 58 transition count 66
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 58 transition count 66
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 57 transition count 65
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 57 transition count 65
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 57 transition count 63
Applied a total of 12 rules in 14 ms. Remains 57 /62 variables (removed 5) and now considering 63/71 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 57/62 places, 63/71 transitions.
// Phase 1: matrix 63 rows 57 cols
[2023-03-09 08:04:05] [INFO ] Computed 2 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 229476 resets, run finished after 564 ms. (steps per millisecond=1773 ) properties (out of 2) seen :3
Incomplete Best-First random walk after 1000001 steps, including 101243 resets, run finished after 300 ms. (steps per millisecond=3333 ) properties (out of 2) seen :3
Incomplete Best-First random walk after 1000001 steps, including 102041 resets, run finished after 294 ms. (steps per millisecond=3401 ) properties (out of 2) seen :2
[2023-03-09 08:04:06] [INFO ] Invariant cache hit.
[2023-03-09 08:04:06] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 08:04:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:04:06] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2023-03-09 08:04:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:04:06] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 08:04:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:04:06] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2023-03-09 08:04:06] [INFO ] State equation strengthened by 19 read => feed constraints.
[2023-03-09 08:04:06] [INFO ] [Nat]Added 19 Read/Feed constraints in 2 ms returned sat
[2023-03-09 08:04:06] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 2 ms to minimize.
[2023-03-09 08:04:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 59 ms
[2023-03-09 08:04:06] [INFO ] Computed and/alt/rep : 18/35/18 causal constraints (skipped 44 transitions) in 6 ms.
[2023-03-09 08:04:06] [INFO ] Added : 2 causal constraints over 1 iterations in 19 ms. Result :sat
Minimization took 12 ms.
[2023-03-09 08:04:06] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 08:04:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:04:06] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2023-03-09 08:04:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:04:06] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 08:04:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:04:06] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2023-03-09 08:04:06] [INFO ] [Nat]Added 19 Read/Feed constraints in 2 ms returned sat
[2023-03-09 08:04:06] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 0 ms to minimize.
[2023-03-09 08:04:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 44 ms
[2023-03-09 08:04:06] [INFO ] Computed and/alt/rep : 18/35/18 causal constraints (skipped 44 transitions) in 5 ms.
[2023-03-09 08:04:06] [INFO ] Added : 1 causal constraints over 1 iterations in 15 ms. Result :sat
Minimization took 10 ms.
Current structural bounds on expressions (after SMT) : [52, 4] Max seen :[1, 2]
Support contains 2 out of 57 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 57/57 places, 63/63 transitions.
Applied a total of 0 rules in 4 ms. Remains 57 /57 variables (removed 0) and now considering 63/63 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 57/57 places, 63/63 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 57/57 places, 63/63 transitions.
Applied a total of 0 rules in 3 ms. Remains 57 /57 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2023-03-09 08:04:06] [INFO ] Invariant cache hit.
[2023-03-09 08:04:07] [INFO ] Implicit Places using invariants in 47 ms returned []
[2023-03-09 08:04:07] [INFO ] Invariant cache hit.
[2023-03-09 08:04:07] [INFO ] State equation strengthened by 19 read => feed constraints.
[2023-03-09 08:04:07] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 134 ms to find 0 implicit places.
[2023-03-09 08:04:07] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 08:04:07] [INFO ] Invariant cache hit.
[2023-03-09 08:04:07] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 209 ms. Remains : 57/57 places, 63/63 transitions.
Starting property specific reduction for DBSingleClientW-PT-d0m04-UpperBounds-05
[2023-03-09 08:04:07] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 2257 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10001 steps, including 969 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :1
[2023-03-09 08:04:07] [INFO ] Invariant cache hit.
[2023-03-09 08:04:07] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 08:04:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:04:07] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2023-03-09 08:04:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:04:07] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 08:04:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:04:07] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2023-03-09 08:04:07] [INFO ] State equation strengthened by 19 read => feed constraints.
[2023-03-09 08:04:07] [INFO ] [Nat]Added 19 Read/Feed constraints in 2 ms returned sat
[2023-03-09 08:04:07] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 1 ms to minimize.
[2023-03-09 08:04:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 43 ms
[2023-03-09 08:04:07] [INFO ] Computed and/alt/rep : 18/35/18 causal constraints (skipped 44 transitions) in 5 ms.
[2023-03-09 08:04:07] [INFO ] Added : 2 causal constraints over 1 iterations in 17 ms. Result :sat
Minimization took 9 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[1]
Support contains 1 out of 57 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 57/57 places, 63/63 transitions.
Applied a total of 0 rules in 5 ms. Remains 57 /57 variables (removed 0) and now considering 63/63 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 57/57 places, 63/63 transitions.
[2023-03-09 08:04:07] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 229507 resets, run finished after 588 ms. (steps per millisecond=1700 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 101767 resets, run finished after 298 ms. (steps per millisecond=3355 ) properties (out of 1) seen :1
[2023-03-09 08:04:08] [INFO ] Invariant cache hit.
[2023-03-09 08:04:08] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 08:04:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:04:08] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2023-03-09 08:04:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:04:08] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 08:04:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:04:08] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2023-03-09 08:04:08] [INFO ] State equation strengthened by 19 read => feed constraints.
[2023-03-09 08:04:08] [INFO ] [Nat]Added 19 Read/Feed constraints in 2 ms returned sat
[2023-03-09 08:04:08] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 0 ms to minimize.
[2023-03-09 08:04:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 42 ms
[2023-03-09 08:04:08] [INFO ] Computed and/alt/rep : 18/35/18 causal constraints (skipped 44 transitions) in 5 ms.
[2023-03-09 08:04:08] [INFO ] Added : 2 causal constraints over 1 iterations in 16 ms. Result :sat
Minimization took 10 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[1]
Support contains 1 out of 57 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 57/57 places, 63/63 transitions.
Applied a total of 0 rules in 3 ms. Remains 57 /57 variables (removed 0) and now considering 63/63 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 57/57 places, 63/63 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 57/57 places, 63/63 transitions.
Applied a total of 0 rules in 3 ms. Remains 57 /57 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2023-03-09 08:04:08] [INFO ] Invariant cache hit.
[2023-03-09 08:04:08] [INFO ] Implicit Places using invariants in 48 ms returned []
[2023-03-09 08:04:08] [INFO ] Invariant cache hit.
[2023-03-09 08:04:08] [INFO ] State equation strengthened by 19 read => feed constraints.
[2023-03-09 08:04:08] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 128 ms to find 0 implicit places.
[2023-03-09 08:04:08] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 08:04:08] [INFO ] Invariant cache hit.
[2023-03-09 08:04:08] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 179 ms. Remains : 57/57 places, 63/63 transitions.
Ending property specific reduction for DBSingleClientW-PT-d0m04-UpperBounds-05 in 1461 ms.
Starting property specific reduction for DBSingleClientW-PT-d0m04-UpperBounds-09
[2023-03-09 08:04:08] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 2267 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10001 steps, including 955 resets, run finished after 4 ms. (steps per millisecond=2500 ) properties (out of 1) seen :2
[2023-03-09 08:04:08] [INFO ] Invariant cache hit.
[2023-03-09 08:04:08] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 08:04:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:04:08] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-09 08:04:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:04:08] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 08:04:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:04:08] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2023-03-09 08:04:08] [INFO ] State equation strengthened by 19 read => feed constraints.
[2023-03-09 08:04:08] [INFO ] [Nat]Added 19 Read/Feed constraints in 3 ms returned sat
[2023-03-09 08:04:08] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2023-03-09 08:04:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 36 ms
[2023-03-09 08:04:08] [INFO ] Computed and/alt/rep : 18/35/18 causal constraints (skipped 44 transitions) in 4 ms.
[2023-03-09 08:04:08] [INFO ] Added : 1 causal constraints over 1 iterations in 12 ms. Result :sat
Minimization took 8 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[2]
Support contains 1 out of 57 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 57/57 places, 63/63 transitions.
Applied a total of 0 rules in 5 ms. Remains 57 /57 variables (removed 0) and now considering 63/63 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 57/57 places, 63/63 transitions.
[2023-03-09 08:04:08] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 229721 resets, run finished after 555 ms. (steps per millisecond=1801 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000000 steps, including 101894 resets, run finished after 291 ms. (steps per millisecond=3436 ) properties (out of 1) seen :2
[2023-03-09 08:04:09] [INFO ] Invariant cache hit.
[2023-03-09 08:04:09] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 08:04:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:04:09] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2023-03-09 08:04:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:04:09] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 08:04:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:04:09] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2023-03-09 08:04:09] [INFO ] State equation strengthened by 19 read => feed constraints.
[2023-03-09 08:04:09] [INFO ] [Nat]Added 19 Read/Feed constraints in 2 ms returned sat
[2023-03-09 08:04:09] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 0 ms to minimize.
[2023-03-09 08:04:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 43 ms
[2023-03-09 08:04:09] [INFO ] Computed and/alt/rep : 18/35/18 causal constraints (skipped 44 transitions) in 5 ms.
[2023-03-09 08:04:09] [INFO ] Added : 1 causal constraints over 1 iterations in 15 ms. Result :sat
Minimization took 14 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[2]
Support contains 1 out of 57 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 57/57 places, 63/63 transitions.
Applied a total of 0 rules in 6 ms. Remains 57 /57 variables (removed 0) and now considering 63/63 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 57/57 places, 63/63 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 57/57 places, 63/63 transitions.
Applied a total of 0 rules in 3 ms. Remains 57 /57 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2023-03-09 08:04:09] [INFO ] Invariant cache hit.
[2023-03-09 08:04:09] [INFO ] Implicit Places using invariants in 50 ms returned []
[2023-03-09 08:04:09] [INFO ] Invariant cache hit.
[2023-03-09 08:04:09] [INFO ] State equation strengthened by 19 read => feed constraints.
[2023-03-09 08:04:09] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
[2023-03-09 08:04:09] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 08:04:09] [INFO ] Invariant cache hit.
[2023-03-09 08:04:10] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 194 ms. Remains : 57/57 places, 63/63 transitions.
Ending property specific reduction for DBSingleClientW-PT-d0m04-UpperBounds-09 in 1390 ms.
[2023-03-09 08:04:10] [INFO ] Flatten gal took : 26 ms
[2023-03-09 08:04:10] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2023-03-09 08:04:10] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 57 places, 63 transitions and 248 arcs took 2 ms.
Total runtime 8623 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=UpperBounds.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: DBSingleClientW_PT_d0m04
(NrP: 57 NrTr: 63 NrArc: 248)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec

net check time: 0m 0.000sec

init dd package: 0m 2.753sec


RS generation: 0m 0.042sec


-> reachability set: #nodes 1036 (1.0e+03) #states 3,434 (3)



starting MCC model checker
--------------------------

checking: place_bound(p44)
normalized: place_bound(p44)

-> the formula is 1

FORMULA DBSingleClientW-PT-d0m04-UpperBounds-05 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(p49)
normalized: place_bound(p49)

-> the formula is 2

FORMULA DBSingleClientW-PT-d0m04-UpperBounds-09 2 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

totally nodes used: 10460 (1.0e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 58272 214369 272641
used/not used/entry size/cache size: 220315 66888549 16 1024MB
basic ops cache: hits/miss/sum: 44 1750 1794
used/not used/entry size/cache size: 5148 16772068 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 8 128MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 12 192MB
state nr cache: hits/miss/sum: 304 1036 1340
used/not used/entry size/cache size: 1036 8387572 32 256MB
max state cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 67098517
1 10241
2 102
3 3
4 0
5 0
6 1
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 4.375sec


BK_STOP 1678349055615

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.000sec


iterations count:8834 (140), effective:319 (5)

initing FirstDep: 0m 0.000sec

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DBSingleClientW-PT-d0m04"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="marciexred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool marciexred"
echo " Input is DBSingleClientW-PT-d0m04, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r106-tall-167814482400181"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DBSingleClientW-PT-d0m04.tgz
mv DBSingleClientW-PT-d0m04 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;