Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r423-tajo-167905976500287.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is ShieldRVt-PT-020B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r423-tajo-167905976500287
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 644K
-rw-r--r-- 1 mcc users 7.0K Feb 25 23:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Feb 25 23:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Feb 25 23:15 CTLFireability.txt
-rw-r--r-- 1 mcc users 38K Feb 25 23:15 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Feb 25 17:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 17:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.1K Feb 25 23:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 93K Feb 25 23:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Feb 25 23:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Feb 25 23:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:04 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 239K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679245580868

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=lolaxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVt-PT-020B
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-19 17:06:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-19 17:06:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 17:06:22] [INFO ] Load time of PNML (sax parser for PT used): 70 ms
[2023-03-19 17:06:22] [INFO ] Transformed 1003 places.
[2023-03-19 17:06:22] [INFO ] Transformed 1003 transitions.
[2023-03-19 17:06:22] [INFO ] Found NUPN structural information;
[2023-03-19 17:06:22] [INFO ] Parsed PT model containing 1003 places and 1003 transitions and 2366 arcs in 140 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 384 ms. (steps per millisecond=26 ) properties (out of 16) seen :10
FORMULA ShieldRVt-PT-020B-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020B-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020B-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020B-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020B-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020B-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020B-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020B-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020B-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020B-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 1003 rows 1003 cols
[2023-03-19 17:06:23] [INFO ] Computed 81 place invariants in 22 ms
[2023-03-19 17:06:24] [INFO ] [Real]Absence check using 81 positive place invariants in 28 ms returned sat
[2023-03-19 17:06:24] [INFO ] After 567ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-19 17:06:24] [INFO ] [Nat]Absence check using 81 positive place invariants in 24 ms returned sat
[2023-03-19 17:06:25] [INFO ] After 747ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-19 17:06:25] [INFO ] Deduced a trap composed of 32 places in 188 ms of which 9 ms to minimize.
[2023-03-19 17:06:25] [INFO ] Deduced a trap composed of 45 places in 199 ms of which 1 ms to minimize.
[2023-03-19 17:06:26] [INFO ] Deduced a trap composed of 49 places in 173 ms of which 1 ms to minimize.
[2023-03-19 17:06:26] [INFO ] Deduced a trap composed of 50 places in 164 ms of which 0 ms to minimize.
[2023-03-19 17:06:26] [INFO ] Deduced a trap composed of 33 places in 132 ms of which 1 ms to minimize.
[2023-03-19 17:06:26] [INFO ] Deduced a trap composed of 32 places in 159 ms of which 1 ms to minimize.
[2023-03-19 17:06:26] [INFO ] Deduced a trap composed of 39 places in 166 ms of which 0 ms to minimize.
[2023-03-19 17:06:27] [INFO ] Deduced a trap composed of 23 places in 153 ms of which 1 ms to minimize.
[2023-03-19 17:06:27] [INFO ] Deduced a trap composed of 34 places in 115 ms of which 0 ms to minimize.
[2023-03-19 17:06:27] [INFO ] Deduced a trap composed of 19 places in 131 ms of which 0 ms to minimize.
[2023-03-19 17:06:27] [INFO ] Deduced a trap composed of 51 places in 137 ms of which 1 ms to minimize.
[2023-03-19 17:06:27] [INFO ] Deduced a trap composed of 46 places in 137 ms of which 1 ms to minimize.
[2023-03-19 17:06:27] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 2396 ms
[2023-03-19 17:06:28] [INFO ] Deduced a trap composed of 27 places in 185 ms of which 1 ms to minimize.
[2023-03-19 17:06:28] [INFO ] Deduced a trap composed of 43 places in 181 ms of which 0 ms to minimize.
[2023-03-19 17:06:28] [INFO ] Deduced a trap composed of 32 places in 191 ms of which 1 ms to minimize.
[2023-03-19 17:06:28] [INFO ] Deduced a trap composed of 53 places in 140 ms of which 0 ms to minimize.
[2023-03-19 17:06:29] [INFO ] Deduced a trap composed of 35 places in 167 ms of which 0 ms to minimize.
[2023-03-19 17:06:29] [INFO ] Deduced a trap composed of 33 places in 169 ms of which 0 ms to minimize.
[2023-03-19 17:06:29] [INFO ] Deduced a trap composed of 39 places in 178 ms of which 0 ms to minimize.
[2023-03-19 17:06:29] [INFO ] Deduced a trap composed of 42 places in 154 ms of which 1 ms to minimize.
[2023-03-19 17:06:30] [INFO ] Deduced a trap composed of 24 places in 159 ms of which 1 ms to minimize.
[2023-03-19 17:06:30] [INFO ] Deduced a trap composed of 46 places in 138 ms of which 1 ms to minimize.
[2023-03-19 17:06:30] [INFO ] Deduced a trap composed of 23 places in 119 ms of which 0 ms to minimize.
[2023-03-19 17:06:30] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 2495 ms
[2023-03-19 17:06:30] [INFO ] Deduced a trap composed of 35 places in 197 ms of which 1 ms to minimize.
[2023-03-19 17:06:31] [INFO ] Deduced a trap composed of 31 places in 173 ms of which 0 ms to minimize.
[2023-03-19 17:06:31] [INFO ] Deduced a trap composed of 35 places in 190 ms of which 0 ms to minimize.
[2023-03-19 17:06:31] [INFO ] Deduced a trap composed of 31 places in 175 ms of which 0 ms to minimize.
[2023-03-19 17:06:31] [INFO ] Deduced a trap composed of 40 places in 152 ms of which 0 ms to minimize.
[2023-03-19 17:06:31] [INFO ] Deduced a trap composed of 31 places in 152 ms of which 1 ms to minimize.
[2023-03-19 17:06:32] [INFO ] Deduced a trap composed of 36 places in 151 ms of which 1 ms to minimize.
[2023-03-19 17:06:32] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1593 ms
[2023-03-19 17:06:32] [INFO ] Deduced a trap composed of 34 places in 206 ms of which 1 ms to minimize.
[2023-03-19 17:06:32] [INFO ] Deduced a trap composed of 33 places in 198 ms of which 1 ms to minimize.
[2023-03-19 17:06:33] [INFO ] Deduced a trap composed of 43 places in 167 ms of which 1 ms to minimize.
[2023-03-19 17:06:33] [INFO ] Deduced a trap composed of 18 places in 196 ms of which 1 ms to minimize.
[2023-03-19 17:06:33] [INFO ] Deduced a trap composed of 21 places in 181 ms of which 1 ms to minimize.
[2023-03-19 17:06:33] [INFO ] Deduced a trap composed of 42 places in 174 ms of which 1 ms to minimize.
[2023-03-19 17:06:33] [INFO ] Deduced a trap composed of 34 places in 151 ms of which 1 ms to minimize.
[2023-03-19 17:06:34] [INFO ] Deduced a trap composed of 33 places in 159 ms of which 1 ms to minimize.
[2023-03-19 17:06:34] [INFO ] Deduced a trap composed of 31 places in 146 ms of which 1 ms to minimize.
[2023-03-19 17:06:34] [INFO ] Deduced a trap composed of 28 places in 124 ms of which 0 ms to minimize.
[2023-03-19 17:06:34] [INFO ] Deduced a trap composed of 35 places in 109 ms of which 1 ms to minimize.
[2023-03-19 17:06:34] [INFO ] Deduced a trap composed of 31 places in 126 ms of which 1 ms to minimize.
[2023-03-19 17:06:34] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 2518 ms
[2023-03-19 17:06:35] [INFO ] Deduced a trap composed of 26 places in 199 ms of which 0 ms to minimize.
[2023-03-19 17:06:35] [INFO ] Deduced a trap composed of 29 places in 171 ms of which 0 ms to minimize.
[2023-03-19 17:06:35] [INFO ] Deduced a trap composed of 42 places in 179 ms of which 1 ms to minimize.
[2023-03-19 17:06:35] [INFO ] Deduced a trap composed of 38 places in 174 ms of which 1 ms to minimize.
[2023-03-19 17:06:35] [INFO ] Deduced a trap composed of 46 places in 152 ms of which 1 ms to minimize.
[2023-03-19 17:06:36] [INFO ] Deduced a trap composed of 25 places in 216 ms of which 0 ms to minimize.
[2023-03-19 17:06:36] [INFO ] Deduced a trap composed of 32 places in 197 ms of which 0 ms to minimize.
[2023-03-19 17:06:36] [INFO ] Deduced a trap composed of 29 places in 166 ms of which 1 ms to minimize.
[2023-03-19 17:06:36] [INFO ] Deduced a trap composed of 44 places in 166 ms of which 1 ms to minimize.
[2023-03-19 17:06:37] [INFO ] Deduced a trap composed of 38 places in 164 ms of which 1 ms to minimize.
[2023-03-19 17:06:37] [INFO ] Deduced a trap composed of 32 places in 164 ms of which 1 ms to minimize.
[2023-03-19 17:06:37] [INFO ] Deduced a trap composed of 32 places in 206 ms of which 0 ms to minimize.
[2023-03-19 17:06:37] [INFO ] Deduced a trap composed of 35 places in 199 ms of which 0 ms to minimize.
[2023-03-19 17:06:37] [INFO ] Deduced a trap composed of 35 places in 174 ms of which 1 ms to minimize.
[2023-03-19 17:06:38] [INFO ] Deduced a trap composed of 47 places in 194 ms of which 1 ms to minimize.
[2023-03-19 17:06:38] [INFO ] Deduced a trap composed of 46 places in 158 ms of which 0 ms to minimize.
[2023-03-19 17:06:38] [INFO ] Deduced a trap composed of 43 places in 164 ms of which 1 ms to minimize.
[2023-03-19 17:06:38] [INFO ] Deduced a trap composed of 32 places in 152 ms of which 1 ms to minimize.
[2023-03-19 17:06:39] [INFO ] Deduced a trap composed of 33 places in 189 ms of which 1 ms to minimize.
[2023-03-19 17:06:39] [INFO ] Deduced a trap composed of 36 places in 177 ms of which 0 ms to minimize.
[2023-03-19 17:06:39] [INFO ] Deduced a trap composed of 38 places in 161 ms of which 0 ms to minimize.
[2023-03-19 17:06:39] [INFO ] Deduced a trap composed of 40 places in 138 ms of which 1 ms to minimize.
[2023-03-19 17:06:39] [INFO ] Deduced a trap composed of 32 places in 151 ms of which 0 ms to minimize.
[2023-03-19 17:06:39] [INFO ] Deduced a trap composed of 28 places in 146 ms of which 2 ms to minimize.
[2023-03-19 17:06:40] [INFO ] Deduced a trap composed of 32 places in 129 ms of which 1 ms to minimize.
[2023-03-19 17:06:40] [INFO ] Deduced a trap composed of 47 places in 161 ms of which 2 ms to minimize.
[2023-03-19 17:06:40] [INFO ] Deduced a trap composed of 41 places in 128 ms of which 10 ms to minimize.
[2023-03-19 17:06:40] [INFO ] Deduced a trap composed of 38 places in 118 ms of which 1 ms to minimize.
[2023-03-19 17:06:40] [INFO ] Trap strengthening (SAT) tested/added 29/28 trap constraints in 5770 ms
[2023-03-19 17:06:40] [INFO ] Deduced a trap composed of 37 places in 136 ms of which 1 ms to minimize.
[2023-03-19 17:06:41] [INFO ] Deduced a trap composed of 34 places in 133 ms of which 0 ms to minimize.
[2023-03-19 17:06:41] [INFO ] Deduced a trap composed of 32 places in 128 ms of which 1 ms to minimize.
[2023-03-19 17:06:41] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 554 ms
[2023-03-19 17:06:41] [INFO ] After 16648ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 913 ms.
[2023-03-19 17:06:42] [INFO ] After 17930ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 240 ms.
Support contains 84 out of 1003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1003/1003 places, 1003/1003 transitions.
Drop transitions removed 235 transitions
Trivial Post-agglo rules discarded 235 transitions
Performed 235 trivial Post agglomeration. Transition count delta: 235
Iterating post reduction 0 with 235 rules applied. Total rules applied 235 place count 1003 transition count 768
Reduce places removed 235 places and 0 transitions.
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Iterating post reduction 1 with 255 rules applied. Total rules applied 490 place count 768 transition count 748
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 510 place count 748 transition count 748
Performed 94 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 94 Pre rules applied. Total rules applied 510 place count 748 transition count 654
Deduced a syphon composed of 94 places in 2 ms
Reduce places removed 94 places and 0 transitions.
Iterating global reduction 3 with 188 rules applied. Total rules applied 698 place count 654 transition count 654
Discarding 129 places :
Symmetric choice reduction at 3 with 129 rule applications. Total rules 827 place count 525 transition count 525
Iterating global reduction 3 with 129 rules applied. Total rules applied 956 place count 525 transition count 525
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 958 place count 525 transition count 523
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 959 place count 524 transition count 523
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 48 Pre rules applied. Total rules applied 959 place count 524 transition count 475
Deduced a syphon composed of 48 places in 2 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 5 with 96 rules applied. Total rules applied 1055 place count 476 transition count 475
Performed 150 Post agglomeration using F-continuation condition.Transition count delta: 150
Deduced a syphon composed of 150 places in 0 ms
Reduce places removed 150 places and 0 transitions.
Iterating global reduction 5 with 300 rules applied. Total rules applied 1355 place count 326 transition count 325
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 5 with 88 rules applied. Total rules applied 1443 place count 282 transition count 352
Free-agglomeration rule applied 5 times.
Iterating global reduction 5 with 5 rules applied. Total rules applied 1448 place count 282 transition count 347
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 1453 place count 277 transition count 347
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 6 with 5 rules applied. Total rules applied 1458 place count 277 transition count 347
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 1459 place count 276 transition count 346
Applied a total of 1459 rules in 219 ms. Remains 276 /1003 variables (removed 727) and now considering 346/1003 (removed 657) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 221 ms. Remains : 276/1003 places, 346/1003 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 283 ms. (steps per millisecond=35 ) properties (out of 6) seen :2
FORMULA ShieldRVt-PT-020B-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020B-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 4) seen :1
FORMULA ShieldRVt-PT-020B-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 346 rows 276 cols
[2023-03-19 17:06:43] [INFO ] Computed 81 place invariants in 5 ms
[2023-03-19 17:06:43] [INFO ] After 90ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-19 17:06:43] [INFO ] [Nat]Absence check using 81 positive place invariants in 9 ms returned sat
[2023-03-19 17:06:43] [INFO ] After 170ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-19 17:06:43] [INFO ] State equation strengthened by 97 read => feed constraints.
[2023-03-19 17:06:43] [INFO ] After 215ms SMT Verify possible using 97 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-19 17:06:43] [INFO ] Deduced a trap composed of 6 places in 46 ms of which 1 ms to minimize.
[2023-03-19 17:06:43] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 0 ms to minimize.
[2023-03-19 17:06:43] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 0 ms to minimize.
[2023-03-19 17:06:44] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 0 ms to minimize.
[2023-03-19 17:06:44] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 255 ms
[2023-03-19 17:06:44] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 1 ms to minimize.
[2023-03-19 17:06:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 60 ms
[2023-03-19 17:06:44] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 0 ms to minimize.
[2023-03-19 17:06:44] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2023-03-19 17:06:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 107 ms
[2023-03-19 17:06:44] [INFO ] After 793ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 149 ms.
[2023-03-19 17:06:44] [INFO ] After 1181ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 38 ms.
Support contains 55 out of 276 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 276/276 places, 346/346 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 276 transition count 338
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 268 transition count 338
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 16 place count 268 transition count 328
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 36 place count 258 transition count 328
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 37 place count 257 transition count 327
Iterating global reduction 2 with 1 rules applied. Total rules applied 38 place count 257 transition count 327
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 72 place count 240 transition count 310
Renaming transitions due to excessive name length > 1024 char.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 82 place count 235 transition count 315
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 84 place count 235 transition count 313
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 85 place count 235 transition count 312
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 86 place count 234 transition count 312
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 88 place count 234 transition count 312
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 89 place count 233 transition count 311
Applied a total of 89 rules in 94 ms. Remains 233 /276 variables (removed 43) and now considering 311/346 (removed 35) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 100 ms. Remains : 233/276 places, 311/346 transitions.
Incomplete random walk after 10000 steps, including 5 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 417984 steps, run timeout after 3001 ms. (steps per millisecond=139 ) properties seen :{}
Probabilistic random walk after 417984 steps, saw 220021 distinct states, run finished after 3004 ms. (steps per millisecond=139 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 311 rows 233 cols
[2023-03-19 17:06:47] [INFO ] Computed 81 place invariants in 7 ms
[2023-03-19 17:06:48] [INFO ] After 191ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-19 17:06:48] [INFO ] [Nat]Absence check using 81 positive place invariants in 9 ms returned sat
[2023-03-19 17:06:48] [INFO ] After 136ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-19 17:06:48] [INFO ] State equation strengthened by 118 read => feed constraints.
[2023-03-19 17:06:48] [INFO ] After 115ms SMT Verify possible using 118 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-19 17:06:48] [INFO ] Deduced a trap composed of 6 places in 43 ms of which 0 ms to minimize.
[2023-03-19 17:06:48] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 1 ms to minimize.
[2023-03-19 17:06:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 129 ms
[2023-03-19 17:06:48] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 0 ms to minimize.
[2023-03-19 17:06:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 90 ms
[2023-03-19 17:06:48] [INFO ] After 564ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 159 ms.
[2023-03-19 17:06:48] [INFO ] After 930ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 22 ms.
Support contains 55 out of 233 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 233/233 places, 311/311 transitions.
Applied a total of 0 rules in 13 ms. Remains 233 /233 variables (removed 0) and now considering 311/311 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 233/233 places, 311/311 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 233/233 places, 311/311 transitions.
Applied a total of 0 rules in 13 ms. Remains 233 /233 variables (removed 0) and now considering 311/311 (removed 0) transitions.
[2023-03-19 17:06:49] [INFO ] Invariant cache hit.
[2023-03-19 17:06:49] [INFO ] Implicit Places using invariants in 239 ms returned []
[2023-03-19 17:06:49] [INFO ] Invariant cache hit.
[2023-03-19 17:06:49] [INFO ] State equation strengthened by 118 read => feed constraints.
[2023-03-19 17:06:49] [INFO ] Implicit Places using invariants and state equation in 374 ms returned []
Implicit Place search using SMT with State Equation took 615 ms to find 0 implicit places.
[2023-03-19 17:06:49] [INFO ] Redundant transitions in 14 ms returned []
[2023-03-19 17:06:49] [INFO ] Invariant cache hit.
[2023-03-19 17:06:49] [INFO ] Dead Transitions using invariants and state equation in 125 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 775 ms. Remains : 233/233 places, 311/311 transitions.
Drop transitions removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 233 transition count 297
Partial Free-agglomeration rule applied 12 times.
Drop transitions removed 12 transitions
Iterating global reduction 0 with 12 rules applied. Total rules applied 26 place count 233 transition count 297
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 32 place count 233 transition count 291
Applied a total of 32 rules in 38 ms. Remains 233 /233 variables (removed 0) and now considering 291/311 (removed 20) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 291 rows 233 cols
[2023-03-19 17:06:49] [INFO ] Computed 81 place invariants in 2 ms
[2023-03-19 17:06:49] [INFO ] After 89ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-19 17:06:49] [INFO ] [Nat]Absence check using 81 positive place invariants in 10 ms returned sat
[2023-03-19 17:06:50] [INFO ] After 153ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-19 17:06:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-19 17:06:50] [INFO ] After 84ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-19 17:06:50] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 1 ms to minimize.
[2023-03-19 17:06:50] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 1 ms to minimize.
[2023-03-19 17:06:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 110 ms
[2023-03-19 17:06:50] [INFO ] After 280ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 67 ms.
[2023-03-19 17:06:50] [INFO ] After 570ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2023-03-19 17:06:50] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 4 ms.
[2023-03-19 17:06:50] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 233 places, 311 transitions and 1488 arcs took 4 ms.
[2023-03-19 17:06:50] [INFO ] Flatten gal took : 59 ms
Total runtime 28301 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ShieldRVt-PT-020B
BK_EXAMINATION: ReachabilityFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/374
ReachabilityFireability

FORMULA ShieldRVt-PT-020B-ReachabilityFireability-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-020B-ReachabilityFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-020B-ReachabilityFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1679245611036

--------------------
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 ReachabilityFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/374/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/374/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/374/ReachabilityFireability.xml
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: LAUNCH task # 13 (type EXCL) for 0 ShieldRVt-PT-020B-ReachabilityFireability-09
lola: time limit : 1200 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 9 (type FNDP) for 0 ShieldRVt-PT-020B-ReachabilityFireability-09
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 10 (type EQUN) for 0 ShieldRVt-PT-020B-ReachabilityFireability-09
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: LAUNCH task # 12 (type SRCH) for 0 ShieldRVt-PT-020B-ReachabilityFireability-09
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: FINISHED task # 12 (type SRCH) for ShieldRVt-PT-020B-ReachabilityFireability-09
lola: result : true
lola: markings : 722
lola: fired transitions : 748
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 9 (type FNDP) for ShieldRVt-PT-020B-ReachabilityFireability-09 (obsolete)
lola: CANCELED task # 10 (type EQUN) for ShieldRVt-PT-020B-ReachabilityFireability-09 (obsolete)
lola: CANCELED task # 13 (type EXCL) for ShieldRVt-PT-020B-ReachabilityFireability-09 (obsolete)
lola: LAUNCH task # 26 (type EXCL) for 6 ShieldRVt-PT-020B-ReachabilityFireability-14
lola: time limit : 1800 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 15 (type FNDP) for 3 ShieldRVt-PT-020B-ReachabilityFireability-11
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 16 (type EQUN) for 3 ShieldRVt-PT-020B-ReachabilityFireability-11
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: LAUNCH task # 18 (type SRCH) for 3 ShieldRVt-PT-020B-ReachabilityFireability-11
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 9 (type FNDP) for ShieldRVt-PT-020B-ReachabilityFireability-09
lola: result : true
lola: fired transitions : 244
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: FINISHED task # 15 (type FNDP) for ShieldRVt-PT-020B-ReachabilityFireability-11
lola: result : true
lola: fired transitions : 129
lola: tried executions : 1
lola: time used : 1.000000
lola: memory pages used : 0
lola: CANCELED task # 16 (type EQUN) for ShieldRVt-PT-020B-ReachabilityFireability-11 (obsolete)
lola: CANCELED task # 18 (type SRCH) for ShieldRVt-PT-020B-ReachabilityFireability-11 (obsolete)
lola: LAUNCH task # 22 (type FNDP) for 6 ShieldRVt-PT-020B-ReachabilityFireability-14
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 23 (type EQUN) for 6 ShieldRVt-PT-020B-ReachabilityFireability-14
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 25 (type SRCH) for 6 ShieldRVt-PT-020B-ReachabilityFireability-14
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 25 (type SRCH) for ShieldRVt-PT-020B-ReachabilityFireability-14
lola: result : false
lola: markings : 3
lola: fired transitions : 2
lola: time used : 0.000000
lola: memory pages used : 1
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: CANCELED task # 22 (type FNDP) for ShieldRVt-PT-020B-ReachabilityFireability-14 (obsolete)
lola: CANCELED task # 23 (type EQUN) for ShieldRVt-PT-020B-ReachabilityFireability-14 (obsolete)
lola: CANCELED task # 26 (type EXCL) for ShieldRVt-PT-020B-ReachabilityFireability-14 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldRVt-PT-020B-ReachabilityFireability-09: EF true tandem / insertion
ShieldRVt-PT-020B-ReachabilityFireability-11: EF true findpath
ShieldRVt-PT-020B-ReachabilityFireability-14: AG true tandem / insertion


Time elapsed: 1 secs. Pages in use: 3

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="ShieldRVt-PT-020B"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is ShieldRVt-PT-020B, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r423-tajo-167905976500287"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVt-PT-020B.tgz
mv ShieldRVt-PT-020B execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;