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.r498-tall-171640618000497.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 ltsminxred
Input is HealthRecord-PT-13, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r498-tall-171640618000497
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 20:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 142K Apr 12 20:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Apr 12 20:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Apr 12 20:05 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 1717194057137

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=HealthRecord-PT-13
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 22:20:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2024-05-31 22:20:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 22:20:58] [INFO ] Load time of PNML (sax parser for PT used): 73 ms
[2024-05-31 22:20:58] [INFO ] Transformed 161 places.
[2024-05-31 22:20:58] [INFO ] Transformed 341 transitions.
[2024-05-31 22:20:58] [INFO ] Found NUPN structural information;
[2024-05-31 22:20:58] [INFO ] Parsed PT model containing 161 places and 341 transitions and 899 arcs in 175 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 161/161 places, 341/341 transitions.
Graph (trivial) has 274 edges and 161 vertex of which 8 / 161 are part of one of the 4 SCC in 3 ms
Free SCC test removed 4 places
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Performed 66 Post agglomeration using F-continuation condition.Transition count delta: 66
Deduced a syphon composed of 66 places in 1 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 0 with 132 rules applied. Total rules applied 133 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 134 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 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 1 with 54 rules applied. Total rules applied 188 place count 64 transition count 275
Applied a total of 188 rules in 69 ms. Remains 64 /161 variables (removed 97) and now considering 275/341 (removed 66) transitions.
[2024-05-31 22:20:58] [INFO ] Flow matrix only has 222 transitions (discarded 53 similar events)
// Phase 1: matrix 222 rows 64 cols
[2024-05-31 22:20:58] [INFO ] Computed 18 invariants in 15 ms
[2024-05-31 22:20:58] [INFO ] Implicit Places using invariants in 211 ms returned []
[2024-05-31 22:20:58] [INFO ] Flow matrix only has 222 transitions (discarded 53 similar events)
[2024-05-31 22:20:58] [INFO ] Invariant cache hit.
[2024-05-31 22:20:58] [INFO ] State equation strengthened by 84 read => feed constraints.
[2024-05-31 22:20:58] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 395 ms to find 0 implicit places.
Running 259 sub problems to find dead transitions.
[2024-05-31 22:20:58] [INFO ] Flow matrix only has 222 transitions (discarded 53 similar events)
[2024-05-31 22:20:58] [INFO ] Invariant cache hit.
[2024-05-31 22:20:58] [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-31 22:21:00] [INFO ] Deduced a trap composed of 29 places in 87 ms of which 18 ms to minimize.
[2024-05-31 22:21:01] [INFO ] Deduced a trap composed of 30 places in 59 ms of which 1 ms to minimize.
[2024-05-31 22:21:01] [INFO ] Deduced a trap composed of 29 places in 63 ms of which 1 ms to minimize.
[2024-05-31 22:21:01] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 1 ms to minimize.
[2024-05-31 22:21:01] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 0 ms to minimize.
[2024-05-31 22:21:01] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 1 ms to minimize.
[2024-05-31 22:21:01] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 1 ms to minimize.
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, 0/236 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 10 (OVERLAPS) 1/286 variables, 1/237 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/286 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 12 (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 10132 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
[2024-05-31 22:21:10] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 2 ms to minimize.
[2024-05-31 22:21:10] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 1 ms to minimize.
[2024-05-31 22:21:10] [INFO ] Deduced a trap composed of 7 places in 48 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/64 variables, 3/92 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/64 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 8 (OVERLAPS) 221/285 variables, 64/156 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/285 variables, 83/239 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/285 variables, 259/498 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/285 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 12 (OVERLAPS) 1/286 variables, 1/499 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/286 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 14 (OVERLAPS) 0/286 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 259 unsolved
No progress, stopping.
After SMT solving in domain Int declared 286/286 variables, and 499 constraints, problems are : Problem set: 0 solved, 259 unsolved in 15195 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: 10/10 constraints]
After SMT, in 25844ms problems are : Problem set: 0 solved, 259 unsolved
Search for dead transitions found 0 dead transitions in 25869ms
Starting structural reductions in LIVENESS mode, iteration 1 : 64/161 places, 275/341 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 26363 ms. Remains : 64/161 places, 275/341 transitions.
Discarding 224 transitions out of 275. Remains 51
Initial state reduction rules removed 1 formulas.
RANDOM walk for 40000 steps (5962 resets) in 2142 ms. (18 steps per ms) remains 27/50 properties
BEST_FIRST walk for 4003 steps (78 resets) in 29 ms. (133 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (85 resets) in 61 ms. (64 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (79 resets) in 48 ms. (81 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (79 resets) in 13 ms. (285 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (72 resets) in 25 ms. (153 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (77 resets) in 25 ms. (154 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (80 resets) in 22 ms. (174 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (81 resets) in 9 ms. (400 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (77 resets) in 16 ms. (235 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (79 resets) in 29 ms. (133 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (74 resets) in 9 ms. (400 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (77 resets) in 18 ms. (210 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (84 resets) in 18 ms. (210 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (120 resets) in 27 ms. (143 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (105 resets) in 37 ms. (105 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (39 resets) in 11 ms. (333 steps per ms) remains 26/27 properties
BEST_FIRST walk for 4003 steps (71 resets) in 19 ms. (200 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (78 resets) in 11 ms. (333 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (81 resets) in 15 ms. (250 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (73 resets) in 10 ms. (364 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (73 resets) in 13 ms. (286 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (75 resets) in 8 ms. (444 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (74 resets) in 11 ms. (333 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (71 resets) in 8 ms. (444 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (74 resets) in 10 ms. (363 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (69 resets) in 10 ms. (364 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (72 resets) in 10 ms. (363 steps per ms) remains 26/26 properties
[2024-05-31 22:21:25] [INFO ] Flow matrix only has 222 transitions (discarded 53 similar events)
[2024-05-31 22:21:25] [INFO ] Invariant cache hit.
[2024-05-31 22:21:25] [INFO ] State equation strengthened by 84 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (OVERLAPS) 16/55 variables, 10/49 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 16/65 constraints. Problems are: Problem set: 0 solved, 26 unsolved
[2024-05-31 22:21:26] [INFO ] Deduced a trap composed of 29 places in 51 ms of which 1 ms to minimize.
[2024-05-31 22:21:26] [INFO ] Deduced a trap composed of 5 places in 74 ms of which 1 ms to minimize.
[2024-05-31 22:21:26] [INFO ] Deduced a trap composed of 7 places in 70 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 3/68 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 6 (OVERLAPS) 9/64 variables, 8/76 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/64 variables, 9/85 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/64 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 9 (OVERLAPS) 221/285 variables, 64/149 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/285 variables, 83/232 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/285 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 12 (OVERLAPS) 1/286 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/286 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 14 (OVERLAPS) 0/286 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Real declared 286/286 variables, and 233 constraints, problems are : Problem set: 0 solved, 26 unsolved in 1651 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: 26/26 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 26 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (OVERLAPS) 16/55 variables, 10/49 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 16/65 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 3/68 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 6 (OVERLAPS) 9/64 variables, 8/76 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/64 variables, 9/85 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/64 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 9 (OVERLAPS) 221/285 variables, 64/149 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/285 variables, 83/232 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/285 variables, 26/258 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/285 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 13 (OVERLAPS) 1/286 variables, 1/259 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/286 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 15 (OVERLAPS) 0/286 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Int declared 286/286 variables, and 259 constraints, problems are : Problem set: 0 solved, 26 unsolved in 1423 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: 26/26 constraints, Known Traps: 3/3 constraints]
After SMT, in 3149ms problems are : Problem set: 0 solved, 26 unsolved
Fused 26 Parikh solutions to 16 different solutions.
Parikh walk visited 10 properties in 81 ms.
Support contains 29 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 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 27 place count 54 transition count 208
Iterating global reduction 1 with 10 rules applied. Total rules applied 37 place count 54 transition count 208
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 55 place count 54 transition count 190
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 58 place count 51 transition count 160
Iterating global reduction 2 with 3 rules applied. Total rules applied 61 place count 51 transition count 160
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 64 place count 48 transition count 151
Iterating global reduction 2 with 3 rules applied. Total rules applied 67 place count 48 transition count 151
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 85 place count 48 transition count 133
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 3 with 16 rules applied. Total rules applied 101 place count 48 transition count 117
Applied a total of 101 rules in 33 ms. Remains 48 /64 variables (removed 16) and now considering 117/275 (removed 158) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 48/64 places, 117/275 transitions.
RANDOM walk for 4000000 steps (553612 resets) in 10730 ms. (372 steps per ms) remains 3/16 properties
BEST_FIRST walk for 4000004 steps (89639 resets) in 2290 ms. (1745 steps per ms) remains 3/3 properties
BEST_FIRST walk for 4000003 steps (89637 resets) in 2408 ms. (1660 steps per ms) remains 3/3 properties
BEST_FIRST walk for 4000002 steps (111067 resets) in 2934 ms. (1362 steps per ms) remains 3/3 properties
[2024-05-31 22:21:34] [INFO ] Flow matrix only has 103 transitions (discarded 14 similar events)
// Phase 1: matrix 103 rows 48 cols
[2024-05-31 22:21:34] [INFO ] Computed 18 invariants in 1 ms
[2024-05-31 22:21:34] [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) 24/36 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 22:21:34] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/36 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 12/48 variables, 8/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 103/151 variables, 48/67 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/151 variables, 38/105 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/151 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/151 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 151/151 variables, and 105 constraints, problems are : Problem set: 0 solved, 3 unsolved in 152 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 48/48 constraints, ReadFeed: 38/38 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) 24/36 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/36 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 12/48 variables, 8/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 103/151 variables, 48/67 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/151 variables, 38/105 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/151 variables, 3/108 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/151 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/151 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 151/151 variables, and 108 constraints, problems are : Problem set: 0 solved, 3 unsolved in 113 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 48/48 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
After SMT, in 305ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 107 steps, including 9 resets, run visited all 3 properties in 2 ms. (steps per millisecond=53 )
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 6 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 36869 ms.
ITS solved all properties within timeout

BK_STOP 1717194095177

--------------------
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-13"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is HealthRecord-PT-13, 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 r498-tall-171640618000497"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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