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-174867016600398.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-13, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r112-smll-174867016600398
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 7.5K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 127K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K 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 71K 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 1748771801200

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-13
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-06-01 09:56:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2025-06-01 09:56:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 09:56:44] [INFO ] Load time of PNML (sax parser for PT used): 165 ms
[2025-06-01 09:56:44] [INFO ] Transformed 161 places.
[2025-06-01 09:56:44] [INFO ] Transformed 341 transitions.
[2025-06-01 09:56:44] [INFO ] Found NUPN structural information;
[2025-06-01 09:56:44] [INFO ] Parsed PT model containing 161 places and 341 transitions and 899 arcs in 361 ms.
Graph (trivial) has 274 edges and 161 vertex of which 8 / 161 are part of one of the 4 SCC in 7 ms
Free SCC test removed 4 places
Structural test allowed to assert that 29 places are NOT stable. Took 35 ms.
Ensure Unique test removed 32 transitions
Reduce redundant transitions removed 32 transitions.
RANDOM walk for 40000 steps (3503 resets) in 4686 ms. (8 steps per ms) remains 63/132 properties
BEST_FIRST walk for 4004 steps (45 resets) in 34 ms. (114 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4003 steps (45 resets) in 58 ms. (67 steps per ms) remains 62/63 properties
BEST_FIRST walk for 4004 steps (47 resets) in 41 ms. (95 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (46 resets) in 34 ms. (114 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (43 resets) in 34 ms. (114 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4003 steps (46 resets) in 31 ms. (125 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4003 steps (45 resets) in 22 ms. (174 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (44 resets) in 25 ms. (154 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (44 resets) in 23 ms. (166 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (44 resets) in 37 ms. (105 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4002 steps (46 resets) in 24 ms. (160 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (44 resets) in 22 ms. (174 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (44 resets) in 26 ms. (148 steps per ms) remains 60/62 properties
BEST_FIRST walk for 4004 steps (47 resets) in 31 ms. (125 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (43 resets) in 28 ms. (138 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (46 resets) in 29 ms. (133 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (45 resets) in 24 ms. (160 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4002 steps (43 resets) in 13 ms. (285 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (44 resets) in 13 ms. (285 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (45 resets) in 24 ms. (160 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4002 steps (47 resets) in 39 ms. (100 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (46 resets) in 28 ms. (138 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4002 steps (46 resets) in 44 ms. (88 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (46 resets) in 18 ms. (210 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (44 resets) in 19 ms. (200 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (46 resets) in 23 ms. (166 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4002 steps (45 resets) in 18 ms. (210 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4002 steps (41 resets) in 15 ms. (250 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (42 resets) in 20 ms. (190 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4002 steps (44 resets) in 21 ms. (181 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (44 resets) in 19 ms. (200 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (46 resets) in 14 ms. (266 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (46 resets) in 24 ms. (160 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (45 resets) in 18 ms. (210 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (47 resets) in 15 ms. (250 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (43 resets) in 20 ms. (190 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (47 resets) in 17 ms. (222 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4002 steps (47 resets) in 15 ms. (250 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (46 resets) in 17 ms. (222 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (44 resets) in 9 ms. (400 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (45 resets) in 16 ms. (235 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (46 resets) in 8 ms. (444 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (41 resets) in 17 ms. (222 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (44 resets) in 9 ms. (400 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (42 resets) in 9 ms. (400 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (45 resets) in 9 ms. (400 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (44 resets) in 11 ms. (333 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (47 resets) in 10 ms. (364 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4002 steps (44 resets) in 20 ms. (190 steps per ms) remains 59/60 properties
BEST_FIRST walk for 4003 steps (46 resets) in 11 ms. (333 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (45 resets) in 11 ms. (333 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (44 resets) in 8 ms. (444 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (39 resets) in 24 ms. (160 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (42 resets) in 16 ms. (235 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (45 resets) in 17 ms. (222 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (47 resets) in 19 ms. (200 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (44 resets) in 22 ms. (174 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (44 resets) in 9 ms. (400 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (46 resets) in 9 ms. (400 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (47 resets) in 17 ms. (222 steps per ms) remains 59/59 properties
[2025-06-01 09:56:46] [INFO ] Flow matrix only has 293 transitions (discarded 16 similar events)
// Phase 1: matrix 293 rows 157 cols
[2025-06-01 09:56:46] [INFO ] Computed 18 invariants in 20 ms
[2025-06-01 09:56:46] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 59/59 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (OVERLAPS) 37/96 variables, 10/69 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 37/106 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 5 (OVERLAPS) 61/157 variables, 8/114 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/157 variables, 61/175 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/157 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 8 (OVERLAPS) 292/449 variables, 157/332 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/449 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 10 (OVERLAPS) 1/450 variables, 1/333 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/450 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 12 (OVERLAPS) 0/450 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Real declared 450/450 variables, and 333 constraints, problems are : Problem set: 0 solved, 59 unsolved in 4283 ms.
Refiners :[Domain max(s): 157/157 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 157/157 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 59 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 59/59 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (OVERLAPS) 37/96 variables, 10/69 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 37/106 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2025-06-01 09:56:51] [INFO ] Deduced a trap composed of 25 places in 131 ms of which 25 ms to minimize.
[2025-06-01 09:56:51] [INFO ] Deduced a trap composed of 45 places in 219 ms of which 4 ms to minimize.
[2025-06-01 09:56:52] [INFO ] Deduced a trap composed of 37 places in 200 ms of which 2 ms to minimize.
[2025-06-01 09:56:52] [INFO ] Deduced a trap composed of 44 places in 149 ms of which 2 ms to minimize.
[2025-06-01 09:56:52] [INFO ] Deduced a trap composed of 44 places in 129 ms of which 2 ms to minimize.
[2025-06-01 09:56:52] [INFO ] Deduced a trap composed of 39 places in 78 ms of which 2 ms to minimize.
[2025-06-01 09:56:52] [INFO ] Deduced a trap composed of 44 places in 82 ms of which 2 ms to minimize.
[2025-06-01 09:56:52] [INFO ] Deduced a trap composed of 39 places in 79 ms of which 1 ms to minimize.
[2025-06-01 09:56:52] [INFO ] Deduced a trap composed of 38 places in 67 ms of which 2 ms to minimize.
[2025-06-01 09:56:53] [INFO ] Deduced a trap composed of 41 places in 70 ms of which 1 ms to minimize.
[2025-06-01 09:56:53] [INFO ] Deduced a trap composed of 40 places in 72 ms of which 2 ms to minimize.
[2025-06-01 09:56:53] [INFO ] Deduced a trap composed of 41 places in 61 ms of which 1 ms to minimize.
[2025-06-01 09:56:53] [INFO ] Deduced a trap composed of 41 places in 80 ms of which 2 ms to minimize.
[2025-06-01 09:56:53] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 2 ms to minimize.
[2025-06-01 09:56:53] [INFO ] Deduced a trap composed of 39 places in 89 ms of which 2 ms to minimize.
[2025-06-01 09:56:53] [INFO ] Deduced a trap composed of 41 places in 71 ms of which 1 ms to minimize.
[2025-06-01 09:56:53] [INFO ] Deduced a trap composed of 41 places in 77 ms of which 2 ms to minimize.
[2025-06-01 09:56:53] [INFO ] Deduced a trap composed of 40 places in 70 ms of which 2 ms to minimize.
[2025-06-01 09:56:53] [INFO ] Deduced a trap composed of 38 places in 69 ms of which 2 ms to minimize.
[2025-06-01 09:56:53] [INFO ] Deduced a trap composed of 41 places in 51 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 20/126 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2025-06-01 09:56:54] [INFO ] Deduced a trap composed of 40 places in 76 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/96 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2025-06-01 09:56:54] [INFO ] Deduced a trap composed of 40 places in 60 ms of which 2 ms to minimize.
[2025-06-01 09:56:54] [INFO ] Deduced a trap composed of 40 places in 59 ms of which 1 ms to minimize.
[2025-06-01 09:56:54] [INFO ] Deduced a trap composed of 40 places in 64 ms of which 1 ms to minimize.
[2025-06-01 09:56:54] [INFO ] Deduced a trap composed of 39 places in 59 ms of which 1 ms to minimize.
[2025-06-01 09:56:54] [INFO ] Deduced a trap composed of 40 places in 60 ms of which 2 ms to minimize.
[2025-06-01 09:56:54] [INFO ] Deduced a trap composed of 40 places in 58 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/96 variables, 6/133 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/96 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 8 (OVERLAPS) 61/157 variables, 8/141 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/157 variables, 61/202 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2025-06-01 09:56:55] [INFO ] Deduced a trap composed of 30 places in 115 ms of which 3 ms to minimize.
[2025-06-01 09:56:55] [INFO ] Deduced a trap composed of 38 places in 151 ms of which 3 ms to minimize.
[2025-06-01 09:56:55] [INFO ] Deduced a trap composed of 30 places in 66 ms of which 2 ms to minimize.
[2025-06-01 09:56:55] [INFO ] Deduced a trap composed of 39 places in 114 ms of which 3 ms to minimize.
[2025-06-01 09:56:55] [INFO ] Deduced a trap composed of 38 places in 118 ms of which 2 ms to minimize.
SMT process timed out in 9454ms, After SMT, problems are : Problem set: 0 solved, 59 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 59 out of 157 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 309/309 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 157 transition count 291
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 20 place count 156 transition count 290
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 20 place count 156 transition count 289
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 22 place count 155 transition count 289
Discarding 48 places :
Symmetric choice reduction at 2 with 48 rule applications. Total rules 70 place count 107 transition count 193
Iterating global reduction 2 with 48 rules applied. Total rules applied 118 place count 107 transition count 193
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 122 place count 103 transition count 185
Iterating global reduction 2 with 4 rules applied. Total rules applied 126 place count 103 transition count 185
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 132 place count 103 transition count 179
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -32
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 146 place count 96 transition count 211
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 149 place count 96 transition count 208
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 150 place count 96 transition count 208
Applied a total of 150 rules in 117 ms. Remains 96 /157 variables (removed 61) and now considering 208/309 (removed 101) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 136 ms. Remains : 96/157 places, 208/309 transitions.
RANDOM walk for 4000000 steps (725604 resets) in 28878 ms. (138 steps per ms) remains 38/59 properties
BEST_FIRST walk for 400002 steps (10993 resets) in 540 ms. (739 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400002 steps (10958 resets) in 464 ms. (860 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400003 steps (11096 resets) in 565 ms. (706 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400003 steps (11009 resets) in 606 ms. (658 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400003 steps (10982 resets) in 590 ms. (676 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (10949 resets) in 569 ms. (701 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400003 steps (10876 resets) in 563 ms. (709 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400003 steps (10941 resets) in 461 ms. (865 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (10976 resets) in 484 ms. (824 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (11028 resets) in 491 ms. (813 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (11009 resets) in 456 ms. (875 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (11024 resets) in 465 ms. (858 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (10993 resets) in 459 ms. (869 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400003 steps (11052 resets) in 477 ms. (836 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (11030 resets) in 479 ms. (833 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (10923 resets) in 464 ms. (860 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400002 steps (10977 resets) in 461 ms. (865 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400003 steps (11017 resets) in 461 ms. (865 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400002 steps (11006 resets) in 485 ms. (823 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400003 steps (10996 resets) in 483 ms. (826 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400003 steps (10970 resets) in 477 ms. (836 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400003 steps (10978 resets) in 482 ms. (828 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400003 steps (11002 resets) in 637 ms. (626 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400003 steps (11075 resets) in 887 ms. (450 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400003 steps (10986 resets) in 624 ms. (640 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (11018 resets) in 633 ms. (630 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (11063 resets) in 567 ms. (704 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (10976 resets) in 766 ms. (521 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400003 steps (11061 resets) in 699 ms. (571 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (10994 resets) in 464 ms. (860 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (11090 resets) in 485 ms. (823 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400003 steps (10932 resets) in 457 ms. (873 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (11044 resets) in 462 ms. (863 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400003 steps (11029 resets) in 465 ms. (858 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400002 steps (11001 resets) in 503 ms. (793 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400003 steps (11020 resets) in 466 ms. (856 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (11024 resets) in 464 ms. (860 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (10963 resets) in 605 ms. (660 steps per ms) remains 38/38 properties
[2025-06-01 09:57:10] [INFO ] Flow matrix only has 188 transitions (discarded 20 similar events)
// Phase 1: matrix 188 rows 96 cols
[2025-06-01 09:57:10] [INFO ] Computed 18 invariants in 4 ms
[2025-06-01 09:57:10] [INFO ] State equation strengthened by 8 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (OVERLAPS) 38/76 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (OVERLAPS) 20/96 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (OVERLAPS) 188/284 variables, 96/114 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/284 variables, 8/122 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/284 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 8 (OVERLAPS) 0/284 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Real declared 284/284 variables, and 122 constraints, problems are : Problem set: 0 solved, 38 unsolved in 1092 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 96/96 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 38 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (OVERLAPS) 38/76 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2025-06-01 09:57:11] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 1 ms to minimize.
[2025-06-01 09:57:11] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 2 ms to minimize.
[2025-06-01 09:57:12] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 7 ms to minimize.
[2025-06-01 09:57:12] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 2 ms to minimize.
[2025-06-01 09:57:12] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 1 ms to minimize.
[2025-06-01 09:57:12] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 1 ms to minimize.
[2025-06-01 09:57:12] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 2 ms to minimize.
[2025-06-01 09:57:12] [INFO ] Deduced a trap composed of 24 places in 69 ms of which 4 ms to minimize.
[2025-06-01 09:57:12] [INFO ] Deduced a trap composed of 32 places in 53 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2025-06-01 09:57:12] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
[2025-06-01 09:57:12] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 1 ms to minimize.
[2025-06-01 09:57:12] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 1 ms to minimize.
[2025-06-01 09:57:12] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 2 ms to minimize.
[2025-06-01 09:57:12] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
[2025-06-01 09:57:12] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 6/25 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2025-06-01 09:57:13] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (OVERLAPS) 20/96 variables, 8/34 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2025-06-01 09:57:13] [INFO ] Deduced a trap composed of 16 places in 83 ms of which 2 ms to minimize.
[2025-06-01 09:57:13] [INFO ] Deduced a trap composed of 14 places in 87 ms of which 1 ms to minimize.
[2025-06-01 09:57:13] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 3 ms to minimize.
[2025-06-01 09:57:13] [INFO ] Deduced a trap composed of 30 places in 59 ms of which 2 ms to minimize.
[2025-06-01 09:57:13] [INFO ] Deduced a trap composed of 30 places in 88 ms of which 1 ms to minimize.
[2025-06-01 09:57:13] [INFO ] Deduced a trap composed of 30 places in 84 ms of which 1 ms to minimize.
[2025-06-01 09:57:13] [INFO ] Deduced a trap composed of 35 places in 108 ms of which 1 ms to minimize.
[2025-06-01 09:57:13] [INFO ] Deduced a trap composed of 30 places in 92 ms of which 2 ms to minimize.
[2025-06-01 09:57:14] [INFO ] Deduced a trap composed of 13 places in 125 ms of which 30 ms to minimize.
[2025-06-01 09:57:14] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
[2025-06-01 09:57:14] [INFO ] Deduced a trap composed of 15 places in 120 ms of which 2 ms to minimize.
[2025-06-01 09:57:14] [INFO ] Deduced a trap composed of 29 places in 76 ms of which 2 ms to minimize.
[2025-06-01 09:57:14] [INFO ] Deduced a trap composed of 29 places in 83 ms of which 2 ms to minimize.
[2025-06-01 09:57:14] [INFO ] Deduced a trap composed of 29 places in 76 ms of which 1 ms to minimize.
[2025-06-01 09:57:14] [INFO ] Deduced a trap composed of 31 places in 74 ms of which 2 ms to minimize.
[2025-06-01 09:57:14] [INFO ] Deduced a trap composed of 31 places in 93 ms of which 3 ms to minimize.
[2025-06-01 09:57:14] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2025-06-01 09:57:14] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 1 ms to minimize.
[2025-06-01 09:57:14] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 1 ms to minimize.
[2025-06-01 09:57:14] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/96 variables, 20/54 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2025-06-01 09:57:14] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2025-06-01 09:57:15] [INFO ] Deduced a trap composed of 33 places in 60 ms of which 1 ms to minimize.
[2025-06-01 09:57:15] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2025-06-01 09:57:15] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 1 ms to minimize.
[2025-06-01 09:57:15] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2025-06-01 09:57:15] [INFO ] Deduced a trap composed of 30 places in 74 ms of which 1 ms to minimize.
[2025-06-01 09:57:15] [INFO ] Deduced a trap composed of 30 places in 69 ms of which 1 ms to minimize.
[2025-06-01 09:57:15] [INFO ] Deduced a trap composed of 32 places in 75 ms of which 1 ms to minimize.
[2025-06-01 09:57:15] [INFO ] Deduced a trap composed of 33 places in 78 ms of which 2 ms to minimize.
[2025-06-01 09:57:15] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2025-06-01 09:57:15] [INFO ] Deduced a trap composed of 30 places in 79 ms of which 2 ms to minimize.
[2025-06-01 09:57:15] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2025-06-01 09:57:15] [INFO ] Deduced a trap composed of 33 places in 57 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/96 variables, 13/67 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2025-06-01 09:57:15] [INFO ] Deduced a trap composed of 30 places in 54 ms of which 1 ms to minimize.
[2025-06-01 09:57:16] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 1 ms to minimize.
[2025-06-01 09:57:16] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/96 variables, 3/70 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2025-06-01 09:57:16] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2025-06-01 09:57:16] [INFO ] Deduced a trap composed of 30 places in 90 ms of which 2 ms to minimize.
[2025-06-01 09:57:16] [INFO ] Deduced a trap composed of 29 places in 81 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/96 variables, 3/73 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2025-06-01 09:57:16] [INFO ] Deduced a trap composed of 30 places in 66 ms of which 1 ms to minimize.
[2025-06-01 09:57:16] [INFO ] Deduced a trap composed of 35 places in 75 ms of which 2 ms to minimize.
[2025-06-01 09:57:17] [INFO ] Deduced a trap composed of 29 places in 63 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/96 variables, 3/76 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2025-06-01 09:57:17] [INFO ] Deduced a trap composed of 31 places in 80 ms of which 1 ms to minimize.
[2025-06-01 09:57:17] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
[2025-06-01 09:57:17] [INFO ] Deduced a trap composed of 25 places in 98 ms of which 1 ms to minimize.
[2025-06-01 09:57:17] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
[2025-06-01 09:57:17] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 1 ms to minimize.
[2025-06-01 09:57:17] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/96 variables, 6/82 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/96 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 14 (OVERLAPS) 188/284 variables, 96/178 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/284 variables, 8/186 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/284 variables, 38/224 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/284 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 18 (OVERLAPS) 0/284 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Int declared 284/284 variables, and 224 constraints, problems are : Problem set: 0 solved, 38 unsolved in 7952 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 96/96 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 64/64 constraints]
After SMT, in 9086ms problems are : Problem set: 0 solved, 38 unsolved
Fused 38 Parikh solutions to 29 different solutions.
Parikh walk visited 35 properties in 3363 ms.
Support contains 3 out of 96 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 208/208 transitions.
Graph (complete) has 493 edges and 96 vertex of which 87 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.3 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 87 transition count 204
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 83 transition count 203
Discarding 31 places :
Symmetric choice reduction at 2 with 31 rule applications. Total rules 41 place count 52 transition count 141
Iterating global reduction 2 with 31 rules applied. Total rules applied 72 place count 52 transition count 141
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 77 place count 47 transition count 131
Iterating global reduction 2 with 5 rules applied. Total rules applied 82 place count 47 transition count 131
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 85 place count 44 transition count 122
Iterating global reduction 2 with 3 rules applied. Total rules applied 88 place count 44 transition count 122
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 90 place count 42 transition count 118
Iterating global reduction 2 with 2 rules applied. Total rules applied 92 place count 42 transition count 118
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 100 place count 42 transition count 110
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 106 place count 39 transition count 120
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 110 place count 39 transition count 116
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 111 place count 39 transition count 229
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 116 place count 38 transition count 225
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 117 place count 37 transition count 166
Iterating global reduction 5 with 1 rules applied. Total rules applied 118 place count 37 transition count 166
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 120 place count 35 transition count 161
Iterating global reduction 5 with 2 rules applied. Total rules applied 122 place count 35 transition count 161
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 5 with 24 rules applied. Total rules applied 146 place count 35 transition count 137
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 6 with 9 rules applied. Total rules applied 155 place count 35 transition count 137
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 163 place count 35 transition count 137
Applied a total of 163 rules in 70 ms. Remains 35 /96 variables (removed 61) and now considering 137/208 (removed 71) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 35/96 places, 137/208 transitions.
RANDOM walk for 2616835 steps (246283 resets) in 17783 ms. (147 steps per ms) remains 0/3 properties
Able to resolve query StableMarking after proving 134 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PARIKH_WALK MARKED_SUFFIX_TEST TRIVIAL_UNMARKED_SCC_TEST BESTFIRST_WALK TOPOLOGICAL
Total runtime 46303 ms.
ITS solved all properties within timeout

BK_STOP 1748771849983

--------------------
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-13"
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-13, 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-174867016600398"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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