Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r560-tall-171734905800133.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is FireWire-PT-06, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r560-tall-171734905800133
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 6.8K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 9.9K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 90K Jun 2 16:33 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME StableMarking

=== Now, execution of the tool begins

BK_START 1717351670142

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=FireWire-PT-06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-02 18:07:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2024-06-02 18:07:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:07:51] [INFO ] Load time of PNML (sax parser for PT used): 74 ms
[2024-06-02 18:07:51] [INFO ] Transformed 116 places.
[2024-06-02 18:07:51] [INFO ] Transformed 368 transitions.
[2024-06-02 18:07:51] [INFO ] Found NUPN structural information;
[2024-06-02 18:07:51] [INFO ] Parsed PT model containing 116 places and 368 transitions and 1362 arcs in 169 ms.
Structural test allowed to assert that 11 places are NOT stable. Took 6 ms.
Ensure Unique test removed 56 transitions
Reduce redundant transitions removed 56 transitions.
RANDOM walk for 40000 steps (2054 resets) in 1966 ms. (20 steps per ms) remains 44/105 properties
BEST_FIRST walk for 4004 steps (53 resets) in 36 ms. (108 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (60 resets) in 63 ms. (62 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (42 resets) in 25 ms. (154 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (62 resets) in 15 ms. (250 steps per ms) remains 41/44 properties
BEST_FIRST walk for 4004 steps (46 resets) in 16 ms. (235 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (47 resets) in 33 ms. (117 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (62 resets) in 17 ms. (222 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (53 resets) in 16 ms. (235 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (67 resets) in 12 ms. (308 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (57 resets) in 13 ms. (285 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (49 resets) in 14 ms. (266 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (53 resets) in 17 ms. (222 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (47 resets) in 13 ms. (286 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (60 resets) in 30 ms. (129 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (45 resets) in 14 ms. (266 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (48 resets) in 15 ms. (250 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (55 resets) in 33 ms. (117 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (44 resets) in 16 ms. (235 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4001 steps (55 resets) in 19 ms. (200 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (49 resets) in 19 ms. (200 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (52 resets) in 10 ms. (363 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (47 resets) in 20 ms. (190 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (55 resets) in 21 ms. (181 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (39 resets) in 16 ms. (235 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (50 resets) in 14 ms. (266 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (48 resets) in 17 ms. (222 steps per ms) remains 40/41 properties
BEST_FIRST walk for 4003 steps (42 resets) in 10 ms. (363 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (55 resets) in 26 ms. (148 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (40 resets) in 11 ms. (333 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (50 resets) in 18 ms. (210 steps per ms) remains 37/40 properties
BEST_FIRST walk for 4002 steps (53 resets) in 27 ms. (142 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (57 resets) in 17 ms. (222 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (52 resets) in 10 ms. (363 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (48 resets) in 21 ms. (181 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (52 resets) in 17 ms. (222 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (46 resets) in 10 ms. (364 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4001 steps (52 resets) in 15 ms. (250 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (51 resets) in 10 ms. (363 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (53 resets) in 23 ms. (166 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4001 steps (41 resets) in 20 ms. (190 steps per ms) remains 37/37 properties
[2024-06-02 18:07:52] [INFO ] Flow matrix only has 280 transitions (discarded 32 similar events)
// Phase 1: matrix 280 rows 116 cols
[2024-06-02 18:07:52] [INFO ] Computed 9 invariants in 14 ms
[2024-06-02 18:07:52] [INFO ] State equation strengthened by 41 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 2 (OVERLAPS) 68/105 variables, 5/42 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 68/110 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 5 (OVERLAPS) 11/116 variables, 4/114 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 11/125 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/116 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 8 (OVERLAPS) 279/395 variables, 116/241 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/395 variables, 40/281 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/395 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 11 (OVERLAPS) 1/396 variables, 1/282 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/396 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 13 (OVERLAPS) 0/396 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 37 unsolved
No progress, stopping.
After SMT solving in domain Real declared 396/396 variables, and 282 constraints, problems are : Problem set: 0 solved, 37 unsolved in 1329 ms.
Refiners :[Domain max(s): 116/116 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 116/116 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 37/37 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 37 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 2 (OVERLAPS) 68/105 variables, 5/42 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 68/110 constraints. Problems are: Problem set: 0 solved, 37 unsolved
[2024-06-02 18:07:54] [INFO ] Deduced a trap composed of 13 places in 90 ms of which 12 ms to minimize.
[2024-06-02 18:07:54] [INFO ] Deduced a trap composed of 38 places in 64 ms of which 2 ms to minimize.
[2024-06-02 18:07:54] [INFO ] Deduced a trap composed of 37 places in 53 ms of which 1 ms to minimize.
[2024-06-02 18:07:54] [INFO ] Deduced a trap composed of 76 places in 51 ms of which 1 ms to minimize.
[2024-06-02 18:07:54] [INFO ] Deduced a trap composed of 69 places in 60 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 5/115 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 6 (OVERLAPS) 11/116 variables, 4/119 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/116 variables, 11/130 constraints. Problems are: Problem set: 0 solved, 37 unsolved
[2024-06-02 18:07:54] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/116 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 37 unsolved
[2024-06-02 18:07:55] [INFO ] Deduced a trap composed of 70 places in 61 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/116 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/116 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 11 (OVERLAPS) 279/395 variables, 116/248 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/395 variables, 40/288 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/395 variables, 37/325 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/395 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 15 (OVERLAPS) 1/396 variables, 1/326 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/396 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 17 (OVERLAPS) 0/396 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 37 unsolved
No progress, stopping.
After SMT solving in domain Int declared 396/396 variables, and 326 constraints, problems are : Problem set: 0 solved, 37 unsolved in 3084 ms.
Refiners :[Domain max(s): 116/116 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 116/116 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 37/37 constraints, Known Traps: 7/7 constraints]
After SMT, in 4498ms problems are : Problem set: 0 solved, 37 unsolved
Fused 37 Parikh solutions to 36 different solutions.
Parikh walk visited 0 properties in 3094 ms.
Support contains 37 out of 116 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 116/116 places, 312/312 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 116 transition count 309
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 3 place count 116 transition count 308
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 115 transition count 308
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 114 transition count 307
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 11 place count 112 transition count 311
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 15 place count 112 transition count 307
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 2 with 8 rules applied. Total rules applied 23 place count 112 transition count 299
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 24 place count 112 transition count 301
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 27 place count 111 transition count 299
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 29 place count 111 transition count 297
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 31 place count 111 transition count 297
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 32 place count 110 transition count 296
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 33 place count 109 transition count 296
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 33 place count 109 transition count 295
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 35 place count 108 transition count 295
Applied a total of 35 rules in 107 ms. Remains 108 /116 variables (removed 8) and now considering 295/312 (removed 17) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 118 ms. Remains : 108/116 places, 295/312 transitions.
RANDOM walk for 4000000 steps (244560 resets) in 17999 ms. (222 steps per ms) remains 14/37 properties
BEST_FIRST walk for 4000004 steps (60037 resets) in 3722 ms. (1074 steps per ms) remains 13/14 properties
BEST_FIRST walk for 4000001 steps (60553 resets) in 3851 ms. (1038 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4000004 steps (60533 resets) in 5253 ms. (761 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4000003 steps (60624 resets) in 6545 ms. (611 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4000002 steps (60659 resets) in 3679 ms. (1086 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4000003 steps (60095 resets) in 3573 ms. (1119 steps per ms) remains 12/13 properties
BEST_FIRST walk for 4000002 steps (60865 resets) in 3431 ms. (1165 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4000003 steps (60689 resets) in 3627 ms. (1102 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4000004 steps (60210 resets) in 3536 ms. (1130 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4000002 steps (60549 resets) in 3415 ms. (1170 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4000004 steps (60938 resets) in 3499 ms. (1142 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4000003 steps (60265 resets) in 3618 ms. (1105 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4000003 steps (60340 resets) in 3626 ms. (1102 steps per ms) remains 12/12 properties
[2024-06-02 18:08:21] [INFO ] Flow matrix only has 268 transitions (discarded 27 similar events)
// Phase 1: matrix 268 rows 108 cols
[2024-06-02 18:08:21] [INFO ] Computed 8 invariants in 3 ms
[2024-06-02 18:08:21] [INFO ] State equation strengthened by 40 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 55/67 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 55/70 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 190/257 variables, 67/137 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/257 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 71/328 variables, 16/153 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/328 variables, 16/169 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/328 variables, 2/171 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/328 variables, 28/199 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/328 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (OVERLAPS) 1/329 variables, 1/200 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/329 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/329 variables, 1/202 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/329 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 16 (OVERLAPS) 45/374 variables, 22/224 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/374 variables, 22/246 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/374 variables, 1/247 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/374 variables, 12/259 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/374 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 21 (OVERLAPS) 2/376 variables, 2/261 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/376 variables, 2/263 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/376 variables, 1/264 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/376 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 25 (OVERLAPS) 0/376 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 376/376 variables, and 264 constraints, problems are : Problem set: 0 solved, 12 unsolved in 462 ms.
Refiners :[Domain max(s): 108/108 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 108/108 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 55/67 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 55/70 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-06-02 18:08:21] [INFO ] Deduced a trap composed of 35 places in 25 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 190/257 variables, 67/138 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/257 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 71/328 variables, 16/154 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/328 variables, 16/170 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/328 variables, 2/172 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/328 variables, 28/200 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/328 variables, 12/212 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-06-02 18:08:21] [INFO ] Deduced a trap composed of 41 places in 40 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/328 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/328 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 15 (OVERLAPS) 1/329 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/329 variables, 1/215 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/329 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/329 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 19 (OVERLAPS) 45/374 variables, 22/238 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/374 variables, 22/260 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/374 variables, 1/261 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/374 variables, 12/273 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/374 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 24 (OVERLAPS) 2/376 variables, 2/275 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/376 variables, 2/277 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/376 variables, 1/278 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/376 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 28 (OVERLAPS) 0/376 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 376/376 variables, and 278 constraints, problems are : Problem set: 0 solved, 12 unsolved in 1007 ms.
Refiners :[Domain max(s): 108/108 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 108/108 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 2/2 constraints]
After SMT, in 1488ms problems are : Problem set: 0 solved, 12 unsolved
Parikh walk visited 0 properties in 3704 ms.
Support contains 12 out of 108 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 108/108 places, 295/295 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 108 transition count 294
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 2 place count 107 transition count 294
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 106 transition count 292
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 106 transition count 292
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 105 transition count 297
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 105 transition count 295
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 105 transition count 294
Applied a total of 9 rules in 35 ms. Remains 105 /108 variables (removed 3) and now considering 294/295 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 105/108 places, 294/295 transitions.
RANDOM walk for 4000000 steps (244155 resets) in 12719 ms. (314 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4000002 steps (60113 resets) in 3650 ms. (1095 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4000004 steps (59927 resets) in 3654 ms. (1094 steps per ms) remains 11/12 properties
BEST_FIRST walk for 4000004 steps (60070 resets) in 3442 ms. (1161 steps per ms) remains 11/11 properties
BEST_FIRST walk for 4000004 steps (60567 resets) in 3431 ms. (1165 steps per ms) remains 11/11 properties
BEST_FIRST walk for 4000003 steps (60493 resets) in 3385 ms. (1181 steps per ms) remains 11/11 properties
BEST_FIRST walk for 4000003 steps (60934 resets) in 3463 ms. (1154 steps per ms) remains 11/11 properties
BEST_FIRST walk for 4000002 steps (60413 resets) in 3401 ms. (1175 steps per ms) remains 11/11 properties
BEST_FIRST walk for 4000002 steps (60676 resets) in 3417 ms. (1170 steps per ms) remains 11/11 properties
BEST_FIRST walk for 4000003 steps (60671 resets) in 3352 ms. (1192 steps per ms) remains 11/11 properties
BEST_FIRST walk for 4000003 steps (60345 resets) in 3410 ms. (1172 steps per ms) remains 11/11 properties
BEST_FIRST walk for 4000004 steps (60968 resets) in 5251 ms. (761 steps per ms) remains 7/11 properties
[2024-06-02 18:08:43] [INFO ] Flow matrix only has 265 transitions (discarded 29 similar events)
// Phase 1: matrix 265 rows 105 cols
[2024-06-02 18:08:43] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 18:08:43] [INFO ] State equation strengthened by 40 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 35/42 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 120/162 variables, 42/44 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 113/275 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/275 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/275 variables, 18/77 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/275 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 1/276 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/276 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/276 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 90/366 variables, 44/123 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/366 variables, 2/125 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/366 variables, 22/147 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/366 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (OVERLAPS) 4/370 variables, 4/151 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/370 variables, 2/153 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/370 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 19 (OVERLAPS) 0/370 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 370/370 variables, and 153 constraints, problems are : Problem set: 0 solved, 7 unsolved in 277 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 105/105 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 35/42 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-02 18:08:43] [INFO ] Deduced a trap composed of 32 places in 31 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 120/162 variables, 42/45 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 113/275 variables, 14/59 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/275 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/275 variables, 18/78 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/275 variables, 7/85 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/275 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 1/276 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/276 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/276 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (OVERLAPS) 90/366 variables, 44/131 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/366 variables, 2/133 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/366 variables, 22/155 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/366 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (OVERLAPS) 4/370 variables, 4/159 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/370 variables, 2/161 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/370 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 21 (OVERLAPS) 0/370 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 370/370 variables, and 161 constraints, problems are : Problem set: 0 solved, 7 unsolved in 480 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 105/105 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 1/1 constraints]
After SMT, in 776ms problems are : Problem set: 0 solved, 7 unsolved
Parikh walk visited 0 properties in 1900 ms.
Support contains 7 out of 105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 294/294 transitions.
Applied a total of 0 rules in 7 ms. Remains 105 /105 variables (removed 0) and now considering 294/294 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 105/105 places, 294/294 transitions.
RANDOM walk for 4000000 steps (243905 resets) in 9687 ms. (412 steps per ms) remains 7/7 properties
BEST_FIRST walk for 4000002 steps (60186 resets) in 2827 ms. (1414 steps per ms) remains 7/7 properties
BEST_FIRST walk for 4000004 steps (60334 resets) in 2884 ms. (1386 steps per ms) remains 7/7 properties
BEST_FIRST walk for 4000004 steps (60278 resets) in 2857 ms. (1399 steps per ms) remains 7/7 properties
BEST_FIRST walk for 4000003 steps (60191 resets) in 2698 ms. (1482 steps per ms) remains 7/7 properties
BEST_FIRST walk for 4000004 steps (60189 resets) in 2872 ms. (1392 steps per ms) remains 7/7 properties
BEST_FIRST walk for 4000004 steps (60319 resets) in 2743 ms. (1457 steps per ms) remains 7/7 properties
BEST_FIRST walk for 4000002 steps (60238 resets) in 2762 ms. (1447 steps per ms) remains 7/7 properties
Finished probabilistic random walk after 114703 steps, run visited all 7 properties in 239 ms. (steps per millisecond=479 )
Probabilistic random walk after 114703 steps, saw 29597 distinct states, run finished after 243 ms. (steps per millisecond=472 ) properties seen :7
Able to resolve query StableMarking after proving 106 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PROBABILISTIC_WALK MARKED_SUFFIX_TEST BESTFIRST_WALK TOPOLOGICAL
Total runtime 64480 ms.
ITS solved all properties within timeout

BK_STOP 1717351735814

--------------------
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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination StableMarking -timeout 180 -rebuildPNML

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="FireWire-PT-06"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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-5568"
echo " Executing tool greatspnxred"
echo " Input is FireWire-PT-06, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r560-tall-171734905800133"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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