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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 464K
-rw-r--r-- 1 mcc users 6.4K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 34K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K 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 9.2K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 95K 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 47K 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 1748770931454

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-02
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-06-01 09:42:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2025-06-01 09:42:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 09:42:14] [INFO ] Load time of PNML (sax parser for PT used): 135 ms
[2025-06-01 09:42:14] [INFO ] Transformed 119 places.
[2025-06-01 09:42:14] [INFO ] Transformed 225 transitions.
[2025-06-01 09:42:14] [INFO ] Found NUPN structural information;
[2025-06-01 09:42:14] [INFO ] Parsed PT model containing 119 places and 225 transitions and 577 arcs in 300 ms.
Graph (trivial) has 182 edges and 119 vertex of which 12 / 119 are part of one of the 6 SCC in 7 ms
Free SCC test removed 6 places
Structural test allowed to assert that 29 places are NOT stable. Took 53 ms.
Ensure Unique test removed 12 transitions
Reduce redundant transitions removed 12 transitions.
RANDOM walk for 40000 steps (3241 resets) in 3107 ms. (12 steps per ms) remains 27/90 properties
BEST_FIRST walk for 4004 steps (41 resets) in 47 ms. (83 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (42 resets) in 23 ms. (166 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (43 resets) in 21 ms. (182 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (41 resets) in 37 ms. (105 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (46 resets) in 21 ms. (182 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (40 resets) in 40 ms. (97 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (44 resets) in 36 ms. (108 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (46 resets) in 19 ms. (200 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (45 resets) in 26 ms. (148 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (44 resets) in 16 ms. (235 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (46 resets) in 14 ms. (266 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (45 resets) in 22 ms. (174 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (45 resets) in 25 ms. (153 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (44 resets) in 31 ms. (125 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (40 resets) in 28 ms. (138 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (42 resets) in 15 ms. (250 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (45 resets) in 13 ms. (285 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (43 resets) in 21 ms. (181 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (43 resets) in 13 ms. (286 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (40 resets) in 13 ms. (286 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (44 resets) in 25 ms. (154 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (44 resets) in 14 ms. (266 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (43 resets) in 15 ms. (250 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (43 resets) in 24 ms. (160 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (42 resets) in 12 ms. (307 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (43 resets) in 29 ms. (133 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (41 resets) in 25 ms. (154 steps per ms) remains 23/27 properties
[2025-06-01 09:42:15] [INFO ] Flow matrix only has 199 transitions (discarded 14 similar events)
// Phase 1: matrix 199 rows 113 cols
[2025-06-01 09:42:15] [INFO ] Computed 14 invariants in 25 ms
[2025-06-01 09:42:15] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (OVERLAPS) 54/77 variables, 8/31 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 54/85 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (OVERLAPS) 36/113 variables, 6/91 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 36/127 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/113 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 8 (OVERLAPS) 198/311 variables, 113/240 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/311 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 10 (OVERLAPS) 1/312 variables, 1/241 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/312 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 12 (OVERLAPS) 0/312 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Real declared 312/312 variables, and 241 constraints, problems are : Problem set: 0 solved, 23 unsolved in 1633 ms.
Refiners :[Domain max(s): 113/113 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 113/113 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 23 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (OVERLAPS) 54/77 variables, 8/31 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 54/85 constraints. Problems are: Problem set: 0 solved, 23 unsolved
[2025-06-01 09:42:17] [INFO ] Deduced a trap composed of 40 places in 174 ms of which 40 ms to minimize.
[2025-06-01 09:42:18] [INFO ] Deduced a trap composed of 40 places in 120 ms of which 3 ms to minimize.
[2025-06-01 09:42:18] [INFO ] Deduced a trap composed of 40 places in 113 ms of which 2 ms to minimize.
[2025-06-01 09:42:18] [INFO ] Deduced a trap composed of 40 places in 97 ms of which 2 ms to minimize.
[2025-06-01 09:42:18] [INFO ] Deduced a trap composed of 40 places in 100 ms of which 2 ms to minimize.
[2025-06-01 09:42:18] [INFO ] Deduced a trap composed of 38 places in 90 ms of which 2 ms to minimize.
[2025-06-01 09:42:18] [INFO ] Deduced a trap composed of 38 places in 87 ms of which 2 ms to minimize.
[2025-06-01 09:42:18] [INFO ] Deduced a trap composed of 40 places in 78 ms of which 2 ms to minimize.
[2025-06-01 09:42:18] [INFO ] Deduced a trap composed of 40 places in 81 ms of which 2 ms to minimize.
[2025-06-01 09:42:18] [INFO ] Deduced a trap composed of 37 places in 63 ms of which 1 ms to minimize.
[2025-06-01 09:42:19] [INFO ] Deduced a trap composed of 38 places in 69 ms of which 2 ms to minimize.
[2025-06-01 09:42:19] [INFO ] Deduced a trap composed of 38 places in 78 ms of which 1 ms to minimize.
[2025-06-01 09:42:19] [INFO ] Deduced a trap composed of 41 places in 70 ms of which 2 ms to minimize.
[2025-06-01 09:42:19] [INFO ] Deduced a trap composed of 41 places in 51 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 14/99 constraints. Problems are: Problem set: 0 solved, 23 unsolved
[2025-06-01 09:42:19] [INFO ] Deduced a trap composed of 41 places in 67 ms of which 2 ms to minimize.
[2025-06-01 09:42:19] [INFO ] Deduced a trap composed of 38 places in 67 ms of which 2 ms to minimize.
[2025-06-01 09:42:19] [INFO ] Deduced a trap composed of 39 places in 71 ms of which 1 ms to minimize.
[2025-06-01 09:42:19] [INFO ] Deduced a trap composed of 41 places in 79 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/77 variables, 4/103 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/77 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 7 (OVERLAPS) 36/113 variables, 6/109 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/113 variables, 36/145 constraints. Problems are: Problem set: 0 solved, 23 unsolved
[2025-06-01 09:42:19] [INFO ] Deduced a trap composed of 32 places in 82 ms of which 3 ms to minimize.
[2025-06-01 09:42:20] [INFO ] Deduced a trap composed of 35 places in 78 ms of which 3 ms to minimize.
[2025-06-01 09:42:20] [INFO ] Deduced a trap composed of 35 places in 86 ms of which 2 ms to minimize.
[2025-06-01 09:42:20] [INFO ] Deduced a trap composed of 35 places in 82 ms of which 2 ms to minimize.
[2025-06-01 09:42:20] [INFO ] Deduced a trap composed of 33 places in 82 ms of which 2 ms to minimize.
[2025-06-01 09:42:20] [INFO ] Deduced a trap composed of 35 places in 126 ms of which 2 ms to minimize.
[2025-06-01 09:42:20] [INFO ] Deduced a trap composed of 33 places in 84 ms of which 2 ms to minimize.
[2025-06-01 09:42:20] [INFO ] Deduced a trap composed of 33 places in 91 ms of which 3 ms to minimize.
[2025-06-01 09:42:20] [INFO ] Deduced a trap composed of 34 places in 116 ms of which 2 ms to minimize.
[2025-06-01 09:42:20] [INFO ] Deduced a trap composed of 45 places in 111 ms of which 3 ms to minimize.
[2025-06-01 09:42:21] [INFO ] Deduced a trap composed of 45 places in 113 ms of which 3 ms to minimize.
[2025-06-01 09:42:21] [INFO ] Deduced a trap composed of 35 places in 94 ms of which 3 ms to minimize.
[2025-06-01 09:42:21] [INFO ] Deduced a trap composed of 33 places in 78 ms of which 2 ms to minimize.
[2025-06-01 09:42:21] [INFO ] Deduced a trap composed of 32 places in 62 ms of which 1 ms to minimize.
[2025-06-01 09:42:21] [INFO ] Deduced a trap composed of 33 places in 61 ms of which 2 ms to minimize.
[2025-06-01 09:42:21] [INFO ] Deduced a trap composed of 34 places in 70 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/113 variables, 16/161 constraints. Problems are: Problem set: 0 solved, 23 unsolved
[2025-06-01 09:42:21] [INFO ] Deduced a trap composed of 25 places in 81 ms of which 2 ms to minimize.
[2025-06-01 09:42:21] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 2 ms to minimize.
[2025-06-01 09:42:21] [INFO ] Deduced a trap composed of 34 places in 88 ms of which 2 ms to minimize.
[2025-06-01 09:42:21] [INFO ] Deduced a trap composed of 35 places in 69 ms of which 2 ms to minimize.
[2025-06-01 09:42:21] [INFO ] Deduced a trap composed of 34 places in 88 ms of which 2 ms to minimize.
[2025-06-01 09:42:22] [INFO ] Deduced a trap composed of 39 places in 69 ms of which 4 ms to minimize.
[2025-06-01 09:42:22] [INFO ] Deduced a trap composed of 34 places in 65 ms of which 1 ms to minimize.
[2025-06-01 09:42:22] [INFO ] Deduced a trap composed of 40 places in 102 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/113 variables, 8/169 constraints. Problems are: Problem set: 0 solved, 23 unsolved
[2025-06-01 09:42:22] [INFO ] Deduced a trap composed of 35 places in 57 ms of which 2 ms to minimize.
[2025-06-01 09:42:22] [INFO ] Deduced a trap composed of 8 places in 68 ms of which 1 ms to minimize.
[2025-06-01 09:42:22] [INFO ] Deduced a trap composed of 39 places in 56 ms of which 1 ms to minimize.
[2025-06-01 09:42:22] [INFO ] Deduced a trap composed of 39 places in 57 ms of which 1 ms to minimize.
SMT process timed out in 6790ms, After SMT, problems are : Problem set: 0 solved, 23 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 23 out of 113 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 113/113 places, 213/213 transitions.
Graph (complete) has 415 edges and 113 vertex of which 106 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.2 ms
Discarding 7 places :
Also discarding 7 output transitions
Drop transitions (Output transitions of discarded places.) removed 7 transitions
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 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 13 rules applied. Total rules applied 14 place count 106 transition count 193
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 26 place count 101 transition count 186
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 29 place count 99 transition count 185
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 29 place count 99 transition count 182
Deduced a syphon composed of 3 places in 0 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 37 place count 94 transition count 182
Discarding 32 places :
Symmetric choice reduction at 3 with 32 rule applications. Total rules 69 place count 62 transition count 118
Iterating global reduction 3 with 32 rules applied. Total rules applied 101 place count 62 transition count 118
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 104 place count 59 transition count 112
Iterating global reduction 3 with 3 rules applied. Total rules applied 107 place count 59 transition count 112
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 108 place count 59 transition count 111
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -34
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 118 place count 54 transition count 145
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 121 place count 54 transition count 142
Partial Free-agglomeration rule applied 19 times.
Drop transitions (Partial Free agglomeration) removed 19 transitions
Iterating global reduction 4 with 19 rules applied. Total rules applied 140 place count 54 transition count 142
Partial Free-agglomeration rule applied 18 times.
Drop transitions (Partial Free agglomeration) removed 18 transitions
Iterating global reduction 4 with 18 rules applied. Total rules applied 158 place count 54 transition count 142
Applied a total of 158 rules in 80 ms. Remains 54 /113 variables (removed 59) and now considering 142/213 (removed 71) transitions.
Running 126 sub problems to find dead transitions.
[2025-06-01 09:42:22] [INFO ] Flow matrix only has 138 transitions (discarded 4 similar events)
// Phase 1: matrix 138 rows 54 cols
[2025-06-01 09:42:22] [INFO ] Computed 5 invariants in 6 ms
[2025-06-01 09:42:22] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (OVERLAPS) 2/54 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 126 unsolved
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
At refinement iteration 4 (OVERLAPS) 138/192 variables, 54/59 constraints. Problems are: Problem set: 19 solved, 107 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/192 variables, 20/79 constraints. Problems are: Problem set: 19 solved, 107 unsolved
[2025-06-01 09:42:24] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 1/80 constraints. Problems are: Problem set: 19 solved, 107 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 0/80 constraints. Problems are: Problem set: 19 solved, 107 unsolved
[2025-06-01 09:42:25] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 2 ms to minimize.
[2025-06-01 09:42:25] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 2 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/192 variables, 2/82 constraints. Problems are: Problem set: 19 solved, 107 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/192 variables, 0/82 constraints. Problems are: Problem set: 19 solved, 107 unsolved
[2025-06-01 09:42:26] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 0 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/192 variables, 1/83 constraints. Problems are: Problem set: 19 solved, 107 unsolved
[2025-06-01 09:42:27] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 3 ms to minimize.
[2025-06-01 09:42:27] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/192 variables, 2/85 constraints. Problems are: Problem set: 19 solved, 107 unsolved
[2025-06-01 09:42:27] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/192 variables, 1/86 constraints. Problems are: Problem set: 19 solved, 107 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/192 variables, 0/86 constraints. Problems are: Problem set: 19 solved, 107 unsolved
At refinement iteration 14 (OVERLAPS) 0/192 variables, 0/86 constraints. Problems are: Problem set: 19 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 86 constraints, problems are : Problem set: 19 solved, 107 unsolved in 6958 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 54/54 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 19 solved, 107 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 19 solved, 107 unsolved
At refinement iteration 1 (OVERLAPS) 2/53 variables, 1/1 constraints. Problems are: Problem set: 19 solved, 107 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 19 solved, 107 unsolved
At refinement iteration 3 (OVERLAPS) 1/54 variables, 4/5 constraints. Problems are: Problem set: 19 solved, 107 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 7/12 constraints. Problems are: Problem set: 19 solved, 107 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/12 constraints. Problems are: Problem set: 19 solved, 107 unsolved
At refinement iteration 6 (OVERLAPS) 138/192 variables, 54/66 constraints. Problems are: Problem set: 19 solved, 107 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 20/86 constraints. Problems are: Problem set: 19 solved, 107 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/192 variables, 107/193 constraints. Problems are: Problem set: 19 solved, 107 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/192 variables, 0/193 constraints. Problems are: Problem set: 19 solved, 107 unsolved
At refinement iteration 10 (OVERLAPS) 0/192 variables, 0/193 constraints. Problems are: Problem set: 19 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/192 variables, and 193 constraints, problems are : Problem set: 19 solved, 107 unsolved in 4994 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 54/54 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 107/126 constraints, Known Traps: 7/7 constraints]
After SMT, in 12204ms problems are : Problem set: 19 solved, 107 unsolved
Search for dead transitions found 19 dead transitions in 12211ms
Found 19 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 19 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 19 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 54/113 places, 123/213 transitions.
Graph (complete) has 175 edges and 54 vertex of which 53 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 53 transition count 123
Applied a total of 3 rules in 10 ms. Remains 53 /54 variables (removed 1) and now considering 123/123 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 12322 ms. Remains : 53/113 places, 123/213 transitions.
RANDOM walk for 255596 steps (84092 resets) in 3367 ms. (75 steps per ms) remains 0/23 properties
Able to resolve query StableMarking after proving 92 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK MARKED_SUFFIX_TEST TRIVIAL_UNMARKED_SCC_TEST BESTFIRST_WALK TOPOLOGICAL
Total runtime 22283 ms.
ITS solved all properties within timeout

BK_STOP 1748770956379

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

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