Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r112-smll-174867016500388.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool gold2024
Input is HealthRecord-PT-11, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r112-smll-174867016500388
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 8.0K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 31K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.4K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 70K May 29 14:32 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 1748771621859

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=HealthRecord-PT-11
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-06-01 09:53:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2025-06-01 09:53:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 09:53:44] [INFO ] Load time of PNML (sax parser for PT used): 192 ms
[2025-06-01 09:53:44] [INFO ] Transformed 159 places.
[2025-06-01 09:53:44] [INFO ] Transformed 334 transitions.
[2025-06-01 09:53:44] [INFO ] Found NUPN structural information;
[2025-06-01 09:53:44] [INFO ] Parsed PT model containing 159 places and 334 transitions and 879 arcs in 564 ms.
Graph (trivial) has 270 edges and 159 vertex of which 10 / 159 are part of one of the 5 SCC in 8 ms
Free SCC test removed 5 places
Structural test allowed to assert that 30 places are NOT stable. Took 46 ms.
Ensure Unique test removed 32 transitions
Reduce redundant transitions removed 32 transitions.
RANDOM walk for 40000 steps (3380 resets) in 2971 ms. (13 steps per ms) remains 63/129 properties
BEST_FIRST walk for 4003 steps (44 resets) in 37 ms. (105 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4004 steps (44 resets) in 30 ms. (129 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4004 steps (42 resets) in 31 ms. (125 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4003 steps (42 resets) in 45 ms. (87 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4004 steps (43 resets) in 36 ms. (108 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4004 steps (42 resets) in 42 ms. (93 steps per ms) remains 61/63 properties
BEST_FIRST walk for 4002 steps (41 resets) in 38 ms. (102 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (46 resets) in 30 ms. (129 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (45 resets) in 25 ms. (154 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (42 resets) in 39 ms. (100 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (47 resets) in 54 ms. (72 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (41 resets) in 31 ms. (125 steps per ms) remains 60/61 properties
BEST_FIRST walk for 4003 steps (43 resets) in 35 ms. (111 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (41 resets) in 29 ms. (133 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (45 resets) in 30 ms. (129 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4002 steps (45 resets) in 14 ms. (266 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (44 resets) in 12 ms. (307 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (44 resets) in 12 ms. (308 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (44 resets) in 14 ms. (266 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (42 resets) in 13 ms. (286 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (41 resets) in 17 ms. (222 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4002 steps (42 resets) in 13 ms. (285 steps per ms) remains 59/60 properties
BEST_FIRST walk for 4004 steps (40 resets) in 23 ms. (166 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (41 resets) in 32 ms. (121 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (42 resets) in 17 ms. (222 steps per ms) remains 58/59 properties
BEST_FIRST walk for 4003 steps (42 resets) in 10 ms. (363 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (43 resets) in 10 ms. (364 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (43 resets) in 10 ms. (364 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (43 resets) in 10 ms. (364 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (41 resets) in 15 ms. (250 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (46 resets) in 24 ms. (160 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (44 resets) in 12 ms. (307 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (45 resets) in 10 ms. (363 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (42 resets) in 20 ms. (190 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (46 resets) in 24 ms. (160 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (42 resets) in 23 ms. (166 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (40 resets) in 25 ms. (153 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (46 resets) in 23 ms. (166 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (42 resets) in 11 ms. (333 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (45 resets) in 15 ms. (250 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (45 resets) in 10 ms. (364 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (43 resets) in 10 ms. (363 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (40 resets) in 17 ms. (222 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (45 resets) in 22 ms. (174 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4002 steps (45 resets) in 17 ms. (222 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (44 resets) in 11 ms. (333 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (41 resets) in 9 ms. (400 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (44 resets) in 16 ms. (235 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (42 resets) in 9 ms. (400 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (43 resets) in 12 ms. (308 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (42 resets) in 15 ms. (250 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (44 resets) in 13 ms. (285 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (45 resets) in 18 ms. (210 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (41 resets) in 29 ms. (133 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (41 resets) in 9 ms. (400 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (44 resets) in 16 ms. (235 steps per ms) remains 56/58 properties
BEST_FIRST walk for 4004 steps (42 resets) in 19 ms. (200 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (44 resets) in 9 ms. (400 steps per ms) remains 55/56 properties
BEST_FIRST walk for 4002 steps (41 resets) in 16 ms. (235 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (43 resets) in 30 ms. (129 steps per ms) remains 55/55 properties
[2025-06-01 09:53:46] [INFO ] Flow matrix only has 285 transitions (discarded 17 similar events)
// Phase 1: matrix 285 rows 154 cols
[2025-06-01 09:53:46] [INFO ] Computed 18 invariants in 13 ms
[2025-06-01 09:53:46] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/55 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 2 (OVERLAPS) 41/96 variables, 10/65 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 41/106 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 5 (OVERLAPS) 58/154 variables, 8/114 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 58/172 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/154 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 8 (OVERLAPS) 284/438 variables, 154/326 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/438 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 10 (OVERLAPS) 1/439 variables, 1/327 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/439 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 12 (OVERLAPS) 0/439 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 55 unsolved
No progress, stopping.
After SMT solving in domain Real declared 439/439 variables, and 327 constraints, problems are : Problem set: 0 solved, 55 unsolved in 4026 ms.
Refiners :[Domain max(s): 154/154 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 154/154 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 55/55 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 55 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/55 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 2 (OVERLAPS) 41/96 variables, 10/65 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 41/106 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2025-06-01 09:53:51] [INFO ] Deduced a trap composed of 25 places in 138 ms of which 22 ms to minimize.
[2025-06-01 09:53:51] [INFO ] Deduced a trap composed of 44 places in 97 ms of which 3 ms to minimize.
[2025-06-01 09:53:51] [INFO ] Deduced a trap composed of 40 places in 95 ms of which 3 ms to minimize.
[2025-06-01 09:53:51] [INFO ] Deduced a trap composed of 44 places in 92 ms of which 2 ms to minimize.
[2025-06-01 09:53:51] [INFO ] Deduced a trap composed of 44 places in 92 ms of which 2 ms to minimize.
[2025-06-01 09:53:52] [INFO ] Deduced a trap composed of 38 places in 92 ms of which 2 ms to minimize.
[2025-06-01 09:53:52] [INFO ] Deduced a trap composed of 40 places in 107 ms of which 2 ms to minimize.
[2025-06-01 09:53:52] [INFO ] Deduced a trap composed of 39 places in 105 ms of which 3 ms to minimize.
[2025-06-01 09:53:52] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
[2025-06-01 09:53:52] [INFO ] Deduced a trap composed of 40 places in 131 ms of which 2 ms to minimize.
[2025-06-01 09:53:52] [INFO ] Deduced a trap composed of 40 places in 115 ms of which 2 ms to minimize.
[2025-06-01 09:53:52] [INFO ] Deduced a trap composed of 40 places in 102 ms of which 2 ms to minimize.
[2025-06-01 09:53:52] [INFO ] Deduced a trap composed of 40 places in 112 ms of which 2 ms to minimize.
[2025-06-01 09:53:52] [INFO ] Deduced a trap composed of 40 places in 100 ms of which 2 ms to minimize.
[2025-06-01 09:53:53] [INFO ] Deduced a trap composed of 39 places in 86 ms of which 2 ms to minimize.
[2025-06-01 09:53:53] [INFO ] Deduced a trap composed of 40 places in 102 ms of which 2 ms to minimize.
[2025-06-01 09:53:53] [INFO ] Deduced a trap composed of 39 places in 96 ms of which 3 ms to minimize.
[2025-06-01 09:53:53] [INFO ] Deduced a trap composed of 41 places in 66 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 18/124 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2025-06-01 09:53:53] [INFO ] Deduced a trap composed of 41 places in 91 ms of which 2 ms to minimize.
[2025-06-01 09:53:53] [INFO ] Deduced a trap composed of 39 places in 93 ms of which 2 ms to minimize.
[2025-06-01 09:53:53] [INFO ] Deduced a trap composed of 41 places in 86 ms of which 2 ms to minimize.
[2025-06-01 09:53:54] [INFO ] Deduced a trap composed of 40 places in 79 ms of which 2 ms to minimize.
[2025-06-01 09:53:54] [INFO ] Deduced a trap composed of 40 places in 87 ms of which 2 ms to minimize.
[2025-06-01 09:53:54] [INFO ] Deduced a trap composed of 40 places in 91 ms of which 2 ms to minimize.
[2025-06-01 09:53:54] [INFO ] Deduced a trap composed of 38 places in 73 ms of which 1 ms to minimize.
[2025-06-01 09:53:54] [INFO ] Deduced a trap composed of 39 places in 77 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/96 variables, 8/132 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2025-06-01 09:53:54] [INFO ] Deduced a trap composed of 43 places in 69 ms of which 2 ms to minimize.
[2025-06-01 09:53:54] [INFO ] Deduced a trap composed of 43 places in 65 ms of which 1 ms to minimize.
[2025-06-01 09:53:54] [INFO ] Deduced a trap composed of 44 places in 66 ms of which 2 ms to minimize.
[2025-06-01 09:53:54] [INFO ] Deduced a trap composed of 43 places in 66 ms of which 2 ms to minimize.
[2025-06-01 09:53:54] [INFO ] Deduced a trap composed of 42 places in 72 ms of which 2 ms to minimize.
[2025-06-01 09:53:54] [INFO ] Deduced a trap composed of 47 places in 62 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/96 variables, 6/138 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2025-06-01 09:53:55] [INFO ] Deduced a trap composed of 38 places in 59 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/96 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2025-06-01 09:53:55] [INFO ] Deduced a trap composed of 41 places in 54 ms of which 1 ms to minimize.
[2025-06-01 09:53:55] [INFO ] Deduced a trap composed of 40 places in 65 ms of which 9 ms to minimize.
SMT process timed out in 9182ms, After SMT, problems are : Problem set: 0 solved, 55 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 55 out of 154 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 154/154 places, 302/302 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 154 transition count 282
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 24 place count 152 transition count 280
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 24 place count 152 transition count 278
Deduced a syphon composed of 2 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 29 place count 149 transition count 278
Discarding 48 places :
Symmetric choice reduction at 2 with 48 rule applications. Total rules 77 place count 101 transition count 182
Iterating global reduction 2 with 48 rules applied. Total rules applied 125 place count 101 transition count 182
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 130 place count 96 transition count 172
Iterating global reduction 2 with 5 rules applied. Total rules applied 135 place count 96 transition count 172
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 143 place count 96 transition count 164
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -33
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 157 place count 89 transition count 197
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 162 place count 89 transition count 192
Applied a total of 162 rules in 73 ms. Remains 89 /154 variables (removed 65) and now considering 192/302 (removed 110) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 102 ms. Remains : 89/154 places, 192/302 transitions.
RANDOM walk for 4000000 steps (926551 resets) in 34249 ms. (116 steps per ms) remains 34/55 properties
BEST_FIRST walk for 400003 steps (12853 resets) in 432 ms. (923 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400004 steps (12996 resets) in 587 ms. (680 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400003 steps (12969 resets) in 682 ms. (585 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400004 steps (12959 resets) in 650 ms. (614 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400004 steps (13043 resets) in 426 ms. (936 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400004 steps (12974 resets) in 428 ms. (932 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400002 steps (12945 resets) in 422 ms. (945 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400001 steps (12960 resets) in 424 ms. (941 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400003 steps (13016 resets) in 429 ms. (930 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400003 steps (12994 resets) in 443 ms. (900 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400002 steps (13016 resets) in 430 ms. (928 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400004 steps (12938 resets) in 433 ms. (921 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400003 steps (12876 resets) in 425 ms. (938 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400004 steps (13002 resets) in 428 ms. (932 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400003 steps (12938 resets) in 431 ms. (925 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400004 steps (12950 resets) in 425 ms. (938 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400004 steps (13039 resets) in 478 ms. (835 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400002 steps (12965 resets) in 545 ms. (732 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400004 steps (13034 resets) in 561 ms. (711 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400002 steps (13003 resets) in 427 ms. (934 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400004 steps (13054 resets) in 483 ms. (826 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400004 steps (12950 resets) in 428 ms. (932 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400003 steps (12973 resets) in 427 ms. (934 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400003 steps (12973 resets) in 444 ms. (898 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400004 steps (12924 resets) in 420 ms. (950 steps per ms) remains 30/34 properties
BEST_FIRST walk for 400004 steps (13017 resets) in 404 ms. (987 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400002 steps (12928 resets) in 402 ms. (992 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400003 steps (12947 resets) in 403 ms. (990 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400004 steps (12951 resets) in 417 ms. (956 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400003 steps (12953 resets) in 398 ms. (1002 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400004 steps (13028 resets) in 398 ms. (1002 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400004 steps (12945 resets) in 403 ms. (990 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400004 steps (12961 resets) in 416 ms. (959 steps per ms) remains 30/30 properties
[2025-06-01 09:54:10] [INFO ] Flow matrix only has 177 transitions (discarded 15 similar events)
// Phase 1: matrix 177 rows 89 cols
[2025-06-01 09:54:10] [INFO ] Computed 17 invariants in 4 ms
[2025-06-01 09:54:10] [INFO ] State equation strengthened by 13 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 35/65 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (OVERLAPS) 24/89 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (OVERLAPS) 177/266 variables, 89/106 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/266 variables, 13/119 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/266 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 8 (OVERLAPS) 0/266 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Real declared 266/266 variables, and 119 constraints, problems are : Problem set: 0 solved, 30 unsolved in 1060 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 89/89 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 30 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 35/65 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 30 unsolved
[2025-06-01 09:54:12] [INFO ] Deduced a trap composed of 20 places in 83 ms of which 2 ms to minimize.
[2025-06-01 09:54:12] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 1 ms to minimize.
[2025-06-01 09:54:12] [INFO ] Deduced a trap composed of 20 places in 78 ms of which 2 ms to minimize.
[2025-06-01 09:54:12] [INFO ] Deduced a trap composed of 21 places in 76 ms of which 2 ms to minimize.
[2025-06-01 09:54:12] [INFO ] Deduced a trap composed of 30 places in 68 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 30 unsolved
[2025-06-01 09:54:12] [INFO ] Deduced a trap composed of 21 places in 73 ms of which 1 ms to minimize.
[2025-06-01 09:54:12] [INFO ] Deduced a trap composed of 20 places in 86 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 30 unsolved
[2025-06-01 09:54:13] [INFO ] Deduced a trap composed of 20 places in 79 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (OVERLAPS) 24/89 variables, 7/25 constraints. Problems are: Problem set: 0 solved, 30 unsolved
[2025-06-01 09:54:13] [INFO ] Deduced a trap composed of 28 places in 106 ms of which 2 ms to minimize.
[2025-06-01 09:54:13] [INFO ] Deduced a trap composed of 29 places in 83 ms of which 2 ms to minimize.
[2025-06-01 09:54:13] [INFO ] Deduced a trap composed of 29 places in 99 ms of which 2 ms to minimize.
[2025-06-01 09:54:13] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 2 ms to minimize.
[2025-06-01 09:54:13] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 2 ms to minimize.
[2025-06-01 09:54:13] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 2 ms to minimize.
[2025-06-01 09:54:13] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 1 ms to minimize.
[2025-06-01 09:54:13] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 2 ms to minimize.
[2025-06-01 09:54:14] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2025-06-01 09:54:14] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
[2025-06-01 09:54:14] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2025-06-01 09:54:14] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2025-06-01 09:54:14] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2025-06-01 09:54:14] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 13 ms to minimize.
[2025-06-01 09:54:14] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2025-06-01 09:54:14] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 2 ms to minimize.
[2025-06-01 09:54:14] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2025-06-01 09:54:14] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2025-06-01 09:54:14] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2025-06-01 09:54:14] [INFO ] Deduced a trap composed of 31 places in 53 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/89 variables, 20/45 constraints. Problems are: Problem set: 0 solved, 30 unsolved
[2025-06-01 09:54:14] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 2 ms to minimize.
[2025-06-01 09:54:14] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 2 ms to minimize.
[2025-06-01 09:54:14] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 2 ms to minimize.
[2025-06-01 09:54:14] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 1 ms to minimize.
[2025-06-01 09:54:14] [INFO ] Deduced a trap composed of 25 places in 58 ms of which 1 ms to minimize.
[2025-06-01 09:54:14] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2025-06-01 09:54:14] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 1 ms to minimize.
[2025-06-01 09:54:14] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 1 ms to minimize.
[2025-06-01 09:54:15] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 1 ms to minimize.
[2025-06-01 09:54:15] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 2 ms to minimize.
[2025-06-01 09:54:15] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 2 ms to minimize.
[2025-06-01 09:54:15] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 1 ms to minimize.
[2025-06-01 09:54:15] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 2 ms to minimize.
[2025-06-01 09:54:15] [INFO ] Deduced a trap composed of 25 places in 58 ms of which 1 ms to minimize.
[2025-06-01 09:54:15] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 2 ms to minimize.
[2025-06-01 09:54:15] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 1 ms to minimize.
[2025-06-01 09:54:15] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 1 ms to minimize.
[2025-06-01 09:54:15] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 1 ms to minimize.
[2025-06-01 09:54:15] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/89 variables, 19/64 constraints. Problems are: Problem set: 0 solved, 30 unsolved
[2025-06-01 09:54:15] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2025-06-01 09:54:15] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
[2025-06-01 09:54:15] [INFO ] Deduced a trap composed of 28 places in 63 ms of which 1 ms to minimize.
[2025-06-01 09:54:15] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2025-06-01 09:54:15] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 0 ms to minimize.
[2025-06-01 09:54:15] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
[2025-06-01 09:54:16] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2025-06-01 09:54:16] [INFO ] Deduced a trap composed of 28 places in 72 ms of which 1 ms to minimize.
[2025-06-01 09:54:16] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 1 ms to minimize.
[2025-06-01 09:54:16] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/89 variables, 10/74 constraints. Problems are: Problem set: 0 solved, 30 unsolved
[2025-06-01 09:54:16] [INFO ] Deduced a trap composed of 28 places in 54 ms of which 1 ms to minimize.
[2025-06-01 09:54:16] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 1 ms to minimize.
[2025-06-01 09:54:16] [INFO ] Deduced a trap composed of 29 places in 72 ms of which 1 ms to minimize.
[2025-06-01 09:54:16] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/89 variables, 4/78 constraints. Problems are: Problem set: 0 solved, 30 unsolved
[2025-06-01 09:54:16] [INFO ] Deduced a trap composed of 28 places in 49 ms of which 1 ms to minimize.
[2025-06-01 09:54:16] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/89 variables, 2/80 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/89 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 13 (OVERLAPS) 177/266 variables, 89/169 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/266 variables, 13/182 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/266 variables, 30/212 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/266 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 17 (OVERLAPS) 0/266 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Int declared 266/266 variables, and 212 constraints, problems are : Problem set: 0 solved, 30 unsolved in 6121 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 89/89 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 63/63 constraints]
After SMT, in 7206ms problems are : Problem set: 0 solved, 30 unsolved
Fused 30 Parikh solutions to 14 different solutions.
Parikh walk visited 27 properties in 1141 ms.
Support contains 3 out of 89 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 89/89 places, 192/192 transitions.
Graph (complete) has 447 edges and 89 vertex of which 80 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 80 transition count 188
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 76 transition count 187
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 38 place count 48 transition count 131
Iterating global reduction 2 with 28 rules applied. Total rules applied 66 place count 48 transition count 131
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 70 place count 44 transition count 123
Iterating global reduction 2 with 4 rules applied. Total rules applied 74 place count 44 transition count 123
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 77 place count 41 transition count 114
Iterating global reduction 2 with 3 rules applied. Total rules applied 80 place count 41 transition count 114
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 82 place count 39 transition count 108
Iterating global reduction 2 with 2 rules applied. Total rules applied 84 place count 39 transition count 108
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 96 place count 39 transition count 96
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 102 place count 36 transition count 106
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 104 place count 34 transition count 100
Iterating global reduction 3 with 2 rules applied. Total rules applied 106 place count 34 transition count 100
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 112 place count 34 transition count 94
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 113 place count 34 transition count 171
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 118 place count 33 transition count 167
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 119 place count 32 transition count 126
Iterating global reduction 5 with 1 rules applied. Total rules applied 120 place count 32 transition count 126
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 121 place count 31 transition count 123
Iterating global reduction 5 with 1 rules applied. Total rules applied 122 place count 31 transition count 123
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 5 with 12 rules applied. Total rules applied 134 place count 31 transition count 111
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 142 place count 31 transition count 111
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 6 with 7 rules applied. Total rules applied 149 place count 31 transition count 111
Applied a total of 149 rules in 74 ms. Remains 31 /89 variables (removed 58) and now considering 111/192 (removed 81) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74 ms. Remains : 31/89 places, 111/192 transitions.
RANDOM walk for 2834274 steps (664141 resets) in 18101 ms. (156 steps per ms) remains 0/3 properties
Able to resolve query StableMarking after proving 131 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PARIKH_WALK MARKED_SUFFIX_TEST TRIVIAL_UNMARKED_SCC_TEST BESTFIRST_WALK TOPOLOGICAL
Total runtime 43124 ms.
ITS solved all properties within timeout

BK_STOP 1748771667404

--------------------
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="HealthRecord-PT-11"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="gold2024"
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-5832"
echo " Executing tool gold2024"
echo " Input is HealthRecord-PT-11, 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 r112-smll-174867016500388"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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