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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 588K
-rw-r--r-- 1 mcc users 8.1K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.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 14K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 162K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 67K May 29 14:32 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME QuasiLiveness

=== Now, execution of the tool begins

BK_START 1748771271745

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-07
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-06-01 09:47:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2025-06-01 09:47:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 09:47:54] [INFO ] Load time of PNML (sax parser for PT used): 304 ms
[2025-06-01 09:47:54] [INFO ] Transformed 155 places.
[2025-06-01 09:47:54] [INFO ] Transformed 320 transitions.
[2025-06-01 09:47:54] [INFO ] Found NUPN structural information;
[2025-06-01 09:47:54] [INFO ] Parsed PT model containing 155 places and 320 transitions and 839 arcs in 536 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 155/155 places, 320/320 transitions.
Graph (trivial) has 262 edges and 155 vertex of which 14 / 155 are part of one of the 7 SCC in 9 ms
Free SCC test removed 7 places
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Performed 57 Post agglomeration using F-continuation condition.Transition count delta: 57
Deduced a syphon composed of 57 places in 1 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 0 with 114 rules applied. Total rules applied 115 place count 91 transition count 231
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 116 place count 91 transition count 230
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: -33
Deduced a syphon composed of 27 places in 1 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 1 with 54 rules applied. Total rules applied 170 place count 64 transition count 263
Applied a total of 170 rules in 148 ms. Remains 64 /155 variables (removed 91) and now considering 263/320 (removed 57) transitions.
[2025-06-01 09:47:55] [INFO ] Flow matrix only has 216 transitions (discarded 47 similar events)
// Phase 1: matrix 216 rows 64 cols
[2025-06-01 09:47:55] [INFO ] Computed 18 invariants in 34 ms
[2025-06-01 09:47:55] [INFO ] Implicit Places using invariants in 693 ms returned []
[2025-06-01 09:47:55] [INFO ] Flow matrix only has 216 transitions (discarded 47 similar events)
[2025-06-01 09:47:55] [INFO ] Invariant cache hit.
[2025-06-01 09:47:55] [INFO ] State equation strengthened by 84 read => feed constraints.
[2025-06-01 09:47:56] [INFO ] Implicit Places using invariants and state equation in 346 ms returned []
Implicit Place search using SMT with State Equation took 1101 ms to find 0 implicit places.
Running 247 sub problems to find dead transitions.
[2025-06-01 09:47:56] [INFO ] Flow matrix only has 216 transitions (discarded 47 similar events)
[2025-06-01 09:47:56] [INFO ] Invariant cache hit.
[2025-06-01 09:47:56] [INFO ] State equation strengthened by 84 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 2 (OVERLAPS) 1/64 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 8/82 constraints. Problems are: Problem set: 0 solved, 247 unsolved
[2025-06-01 09:48:00] [INFO ] Deduced a trap composed of 29 places in 146 ms of which 23 ms to minimize.
[2025-06-01 09:48:00] [INFO ] Deduced a trap composed of 25 places in 124 ms of which 2 ms to minimize.
[2025-06-01 09:48:00] [INFO ] Deduced a trap composed of 29 places in 118 ms of which 2 ms to minimize.
[2025-06-01 09:48:00] [INFO ] Deduced a trap composed of 16 places in 113 ms of which 1 ms to minimize.
[2025-06-01 09:48:01] [INFO ] Deduced a trap composed of 7 places in 73 ms of which 2 ms to minimize.
[2025-06-01 09:48:01] [INFO ] Deduced a trap composed of 5 places in 62 ms of which 2 ms to minimize.
[2025-06-01 09:48:01] [INFO ] Deduced a trap composed of 7 places in 120 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 7/89 constraints. Problems are: Problem set: 0 solved, 247 unsolved
[2025-06-01 09:48:02] [INFO ] Deduced a trap composed of 25 places in 78 ms of which 2 ms to minimize.
[2025-06-01 09:48:02] [INFO ] Deduced a trap composed of 7 places in 74 ms of which 1 ms to minimize.
[2025-06-01 09:48:02] [INFO ] Deduced a trap composed of 7 places in 62 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/64 variables, 3/92 constraints. Problems are: Problem set: 0 solved, 247 unsolved
[2025-06-01 09:48:04] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 1 ms to minimize.
[2025-06-01 09:48:04] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/64 variables, 2/94 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/64 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 9 (OVERLAPS) 215/279 variables, 64/158 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/279 variables, 83/241 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/279 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 12 (OVERLAPS) 1/280 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/280 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 14 (OVERLAPS) 0/280 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 247 unsolved
No progress, stopping.
After SMT solving in domain Real declared 280/280 variables, and 242 constraints, problems are : Problem set: 0 solved, 247 unsolved in 19787 ms.
Refiners :[Domain max(s): 64/64 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 64/64 constraints, ReadFeed: 84/84 constraints, PredecessorRefiner: 247/247 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 247 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 2 (OVERLAPS) 1/64 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 8/82 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 12/94 constraints. Problems are: Problem set: 0 solved, 247 unsolved
[2025-06-01 09:48:18] [INFO ] Deduced a trap composed of 6 places in 82 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/64 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/64 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 8 (OVERLAPS) 215/279 variables, 64/159 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/279 variables, 83/242 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/279 variables, 247/489 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/279 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 12 (OVERLAPS) 1/280 variables, 1/490 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/280 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 14 (OVERLAPS) 0/280 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 247 unsolved
No progress, stopping.
After SMT solving in domain Int declared 280/280 variables, and 490 constraints, problems are : Problem set: 0 solved, 247 unsolved in 20512 ms.
Refiners :[Domain max(s): 64/64 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 64/64 constraints, ReadFeed: 84/84 constraints, PredecessorRefiner: 247/247 constraints, Known Traps: 13/13 constraints]
After SMT, in 41133ms problems are : Problem set: 0 solved, 247 unsolved
Search for dead transitions found 0 dead transitions in 41176ms
Starting structural reductions in LIVENESS mode, iteration 1 : 64/155 places, 263/320 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 42501 ms. Remains : 64/155 places, 263/320 transitions.
Discarding 212 transitions out of 263. Remains 51
Initial state reduction rules removed 1 formulas.
RANDOM walk for 40000 steps (4820 resets) in 2431 ms. (16 steps per ms) remains 16/50 properties
BEST_FIRST walk for 4004 steps (74 resets) in 40 ms. (97 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (68 resets) in 32 ms. (121 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (67 resets) in 52 ms. (75 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (105 resets) in 34 ms. (114 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (36 resets) in 29 ms. (133 steps per ms) remains 15/16 properties
BEST_FIRST walk for 4002 steps (63 resets) in 34 ms. (114 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (63 resets) in 44 ms. (88 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (63 resets) in 27 ms. (143 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (65 resets) in 43 ms. (91 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (67 resets) in 44 ms. (88 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (62 resets) in 33 ms. (117 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (63 resets) in 34 ms. (114 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (58 resets) in 27 ms. (142 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (59 resets) in 22 ms. (174 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (57 resets) in 26 ms. (148 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (61 resets) in 20 ms. (190 steps per ms) remains 15/15 properties
[2025-06-01 09:48:38] [INFO ] Flow matrix only has 216 transitions (discarded 47 similar events)
[2025-06-01 09:48:38] [INFO ] Invariant cache hit.
[2025-06-01 09:48:38] [INFO ] State equation strengthened by 84 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 27/55 variables, 10/38 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 27/65 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2025-06-01 09:48:38] [INFO ] Deduced a trap composed of 29 places in 49 ms of which 1 ms to minimize.
[2025-06-01 09:48:38] [INFO ] Deduced a trap composed of 5 places in 54 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 9/64 variables, 8/75 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/64 variables, 9/84 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/64 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (OVERLAPS) 215/279 variables, 64/148 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/279 variables, 83/231 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/279 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 12 (OVERLAPS) 1/280 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/280 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 14 (OVERLAPS) 0/280 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 280/280 variables, and 232 constraints, problems are : Problem set: 0 solved, 15 unsolved in 1284 ms.
Refiners :[Domain max(s): 64/64 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 64/64 constraints, ReadFeed: 84/84 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 27/55 variables, 10/38 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 27/65 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 9/64 variables, 8/75 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/64 variables, 9/84 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/64 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (OVERLAPS) 215/279 variables, 64/148 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/279 variables, 83/231 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/279 variables, 15/246 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/279 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 13 (OVERLAPS) 1/280 variables, 1/247 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/280 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 15 (OVERLAPS) 0/280 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 280/280 variables, and 247 constraints, problems are : Problem set: 0 solved, 15 unsolved in 1865 ms.
Refiners :[Domain max(s): 64/64 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 64/64 constraints, ReadFeed: 84/84 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 2/2 constraints]
After SMT, in 3190ms problems are : Problem set: 0 solved, 15 unsolved
Fused 15 Parikh solutions to 14 different solutions.
Parikh walk visited 11 properties in 1064 ms.
Support contains 13 out of 64 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 64/64 places, 263/263 transitions.
Graph (complete) has 377 edges and 64 vertex of which 55 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 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 55 transition count 243
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 22 place count 45 transition count 193
Iterating global reduction 1 with 10 rules applied. Total rules applied 32 place count 45 transition count 193
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 50 place count 45 transition count 175
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 53 place count 42 transition count 145
Iterating global reduction 2 with 3 rules applied. Total rules applied 56 place count 42 transition count 145
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 59 place count 39 transition count 136
Iterating global reduction 2 with 3 rules applied. Total rules applied 62 place count 39 transition count 136
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 80 place count 39 transition count 118
Drop transitions (Redundant composition of simpler transitions.) removed 23 transitions
Redundant transition composition rules discarded 23 transitions
Iterating global reduction 3 with 23 rules applied. Total rules applied 103 place count 39 transition count 95
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 105 place count 38 transition count 94
Applied a total of 105 rules in 55 ms. Remains 38 /64 variables (removed 26) and now considering 94/263 (removed 169) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 38/64 places, 94/263 transitions.
RANDOM walk for 4000000 steps (432988 resets) in 10174 ms. (393 steps per ms) remains 3/4 properties
BEST_FIRST walk for 4000004 steps (75213 resets) in 3237 ms. (1235 steps per ms) remains 3/3 properties
BEST_FIRST walk for 4000003 steps (75240 resets) in 2468 ms. (1620 steps per ms) remains 3/3 properties
BEST_FIRST walk for 4000003 steps (77778 resets) in 2803 ms. (1426 steps per ms) remains 3/3 properties
[2025-06-01 09:48:48] [INFO ] Flow matrix only has 89 transitions (discarded 5 similar events)
// Phase 1: matrix 89 rows 38 cols
[2025-06-01 09:48:48] [INFO ] Computed 9 invariants in 3 ms
[2025-06-01 09:48:48] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 5/17 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 21/38 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 89/127 variables, 38/47 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/127 variables, 38/85 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/127 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/127 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 127/127 variables, and 85 constraints, problems are : Problem set: 0 solved, 3 unsolved in 122 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 38/38 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 5/17 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 21/38 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 89/127 variables, 38/47 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/127 variables, 38/85 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/127 variables, 3/88 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/127 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/127 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 127/127 variables, and 88 constraints, problems are : Problem set: 0 solved, 3 unsolved in 133 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 38/38 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 271ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 17 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=17 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 3 properties in 8 ms.
Able to resolve query QuasiLiveness after proving 51 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK PARIKH_WALK BESTFIRST_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 54746 ms.
ITS solved all properties within timeout

BK_STOP 1748771328971

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

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