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.r394-oct2-167903717700271.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 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 ShieldIIPt-PT-010B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r394-oct2-167903717700271
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 664K
-rw-r--r-- 1 mcc users 7.3K Feb 25 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Feb 25 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 25 16:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 25 16:57 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.6K Feb 25 16:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 16:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 145K Feb 25 16:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Feb 25 16:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Feb 25 16:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:56 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 167K 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 ShieldIIPt-PT-010B-ReachabilityFireability-00
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityFireability-01
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityFireability-02
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityFireability-03
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityFireability-04
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityFireability-05
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityFireability-06
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityFireability-07
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityFireability-08
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityFireability-09
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityFireability-10
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityFireability-11
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityFireability-12
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityFireability-13
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityFireability-14
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679499466914

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=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-010B
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 15:37:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-22 15:37:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 15:37:50] [INFO ] Load time of PNML (sax parser for PT used): 146 ms
[2023-03-22 15:37:50] [INFO ] Transformed 703 places.
[2023-03-22 15:37:50] [INFO ] Transformed 653 transitions.
[2023-03-22 15:37:50] [INFO ] Found NUPN structural information;
[2023-03-22 15:37:50] [INFO ] Parsed PT model containing 703 places and 653 transitions and 1626 arcs in 292 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 37 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 507 ms. (steps per millisecond=19 ) properties (out of 16) seen :8
FORMULA ShieldIIPt-PT-010B-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 8) seen :1
FORMULA ShieldIIPt-PT-010B-ReachabilityFireability-13 FALSE 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 653 rows 703 cols
[2023-03-22 15:37:51] [INFO ] Computed 91 place invariants in 23 ms
[2023-03-22 15:37:52] [INFO ] [Real]Absence check using 91 positive place invariants in 102 ms returned sat
[2023-03-22 15:37:52] [INFO ] After 770ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-22 15:37:52] [INFO ] [Nat]Absence check using 91 positive place invariants in 32 ms returned sat
[2023-03-22 15:37:54] [INFO ] After 1398ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-22 15:37:54] [INFO ] Deduced a trap composed of 18 places in 284 ms of which 11 ms to minimize.
[2023-03-22 15:37:54] [INFO ] Deduced a trap composed of 12 places in 207 ms of which 1 ms to minimize.
[2023-03-22 15:37:54] [INFO ] Deduced a trap composed of 27 places in 196 ms of which 7 ms to minimize.
[2023-03-22 15:37:55] [INFO ] Deduced a trap composed of 20 places in 215 ms of which 24 ms to minimize.
[2023-03-22 15:37:55] [INFO ] Deduced a trap composed of 20 places in 242 ms of which 42 ms to minimize.
[2023-03-22 15:37:55] [INFO ] Deduced a trap composed of 23 places in 151 ms of which 0 ms to minimize.
[2023-03-22 15:37:55] [INFO ] Deduced a trap composed of 28 places in 203 ms of which 1 ms to minimize.
[2023-03-22 15:37:56] [INFO ] Deduced a trap composed of 20 places in 228 ms of which 5 ms to minimize.
[2023-03-22 15:37:56] [INFO ] Deduced a trap composed of 24 places in 118 ms of which 1 ms to minimize.
[2023-03-22 15:37:56] [INFO ] Deduced a trap composed of 34 places in 84 ms of which 0 ms to minimize.
[2023-03-22 15:37:56] [INFO ] Deduced a trap composed of 26 places in 97 ms of which 0 ms to minimize.
[2023-03-22 15:37:56] [INFO ] Deduced a trap composed of 28 places in 244 ms of which 0 ms to minimize.
[2023-03-22 15:37:56] [INFO ] Deduced a trap composed of 30 places in 63 ms of which 0 ms to minimize.
[2023-03-22 15:37:56] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 2792 ms
[2023-03-22 15:37:57] [INFO ] Deduced a trap composed of 21 places in 250 ms of which 1 ms to minimize.
[2023-03-22 15:37:57] [INFO ] Deduced a trap composed of 19 places in 199 ms of which 0 ms to minimize.
[2023-03-22 15:37:57] [INFO ] Deduced a trap composed of 19 places in 177 ms of which 1 ms to minimize.
[2023-03-22 15:37:57] [INFO ] Deduced a trap composed of 23 places in 181 ms of which 1 ms to minimize.
[2023-03-22 15:37:58] [INFO ] Deduced a trap composed of 20 places in 206 ms of which 1 ms to minimize.
[2023-03-22 15:37:58] [INFO ] Deduced a trap composed of 31 places in 360 ms of which 1 ms to minimize.
[2023-03-22 15:37:58] [INFO ] Deduced a trap composed of 19 places in 216 ms of which 1 ms to minimize.
[2023-03-22 15:37:59] [INFO ] Deduced a trap composed of 25 places in 174 ms of which 0 ms to minimize.
[2023-03-22 15:37:59] [INFO ] Deduced a trap composed of 28 places in 169 ms of which 1 ms to minimize.
[2023-03-22 15:37:59] [INFO ] Deduced a trap composed of 33 places in 321 ms of which 2 ms to minimize.
[2023-03-22 15:37:59] [INFO ] Deduced a trap composed of 22 places in 278 ms of which 1 ms to minimize.
[2023-03-22 15:38:00] [INFO ] Deduced a trap composed of 24 places in 198 ms of which 1 ms to minimize.
[2023-03-22 15:38:00] [INFO ] Deduced a trap composed of 32 places in 120 ms of which 1 ms to minimize.
[2023-03-22 15:38:00] [INFO ] Deduced a trap composed of 12 places in 268 ms of which 1 ms to minimize.
[2023-03-22 15:38:00] [INFO ] Deduced a trap composed of 15 places in 170 ms of which 0 ms to minimize.
[2023-03-22 15:38:01] [INFO ] Deduced a trap composed of 22 places in 168 ms of which 0 ms to minimize.
[2023-03-22 15:38:01] [INFO ] Deduced a trap composed of 19 places in 194 ms of which 1 ms to minimize.
[2023-03-22 15:38:01] [INFO ] Deduced a trap composed of 19 places in 175 ms of which 0 ms to minimize.
[2023-03-22 15:38:01] [INFO ] Deduced a trap composed of 26 places in 270 ms of which 0 ms to minimize.
[2023-03-22 15:38:02] [INFO ] Deduced a trap composed of 18 places in 192 ms of which 1 ms to minimize.
[2023-03-22 15:38:02] [INFO ] Deduced a trap composed of 15 places in 119 ms of which 0 ms to minimize.
[2023-03-22 15:38:02] [INFO ] Deduced a trap composed of 19 places in 183 ms of which 18 ms to minimize.
[2023-03-22 15:38:02] [INFO ] Deduced a trap composed of 22 places in 168 ms of which 1 ms to minimize.
[2023-03-22 15:38:02] [INFO ] Deduced a trap composed of 24 places in 136 ms of which 0 ms to minimize.
[2023-03-22 15:38:02] [INFO ] Deduced a trap composed of 42 places in 109 ms of which 0 ms to minimize.
[2023-03-22 15:38:03] [INFO ] Deduced a trap composed of 19 places in 166 ms of which 1 ms to minimize.
[2023-03-22 15:38:03] [INFO ] Deduced a trap composed of 28 places in 117 ms of which 1 ms to minimize.
[2023-03-22 15:38:03] [INFO ] Trap strengthening (SAT) tested/added 28/27 trap constraints in 6312 ms
[2023-03-22 15:38:03] [INFO ] Deduced a trap composed of 20 places in 225 ms of which 3 ms to minimize.
[2023-03-22 15:38:03] [INFO ] Deduced a trap composed of 18 places in 140 ms of which 0 ms to minimize.
[2023-03-22 15:38:04] [INFO ] Deduced a trap composed of 14 places in 114 ms of which 1 ms to minimize.
[2023-03-22 15:38:04] [INFO ] Deduced a trap composed of 22 places in 293 ms of which 1 ms to minimize.
[2023-03-22 15:38:04] [INFO ] Deduced a trap composed of 23 places in 154 ms of which 0 ms to minimize.
[2023-03-22 15:38:04] [INFO ] Deduced a trap composed of 16 places in 184 ms of which 1 ms to minimize.
[2023-03-22 15:38:04] [INFO ] Deduced a trap composed of 17 places in 107 ms of which 0 ms to minimize.
[2023-03-22 15:38:05] [INFO ] Deduced a trap composed of 16 places in 97 ms of which 0 ms to minimize.
[2023-03-22 15:38:05] [INFO ] Deduced a trap composed of 20 places in 167 ms of which 1 ms to minimize.
[2023-03-22 15:38:05] [INFO ] Deduced a trap composed of 23 places in 220 ms of which 0 ms to minimize.
[2023-03-22 15:38:05] [INFO ] Deduced a trap composed of 21 places in 181 ms of which 1 ms to minimize.
[2023-03-22 15:38:06] [INFO ] Deduced a trap composed of 19 places in 193 ms of which 1 ms to minimize.
[2023-03-22 15:38:06] [INFO ] Deduced a trap composed of 29 places in 231 ms of which 3 ms to minimize.
[2023-03-22 15:38:06] [INFO ] Deduced a trap composed of 22 places in 348 ms of which 19 ms to minimize.
[2023-03-22 15:38:07] [INFO ] Deduced a trap composed of 17 places in 230 ms of which 1 ms to minimize.
[2023-03-22 15:38:07] [INFO ] Deduced a trap composed of 34 places in 233 ms of which 1 ms to minimize.
[2023-03-22 15:38:07] [INFO ] Deduced a trap composed of 18 places in 180 ms of which 36 ms to minimize.
[2023-03-22 15:38:07] [INFO ] Deduced a trap composed of 38 places in 104 ms of which 1 ms to minimize.
[2023-03-22 15:38:07] [INFO ] Deduced a trap composed of 27 places in 113 ms of which 0 ms to minimize.
[2023-03-22 15:38:08] [INFO ] Deduced a trap composed of 23 places in 161 ms of which 0 ms to minimize.
[2023-03-22 15:38:08] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 4671 ms
[2023-03-22 15:38:08] [INFO ] Deduced a trap composed of 21 places in 173 ms of which 1 ms to minimize.
[2023-03-22 15:38:08] [INFO ] Deduced a trap composed of 27 places in 97 ms of which 0 ms to minimize.
[2023-03-22 15:38:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 357 ms
[2023-03-22 15:38:08] [INFO ] Deduced a trap composed of 17 places in 133 ms of which 0 ms to minimize.
[2023-03-22 15:38:09] [INFO ] Deduced a trap composed of 21 places in 188 ms of which 0 ms to minimize.
[2023-03-22 15:38:09] [INFO ] Deduced a trap composed of 28 places in 123 ms of which 1 ms to minimize.
[2023-03-22 15:38:09] [INFO ] Deduced a trap composed of 26 places in 106 ms of which 2 ms to minimize.
[2023-03-22 15:38:09] [INFO ] Deduced a trap composed of 25 places in 124 ms of which 1 ms to minimize.
[2023-03-22 15:38:09] [INFO ] Deduced a trap composed of 21 places in 113 ms of which 15 ms to minimize.
[2023-03-22 15:38:09] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1107 ms
[2023-03-22 15:38:10] [INFO ] Deduced a trap composed of 20 places in 184 ms of which 21 ms to minimize.
[2023-03-22 15:38:10] [INFO ] Deduced a trap composed of 32 places in 181 ms of which 14 ms to minimize.
[2023-03-22 15:38:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 497 ms
[2023-03-22 15:38:10] [INFO ] Deduced a trap composed of 16 places in 185 ms of which 1 ms to minimize.
[2023-03-22 15:38:11] [INFO ] Deduced a trap composed of 22 places in 179 ms of which 1 ms to minimize.
[2023-03-22 15:38:11] [INFO ] Deduced a trap composed of 22 places in 129 ms of which 0 ms to minimize.
[2023-03-22 15:38:11] [INFO ] Deduced a trap composed of 25 places in 156 ms of which 1 ms to minimize.
[2023-03-22 15:38:11] [INFO ] Deduced a trap composed of 24 places in 205 ms of which 0 ms to minimize.
[2023-03-22 15:38:11] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1116 ms
[2023-03-22 15:38:11] [INFO ] After 19120ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 813 ms.
[2023-03-22 15:38:12] [INFO ] After 20475ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 197 ms.
Support contains 165 out of 703 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 703/703 places, 653/653 transitions.
Drop transitions removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 0 with 71 rules applied. Total rules applied 71 place count 703 transition count 582
Reduce places removed 71 places and 0 transitions.
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Iterating post reduction 1 with 102 rules applied. Total rules applied 173 place count 632 transition count 551
Reduce places removed 31 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 32 rules applied. Total rules applied 205 place count 601 transition count 550
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 35 Pre rules applied. Total rules applied 205 place count 601 transition count 515
Deduced a syphon composed of 35 places in 2 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 275 place count 566 transition count 515
Discarding 52 places :
Symmetric choice reduction at 3 with 52 rule applications. Total rules 327 place count 514 transition count 463
Iterating global reduction 3 with 52 rules applied. Total rules applied 379 place count 514 transition count 463
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 379 place count 514 transition count 453
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 399 place count 504 transition count 453
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 97
Deduced a syphon composed of 97 places in 1 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 3 with 194 rules applied. Total rules applied 593 place count 407 transition count 356
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 615 place count 396 transition count 356
Free-agglomeration rule applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 619 place count 396 transition count 352
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 623 place count 392 transition count 352
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 629 place count 392 transition count 352
Applied a total of 629 rules in 135 ms. Remains 392 /703 variables (removed 311) and now considering 352/653 (removed 301) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 135 ms. Remains : 392/703 places, 352/653 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 7) seen :2
FORMULA ShieldIIPt-PT-010B-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 5) seen :1
FORMULA ShieldIIPt-PT-010B-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 4) seen :1
FORMULA ShieldIIPt-PT-010B-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 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 31 ms. (steps per millisecond=322 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 352 rows 392 cols
[2023-03-22 15:38:13] [INFO ] Computed 91 place invariants in 2 ms
[2023-03-22 15:38:13] [INFO ] After 83ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-22 15:38:13] [INFO ] [Nat]Absence check using 91 positive place invariants in 12 ms returned sat
[2023-03-22 15:38:13] [INFO ] After 316ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-22 15:38:13] [INFO ] State equation strengthened by 18 read => feed constraints.
[2023-03-22 15:38:13] [INFO ] After 253ms SMT Verify possible using 18 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-22 15:38:14] [INFO ] Deduced a trap composed of 8 places in 137 ms of which 1 ms to minimize.
[2023-03-22 15:38:14] [INFO ] Deduced a trap composed of 7 places in 143 ms of which 1 ms to minimize.
[2023-03-22 15:38:14] [INFO ] Deduced a trap composed of 6 places in 140 ms of which 1 ms to minimize.
[2023-03-22 15:38:14] [INFO ] Deduced a trap composed of 7 places in 92 ms of which 0 ms to minimize.
[2023-03-22 15:38:14] [INFO ] Deduced a trap composed of 6 places in 157 ms of which 0 ms to minimize.
[2023-03-22 15:38:15] [INFO ] Deduced a trap composed of 10 places in 107 ms of which 1 ms to minimize.
[2023-03-22 15:38:15] [INFO ] Deduced a trap composed of 6 places in 122 ms of which 1 ms to minimize.
[2023-03-22 15:38:15] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 1 ms to minimize.
[2023-03-22 15:38:15] [INFO ] Deduced a trap composed of 13 places in 136 ms of which 1 ms to minimize.
[2023-03-22 15:38:15] [INFO ] Deduced a trap composed of 9 places in 184 ms of which 0 ms to minimize.
[2023-03-22 15:38:15] [INFO ] Deduced a trap composed of 11 places in 80 ms of which 1 ms to minimize.
[2023-03-22 15:38:15] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1787 ms
[2023-03-22 15:38:16] [INFO ] Deduced a trap composed of 6 places in 298 ms of which 1 ms to minimize.
[2023-03-22 15:38:16] [INFO ] Deduced a trap composed of 8 places in 206 ms of which 1 ms to minimize.
[2023-03-22 15:38:16] [INFO ] Deduced a trap composed of 10 places in 120 ms of which 1 ms to minimize.
[2023-03-22 15:38:16] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 0 ms to minimize.
[2023-03-22 15:38:16] [INFO ] Deduced a trap composed of 16 places in 95 ms of which 0 ms to minimize.
[2023-03-22 15:38:17] [INFO ] Deduced a trap composed of 15 places in 280 ms of which 1 ms to minimize.
[2023-03-22 15:38:17] [INFO ] Deduced a trap composed of 16 places in 175 ms of which 3 ms to minimize.
[2023-03-22 15:38:17] [INFO ] Deduced a trap composed of 8 places in 109 ms of which 0 ms to minimize.
[2023-03-22 15:38:17] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1652 ms
[2023-03-22 15:38:17] [INFO ] Deduced a trap composed of 8 places in 131 ms of which 1 ms to minimize.
[2023-03-22 15:38:18] [INFO ] Deduced a trap composed of 8 places in 157 ms of which 1 ms to minimize.
[2023-03-22 15:38:18] [INFO ] Deduced a trap composed of 8 places in 77 ms of which 1 ms to minimize.
[2023-03-22 15:38:18] [INFO ] Deduced a trap composed of 6 places in 228 ms of which 0 ms to minimize.
[2023-03-22 15:38:18] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 0 ms to minimize.
[2023-03-22 15:38:18] [INFO ] Deduced a trap composed of 14 places in 112 ms of which 1 ms to minimize.
[2023-03-22 15:38:18] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 998 ms
[2023-03-22 15:38:18] [INFO ] After 5001ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 244 ms.
[2023-03-22 15:38:19] [INFO ] After 5666ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 87 ms.
Support contains 91 out of 392 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 352/352 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 392 transition count 346
Reduce places removed 6 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 10 rules applied. Total rules applied 16 place count 386 transition count 342
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 20 place count 382 transition count 342
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 17 Pre rules applied. Total rules applied 20 place count 382 transition count 325
Deduced a syphon composed of 17 places in 2 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 54 place count 365 transition count 325
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 57 place count 362 transition count 322
Iterating global reduction 3 with 3 rules applied. Total rules applied 60 place count 362 transition count 322
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 60 place count 362 transition count 321
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 62 place count 361 transition count 321
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 45
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 3 with 90 rules applied. Total rules applied 152 place count 316 transition count 276
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 160 place count 312 transition count 278
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 163 place count 312 transition count 275
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 166 place count 309 transition count 275
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 168 place count 309 transition count 275
Applied a total of 168 rules in 80 ms. Remains 309 /392 variables (removed 83) and now considering 275/352 (removed 77) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 309/392 places, 275/352 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 221678 steps, run timeout after 3001 ms. (steps per millisecond=73 ) properties seen :{}
Probabilistic random walk after 221678 steps, saw 131660 distinct states, run finished after 3003 ms. (steps per millisecond=73 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 275 rows 309 cols
[2023-03-22 15:38:22] [INFO ] Computed 91 place invariants in 2 ms
[2023-03-22 15:38:22] [INFO ] After 88ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-22 15:38:22] [INFO ] [Nat]Absence check using 91 positive place invariants in 22 ms returned sat
[2023-03-22 15:38:22] [INFO ] After 328ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-22 15:38:22] [INFO ] State equation strengthened by 28 read => feed constraints.
[2023-03-22 15:38:23] [INFO ] After 237ms SMT Verify possible using 28 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-22 15:38:23] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 0 ms to minimize.
[2023-03-22 15:38:23] [INFO ] Deduced a trap composed of 8 places in 77 ms of which 1 ms to minimize.
[2023-03-22 15:38:23] [INFO ] Deduced a trap composed of 7 places in 92 ms of which 0 ms to minimize.
[2023-03-22 15:38:23] [INFO ] Deduced a trap composed of 6 places in 56 ms of which 0 ms to minimize.
[2023-03-22 15:38:23] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 1 ms to minimize.
[2023-03-22 15:38:23] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 537 ms
[2023-03-22 15:38:24] [INFO ] Deduced a trap composed of 16 places in 107 ms of which 1 ms to minimize.
[2023-03-22 15:38:24] [INFO ] Deduced a trap composed of 12 places in 117 ms of which 0 ms to minimize.
[2023-03-22 15:38:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 309 ms
[2023-03-22 15:38:24] [INFO ] Deduced a trap composed of 7 places in 104 ms of which 0 ms to minimize.
[2023-03-22 15:38:24] [INFO ] Deduced a trap composed of 6 places in 76 ms of which 1 ms to minimize.
[2023-03-22 15:38:24] [INFO ] Deduced a trap composed of 5 places in 239 ms of which 0 ms to minimize.
[2023-03-22 15:38:24] [INFO ] Deduced a trap composed of 7 places in 84 ms of which 1 ms to minimize.
[2023-03-22 15:38:25] [INFO ] Deduced a trap composed of 6 places in 97 ms of which 1 ms to minimize.
[2023-03-22 15:38:25] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 1 ms to minimize.
[2023-03-22 15:38:25] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 849 ms
[2023-03-22 15:38:25] [INFO ] After 2173ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 243 ms.
[2023-03-22 15:38:25] [INFO ] After 2932ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 57 ms.
Support contains 91 out of 309 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 309/309 places, 275/275 transitions.
Applied a total of 0 rules in 17 ms. Remains 309 /309 variables (removed 0) and now considering 275/275 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 309/309 places, 275/275 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 309/309 places, 275/275 transitions.
Applied a total of 0 rules in 13 ms. Remains 309 /309 variables (removed 0) and now considering 275/275 (removed 0) transitions.
[2023-03-22 15:38:25] [INFO ] Invariant cache hit.
[2023-03-22 15:38:25] [INFO ] Implicit Places using invariants in 345 ms returned []
[2023-03-22 15:38:25] [INFO ] Invariant cache hit.
[2023-03-22 15:38:26] [INFO ] State equation strengthened by 28 read => feed constraints.
[2023-03-22 15:38:26] [INFO ] Implicit Places using invariants and state equation in 517 ms returned []
Implicit Place search using SMT with State Equation took 868 ms to find 0 implicit places.
[2023-03-22 15:38:26] [INFO ] Redundant transitions in 10 ms returned []
[2023-03-22 15:38:26] [INFO ] Invariant cache hit.
[2023-03-22 15:38:26] [INFO ] Dead Transitions using invariants and state equation in 334 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1251 ms. Remains : 309/309 places, 275/275 transitions.
Graph (complete) has 722 edges and 309 vertex of which 307 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 307 transition count 274
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 306 transition count 274
Partial Free-agglomeration rule applied 13 times.
Drop transitions removed 13 transitions
Iterating global reduction 0 with 13 rules applied. Total rules applied 16 place count 306 transition count 274
Applied a total of 16 rules in 32 ms. Remains 306 /309 variables (removed 3) and now considering 274/275 (removed 1) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 274 rows 306 cols
[2023-03-22 15:38:26] [INFO ] Computed 89 place invariants in 1 ms
[2023-03-22 15:38:26] [INFO ] After 142ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-22 15:38:27] [INFO ] [Nat]Absence check using 89 positive place invariants in 11 ms returned sat
[2023-03-22 15:38:27] [INFO ] After 229ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-22 15:38:27] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-22 15:38:27] [INFO ] After 142ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-22 15:38:27] [INFO ] Deduced a trap composed of 5 places in 99 ms of which 1 ms to minimize.
[2023-03-22 15:38:27] [INFO ] Deduced a trap composed of 7 places in 88 ms of which 0 ms to minimize.
[2023-03-22 15:38:27] [INFO ] Deduced a trap composed of 7 places in 89 ms of which 1 ms to minimize.
[2023-03-22 15:38:28] [INFO ] Deduced a trap composed of 10 places in 78 ms of which 1 ms to minimize.
[2023-03-22 15:38:28] [INFO ] Deduced a trap composed of 6 places in 83 ms of which 1 ms to minimize.
[2023-03-22 15:38:28] [INFO ] Deduced a trap composed of 7 places in 68 ms of which 0 ms to minimize.
[2023-03-22 15:38:28] [INFO ] Deduced a trap composed of 6 places in 97 ms of which 26 ms to minimize.
[2023-03-22 15:38:28] [INFO ] Deduced a trap composed of 6 places in 72 ms of which 1 ms to minimize.
[2023-03-22 15:38:28] [INFO ] Deduced a trap composed of 8 places in 66 ms of which 0 ms to minimize.
[2023-03-22 15:38:28] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1060 ms
[2023-03-22 15:38:28] [INFO ] Deduced a trap composed of 11 places in 151 ms of which 1 ms to minimize.
[2023-03-22 15:38:28] [INFO ] Deduced a trap composed of 13 places in 120 ms of which 1 ms to minimize.
[2023-03-22 15:38:29] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 0 ms to minimize.
[2023-03-22 15:38:29] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 413 ms
[2023-03-22 15:38:29] [INFO ] Deduced a trap composed of 6 places in 101 ms of which 0 ms to minimize.
[2023-03-22 15:38:29] [INFO ] Deduced a trap composed of 6 places in 75 ms of which 1 ms to minimize.
[2023-03-22 15:38:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 238 ms
[2023-03-22 15:38:29] [INFO ] After 2127ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 194 ms.
[2023-03-22 15:38:29] [INFO ] After 2675ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2023-03-22 15:38:29] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 7 ms.
[2023-03-22 15:38:29] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 309 places, 275 transitions and 988 arcs took 3 ms.
[2023-03-22 15:38:29] [INFO ] Flatten gal took : 69 ms
Total runtime 39964 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=ReachabilityFireability.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: ShieldIIPt_PT_010B
(NrP: 309 NrTr: 275 NrArc: 988)

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

net check time: 0m 0.000sec

init dd package: 0m 2.947sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393236 kB
MemFree: 6225756 kB
After kill :
MemTotal: 16393236 kB
MemFree: 16096464 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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:
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
+ 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
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

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="ShieldIIPt-PT-010B"
export BK_EXAMINATION="ReachabilityFireability"
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 ShieldIIPt-PT-010B, 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 r394-oct2-167903717700271"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPt-PT-010B.tgz
mv ShieldIIPt-PT-010B 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 ;