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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 464K
-rw-r--r-- 1 mcc users 5.5K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 55K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K 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.8K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 103K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K 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 67K 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 1748771191780

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-06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-06-01 09:46:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2025-06-01 09:46:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 09:46:34] [INFO ] Load time of PNML (sax parser for PT used): 160 ms
[2025-06-01 09:46:34] [INFO ] Transformed 154 places.
[2025-06-01 09:46:34] [INFO ] Transformed 319 transitions.
[2025-06-01 09:46:34] [INFO ] Found NUPN structural information;
[2025-06-01 09:46:34] [INFO ] Parsed PT model containing 154 places and 319 transitions and 835 arcs in 381 ms.
Graph (trivial) has 262 edges and 154 vertex of which 14 / 154 are part of one of the 7 SCC in 7 ms
Free SCC test removed 7 places
Structural test allowed to assert that 34 places are NOT stable. Took 44 ms.
Ensure Unique test removed 32 transitions
Reduce redundant transitions removed 32 transitions.
RANDOM walk for 40000 steps (2866 resets) in 3593 ms. (11 steps per ms) remains 40/120 properties
BEST_FIRST walk for 4004 steps (33 resets) in 40 ms. (97 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (33 resets) in 36 ms. (108 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (34 resets) in 42 ms. (93 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (29 resets) in 41 ms. (95 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (31 resets) in 32 ms. (121 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (33 resets) in 29 ms. (133 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (35 resets) in 20 ms. (190 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (35 resets) in 17 ms. (222 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (33 resets) in 16 ms. (235 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (33 resets) in 25 ms. (153 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (33 resets) in 24 ms. (160 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (29 resets) in 17 ms. (222 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (34 resets) in 11 ms. (333 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (35 resets) in 24 ms. (160 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (30 resets) in 20 ms. (190 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (33 resets) in 11 ms. (333 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (33 resets) in 15 ms. (250 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (32 resets) in 12 ms. (308 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (32 resets) in 10 ms. (363 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (33 resets) in 10 ms. (364 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (36 resets) in 18 ms. (210 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (32 resets) in 10 ms. (364 steps per ms) remains 39/40 properties
BEST_FIRST walk for 4001 steps (34 resets) in 17 ms. (222 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (32 resets) in 10 ms. (364 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (33 resets) in 31 ms. (125 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (31 resets) in 17 ms. (222 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (33 resets) in 10 ms. (363 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (34 resets) in 36 ms. (108 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (33 resets) in 10 ms. (363 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (33 resets) in 10 ms. (364 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (31 resets) in 17 ms. (222 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (32 resets) in 17 ms. (222 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (30 resets) in 10 ms. (363 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (31 resets) in 19 ms. (200 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (35 resets) in 20 ms. (190 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (33 resets) in 17 ms. (222 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (35 resets) in 11 ms. (333 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (28 resets) in 20 ms. (190 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (30 resets) in 11 ms. (333 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (33 resets) in 20 ms. (190 steps per ms) remains 39/39 properties
[2025-06-01 09:46:36] [INFO ] Flow matrix only has 268 transitions (discarded 19 similar events)
// Phase 1: matrix 268 rows 147 cols
[2025-06-01 09:46:36] [INFO ] Computed 18 invariants in 34 ms
[2025-06-01 09:46:36] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 2 (OVERLAPS) 56/95 variables, 10/49 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 56/105 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (OVERLAPS) 52/147 variables, 8/113 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/147 variables, 52/165 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/147 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 8 (OVERLAPS) 267/414 variables, 147/312 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/414 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 10 (OVERLAPS) 1/415 variables, 1/313 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/415 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 12 (OVERLAPS) 0/415 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Real declared 415/415 variables, and 313 constraints, problems are : Problem set: 0 solved, 39 unsolved in 3078 ms.
Refiners :[Domain max(s): 147/147 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 147/147 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 39 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 2 (OVERLAPS) 56/95 variables, 10/49 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 56/105 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2025-06-01 09:46:40] [INFO ] Deduced a trap composed of 38 places in 164 ms of which 25 ms to minimize.
[2025-06-01 09:46:40] [INFO ] Deduced a trap composed of 40 places in 104 ms of which 3 ms to minimize.
[2025-06-01 09:46:40] [INFO ] Deduced a trap composed of 40 places in 86 ms of which 2 ms to minimize.
[2025-06-01 09:46:40] [INFO ] Deduced a trap composed of 39 places in 84 ms of which 2 ms to minimize.
[2025-06-01 09:46:40] [INFO ] Deduced a trap composed of 38 places in 76 ms of which 2 ms to minimize.
[2025-06-01 09:46:40] [INFO ] Deduced a trap composed of 39 places in 91 ms of which 2 ms to minimize.
[2025-06-01 09:46:40] [INFO ] Deduced a trap composed of 25 places in 66 ms of which 2 ms to minimize.
[2025-06-01 09:46:41] [INFO ] Deduced a trap composed of 39 places in 70 ms of which 2 ms to minimize.
[2025-06-01 09:46:41] [INFO ] Deduced a trap composed of 40 places in 76 ms of which 2 ms to minimize.
[2025-06-01 09:46:41] [INFO ] Deduced a trap composed of 41 places in 66 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 10/115 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2025-06-01 09:46:41] [INFO ] Deduced a trap composed of 40 places in 92 ms of which 2 ms to minimize.
[2025-06-01 09:46:41] [INFO ] Deduced a trap composed of 41 places in 79 ms of which 3 ms to minimize.
[2025-06-01 09:46:41] [INFO ] Deduced a trap composed of 38 places in 72 ms of which 1 ms to minimize.
[2025-06-01 09:46:41] [INFO ] Deduced a trap composed of 40 places in 65 ms of which 1 ms to minimize.
[2025-06-01 09:46:41] [INFO ] Deduced a trap composed of 40 places in 62 ms of which 2 ms to minimize.
[2025-06-01 09:46:41] [INFO ] Deduced a trap composed of 40 places in 72 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/95 variables, 6/121 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2025-06-01 09:46:42] [INFO ] Deduced a trap composed of 40 places in 69 ms of which 1 ms to minimize.
[2025-06-01 09:46:42] [INFO ] Deduced a trap composed of 40 places in 74 ms of which 1 ms to minimize.
[2025-06-01 09:46:42] [INFO ] Deduced a trap composed of 40 places in 71 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/95 variables, 3/124 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2025-06-01 09:46:42] [INFO ] Deduced a trap composed of 40 places in 71 ms of which 1 ms to minimize.
[2025-06-01 09:46:42] [INFO ] Deduced a trap composed of 40 places in 64 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/95 variables, 2/126 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/95 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 9 (OVERLAPS) 52/147 variables, 8/134 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/147 variables, 52/186 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2025-06-01 09:46:43] [INFO ] Deduced a trap composed of 29 places in 171 ms of which 2 ms to minimize.
[2025-06-01 09:46:43] [INFO ] Deduced a trap composed of 40 places in 91 ms of which 2 ms to minimize.
[2025-06-01 09:46:43] [INFO ] Deduced a trap composed of 38 places in 74 ms of which 2 ms to minimize.
[2025-06-01 09:46:43] [INFO ] Deduced a trap composed of 40 places in 112 ms of which 2 ms to minimize.
[2025-06-01 09:46:43] [INFO ] Deduced a trap composed of 29 places in 62 ms of which 1 ms to minimize.
[2025-06-01 09:46:43] [INFO ] Deduced a trap composed of 40 places in 73 ms of which 2 ms to minimize.
[2025-06-01 09:46:43] [INFO ] Deduced a trap composed of 38 places in 85 ms of which 2 ms to minimize.
[2025-06-01 09:46:43] [INFO ] Deduced a trap composed of 29 places in 81 ms of which 3 ms to minimize.
[2025-06-01 09:46:43] [INFO ] Deduced a trap composed of 38 places in 69 ms of which 1 ms to minimize.
[2025-06-01 09:46:43] [INFO ] Deduced a trap composed of 39 places in 80 ms of which 1 ms to minimize.
[2025-06-01 09:46:44] [INFO ] Deduced a trap composed of 39 places in 79 ms of which 1 ms to minimize.
[2025-06-01 09:46:44] [INFO ] Deduced a trap composed of 29 places in 53 ms of which 1 ms to minimize.
[2025-06-01 09:46:44] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 2 ms to minimize.
[2025-06-01 09:46:44] [INFO ] Deduced a trap composed of 30 places in 59 ms of which 10 ms to minimize.
[2025-06-01 09:46:44] [INFO ] Deduced a trap composed of 30 places in 62 ms of which 1 ms to minimize.
[2025-06-01 09:46:44] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 2 ms to minimize.
[2025-06-01 09:46:44] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 2 ms to minimize.
[2025-06-01 09:46:44] [INFO ] Deduced a trap composed of 39 places in 68 ms of which 2 ms to minimize.
[2025-06-01 09:46:44] [INFO ] Deduced a trap composed of 39 places in 69 ms of which 2 ms to minimize.
[2025-06-01 09:46:44] [INFO ] Deduced a trap composed of 38 places in 62 ms of which 1 ms to minimize.
SMT process timed out in 8244ms, After SMT, problems are : Problem set: 0 solved, 39 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 39 out of 147 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 147/147 places, 287/287 transitions.
Graph (complete) has 636 edges and 147 vertex of which 138 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.2 ms
Discarding 9 places :
Also discarding 9 output transitions
Drop transitions (Output transitions of discarded places.) removed 9 transitions
Drop transitions (Empty/Sink Transition effects.) removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 138 transition count 261
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 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 1 with 14 rules applied. Total rules applied 32 place count 132 transition count 253
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 35 place count 130 transition count 252
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 35 place count 130 transition count 248
Deduced a syphon composed of 4 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 11 rules applied. Total rules applied 46 place count 123 transition count 248
Discarding 44 places :
Symmetric choice reduction at 3 with 44 rule applications. Total rules 90 place count 79 transition count 160
Iterating global reduction 3 with 44 rules applied. Total rules applied 134 place count 79 transition count 160
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 139 place count 74 transition count 150
Iterating global reduction 3 with 5 rules applied. Total rules applied 144 place count 74 transition count 150
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 152 place count 74 transition count 142
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -32
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 164 place count 68 transition count 174
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 168 place count 68 transition count 170
Partial Free-agglomeration rule applied 14 times.
Drop transitions (Partial Free agglomeration) removed 14 transitions
Iterating global reduction 4 with 14 rules applied. Total rules applied 182 place count 68 transition count 170
Partial Free-agglomeration rule applied 13 times.
Drop transitions (Partial Free agglomeration) removed 13 transitions
Iterating global reduction 4 with 13 rules applied. Total rules applied 195 place count 68 transition count 170
Applied a total of 195 rules in 121 ms. Remains 68 /147 variables (removed 79) and now considering 170/287 (removed 117) transitions.
Running 154 sub problems to find dead transitions.
[2025-06-01 09:46:44] [INFO ] Flow matrix only has 160 transitions (discarded 10 similar events)
// Phase 1: matrix 160 rows 68 cols
[2025-06-01 09:46:44] [INFO ] Computed 6 invariants in 3 ms
[2025-06-01 09:46:44] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 1 (OVERLAPS) 2/68 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 154 unsolved
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
At refinement iteration 4 (OVERLAPS) 160/228 variables, 68/74 constraints. Problems are: Problem set: 14 solved, 140 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/228 variables, 14/88 constraints. Problems are: Problem set: 14 solved, 140 unsolved
[2025-06-01 09:46:48] [INFO ] Deduced a trap composed of 19 places in 92 ms of which 2 ms to minimize.
[2025-06-01 09:46:48] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 1 ms to minimize.
[2025-06-01 09:46:48] [INFO ] Deduced a trap composed of 28 places in 90 ms of which 1 ms to minimize.
[2025-06-01 09:46:48] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 1 ms to minimize.
[2025-06-01 09:46:48] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 2 ms to minimize.
[2025-06-01 09:46:48] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 2 ms to minimize.
[2025-06-01 09:46:48] [INFO ] Deduced a trap composed of 29 places in 59 ms of which 1 ms to minimize.
[2025-06-01 09:46:48] [INFO ] Deduced a trap composed of 30 places in 56 ms of which 1 ms to minimize.
[2025-06-01 09:46:48] [INFO ] Deduced a trap composed of 15 places in 93 ms of which 2 ms to minimize.
[2025-06-01 09:46:48] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/228 variables, 10/98 constraints. Problems are: Problem set: 14 solved, 140 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/228 variables, 0/98 constraints. Problems are: Problem set: 14 solved, 140 unsolved
[2025-06-01 09:46:50] [INFO ] Deduced a trap composed of 27 places in 73 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/228 variables, 1/99 constraints. Problems are: Problem set: 14 solved, 140 unsolved
[2025-06-01 09:46:51] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 2 ms to minimize.
[2025-06-01 09:46:51] [INFO ] Deduced a trap composed of 14 places in 75 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/228 variables, 2/101 constraints. Problems are: Problem set: 14 solved, 140 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/228 variables, 0/101 constraints. Problems are: Problem set: 14 solved, 140 unsolved
At refinement iteration 11 (OVERLAPS) 0/228 variables, 0/101 constraints. Problems are: Problem set: 14 solved, 140 unsolved
No progress, stopping.
After SMT solving in domain Real declared 228/228 variables, and 101 constraints, problems are : Problem set: 14 solved, 140 unsolved in 8436 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 68/68 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 154/154 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 14 solved, 140 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 14 solved, 140 unsolved
At refinement iteration 1 (OVERLAPS) 2/67 variables, 1/1 constraints. Problems are: Problem set: 14 solved, 140 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 4/5 constraints. Problems are: Problem set: 14 solved, 140 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 0/5 constraints. Problems are: Problem set: 14 solved, 140 unsolved
At refinement iteration 4 (OVERLAPS) 1/68 variables, 5/10 constraints. Problems are: Problem set: 14 solved, 140 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 9/19 constraints. Problems are: Problem set: 14 solved, 140 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 0/19 constraints. Problems are: Problem set: 14 solved, 140 unsolved
At refinement iteration 7 (OVERLAPS) 160/228 variables, 68/87 constraints. Problems are: Problem set: 14 solved, 140 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/228 variables, 14/101 constraints. Problems are: Problem set: 14 solved, 140 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/228 variables, 140/241 constraints. Problems are: Problem set: 14 solved, 140 unsolved
[2025-06-01 09:46:56] [INFO ] Deduced a trap composed of 22 places in 78 ms of which 2 ms to minimize.
[2025-06-01 09:46:56] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 2 ms to minimize.
[2025-06-01 09:46:56] [INFO ] Deduced a trap composed of 15 places in 95 ms of which 2 ms to minimize.
[2025-06-01 09:46:56] [INFO ] Deduced a trap composed of 21 places in 73 ms of which 1 ms to minimize.
[2025-06-01 09:46:56] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 1 ms to minimize.
[2025-06-01 09:46:56] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
[2025-06-01 09:46:56] [INFO ] Deduced a trap composed of 23 places in 86 ms of which 1 ms to minimize.
[2025-06-01 09:46:57] [INFO ] Deduced a trap composed of 23 places in 83 ms of which 2 ms to minimize.
[2025-06-01 09:46:57] [INFO ] Deduced a trap composed of 28 places in 77 ms of which 2 ms to minimize.
[2025-06-01 09:46:57] [INFO ] Deduced a trap composed of 26 places in 77 ms of which 2 ms to minimize.
[2025-06-01 09:46:57] [INFO ] Deduced a trap composed of 29 places in 71 ms of which 2 ms to minimize.
[2025-06-01 09:46:57] [INFO ] Deduced a trap composed of 13 places in 82 ms of which 2 ms to minimize.
[2025-06-01 09:46:57] [INFO ] Deduced a trap composed of 29 places in 70 ms of which 1 ms to minimize.
[2025-06-01 09:46:57] [INFO ] Deduced a trap composed of 28 places in 81 ms of which 2 ms to minimize.
[2025-06-01 09:46:57] [INFO ] Deduced a trap composed of 28 places in 74 ms of which 1 ms to minimize.
[2025-06-01 09:46:57] [INFO ] Deduced a trap composed of 28 places in 69 ms of which 2 ms to minimize.
[2025-06-01 09:46:58] [INFO ] Deduced a trap composed of 29 places in 74 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/228 variables, 17/258 constraints. Problems are: Problem set: 14 solved, 140 unsolved
[2025-06-01 09:47:00] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 1 ms to minimize.
[2025-06-01 09:47:00] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 1 ms to minimize.
[2025-06-01 09:47:00] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/228 variables, 3/261 constraints. Problems are: Problem set: 14 solved, 140 unsolved
[2025-06-01 09:47:02] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 1 ms to minimize.
[2025-06-01 09:47:02] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 1 ms to minimize.
[2025-06-01 09:47:02] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/228 variables, 3/264 constraints. Problems are: Problem set: 14 solved, 140 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/228 variables, 0/264 constraints. Problems are: Problem set: 14 solved, 140 unsolved
[2025-06-01 09:47:08] [INFO ] Deduced a trap composed of 28 places in 61 ms of which 1 ms to minimize.
[2025-06-01 09:47:08] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/228 variables, 2/266 constraints. Problems are: Problem set: 14 solved, 140 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/228 variables, 0/266 constraints. Problems are: Problem set: 14 solved, 140 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 228/228 variables, and 266 constraints, problems are : Problem set: 14 solved, 140 unsolved in 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 68/68 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 140/154 constraints, Known Traps: 38/38 constraints]
After SMT, in 28869ms problems are : Problem set: 14 solved, 140 unsolved
Search for dead transitions found 14 dead transitions in 28878ms
Found 14 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 14 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 14 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 68/147 places, 156/287 transitions.
Graph (complete) has 288 edges and 68 vertex of which 67 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 67 transition count 156
Applied a total of 2 rules in 28 ms. Remains 67 /68 variables (removed 1) and now considering 156/156 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 29072 ms. Remains : 67/147 places, 156/287 transitions.
RANDOM walk for 4000000 steps (1174909 resets) in 23853 ms. (167 steps per ms) remains 3/39 properties
BEST_FIRST walk for 4000004 steps (134385 resets) in 1874 ms. (2133 steps per ms) remains 3/3 properties
BEST_FIRST walk for 4000004 steps (134328 resets) in 1898 ms. (2106 steps per ms) remains 3/3 properties
BEST_FIRST walk for 4000003 steps (134114 resets) in 1942 ms. (2058 steps per ms) remains 3/3 properties
[2025-06-01 09:47:23] [INFO ] Flow matrix only has 146 transitions (discarded 10 similar events)
// Phase 1: matrix 146 rows 67 cols
[2025-06-01 09:47:23] [INFO ] Computed 6 invariants in 3 ms
[2025-06-01 09:47:23] [INFO ] State equation strengthened by 14 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 38/41 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 109/150 variables, 41/47 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/150 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 63/213 variables, 26/73 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/213 variables, 14/87 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/213 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/213 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 213/213 variables, and 87 constraints, problems are : Problem set: 0 solved, 3 unsolved in 180 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 67/67 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 38/41 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 109/150 variables, 41/47 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/150 variables, 3/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/150 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 63/213 variables, 26/76 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/213 variables, 14/90 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/213 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/213 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 213/213 variables, and 90 constraints, problems are : Problem set: 0 solved, 3 unsolved in 156 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 67/67 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 348ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 103 ms.
Support contains 3 out of 67 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 67/67 places, 156/156 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 67 transition count 144
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 37 place count 42 transition count 99
Iterating global reduction 1 with 25 rules applied. Total rules applied 62 place count 42 transition count 99
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 66 place count 38 transition count 95
Iterating global reduction 1 with 4 rules applied. Total rules applied 70 place count 38 transition count 95
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 73 place count 35 transition count 89
Iterating global reduction 1 with 3 rules applied. Total rules applied 76 place count 35 transition count 89
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 79 place count 32 transition count 83
Iterating global reduction 1 with 3 rules applied. Total rules applied 82 place count 32 transition count 83
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 100 place count 32 transition count 65
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 104 place count 30 transition count 63
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 108 place count 28 transition count 72
Applied a total of 108 rules in 33 ms. Remains 28 /67 variables (removed 39) and now considering 72/156 (removed 84) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 28/67 places, 72/156 transitions.
RANDOM walk for 4000000 steps (1207083 resets) in 10450 ms. (382 steps per ms) remains 3/3 properties
BEST_FIRST walk for 4000003 steps (149348 resets) in 2694 ms. (1484 steps per ms) remains 3/3 properties
BEST_FIRST walk for 4000003 steps (149278 resets) in 2090 ms. (1912 steps per ms) remains 3/3 properties
BEST_FIRST walk for 4000002 steps (149504 resets) in 1961 ms. (2038 steps per ms) remains 3/3 properties
Finished probabilistic random walk after 1624 steps, run visited all 3 properties in 19 ms. (steps per millisecond=85 )
Probabilistic random walk after 1624 steps, saw 574 distinct states, run finished after 24 ms. (steps per millisecond=67 ) properties seen :3
Able to resolve query StableMarking after proving 122 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PROBABILISTIC_WALK MARKED_SUFFIX_TEST TRIVIAL_UNMARKED_SCC_TEST BESTFIRST_WALK TOPOLOGICAL
Total runtime 54009 ms.
ITS solved all properties within timeout

BK_STOP 1748771248541

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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-06"
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-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 r112-smll-174867016500363"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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