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-171640616900517.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-17, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r188-tall-171640616900517
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 596K
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K 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 16K Apr 22 14:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.8K Apr 12 20:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 87K Apr 12 20:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Apr 12 20:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Apr 12 20:21 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 175K 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 1716476137214

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-17
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 14:55:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2024-05-23 14:55:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 14:55:38] [INFO ] Load time of PNML (sax parser for PT used): 108 ms
[2024-05-23 14:55:38] [INFO ] Transformed 624 places.
[2024-05-23 14:55:38] [INFO ] Transformed 828 transitions.
[2024-05-23 14:55:38] [INFO ] Found NUPN structural information;
[2024-05-23 14:55:38] [INFO ] Parsed PT model containing 624 places and 828 transitions and 1879 arcs in 240 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 624/624 places, 828/828 transitions.
Graph (trivial) has 750 edges and 624 vertex of which 87 / 624 are part of one of the 21 SCC in 15 ms
Free SCC test removed 66 places
Ensure Unique test removed 75 transitions
Reduce isomorphic transitions removed 75 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 295 transitions
Trivial Post-agglo rules discarded 295 transitions
Performed 295 trivial Post agglomeration. Transition count delta: 295
Iterating post reduction 0 with 295 rules applied. Total rules applied 296 place count 558 transition count 458
Reduce places removed 295 places and 0 transitions.
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 1 with 337 rules applied. Total rules applied 633 place count 263 transition count 416
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 647 place count 249 transition count 416
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 647 place count 249 transition count 406
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 667 place count 239 transition count 406
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 97
Deduced a syphon composed of 97 places in 1 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 3 with 194 rules applied. Total rules applied 861 place count 142 transition count 309
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: -77
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 72 rules applied. Total rules applied 933 place count 106 transition count 386
Applied a total of 933 rules in 103 ms. Remains 106 /624 variables (removed 518) and now considering 386/828 (removed 442) transitions.
[2024-05-23 14:55:38] [INFO ] Flow matrix only has 357 transitions (discarded 29 similar events)
// Phase 1: matrix 357 rows 106 cols
[2024-05-23 14:55:38] [INFO ] Computed 18 invariants in 22 ms
[2024-05-23 14:55:39] [INFO ] Implicit Places using invariants in 262 ms returned []
[2024-05-23 14:55:39] [INFO ] Flow matrix only has 357 transitions (discarded 29 similar events)
[2024-05-23 14:55:39] [INFO ] Invariant cache hit.
[2024-05-23 14:55:39] [INFO ] State equation strengthened by 54 read => feed constraints.
[2024-05-23 14:55:39] [INFO ] Implicit Places using invariants and state equation in 228 ms returned []
Implicit Place search using SMT with State Equation took 520 ms to find 0 implicit places.
Running 356 sub problems to find dead transitions.
[2024-05-23 14:55:39] [INFO ] Flow matrix only has 357 transitions (discarded 29 similar events)
[2024-05-23 14:55:39] [INFO ] Invariant cache hit.
[2024-05-23 14:55:39] [INFO ] State equation strengthened by 54 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 105/105 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 2 (OVERLAPS) 1/106 variables, 10/115 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 8/124 constraints. Problems are: Problem set: 0 solved, 356 unsolved
[2024-05-23 14:55:42] [INFO ] Deduced a trap composed of 31 places in 74 ms of which 8 ms to minimize.
[2024-05-23 14:55:42] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 2 ms to minimize.
[2024-05-23 14:55:42] [INFO ] Deduced a trap composed of 10 places in 67 ms of which 1 ms to minimize.
[2024-05-23 14:55:43] [INFO ] Deduced a trap composed of 32 places in 59 ms of which 1 ms to minimize.
[2024-05-23 14:55:43] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/106 variables, 5/129 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 7 (OVERLAPS) 356/462 variables, 106/235 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/462 variables, 53/288 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/462 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 10 (OVERLAPS) 1/463 variables, 1/289 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/463 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 12 (OVERLAPS) 0/463 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 356 unsolved
No progress, stopping.
After SMT solving in domain Real declared 463/463 variables, and 289 constraints, problems are : Problem set: 0 solved, 356 unsolved in 18870 ms.
Refiners :[Domain max(s): 106/106 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 106/106 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 356/356 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 356 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 105/105 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 2 (OVERLAPS) 1/106 variables, 10/115 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 8/124 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/106 variables, 5/129 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 7 (OVERLAPS) 356/462 variables, 106/235 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/462 variables, 53/288 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/462 variables, 356/644 constraints. Problems are: Problem set: 0 solved, 356 unsolved
[2024-05-23 14:56:06] [INFO ] Deduced a trap composed of 36 places in 89 ms of which 2 ms to minimize.
[2024-05-23 14:56:07] [INFO ] Deduced a trap composed of 33 places in 68 ms of which 1 ms to minimize.
[2024-05-23 14:56:07] [INFO ] Deduced a trap composed of 34 places in 60 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/462 variables, 3/647 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/462 variables, 0/647 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 12 (OVERLAPS) 1/463 variables, 1/648 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/463 variables, 0/648 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 14 (OVERLAPS) 0/463 variables, 0/648 constraints. Problems are: Problem set: 0 solved, 356 unsolved
No progress, stopping.
After SMT solving in domain Int declared 463/463 variables, and 648 constraints, problems are : Problem set: 0 solved, 356 unsolved in 30011 ms.
Refiners :[Domain max(s): 106/106 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 106/106 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 356/356 constraints, Known Traps: 8/8 constraints]
After SMT, in 49627ms problems are : Problem set: 0 solved, 356 unsolved
Search for dead transitions found 0 dead transitions in 49646ms
Starting structural reductions in LIVENESS mode, iteration 1 : 106/624 places, 386/828 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 50303 ms. Remains : 106/624 places, 386/828 transitions.
Discarding 295 transitions out of 386. Remains 91
Initial state reduction rules removed 1 formulas.
RANDOM walk for 40000 steps (3802 resets) in 1970 ms. (20 steps per ms) remains 34/90 properties
BEST_FIRST walk for 4004 steps (27 resets) in 22 ms. (174 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (26 resets) in 14 ms. (266 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (27 resets) in 24 ms. (160 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (30 resets) in 29 ms. (133 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (26 resets) in 15 ms. (250 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (27 resets) in 10 ms. (363 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (27 resets) in 10 ms. (364 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (27 resets) in 13 ms. (286 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (26 resets) in 11 ms. (333 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (28 resets) in 15 ms. (250 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (26 resets) in 13 ms. (285 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (25 resets) in 12 ms. (308 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (27 resets) in 17 ms. (222 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (25 resets) in 19 ms. (200 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (16 resets) in 14 ms. (266 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (15 resets) in 16 ms. (235 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (13 resets) in 13 ms. (286 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (40 resets) in 20 ms. (190 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (40 resets) in 19 ms. (200 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (40 resets) in 12 ms. (308 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (21 resets) in 10 ms. (364 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (19 resets) in 8 ms. (444 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (18 resets) in 10 ms. (363 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (18 resets) in 13 ms. (286 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (17 resets) in 10 ms. (364 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (17 resets) in 10 ms. (364 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (19 resets) in 9 ms. (400 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (25 resets) in 13 ms. (286 steps per ms) remains 33/34 properties
BEST_FIRST walk for 4004 steps (28 resets) in 14 ms. (266 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (27 resets) in 13 ms. (286 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (29 resets) in 16 ms. (235 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (26 resets) in 12 ms. (307 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (25 resets) in 14 ms. (266 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (28 resets) in 16 ms. (235 steps per ms) remains 33/33 properties
[2024-05-23 14:56:29] [INFO ] Flow matrix only has 357 transitions (discarded 29 similar events)
[2024-05-23 14:56:29] [INFO ] Invariant cache hit.
[2024-05-23 14:56:29] [INFO ] State equation strengthened by 54 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 2 (OVERLAPS) 16/64 variables, 10/58 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 16/74 constraints. Problems are: Problem set: 0 solved, 33 unsolved
[2024-05-23 14:56:30] [INFO ] Deduced a trap composed of 31 places in 48 ms of which 1 ms to minimize.
[2024-05-23 14:56:30] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 1 ms to minimize.
[2024-05-23 14:56:30] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 0 ms to minimize.
[2024-05-23 14:56:30] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 4/78 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 6 (OVERLAPS) 42/106 variables, 8/86 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/106 variables, 42/128 constraints. Problems are: Problem set: 0 solved, 33 unsolved
[2024-05-23 14:56:30] [INFO ] Deduced a trap composed of 34 places in 61 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/106 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/106 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 10 (OVERLAPS) 356/462 variables, 106/235 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/462 variables, 53/288 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/462 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 13 (OVERLAPS) 1/463 variables, 1/289 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/463 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 15 (OVERLAPS) 0/463 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Real declared 463/463 variables, and 289 constraints, problems are : Problem set: 0 solved, 33 unsolved in 2248 ms.
Refiners :[Domain max(s): 106/106 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 106/106 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 33 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 2 (OVERLAPS) 16/64 variables, 10/58 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 16/74 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 4/78 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 6 (OVERLAPS) 42/106 variables, 8/86 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/106 variables, 42/128 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/106 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/106 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 10 (OVERLAPS) 356/462 variables, 106/235 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/462 variables, 53/288 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/462 variables, 33/321 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/462 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 14 (OVERLAPS) 1/463 variables, 1/322 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/463 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 16 (OVERLAPS) 0/463 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Int declared 463/463 variables, and 322 constraints, problems are : Problem set: 0 solved, 33 unsolved in 2564 ms.
Refiners :[Domain max(s): 106/106 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 106/106 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 5/5 constraints]
After SMT, in 4881ms problems are : Problem set: 0 solved, 33 unsolved
Fused 33 Parikh solutions to 25 different solutions.
Parikh walk visited 4 properties in 621 ms.
Support contains 43 out of 106 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 106/106 places, 386/386 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 106 transition count 365
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 26 place count 101 transition count 340
Iterating global reduction 1 with 5 rules applied. Total rules applied 31 place count 101 transition count 340
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 43 place count 89 transition count 316
Iterating global reduction 1 with 12 rules applied. Total rules applied 55 place count 89 transition count 316
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 64 place count 89 transition count 307
Drop transitions (Redundant composition of simpler transitions.) removed 32 transitions
Redundant transition composition rules discarded 32 transitions
Iterating global reduction 2 with 32 rules applied. Total rules applied 96 place count 89 transition count 275
Free-agglomeration rule applied 8 times.
Iterating global reduction 2 with 8 rules applied. Total rules applied 104 place count 89 transition count 267
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 112 place count 81 transition count 267
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 3 with 11 rules applied. Total rules applied 123 place count 81 transition count 256
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 126 place count 81 transition count 256
Applied a total of 126 rules in 59 ms. Remains 81 /106 variables (removed 25) and now considering 256/386 (removed 130) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59 ms. Remains : 81/106 places, 256/386 transitions.
RANDOM walk for 4000000 steps (383643 resets) in 19168 ms. (208 steps per ms) remains 18/29 properties
BEST_FIRST walk for 400004 steps (3824 resets) in 280 ms. (1423 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400002 steps (3813 resets) in 267 ms. (1492 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (3810 resets) in 258 ms. (1544 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400003 steps (3841 resets) in 263 ms. (1515 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (5093 resets) in 309 ms. (1290 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (4905 resets) in 319 ms. (1250 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400003 steps (3417 resets) in 281 ms. (1418 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (3367 resets) in 320 ms. (1246 steps per ms) remains 16/18 properties
BEST_FIRST walk for 400004 steps (3382 resets) in 302 ms. (1320 steps per ms) remains 16/16 properties
BEST_FIRST walk for 400003 steps (3388 resets) in 263 ms. (1515 steps per ms) remains 14/16 properties
BEST_FIRST walk for 400004 steps (3383 resets) in 263 ms. (1515 steps per ms) remains 14/14 properties
BEST_FIRST walk for 400004 steps (3389 resets) in 252 ms. (1581 steps per ms) remains 14/14 properties
BEST_FIRST walk for 400003 steps (3799 resets) in 248 ms. (1606 steps per ms) remains 14/14 properties
BEST_FIRST walk for 400003 steps (3815 resets) in 246 ms. (1619 steps per ms) remains 14/14 properties
BEST_FIRST walk for 400003 steps (3806 resets) in 243 ms. (1639 steps per ms) remains 14/14 properties
BEST_FIRST walk for 400004 steps (3786 resets) in 245 ms. (1626 steps per ms) remains 14/14 properties
[2024-05-23 14:56:41] [INFO ] Flow matrix only has 244 transitions (discarded 12 similar events)
// Phase 1: matrix 244 rows 81 cols
[2024-05-23 14:56:41] [INFO ] Computed 18 invariants in 4 ms
[2024-05-23 14:56:41] [INFO ] State equation strengthened by 53 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 26/54 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-05-23 14:56:42] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 3 ms to minimize.
[2024-05-23 14:56:42] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
[2024-05-23 14:56:42] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (OVERLAPS) 27/81 variables, 8/21 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (OVERLAPS) 244/325 variables, 81/102 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/325 variables, 53/155 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/325 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (OVERLAPS) 0/325 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 325/325 variables, and 155 constraints, problems are : Problem set: 0 solved, 14 unsolved in 625 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 81/81 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 26/54 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (OVERLAPS) 27/81 variables, 8/21 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (OVERLAPS) 244/325 variables, 81/102 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/325 variables, 53/155 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/325 variables, 14/169 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/325 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (OVERLAPS) 0/325 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Int declared 325/325 variables, and 169 constraints, problems are : Problem set: 0 solved, 14 unsolved in 684 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 81/81 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 3/3 constraints]
After SMT, in 1339ms problems are : Problem set: 0 solved, 14 unsolved
Parikh walk visited 8 properties in 1388 ms.
Support contains 17 out of 81 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 256/256 transitions.
Graph (complete) has 441 edges and 81 vertex of which 72 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.2 ms
Discarding 9 places :
Also discarding 0 output transitions
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 5 place count 68 transition count 236
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 68 transition count 236
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 12 place count 65 transition count 212
Iterating global reduction 0 with 3 rules applied. Total rules applied 15 place count 65 transition count 212
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 17 place count 63 transition count 198
Iterating global reduction 0 with 2 rules applied. Total rules applied 19 place count 63 transition count 198
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 31 place count 63 transition count 186
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 33 place count 63 transition count 184
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 62 transition count 179
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 62 transition count 179
Free-agglomeration rule applied 6 times.
Iterating global reduction 1 with 6 rules applied. Total rules applied 41 place count 62 transition count 173
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 49 place count 56 transition count 171
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 53 place count 56 transition count 167
Applied a total of 53 rules in 25 ms. Remains 56 /81 variables (removed 25) and now considering 167/256 (removed 89) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 56/81 places, 167/256 transitions.
RANDOM walk for 4000000 steps (401212 resets) in 9320 ms. (429 steps per ms) remains 6/6 properties
BEST_FIRST walk for 4000004 steps (42575 resets) in 1751 ms. (2283 steps per ms) remains 6/6 properties
BEST_FIRST walk for 4000003 steps (42624 resets) in 1741 ms. (2296 steps per ms) remains 6/6 properties
BEST_FIRST walk for 4000003 steps (42618 resets) in 1752 ms. (2281 steps per ms) remains 6/6 properties
BEST_FIRST walk for 4000003 steps (51303 resets) in 2159 ms. (1851 steps per ms) remains 6/6 properties
BEST_FIRST walk for 4000004 steps (49385 resets) in 2224 ms. (1797 steps per ms) remains 6/6 properties
BEST_FIRST walk for 4000004 steps (42221 resets) in 1892 ms. (2113 steps per ms) remains 6/6 properties
Finished probabilistic random walk after 119735 steps, run visited all 6 properties in 301 ms. (steps per millisecond=397 )
Probabilistic random walk after 119735 steps, saw 22815 distinct states, run finished after 305 ms. (steps per millisecond=392 ) properties seen :6
Able to resolve query QuasiLiveness after proving 91 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK PARIKH_WALK PROBABILISTIC_WALK BESTFIRST_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 72312 ms.
ITS solved all properties within timeout

BK_STOP 1716476210711

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

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