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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 464K
-rw-r--r-- 1 mcc users 5.8K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K 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 18K 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 109K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K 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 1748771460009

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-09
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-06-01 09:51:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2025-06-01 09:51:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 09:51:03] [INFO ] Load time of PNML (sax parser for PT used): 169 ms
[2025-06-01 09:51:03] [INFO ] Transformed 157 places.
[2025-06-01 09:51:03] [INFO ] Transformed 327 transitions.
[2025-06-01 09:51:03] [INFO ] Found NUPN structural information;
[2025-06-01 09:51:03] [INFO ] Parsed PT model containing 157 places and 327 transitions and 859 arcs in 400 ms.
Graph (trivial) has 266 edges and 157 vertex of which 12 / 157 are part of one of the 6 SCC in 7 ms
Free SCC test removed 6 places
Structural test allowed to assert that 31 places are NOT stable. Took 46 ms.
Ensure Unique test removed 32 transitions
Reduce redundant transitions removed 32 transitions.
RANDOM walk for 40000 steps (3223 resets) in 4329 ms. (9 steps per ms) remains 53/126 properties
BEST_FIRST walk for 4003 steps (40 resets) in 47 ms. (83 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (41 resets) in 51 ms. (77 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (43 resets) in 34 ms. (114 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (40 resets) in 43 ms. (91 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (42 resets) in 55 ms. (71 steps per ms) remains 52/53 properties
BEST_FIRST walk for 4003 steps (42 resets) in 37 ms. (105 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (43 resets) in 25 ms. (153 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (42 resets) in 35 ms. (111 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (42 resets) in 20 ms. (190 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (42 resets) in 39 ms. (100 steps per ms) remains 51/52 properties
BEST_FIRST walk for 4004 steps (42 resets) in 44 ms. (88 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (42 resets) in 32 ms. (121 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (40 resets) in 24 ms. (160 steps per ms) remains 50/51 properties
BEST_FIRST walk for 4004 steps (41 resets) in 24 ms. (160 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (43 resets) in 40 ms. (97 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (43 resets) in 12 ms. (308 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (39 resets) in 12 ms. (307 steps per ms) remains 47/50 properties
BEST_FIRST walk for 4004 steps (40 resets) in 13 ms. (286 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (43 resets) in 13 ms. (285 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (44 resets) in 19 ms. (200 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (37 resets) in 16 ms. (235 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (43 resets) in 23 ms. (166 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (39 resets) in 12 ms. (308 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (41 resets) in 19 ms. (200 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (43 resets) in 12 ms. (307 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (43 resets) in 23 ms. (166 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (38 resets) in 16 ms. (235 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (43 resets) in 26 ms. (148 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (44 resets) in 18 ms. (210 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (37 resets) in 15 ms. (250 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (43 resets) in 12 ms. (308 steps per ms) remains 46/47 properties
BEST_FIRST walk for 4004 steps (41 resets) in 12 ms. (308 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (41 resets) in 48 ms. (81 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (45 resets) in 25 ms. (153 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (41 resets) in 20 ms. (190 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (45 resets) in 12 ms. (308 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (43 resets) in 12 ms. (308 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (40 resets) in 12 ms. (308 steps per ms) remains 45/46 properties
BEST_FIRST walk for 4003 steps (42 resets) in 16 ms. (235 steps per ms) remains 43/45 properties
BEST_FIRST walk for 4004 steps (41 resets) in 27 ms. (143 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4002 steps (43 resets) in 15 ms. (250 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4002 steps (41 resets) in 13 ms. (285 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (42 resets) in 15 ms. (250 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (42 resets) in 11 ms. (333 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (43 resets) in 15 ms. (250 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (39 resets) in 11 ms. (333 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (42 resets) in 24 ms. (160 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (43 resets) in 11 ms. (333 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (40 resets) in 25 ms. (154 steps per ms) remains 43/43 properties
[2025-06-01 09:51:05] [INFO ] Flow matrix only has 277 transitions (discarded 18 similar events)
// Phase 1: matrix 277 rows 151 cols
[2025-06-01 09:51:05] [INFO ] Computed 18 invariants in 39 ms
[2025-06-01 09:51:05] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 2 (OVERLAPS) 51/94 variables, 10/53 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 51/104 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 5 (OVERLAPS) 57/151 variables, 8/112 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/151 variables, 57/169 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/151 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 8 (OVERLAPS) 276/427 variables, 151/320 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/427 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 10 (OVERLAPS) 1/428 variables, 1/321 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/428 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 12 (OVERLAPS) 0/428 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Real declared 428/428 variables, and 321 constraints, problems are : Problem set: 0 solved, 43 unsolved in 3670 ms.
Refiners :[Domain max(s): 151/151 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 151/151 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 43 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 2 (OVERLAPS) 51/94 variables, 10/53 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 51/104 constraints. Problems are: Problem set: 0 solved, 43 unsolved
[2025-06-01 09:51:09] [INFO ] Deduced a trap composed of 23 places in 162 ms of which 31 ms to minimize.
[2025-06-01 09:51:09] [INFO ] Deduced a trap composed of 39 places in 114 ms of which 3 ms to minimize.
[2025-06-01 09:51:09] [INFO ] Deduced a trap composed of 41 places in 104 ms of which 3 ms to minimize.
[2025-06-01 09:51:09] [INFO ] Deduced a trap composed of 25 places in 78 ms of which 2 ms to minimize.
[2025-06-01 09:51:10] [INFO ] Deduced a trap composed of 39 places in 95 ms of which 2 ms to minimize.
[2025-06-01 09:51:10] [INFO ] Deduced a trap composed of 41 places in 91 ms of which 2 ms to minimize.
[2025-06-01 09:51:10] [INFO ] Deduced a trap composed of 39 places in 92 ms of which 2 ms to minimize.
[2025-06-01 09:51:10] [INFO ] Deduced a trap composed of 38 places in 90 ms of which 3 ms to minimize.
[2025-06-01 09:51:10] [INFO ] Deduced a trap composed of 38 places in 99 ms of which 2 ms to minimize.
[2025-06-01 09:51:10] [INFO ] Deduced a trap composed of 39 places in 84 ms of which 2 ms to minimize.
[2025-06-01 09:51:10] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 2 ms to minimize.
[2025-06-01 09:51:10] [INFO ] Deduced a trap composed of 41 places in 86 ms of which 2 ms to minimize.
[2025-06-01 09:51:10] [INFO ] Deduced a trap composed of 41 places in 97 ms of which 2 ms to minimize.
[2025-06-01 09:51:11] [INFO ] Deduced a trap composed of 40 places in 116 ms of which 4 ms to minimize.
[2025-06-01 09:51:11] [INFO ] Deduced a trap composed of 39 places in 112 ms of which 6 ms to minimize.
[2025-06-01 09:51:11] [INFO ] Deduced a trap composed of 42 places in 98 ms of which 2 ms to minimize.
[2025-06-01 09:51:11] [INFO ] Deduced a trap composed of 42 places in 112 ms of which 3 ms to minimize.
[2025-06-01 09:51:11] [INFO ] Deduced a trap composed of 41 places in 71 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 18/122 constraints. Problems are: Problem set: 0 solved, 43 unsolved
[2025-06-01 09:51:11] [INFO ] Deduced a trap composed of 39 places in 100 ms of which 2 ms to minimize.
[2025-06-01 09:51:11] [INFO ] Deduced a trap composed of 40 places in 162 ms of which 4 ms to minimize.
[2025-06-01 09:51:12] [INFO ] Deduced a trap composed of 39 places in 87 ms of which 2 ms to minimize.
[2025-06-01 09:51:12] [INFO ] Deduced a trap composed of 40 places in 99 ms of which 3 ms to minimize.
[2025-06-01 09:51:12] [INFO ] Deduced a trap composed of 39 places in 86 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/94 variables, 5/127 constraints. Problems are: Problem set: 0 solved, 43 unsolved
[2025-06-01 09:51:12] [INFO ] Deduced a trap composed of 40 places in 75 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/94 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/94 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 8 (OVERLAPS) 57/151 variables, 8/136 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/151 variables, 57/193 constraints. Problems are: Problem set: 0 solved, 43 unsolved
[2025-06-01 09:51:13] [INFO ] Deduced a trap composed of 42 places in 109 ms of which 2 ms to minimize.
[2025-06-01 09:51:13] [INFO ] Deduced a trap composed of 39 places in 102 ms of which 3 ms to minimize.
[2025-06-01 09:51:13] [INFO ] Deduced a trap composed of 30 places in 104 ms of which 3 ms to minimize.
[2025-06-01 09:51:13] [INFO ] Deduced a trap composed of 40 places in 107 ms of which 3 ms to minimize.
[2025-06-01 09:51:13] [INFO ] Deduced a trap composed of 46 places in 109 ms of which 3 ms to minimize.
[2025-06-01 09:51:13] [INFO ] Deduced a trap composed of 30 places in 108 ms of which 2 ms to minimize.
[2025-06-01 09:51:13] [INFO ] Deduced a trap composed of 30 places in 90 ms of which 2 ms to minimize.
[2025-06-01 09:51:13] [INFO ] Deduced a trap composed of 39 places in 90 ms of which 2 ms to minimize.
[2025-06-01 09:51:13] [INFO ] Deduced a trap composed of 44 places in 104 ms of which 2 ms to minimize.
[2025-06-01 09:51:14] [INFO ] Deduced a trap composed of 32 places in 69 ms of which 2 ms to minimize.
SMT process timed out in 8853ms, After SMT, problems are : Problem set: 0 solved, 43 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 43 out of 151 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 151/151 places, 295/295 transitions.
Graph (complete) has 653 edges and 151 vertex of which 142 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 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 142 transition count 273
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 20 place count 139 transition count 270
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 20 place count 139 transition count 267
Deduced a syphon composed of 3 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 28 place count 134 transition count 267
Discarding 46 places :
Symmetric choice reduction at 2 with 46 rule applications. Total rules 74 place count 88 transition count 175
Iterating global reduction 2 with 46 rules applied. Total rules applied 120 place count 88 transition count 175
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 124 place count 84 transition count 167
Iterating global reduction 2 with 4 rules applied. Total rules applied 128 place count 84 transition count 167
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 134 place count 84 transition count 161
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -37
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 148 place count 77 transition count 198
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 152 place count 77 transition count 194
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 153 place count 77 transition count 193
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 154 place count 76 transition count 193
Applied a total of 154 rules in 135 ms. Remains 76 /151 variables (removed 75) and now considering 193/295 (removed 102) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 168 ms. Remains : 76/151 places, 193/295 transitions.
RANDOM walk for 4000000 steps (1217952 resets) in 29486 ms. (135 steps per ms) remains 38/43 properties
BEST_FIRST walk for 400004 steps (14637 resets) in 400 ms. (997 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400003 steps (14599 resets) in 397 ms. (1005 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (14454 resets) in 396 ms. (1007 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (14569 resets) in 398 ms. (1002 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (14482 resets) in 434 ms. (919 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (14619 resets) in 402 ms. (992 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400003 steps (14454 resets) in 414 ms. (963 steps per ms) remains 32/38 properties
BEST_FIRST walk for 400003 steps (14437 resets) in 399 ms. (1000 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400004 steps (14454 resets) in 451 ms. (884 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400003 steps (14553 resets) in 380 ms. (1049 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400003 steps (14593 resets) in 380 ms. (1049 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400004 steps (14499 resets) in 376 ms. (1061 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400003 steps (14508 resets) in 384 ms. (1038 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400004 steps (14525 resets) in 380 ms. (1049 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400002 steps (14576 resets) in 382 ms. (1044 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400004 steps (14589 resets) in 377 ms. (1058 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400004 steps (14421 resets) in 383 ms. (1041 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400004 steps (14476 resets) in 382 ms. (1044 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400004 steps (14494 resets) in 382 ms. (1044 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400004 steps (14575 resets) in 379 ms. (1052 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400004 steps (14550 resets) in 373 ms. (1069 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400004 steps (14504 resets) in 379 ms. (1052 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400003 steps (14533 resets) in 386 ms. (1033 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400004 steps (14409 resets) in 394 ms. (1012 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400004 steps (14575 resets) in 379 ms. (1052 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400004 steps (14605 resets) in 372 ms. (1072 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400004 steps (14443 resets) in 381 ms. (1047 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400004 steps (14598 resets) in 378 ms. (1055 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400004 steps (14556 resets) in 378 ms. (1055 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400004 steps (14463 resets) in 379 ms. (1052 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400004 steps (14550 resets) in 372 ms. (1072 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400003 steps (14476 resets) in 378 ms. (1055 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400003 steps (14495 resets) in 379 ms. (1052 steps per ms) remains 32/32 properties
[2025-06-01 09:51:25] [INFO ] Flow matrix only has 177 transitions (discarded 16 similar events)
// Phase 1: matrix 177 rows 76 cols
[2025-06-01 09:51:25] [INFO ] Computed 7 invariants in 2 ms
[2025-06-01 09:51:25] [INFO ] State equation strengthened by 15 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 8/40 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (OVERLAPS) 36/76 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (OVERLAPS) 177/253 variables, 76/83 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/253 variables, 15/98 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/253 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (OVERLAPS) 0/253 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Real declared 253/253 variables, and 98 constraints, problems are : Problem set: 0 solved, 32 unsolved in 1109 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 76/76 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 32 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 8/40 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (OVERLAPS) 36/76 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (OVERLAPS) 177/253 variables, 76/83 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/253 variables, 15/98 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/253 variables, 32/130 constraints. Problems are: Problem set: 0 solved, 32 unsolved
[2025-06-01 09:51:27] [INFO ] Deduced a trap composed of 24 places in 126 ms of which 25 ms to minimize.
[2025-06-01 09:51:27] [INFO ] Deduced a trap composed of 35 places in 126 ms of which 2 ms to minimize.
[2025-06-01 09:51:28] [INFO ] Deduced a trap composed of 34 places in 76 ms of which 2 ms to minimize.
[2025-06-01 09:51:28] [INFO ] Deduced a trap composed of 34 places in 74 ms of which 2 ms to minimize.
[2025-06-01 09:51:28] [INFO ] Deduced a trap composed of 31 places in 68 ms of which 2 ms to minimize.
[2025-06-01 09:51:28] [INFO ] Deduced a trap composed of 32 places in 69 ms of which 4 ms to minimize.
[2025-06-01 09:51:28] [INFO ] Deduced a trap composed of 24 places in 73 ms of which 2 ms to minimize.
[2025-06-01 09:51:28] [INFO ] Deduced a trap composed of 24 places in 70 ms of which 1 ms to minimize.
[2025-06-01 09:51:28] [INFO ] Deduced a trap composed of 35 places in 90 ms of which 1 ms to minimize.
[2025-06-01 09:51:28] [INFO ] Deduced a trap composed of 36 places in 92 ms of which 2 ms to minimize.
[2025-06-01 09:51:28] [INFO ] Deduced a trap composed of 19 places in 79 ms of which 2 ms to minimize.
[2025-06-01 09:51:28] [INFO ] Deduced a trap composed of 35 places in 87 ms of which 2 ms to minimize.
[2025-06-01 09:51:28] [INFO ] Deduced a trap composed of 37 places in 89 ms of which 2 ms to minimize.
[2025-06-01 09:51:29] [INFO ] Deduced a trap composed of 24 places in 74 ms of which 2 ms to minimize.
[2025-06-01 09:51:29] [INFO ] Deduced a trap composed of 35 places in 79 ms of which 2 ms to minimize.
[2025-06-01 09:51:29] [INFO ] Deduced a trap composed of 19 places in 79 ms of which 2 ms to minimize.
[2025-06-01 09:51:29] [INFO ] Deduced a trap composed of 34 places in 80 ms of which 1 ms to minimize.
[2025-06-01 09:51:29] [INFO ] Deduced a trap composed of 37 places in 79 ms of which 2 ms to minimize.
[2025-06-01 09:51:29] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 1 ms to minimize.
[2025-06-01 09:51:29] [INFO ] Deduced a trap composed of 19 places in 91 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/253 variables, 20/150 constraints. Problems are: Problem set: 0 solved, 32 unsolved
[2025-06-01 09:51:30] [INFO ] Deduced a trap composed of 33 places in 70 ms of which 1 ms to minimize.
[2025-06-01 09:51:30] [INFO ] Deduced a trap composed of 18 places in 66 ms of which 6 ms to minimize.
[2025-06-01 09:51:30] [INFO ] Deduced a trap composed of 32 places in 62 ms of which 2 ms to minimize.
[2025-06-01 09:51:30] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/253 variables, 4/154 constraints. Problems are: Problem set: 0 solved, 32 unsolved
[2025-06-01 09:51:30] [INFO ] Deduced a trap composed of 32 places in 72 ms of which 2 ms to minimize.
[2025-06-01 09:51:30] [INFO ] Deduced a trap composed of 32 places in 49 ms of which 1 ms to minimize.
[2025-06-01 09:51:30] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 1 ms to minimize.
[2025-06-01 09:51:30] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
[2025-06-01 09:51:31] [INFO ] Deduced a trap composed of 33 places in 48 ms of which 1 ms to minimize.
[2025-06-01 09:51:31] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/253 variables, 6/160 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/253 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 32 unsolved
[2025-06-01 09:51:31] [INFO ] Deduced a trap composed of 33 places in 44 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/253 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 32 unsolved
[2025-06-01 09:51:32] [INFO ] Deduced a trap composed of 33 places in 61 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/253 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/253 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 32 unsolved
[2025-06-01 09:51:33] [INFO ] Deduced a trap composed of 33 places in 72 ms of which 1 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/253 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/253 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 17 (OVERLAPS) 0/253 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Int declared 253/253 variables, and 163 constraints, problems are : Problem set: 0 solved, 32 unsolved in 7930 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 76/76 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 33/33 constraints]
After SMT, in 9061ms problems are : Problem set: 0 solved, 32 unsolved
Fused 32 Parikh solutions to 21 different solutions.
Parikh walk visited 29 properties in 1337 ms.
Support contains 3 out of 76 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 76/76 places, 193/193 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 76 transition count 190
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 7 place count 73 transition count 189
Discarding 26 places :
Symmetric choice reduction at 2 with 26 rule applications. Total rules 33 place count 47 transition count 137
Iterating global reduction 2 with 26 rules applied. Total rules applied 59 place count 47 transition count 137
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 64 place count 42 transition count 127
Iterating global reduction 2 with 5 rules applied. Total rules applied 69 place count 42 transition count 127
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 72 place count 39 transition count 118
Iterating global reduction 2 with 3 rules applied. Total rules applied 75 place count 39 transition count 118
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 78 place count 36 transition count 109
Iterating global reduction 2 with 3 rules applied. Total rules applied 81 place count 36 transition count 109
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 99 place count 36 transition count 91
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 3 with 2 rules applied. Total rules applied 101 place count 35 transition count 90
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 107 place count 32 transition count 102
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 108 place count 32 transition count 101
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 109 place count 31 transition count 97
Iterating global reduction 3 with 1 rules applied. Total rules applied 110 place count 31 transition count 97
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 116 place count 31 transition count 91
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 125 place count 31 transition count 91
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 133 place count 31 transition count 91
Applied a total of 133 rules in 37 ms. Remains 31 /76 variables (removed 45) and now considering 91/193 (removed 102) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 31/76 places, 91/193 transitions.
RANDOM walk for 4000000 steps (1328395 resets) in 14751 ms. (271 steps per ms) remains 3/3 properties
BEST_FIRST walk for 4000004 steps (147693 resets) in 2148 ms. (1861 steps per ms) remains 3/3 properties
BEST_FIRST walk for 4000003 steps (147659 resets) in 2323 ms. (1721 steps per ms) remains 3/3 properties
BEST_FIRST walk for 4000003 steps (147641 resets) in 2011 ms. (1988 steps per ms) remains 3/3 properties
Finished probabilistic random walk after 2180 steps, run visited all 3 properties in 29 ms. (steps per millisecond=75 )
Probabilistic random walk after 2180 steps, saw 796 distinct states, run finished after 36 ms. (steps per millisecond=60 ) properties seen :3
Able to resolve query StableMarking after proving 128 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PARIKH_WALK PROBABILISTIC_WALK MARKED_SUFFIX_TEST TRIVIAL_UNMARKED_SCC_TEST BESTFIRST_WALK TOPOLOGICAL
Total runtime 39555 ms.
ITS solved all properties within timeout

BK_STOP 1748771502322

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

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