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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 5.7K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K 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.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 10K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 104K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K 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 125K 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 QuasiLiveness

=== Now, execution of the tool begins

BK_START 1748772062535

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=HealthRecord-PT-16
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-06-01 10:01:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2025-06-01 10:01:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 10:01:05] [INFO ] Load time of PNML (sax parser for PT used): 153 ms
[2025-06-01 10:01:05] [INFO ] Transformed 453 places.
[2025-06-01 10:01:05] [INFO ] Transformed 594 transitions.
[2025-06-01 10:01:05] [INFO ] Found NUPN structural information;
[2025-06-01 10:01:05] [INFO ] Parsed PT model containing 453 places and 594 transitions and 1333 arcs in 349 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 453/453 places, 594/594 transitions.
Graph (trivial) has 536 edges and 453 vertex of which 49 / 453 are part of one of the 17 SCC in 7 ms
Free SCC test removed 32 places
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 218 transitions
Trivial Post-agglo rules discarded 218 transitions
Performed 218 trivial Post agglomeration. Transition count delta: 218
Iterating post reduction 0 with 218 rules applied. Total rules applied 219 place count 421 transition count 341
Reduce places removed 218 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 1 with 245 rules applied. Total rules applied 464 place count 203 transition count 314
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 475 place count 192 transition count 314
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 475 place count 192 transition count 305
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 493 place count 183 transition count 305
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 0 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 3 with 150 rules applied. Total rules applied 643 place count 108 transition count 230
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: -42
Deduced a syphon composed of 23 places in 1 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 689 place count 85 transition count 272
Applied a total of 689 rules in 127 ms. Remains 85 /453 variables (removed 368) and now considering 272/594 (removed 322) transitions.
[2025-06-01 10:01:05] [INFO ] Flow matrix only has 250 transitions (discarded 22 similar events)
// Phase 1: matrix 250 rows 85 cols
[2025-06-01 10:01:05] [INFO ] Computed 14 invariants in 22 ms
[2025-06-01 10:01:05] [INFO ] Implicit Places using invariants in 349 ms returned []
[2025-06-01 10:01:05] [INFO ] Flow matrix only has 250 transitions (discarded 22 similar events)
[2025-06-01 10:01:05] [INFO ] Invariant cache hit.
[2025-06-01 10:01:06] [INFO ] State equation strengthened by 14 read => feed constraints.
[2025-06-01 10:01:06] [INFO ] Implicit Places using invariants and state equation in 296 ms returned []
Implicit Place search using SMT with State Equation took 691 ms to find 0 implicit places.
Running 252 sub problems to find dead transitions.
[2025-06-01 10:01:06] [INFO ] Flow matrix only has 250 transitions (discarded 22 similar events)
[2025-06-01 10:01:06] [INFO ] Invariant cache hit.
[2025-06-01 10:01:06] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 84/84 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (OVERLAPS) 1/85 variables, 8/92 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 6/99 constraints. Problems are: Problem set: 0 solved, 252 unsolved
[2025-06-01 10:01:09] [INFO ] Deduced a trap composed of 31 places in 111 ms of which 20 ms to minimize.
[2025-06-01 10:01:09] [INFO ] Deduced a trap composed of 31 places in 157 ms of which 2 ms to minimize.
[2025-06-01 10:01:10] [INFO ] Deduced a trap composed of 10 places in 107 ms of which 3 ms to minimize.
[2025-06-01 10:01:10] [INFO ] Deduced a trap composed of 8 places in 97 ms of which 3 ms to minimize.
[2025-06-01 10:01:12] [INFO ] Deduced a trap composed of 12 places in 2270 ms of which 30 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 5/104 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/85 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 7 (OVERLAPS) 249/334 variables, 85/189 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/334 variables, 13/202 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/334 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 10 (OVERLAPS) 1/335 variables, 1/203 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/335 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 12 (OVERLAPS) 0/335 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 252 unsolved
No progress, stopping.
After SMT solving in domain Real declared 335/335 variables, and 203 constraints, problems are : Problem set: 0 solved, 252 unsolved in 19340 ms.
Refiners :[Domain max(s): 85/85 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 85/85 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 252/252 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 252 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 84/84 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (OVERLAPS) 1/85 variables, 8/92 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 6/99 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 5/104 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/85 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 7 (OVERLAPS) 249/334 variables, 85/189 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/334 variables, 13/202 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/334 variables, 252/454 constraints. Problems are: Problem set: 0 solved, 252 unsolved
[2025-06-01 10:01:33] [INFO ] Deduced a trap composed of 20 places in 73 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/334 variables, 1/455 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/334 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 12 (OVERLAPS) 1/335 variables, 1/456 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/335 variables, 0/456 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 14 (OVERLAPS) 0/335 variables, 0/456 constraints. Problems are: Problem set: 0 solved, 252 unsolved
No progress, stopping.
After SMT solving in domain Int declared 335/335 variables, and 456 constraints, problems are : Problem set: 0 solved, 252 unsolved in 22769 ms.
Refiners :[Domain max(s): 85/85 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 85/85 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 252/252 constraints, Known Traps: 6/6 constraints]
After SMT, in 43043ms problems are : Problem set: 0 solved, 252 unsolved
Search for dead transitions found 0 dead transitions in 43083ms
Starting structural reductions in LIVENESS mode, iteration 1 : 85/453 places, 272/594 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 43951 ms. Remains : 85/453 places, 272/594 transitions.
Discarding 198 transitions out of 272. Remains 74
Initial state reduction rules removed 1 formulas.
RANDOM walk for 40000 steps (4200 resets) in 2592 ms. (15 steps per ms) remains 26/73 properties
BEST_FIRST walk for 4003 steps (35 resets) in 23 ms. (166 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (38 resets) in 22 ms. (174 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (36 resets) in 16 ms. (235 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (23 resets) in 20 ms. (190 steps per ms) remains 25/26 properties
BEST_FIRST walk for 4003 steps (34 resets) in 18 ms. (210 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (32 resets) in 21 ms. (182 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (31 resets) in 17 ms. (222 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (31 resets) in 23 ms. (166 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (23 resets) in 18 ms. (210 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (23 resets) in 11 ms. (333 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (64 resets) in 32 ms. (121 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (37 resets) in 18 ms. (210 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (32 resets) in 21 ms. (182 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (37 resets) in 18 ms. (210 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (40 resets) in 21 ms. (181 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (39 resets) in 15 ms. (250 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (34 resets) in 22 ms. (174 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (36 resets) in 17 ms. (222 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (35 resets) in 19 ms. (200 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (37 resets) in 17 ms. (222 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (37 resets) in 18 ms. (210 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (37 resets) in 15 ms. (250 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (37 resets) in 41 ms. (95 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (36 resets) in 14 ms. (266 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (37 resets) in 14 ms. (266 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (39 resets) in 16 ms. (235 steps per ms) remains 25/25 properties
[2025-06-01 10:01:50] [INFO ] Flow matrix only has 250 transitions (discarded 22 similar events)
[2025-06-01 10:01:50] [INFO ] Invariant cache hit.
[2025-06-01 10:01:50] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 2 (OVERLAPS) 21/56 variables, 8/43 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 21/64 constraints. Problems are: Problem set: 0 solved, 25 unsolved
[2025-06-01 10:01:50] [INFO ] Deduced a trap composed of 31 places in 49 ms of which 2 ms to minimize.
[2025-06-01 10:01:50] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 1 ms to minimize.
[2025-06-01 10:01:50] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 3/67 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 6 (OVERLAPS) 29/85 variables, 6/73 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/85 variables, 29/102 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/85 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 9 (OVERLAPS) 249/334 variables, 85/187 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/334 variables, 13/200 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/334 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 12 (OVERLAPS) 1/335 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/335 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 14 (OVERLAPS) 0/335 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Real declared 335/335 variables, and 201 constraints, problems are : Problem set: 0 solved, 25 unsolved in 2133 ms.
Refiners :[Domain max(s): 85/85 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 85/85 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 25 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 2 (OVERLAPS) 21/56 variables, 8/43 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 21/64 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 3/67 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 6 (OVERLAPS) 29/85 variables, 6/73 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/85 variables, 29/102 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/85 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 9 (OVERLAPS) 249/334 variables, 85/187 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/334 variables, 13/200 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/334 variables, 25/225 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/334 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 13 (OVERLAPS) 1/335 variables, 1/226 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/335 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 15 (OVERLAPS) 0/335 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Int declared 335/335 variables, and 226 constraints, problems are : Problem set: 0 solved, 25 unsolved in 2426 ms.
Refiners :[Domain max(s): 85/85 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 85/85 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 3/3 constraints]
After SMT, in 4617ms problems are : Problem set: 0 solved, 25 unsolved
Fused 25 Parikh solutions to 24 different solutions.
Parikh walk visited 17 properties in 1508 ms.
Support contains 17 out of 85 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 272/272 transitions.
Graph (complete) has 407 edges and 85 vertex of which 78 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.8 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 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 78 transition count 255
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 19 place count 70 transition count 215
Iterating global reduction 1 with 8 rules applied. Total rules applied 27 place count 70 transition count 215
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 33 place count 64 transition count 203
Iterating global reduction 1 with 6 rules applied. Total rules applied 39 place count 64 transition count 203
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 42 place count 64 transition count 200
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 43 place count 63 transition count 193
Iterating global reduction 2 with 1 rules applied. Total rules applied 44 place count 63 transition count 193
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 46 place count 63 transition count 191
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 3 with 20 rules applied. Total rules applied 66 place count 63 transition count 171
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 67 place count 62 transition count 166
Iterating global reduction 3 with 1 rules applied. Total rules applied 68 place count 62 transition count 166
Free-agglomeration rule applied 13 times.
Iterating global reduction 3 with 13 rules applied. Total rules applied 81 place count 62 transition count 153
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 3 with 13 rules applied. Total rules applied 94 place count 49 transition count 153
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 4 with 18 rules applied. Total rules applied 112 place count 49 transition count 135
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 114 place count 48 transition count 143
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 115 place count 48 transition count 143
Applied a total of 115 rules in 79 ms. Remains 48 /85 variables (removed 37) and now considering 143/272 (removed 129) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 81 ms. Remains : 48/85 places, 143/272 transitions.
RANDOM walk for 4000000 steps (432208 resets) in 12610 ms. (317 steps per ms) remains 5/8 properties
BEST_FIRST walk for 4000004 steps (57320 resets) in 3229 ms. (1238 steps per ms) remains 5/5 properties
BEST_FIRST walk for 4000004 steps (57367 resets) in 2070 ms. (1931 steps per ms) remains 4/5 properties
BEST_FIRST walk for 4000003 steps (63535 resets) in 2547 ms. (1569 steps per ms) remains 4/4 properties
BEST_FIRST walk for 4000002 steps (56662 resets) in 2109 ms. (1895 steps per ms) remains 4/4 properties
[2025-06-01 10:02:02] [INFO ] Flow matrix only has 130 transitions (discarded 13 similar events)
// Phase 1: matrix 130 rows 48 cols
[2025-06-01 10:02:02] [INFO ] Computed 7 invariants in 6 ms
[2025-06-01 10:02:02] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 5/17 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 31/48 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 130/178 variables, 48/55 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/178 variables, 10/65 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/178 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 0/178 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 178/178 variables, and 65 constraints, problems are : Problem set: 0 solved, 4 unsolved in 184 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 48/48 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 5/17 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 31/48 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 130/178 variables, 48/55 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/178 variables, 10/65 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/178 variables, 4/69 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/178 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 0/178 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 178/178 variables, and 69 constraints, problems are : Problem set: 0 solved, 4 unsolved in 283 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 48/48 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 498ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 1 properties in 333 ms.
Support contains 10 out of 48 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 48/48 places, 143/143 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 45 transition count 132
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 45 transition count 132
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 45 transition count 131
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 44 transition count 129
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 44 transition count 129
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 43 transition count 122
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 43 transition count 122
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 13 place count 43 transition count 120
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 15 place count 43 transition count 118
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 19 place count 41 transition count 116
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 23 place count 41 transition count 112
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 28 place count 41 transition count 112
Applied a total of 28 rules in 39 ms. Remains 41 /48 variables (removed 7) and now considering 112/143 (removed 31) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 41/48 places, 112/143 transitions.
RANDOM walk for 4000000 steps (416723 resets) in 10336 ms. (386 steps per ms) remains 3/3 properties
BEST_FIRST walk for 4000004 steps (54736 resets) in 2058 ms. (1942 steps per ms) remains 3/3 properties
BEST_FIRST walk for 4000004 steps (54681 resets) in 2083 ms. (1919 steps per ms) remains 3/3 properties
BEST_FIRST walk for 4000003 steps (66270 resets) in 2664 ms. (1500 steps per ms) remains 3/3 properties
Finished probabilistic random walk after 2269 steps, run visited all 3 properties in 32 ms. (steps per millisecond=70 )
Probabilistic random walk after 2269 steps, saw 797 distinct states, run finished after 40 ms. (steps per millisecond=56 ) properties seen :3
Able to resolve query QuasiLiveness after proving 74 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK PARIKH_WALK PROBABILISTIC_WALK BESTFIRST_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 64388 ms.
ITS solved all properties within timeout

BK_STOP 1748772129320

--------------------
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 QuasiLiveness -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-16"
export BK_EXAMINATION="QuasiLiveness"
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-16, examination is QuasiLiveness"
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-174867016600412"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/HealthRecord-PT-16.tgz
mv HealthRecord-PT-16 execution
cd execution
if [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "UpperBounds" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] || [ "QuasiLiveness" = "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 [ "QuasiLiveness" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "QuasiLiveness" != "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 "QuasiLiveness.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 '' QuasiLiveness.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] ; then
echo "FORMULA_NAME QuasiLiveness"
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 ;