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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 7.2K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K 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 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 70K 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 68K 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 1748771361783

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-08
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-06-01 09:49:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2025-06-01 09:49:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 09:49:24] [INFO ] Load time of PNML (sax parser for PT used): 207 ms
[2025-06-01 09:49:24] [INFO ] Transformed 156 places.
[2025-06-01 09:49:24] [INFO ] Transformed 326 transitions.
[2025-06-01 09:49:24] [INFO ] Found NUPN structural information;
[2025-06-01 09:49:24] [INFO ] Parsed PT model containing 156 places and 326 transitions and 855 arcs in 499 ms.
Graph (trivial) has 266 edges and 156 vertex of which 12 / 156 are part of one of the 6 SCC in 7 ms
Free SCC test removed 6 places
Structural test allowed to assert that 33 places are NOT stable. Took 45 ms.
Ensure Unique test removed 32 transitions
Reduce redundant transitions removed 32 transitions.
RANDOM walk for 40000 steps (2984 resets) in 3099 ms. (12 steps per ms) remains 44/123 properties
BEST_FIRST walk for 4004 steps (34 resets) in 26 ms. (148 steps per ms) remains 42/44 properties
BEST_FIRST walk for 4004 steps (35 resets) in 21 ms. (182 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (35 resets) in 19 ms. (200 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (36 resets) in 20 ms. (190 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (33 resets) in 17 ms. (222 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (34 resets) in 17 ms. (222 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (32 resets) in 32 ms. (121 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (32 resets) in 19 ms. (200 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (33 resets) in 28 ms. (138 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (32 resets) in 25 ms. (154 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (34 resets) in 35 ms. (111 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (33 resets) in 19 ms. (200 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (32 resets) in 25 ms. (154 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (35 resets) in 22 ms. (174 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (34 resets) in 16 ms. (235 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (33 resets) in 18 ms. (210 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (32 resets) in 16 ms. (235 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (34 resets) in 19 ms. (200 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (33 resets) in 11 ms. (333 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (33 resets) in 25 ms. (154 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (33 resets) in 23 ms. (166 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (31 resets) in 19 ms. (200 steps per ms) remains 40/42 properties
BEST_FIRST walk for 4004 steps (36 resets) in 15 ms. (250 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (35 resets) in 12 ms. (308 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (33 resets) in 21 ms. (182 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (33 resets) in 17 ms. (222 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (34 resets) in 13 ms. (286 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (31 resets) in 13 ms. (285 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (36 resets) in 11 ms. (333 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (37 resets) in 12 ms. (307 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (31 resets) in 12 ms. (308 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (35 resets) in 15 ms. (250 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (35 resets) in 29 ms. (133 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (36 resets) in 10 ms. (364 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (33 resets) in 12 ms. (308 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (33 resets) in 26 ms. (148 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (35 resets) in 11 ms. (333 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (35 resets) in 13 ms. (286 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (34 resets) in 14 ms. (266 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (34 resets) in 18 ms. (210 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (33 resets) in 11 ms. (333 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (34 resets) in 13 ms. (286 steps per ms) remains 39/40 properties
[2025-06-01 09:49:26] [INFO ] Flow matrix only has 276 transitions (discarded 18 similar events)
// Phase 1: matrix 276 rows 150 cols
[2025-06-01 09:49:26] [INFO ] Computed 18 invariants in 24 ms
[2025-06-01 09:49:26] [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) 55/150 variables, 8/113 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/150 variables, 55/168 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/150 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 8 (OVERLAPS) 275/425 variables, 150/318 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/425 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 10 (OVERLAPS) 1/426 variables, 1/319 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/426 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 12 (OVERLAPS) 0/426 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Real declared 426/426 variables, and 319 constraints, problems are : Problem set: 0 solved, 39 unsolved in 2480 ms.
Refiners :[Domain max(s): 150/150 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 150/150 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:49:29] [INFO ] Deduced a trap composed of 38 places in 120 ms of which 23 ms to minimize.
[2025-06-01 09:49:29] [INFO ] Deduced a trap composed of 39 places in 76 ms of which 2 ms to minimize.
[2025-06-01 09:49:29] [INFO ] Deduced a trap composed of 25 places in 74 ms of which 2 ms to minimize.
[2025-06-01 09:49:29] [INFO ] Deduced a trap composed of 40 places in 89 ms of which 2 ms to minimize.
[2025-06-01 09:49:29] [INFO ] Deduced a trap composed of 38 places in 97 ms of which 2 ms to minimize.
[2025-06-01 09:49:29] [INFO ] Deduced a trap composed of 40 places in 82 ms of which 2 ms to minimize.
[2025-06-01 09:49:29] [INFO ] Deduced a trap composed of 41 places in 92 ms of which 2 ms to minimize.
[2025-06-01 09:49:30] [INFO ] Deduced a trap composed of 41 places in 96 ms of which 3 ms to minimize.
[2025-06-01 09:49:30] [INFO ] Deduced a trap composed of 40 places in 91 ms of which 2 ms to minimize.
[2025-06-01 09:49:30] [INFO ] Deduced a trap composed of 39 places in 87 ms of which 2 ms to minimize.
[2025-06-01 09:49:30] [INFO ] Deduced a trap composed of 41 places in 67 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 11/116 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2025-06-01 09:49:30] [INFO ] Deduced a trap composed of 40 places in 98 ms of which 2 ms to minimize.
[2025-06-01 09:49:30] [INFO ] Deduced a trap composed of 39 places in 88 ms of which 2 ms to minimize.
[2025-06-01 09:49:30] [INFO ] Deduced a trap composed of 39 places in 99 ms of which 2 ms to minimize.
[2025-06-01 09:49:30] [INFO ] Deduced a trap composed of 40 places in 68 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/95 variables, 4/120 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/95 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (OVERLAPS) 55/150 variables, 8/128 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/150 variables, 55/183 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2025-06-01 09:49:31] [INFO ] Deduced a trap composed of 45 places in 95 ms of which 2 ms to minimize.
[2025-06-01 09:49:31] [INFO ] Deduced a trap composed of 39 places in 103 ms of which 3 ms to minimize.
[2025-06-01 09:49:31] [INFO ] Deduced a trap composed of 39 places in 91 ms of which 2 ms to minimize.
[2025-06-01 09:49:31] [INFO ] Deduced a trap composed of 39 places in 88 ms of which 2 ms to minimize.
[2025-06-01 09:49:31] [INFO ] Deduced a trap composed of 44 places in 106 ms of which 3 ms to minimize.
[2025-06-01 09:49:31] [INFO ] Deduced a trap composed of 47 places in 96 ms of which 2 ms to minimize.
[2025-06-01 09:49:32] [INFO ] Deduced a trap composed of 40 places in 87 ms of which 3 ms to minimize.
[2025-06-01 09:49:32] [INFO ] Deduced a trap composed of 40 places in 128 ms of which 6 ms to minimize.
[2025-06-01 09:49:32] [INFO ] Deduced a trap composed of 29 places in 85 ms of which 2 ms to minimize.
[2025-06-01 09:49:32] [INFO ] Deduced a trap composed of 38 places in 76 ms of which 2 ms to minimize.
[2025-06-01 09:49:32] [INFO ] Deduced a trap composed of 38 places in 79 ms of which 2 ms to minimize.
[2025-06-01 09:49:32] [INFO ] Deduced a trap composed of 29 places in 101 ms of which 2 ms to minimize.
[2025-06-01 09:49:32] [INFO ] Deduced a trap composed of 29 places in 105 ms of which 2 ms to minimize.
[2025-06-01 09:49:32] [INFO ] Deduced a trap composed of 29 places in 93 ms of which 2 ms to minimize.
[2025-06-01 09:49:32] [INFO ] Deduced a trap composed of 29 places in 66 ms of which 1 ms to minimize.
[2025-06-01 09:49:32] [INFO ] Deduced a trap composed of 38 places in 89 ms of which 1 ms to minimize.
[2025-06-01 09:49:33] [INFO ] Deduced a trap composed of 38 places in 86 ms of which 2 ms to minimize.
[2025-06-01 09:49:33] [INFO ] Deduced a trap composed of 41 places in 75 ms of which 1 ms to minimize.
[2025-06-01 09:49:33] [INFO ] Deduced a trap composed of 38 places in 107 ms of which 2 ms to minimize.
[2025-06-01 09:49:33] [INFO ] Deduced a trap composed of 24 places in 114 ms of which 8 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/150 variables, 20/203 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2025-06-01 09:49:33] [INFO ] Deduced a trap composed of 29 places in 53 ms of which 1 ms to minimize.
[2025-06-01 09:49:33] [INFO ] Deduced a trap composed of 29 places in 55 ms of which 1 ms to minimize.
[2025-06-01 09:49:33] [INFO ] Deduced a trap composed of 47 places in 115 ms of which 2 ms to minimize.
[2025-06-01 09:49:33] [INFO ] Deduced a trap composed of 44 places in 112 ms of which 1 ms to minimize.
[2025-06-01 09:49:34] [INFO ] Deduced a trap composed of 39 places in 301 ms of which 3 ms to minimize.
SMT process timed out in 7844ms, After SMT, problems are : Problem set: 0 solved, 39 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 39 out of 150 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 150/150 places, 294/294 transitions.
Graph (complete) has 650 edges and 150 vertex of which 141 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.4 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 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 141 transition count 270
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 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 12 rules applied. Total rules applied 28 place count 136 transition count 263
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 31 place count 134 transition count 262
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 31 place count 134 transition count 259
Deduced a syphon composed of 3 places in 2 ms
Ensure Unique test removed 2 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 39 place count 129 transition count 259
Discarding 47 places :
Symmetric choice reduction at 3 with 47 rule applications. Total rules 86 place count 82 transition count 165
Iterating global reduction 3 with 47 rules applied. Total rules applied 133 place count 82 transition count 165
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 138 place count 77 transition count 155
Iterating global reduction 3 with 5 rules applied. Total rules applied 143 place count 77 transition count 155
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 151 place count 77 transition count 147
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -33
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 163 place count 71 transition count 180
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 166 place count 71 transition count 177
Partial Free-agglomeration rule applied 15 times.
Drop transitions (Partial Free agglomeration) removed 15 transitions
Iterating global reduction 4 with 15 rules applied. Total rules applied 181 place count 71 transition count 177
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 195 place count 71 transition count 177
Applied a total of 195 rules in 142 ms. Remains 71 /150 variables (removed 79) and now considering 177/294 (removed 117) transitions.
Running 161 sub problems to find dead transitions.
[2025-06-01 09:49:34] [INFO ] Flow matrix only has 164 transitions (discarded 13 similar events)
// Phase 1: matrix 164 rows 71 cols
[2025-06-01 09:49:34] [INFO ] Computed 7 invariants in 7 ms
[2025-06-01 09:49:34] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 1 (OVERLAPS) 2/71 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 161 unsolved
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
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
At refinement iteration 4 (OVERLAPS) 164/235 variables, 71/78 constraints. Problems are: Problem set: 15 solved, 146 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/235 variables, 14/92 constraints. Problems are: Problem set: 15 solved, 146 unsolved
[2025-06-01 09:49:37] [INFO ] Deduced a trap composed of 24 places in 88 ms of which 2 ms to minimize.
[2025-06-01 09:49:37] [INFO ] Deduced a trap composed of 12 places in 97 ms of which 2 ms to minimize.
[2025-06-01 09:49:37] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 1 ms to minimize.
[2025-06-01 09:49:37] [INFO ] Deduced a trap composed of 30 places in 55 ms of which 2 ms to minimize.
[2025-06-01 09:49:37] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 0 ms to minimize.
[2025-06-01 09:49:37] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2025-06-01 09:49:37] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/235 variables, 7/99 constraints. Problems are: Problem set: 15 solved, 146 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/235 variables, 0/99 constraints. Problems are: Problem set: 15 solved, 146 unsolved
At refinement iteration 8 (OVERLAPS) 0/235 variables, 0/99 constraints. Problems are: Problem set: 15 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Real declared 235/235 variables, and 99 constraints, problems are : Problem set: 15 solved, 146 unsolved in 6293 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 71/71 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 161/161 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 15 solved, 146 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 0/0 constraints. Problems are: Problem set: 15 solved, 146 unsolved
At refinement iteration 1 (OVERLAPS) 2/70 variables, 1/1 constraints. Problems are: Problem set: 15 solved, 146 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 4/5 constraints. Problems are: Problem set: 15 solved, 146 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 0/5 constraints. Problems are: Problem set: 15 solved, 146 unsolved
At refinement iteration 4 (OVERLAPS) 1/71 variables, 6/11 constraints. Problems are: Problem set: 15 solved, 146 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 3/14 constraints. Problems are: Problem set: 15 solved, 146 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/71 variables, 0/14 constraints. Problems are: Problem set: 15 solved, 146 unsolved
At refinement iteration 7 (OVERLAPS) 164/235 variables, 71/85 constraints. Problems are: Problem set: 15 solved, 146 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/235 variables, 14/99 constraints. Problems are: Problem set: 15 solved, 146 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/235 variables, 146/245 constraints. Problems are: Problem set: 15 solved, 146 unsolved
[2025-06-01 09:49:43] [INFO ] Deduced a trap composed of 24 places in 89 ms of which 2 ms to minimize.
[2025-06-01 09:49:43] [INFO ] Deduced a trap composed of 23 places in 96 ms of which 2 ms to minimize.
[2025-06-01 09:49:44] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 1 ms to minimize.
[2025-06-01 09:49:44] [INFO ] Deduced a trap composed of 24 places in 93 ms of which 3 ms to minimize.
[2025-06-01 09:49:44] [INFO ] Deduced a trap composed of 23 places in 87 ms of which 2 ms to minimize.
[2025-06-01 09:49:44] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 2 ms to minimize.
[2025-06-01 09:49:44] [INFO ] Deduced a trap composed of 29 places in 67 ms of which 1 ms to minimize.
[2025-06-01 09:49:44] [INFO ] Deduced a trap composed of 30 places in 60 ms of which 1 ms to minimize.
[2025-06-01 09:49:44] [INFO ] Deduced a trap composed of 29 places in 54 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/235 variables, 9/254 constraints. Problems are: Problem set: 15 solved, 146 unsolved
[2025-06-01 09:49:47] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2025-06-01 09:49:47] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 1 ms to minimize.
[2025-06-01 09:49:47] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 1 ms to minimize.
[2025-06-01 09:49:47] [INFO ] Deduced a trap composed of 28 places in 55 ms of which 1 ms to minimize.
[2025-06-01 09:49:47] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2025-06-01 09:49:47] [INFO ] Deduced a trap composed of 12 places in 79 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/235 variables, 6/260 constraints. Problems are: Problem set: 15 solved, 146 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/235 variables, 0/260 constraints. Problems are: Problem set: 15 solved, 146 unsolved
[2025-06-01 09:49:52] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 1 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/235 variables, 1/261 constraints. Problems are: Problem set: 15 solved, 146 unsolved
[2025-06-01 09:49:56] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/235 variables, 1/262 constraints. Problems are: Problem set: 15 solved, 146 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/235 variables, 0/262 constraints. Problems are: Problem set: 15 solved, 146 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 235/235 variables, and 262 constraints, problems are : Problem set: 15 solved, 146 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 71/71 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 146/161 constraints, Known Traps: 24/24 constraints]
After SMT, in 26676ms problems are : Problem set: 15 solved, 146 unsolved
Search for dead transitions found 15 dead transitions in 26686ms
Found 15 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 15 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 15 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 71/150 places, 162/294 transitions.
Graph (complete) has 295 edges and 71 vertex of which 70 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 69 transition count 161
Applied a total of 3 rules in 14 ms. Remains 69 /71 variables (removed 2) and now considering 161/162 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 26890 ms. Remains : 69/150 places, 161/294 transitions.
RANDOM walk for 4000000 steps (867365 resets) in 23901 ms. (167 steps per ms) remains 3/39 properties
BEST_FIRST walk for 4000004 steps (92266 resets) in 2087 ms. (1915 steps per ms) remains 3/3 properties
BEST_FIRST walk for 4000004 steps (92333 resets) in 2023 ms. (1976 steps per ms) remains 3/3 properties
BEST_FIRST walk for 4000004 steps (92351 resets) in 2042 ms. (1957 steps per ms) remains 3/3 properties
[2025-06-01 09:50:09] [INFO ] Flow matrix only has 148 transitions (discarded 13 similar events)
// Phase 1: matrix 148 rows 69 cols
[2025-06-01 09:50:09] [INFO ] Computed 7 invariants in 1 ms
[2025-06-01 09:50:09] [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) 40/43 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 111/154 variables, 43/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 63/217 variables, 26/76 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/217 variables, 14/90 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/217 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/217 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 217/217 variables, and 90 constraints, problems are : Problem set: 0 solved, 3 unsolved in 136 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 69/69 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) 40/43 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 111/154 variables, 43/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 3/53 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/154 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 63/217 variables, 26/79 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/217 variables, 14/93 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/217 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/217 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 217/217 variables, and 93 constraints, problems are : Problem set: 0 solved, 3 unsolved in 148 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 69/69 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 298ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 67 ms.
Support contains 3 out of 69 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 69/69 places, 161/161 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 69 transition count 149
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 37 place count 44 transition count 104
Iterating global reduction 1 with 25 rules applied. Total rules applied 62 place count 44 transition count 104
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 66 place count 40 transition count 100
Iterating global reduction 1 with 4 rules applied. Total rules applied 70 place count 40 transition count 100
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 73 place count 37 transition count 94
Iterating global reduction 1 with 3 rules applied. Total rules applied 76 place count 37 transition count 94
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 79 place count 34 transition count 88
Iterating global reduction 1 with 3 rules applied. Total rules applied 82 place count 34 transition count 88
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 34 transition count 70
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
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 104 place count 32 transition count 68
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 105 place count 31 transition count 66
Iterating global reduction 2 with 1 rules applied. Total rules applied 106 place count 31 transition count 66
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -9
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 110 place count 29 transition count 75
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 111 place count 29 transition count 75
Applied a total of 111 rules in 21 ms. Remains 29 /69 variables (removed 40) and now considering 75/161 (removed 86) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 29/69 places, 75/161 transitions.
RANDOM walk for 3018898 steps (681228 resets) in 14395 ms. (209 steps per ms) remains 0/3 properties
Able to resolve query StableMarking after proving 125 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK MARKED_SUFFIX_TEST TRIVIAL_UNMARKED_SCC_TEST BESTFIRST_WALK TOPOLOGICAL
Total runtime 52084 ms.
ITS solved all properties within timeout

BK_STOP 1748771416287

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

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