Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r188-tall-171640616800492.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
Executing tool greatspnxred
Input is HealthRecord-PT-12, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r188-tall-171640616800492
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 20:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 135K Apr 12 20:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Apr 12 20:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 48K Apr 12 20:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 71K May 18 16:42 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 1716475927108

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=HealthRecord-PT-12
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 14:52:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2024-05-23 14:52:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 14:52:08] [INFO ] Load time of PNML (sax parser for PT used): 78 ms
[2024-05-23 14:52:08] [INFO ] Transformed 160 places.
[2024-05-23 14:52:08] [INFO ] Transformed 340 transitions.
[2024-05-23 14:52:08] [INFO ] Found NUPN structural information;
[2024-05-23 14:52:08] [INFO ] Parsed PT model containing 160 places and 340 transitions and 895 arcs in 174 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 160/160 places, 340/340 transitions.
Graph (trivial) has 274 edges and 160 vertex of which 8 / 160 are part of one of the 4 SCC in 4 ms
Free SCC test removed 4 places
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Performed 65 Post agglomeration using F-continuation condition.Transition count delta: 65
Deduced a syphon composed of 65 places in 0 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 0 with 130 rules applied. Total rules applied 131 place count 91 transition count 243
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 132 place count 91 transition count 242
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 186 place count 64 transition count 275
Applied a total of 186 rules in 64 ms. Remains 64 /160 variables (removed 96) and now considering 275/340 (removed 65) transitions.
[2024-05-23 14:52:08] [INFO ] Flow matrix only has 222 transitions (discarded 53 similar events)
// Phase 1: matrix 222 rows 64 cols
[2024-05-23 14:52:08] [INFO ] Computed 18 invariants in 16 ms
[2024-05-23 14:52:08] [INFO ] Implicit Places using invariants in 220 ms returned []
[2024-05-23 14:52:08] [INFO ] Flow matrix only has 222 transitions (discarded 53 similar events)
[2024-05-23 14:52:08] [INFO ] Invariant cache hit.
[2024-05-23 14:52:08] [INFO ] State equation strengthened by 84 read => feed constraints.
[2024-05-23 14:52:08] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 389 ms to find 0 implicit places.
Running 259 sub problems to find dead transitions.
[2024-05-23 14:52:08] [INFO ] Flow matrix only has 222 transitions (discarded 53 similar events)
[2024-05-23 14:52:08] [INFO ] Invariant cache hit.
[2024-05-23 14:52:08] [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, 259 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 2 (OVERLAPS) 1/64 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 8/82 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-23 14:52:11] [INFO ] Deduced a trap composed of 30 places in 96 ms of which 21 ms to minimize.
[2024-05-23 14:52:11] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 4 ms to minimize.
[2024-05-23 14:52:11] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 1 ms to minimize.
[2024-05-23 14:52:11] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 1 ms to minimize.
[2024-05-23 14:52:11] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 5/87 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-23 14:52:12] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/64 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-23 14:52:13] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/64 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/64 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 9 (OVERLAPS) 221/285 variables, 64/153 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/285 variables, 83/236 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/285 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 12 (OVERLAPS) 1/286 variables, 1/237 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/286 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 14 (OVERLAPS) 0/286 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 259 unsolved
No progress, stopping.
After SMT solving in domain Real declared 286/286 variables, and 237 constraints, problems are : Problem set: 0 solved, 259 unsolved in 10969 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: 259/259 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 259 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 2 (OVERLAPS) 1/64 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 8/82 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 7/89 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/64 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 7 (OVERLAPS) 221/285 variables, 64/153 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/285 variables, 83/236 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/285 variables, 259/495 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/285 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 11 (OVERLAPS) 1/286 variables, 1/496 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/286 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 13 (OVERLAPS) 0/286 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 259 unsolved
No progress, stopping.
After SMT solving in domain Int declared 286/286 variables, and 496 constraints, problems are : Problem set: 0 solved, 259 unsolved in 14408 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: 259/259 constraints, Known Traps: 7/7 constraints]
After SMT, in 25892ms problems are : Problem set: 0 solved, 259 unsolved
Search for dead transitions found 0 dead transitions in 25910ms
Starting structural reductions in LIVENESS mode, iteration 1 : 64/160 places, 275/340 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 26388 ms. Remains : 64/160 places, 275/340 transitions.
Discarding 224 transitions out of 275. Remains 51
Initial state reduction rules removed 1 formulas.
RANDOM walk for 40000 steps (5156 resets) in 2765 ms. (14 steps per ms) remains 27/50 properties
BEST_FIRST walk for 4004 steps (60 resets) in 28 ms. (138 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (58 resets) in 24 ms. (160 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (63 resets) in 19 ms. (200 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (60 resets) in 21 ms. (181 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (60 resets) in 18 ms. (210 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (62 resets) in 20 ms. (190 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (60 resets) in 33 ms. (117 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (61 resets) in 22 ms. (174 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (62 resets) in 12 ms. (308 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (57 resets) in 13 ms. (286 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (60 resets) in 16 ms. (235 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (63 resets) in 11 ms. (333 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (63 resets) in 15 ms. (250 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (92 resets) in 36 ms. (108 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (87 resets) in 28 ms. (138 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (21 resets) in 20 ms. (190 steps per ms) remains 22/27 properties
BEST_FIRST walk for 4004 steps (60 resets) in 21 ms. (182 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (51 resets) in 21 ms. (182 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (52 resets) in 10 ms. (363 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (56 resets) in 11 ms. (333 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (60 resets) in 14 ms. (266 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (53 resets) in 23 ms. (166 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (60 resets) in 12 ms. (308 steps per ms) remains 22/22 properties
[2024-05-23 14:52:35] [INFO ] Flow matrix only has 222 transitions (discarded 53 similar events)
[2024-05-23 14:52:35] [INFO ] Invariant cache hit.
[2024-05-23 14:52:35] [INFO ] State equation strengthened by 84 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (OVERLAPS) 20/55 variables, 10/45 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 22 unsolved
[2024-05-23 14:52:36] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 1 ms to minimize.
[2024-05-23 14:52:36] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (OVERLAPS) 9/64 variables, 7/75 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/64 variables, 9/84 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/64 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 10 (OVERLAPS) 221/285 variables, 64/148 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/285 variables, 83/231 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/285 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 13 (OVERLAPS) 1/286 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/286 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 15 (OVERLAPS) 0/286 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Real declared 286/286 variables, and 232 constraints, problems are : Problem set: 0 solved, 22 unsolved in 1251 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: 22/22 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 22 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (OVERLAPS) 20/55 variables, 10/45 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (OVERLAPS) 9/64 variables, 7/75 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/64 variables, 9/84 constraints. Problems are: Problem set: 0 solved, 22 unsolved
[2024-05-23 14:52:37] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/64 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/64 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 11 (OVERLAPS) 221/285 variables, 64/149 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/285 variables, 83/232 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/285 variables, 22/254 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/285 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 15 (OVERLAPS) 1/286 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/286 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 17 (OVERLAPS) 0/286 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Int declared 286/286 variables, and 255 constraints, problems are : Problem set: 0 solved, 22 unsolved in 1404 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: 22/22 constraints, Known Traps: 3/3 constraints]
After SMT, in 2688ms problems are : Problem set: 0 solved, 22 unsolved
Fused 22 Parikh solutions to 13 different solutions.
Parikh walk visited 6 properties in 139 ms.
Support contains 26 out of 64 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 64/64 places, 275/275 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 64 transition count 258
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 26 place count 55 transition count 213
Iterating global reduction 1 with 9 rules applied. Total rules applied 35 place count 55 transition count 213
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 53 place count 55 transition count 195
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 55 place count 53 transition count 175
Iterating global reduction 2 with 2 rules applied. Total rules applied 57 place count 53 transition count 175
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 59 place count 51 transition count 169
Iterating global reduction 2 with 2 rules applied. Total rules applied 61 place count 51 transition count 169
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 73 place count 51 transition count 157
Drop transitions (Redundant composition of simpler transitions.) removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 3 with 17 rules applied. Total rules applied 90 place count 51 transition count 140
Applied a total of 90 rules in 27 ms. Remains 51 /64 variables (removed 13) and now considering 140/275 (removed 135) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 51/64 places, 140/275 transitions.
RANDOM walk for 4000000 steps (485723 resets) in 8474 ms. (471 steps per ms) remains 4/16 properties
BEST_FIRST walk for 4000002 steps (71140 resets) in 1848 ms. (2163 steps per ms) remains 4/4 properties
BEST_FIRST walk for 4000004 steps (71203 resets) in 1790 ms. (2233 steps per ms) remains 4/4 properties
BEST_FIRST walk for 4000004 steps (87932 resets) in 2312 ms. (1729 steps per ms) remains 4/4 properties
BEST_FIRST walk for 4000002 steps (67517 resets) in 1911 ms. (2092 steps per ms) remains 3/4 properties
[2024-05-23 14:52:43] [INFO ] Flow matrix only has 124 transitions (discarded 16 similar events)
// Phase 1: matrix 124 rows 51 cols
[2024-05-23 14:52:43] [INFO ] Computed 18 invariants in 1 ms
[2024-05-23 14:52:43] [INFO ] State equation strengthened by 48 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) 27/39 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-23 14:52:43] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 12/51 variables, 8/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 124/175 variables, 51/70 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/175 variables, 48/118 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/175 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/175 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 175/175 variables, and 118 constraints, problems are : Problem set: 0 solved, 3 unsolved in 151 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 51/51 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 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) 27/39 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 12/51 variables, 8/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 124/175 variables, 51/70 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/175 variables, 48/118 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/175 variables, 3/121 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/175 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/175 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 175/175 variables, and 121 constraints, problems are : Problem set: 0 solved, 3 unsolved in 136 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 51/51 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
After SMT, in 299ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 62 ms.
Support contains 12 out of 51 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 51/51 places, 140/140 transitions.
Graph (complete) has 286 edges and 51 vertex of which 42 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.2 ms
Discarding 9 places :
Also discarding 0 output transitions
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 3 place count 40 transition count 135
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 40 transition count 135
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 6 place count 40 transition count 134
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 7 place count 39 transition count 124
Iterating global reduction 1 with 1 rules applied. Total rules applied 8 place count 39 transition count 124
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 38 transition count 121
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 38 transition count 121
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 16 place count 38 transition count 115
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 18 place count 37 transition count 121
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 2 with 7 rules applied. Total rules applied 25 place count 37 transition count 121
Applied a total of 25 rules in 26 ms. Remains 37 /51 variables (removed 14) and now considering 121/140 (removed 19) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 37/51 places, 121/140 transitions.
RANDOM walk for 4000000 steps (570036 resets) in 8453 ms. (473 steps per ms) remains 3/3 properties
BEST_FIRST walk for 4000003 steps (72413 resets) in 1730 ms. (2310 steps per ms) remains 3/3 properties
BEST_FIRST walk for 4000003 steps (72577 resets) in 1725 ms. (2317 steps per ms) remains 3/3 properties
BEST_FIRST walk for 4000003 steps (85630 resets) in 2268 ms. (1762 steps per ms) remains 3/3 properties
Finished probabilistic random walk after 1364 steps, run visited all 3 properties in 15 ms. (steps per millisecond=90 )
Probabilistic random walk after 1364 steps, saw 575 distinct states, run finished after 18 ms. (steps per millisecond=75 ) properties seen :3
Able to resolve query QuasiLiveness after proving 51 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK PARIKH_WALK PROBABILISTIC_WALK BESTFIRST_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 38941 ms.
ITS solved all properties within timeout

BK_STOP 1716475967228

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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-12"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="greatspnxred"
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-5568"
echo " Executing tool greatspnxred"
echo " Input is HealthRecord-PT-12, 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 r188-tall-171640616800492"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/HealthRecord-PT-12.tgz
mv HealthRecord-PT-12 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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property QuasiLiveness.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -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 ;