fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r560-tall-171734905700117
Last Updated
July 7, 2024

About the Execution of GreatSPN+red for FireWire-PT-03

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
687.903 49301.00 135310.00 150.60 T normal

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.r560-tall-171734905700117.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 FireWire-PT-03, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r560-tall-171734905700117
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 564K
-rw-r--r-- 1 mcc users 6.9K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 13K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 141K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 86K Jun 2 16:33 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 1717351581121

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=FireWire-PT-03
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-02 18:06:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2024-06-02 18:06:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:06:22] [INFO ] Load time of PNML (sax parser for PT used): 79 ms
[2024-06-02 18:06:22] [INFO ] Transformed 112 places.
[2024-06-02 18:06:22] [INFO ] Transformed 356 transitions.
[2024-06-02 18:06:22] [INFO ] Found NUPN structural information;
[2024-06-02 18:06:22] [INFO ] Parsed PT model containing 112 places and 356 transitions and 1308 arcs in 176 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 112/112 places, 356/356 transitions.
Ensure Unique test removed 53 transitions
Reduce isomorphic transitions removed 53 transitions.
Iterating post reduction 0 with 53 rules applied. Total rules applied 53 place count 112 transition count 303
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 53 place count 112 transition count 302
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 55 place count 111 transition count 302
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 61 place count 108 transition count 299
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 67 place count 105 transition count 305
Applied a total of 67 rules in 57 ms. Remains 105 /112 variables (removed 7) and now considering 305/356 (removed 51) transitions.
[2024-06-02 18:06:22] [INFO ] Flow matrix only has 262 transitions (discarded 43 similar events)
// Phase 1: matrix 262 rows 105 cols
[2024-06-02 18:06:22] [INFO ] Computed 9 invariants in 15 ms
[2024-06-02 18:06:22] [INFO ] Implicit Places using invariants in 252 ms returned [104]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 282 ms to find 1 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 104/112 places, 305/356 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 104 transition count 304
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 103 transition count 304
Applied a total of 2 rules in 7 ms. Remains 103 /104 variables (removed 1) and now considering 304/305 (removed 1) transitions.
[2024-06-02 18:06:22] [INFO ] Flow matrix only has 261 transitions (discarded 43 similar events)
// Phase 1: matrix 261 rows 103 cols
[2024-06-02 18:06:22] [INFO ] Computed 8 invariants in 3 ms
[2024-06-02 18:06:22] [INFO ] Implicit Places using invariants in 111 ms returned []
[2024-06-02 18:06:22] [INFO ] Flow matrix only has 261 transitions (discarded 43 similar events)
[2024-06-02 18:06:22] [INFO ] Invariant cache hit.
[2024-06-02 18:06:23] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-06-02 18:06:23] [INFO ] Implicit Places using invariants and state equation in 275 ms returned []
Implicit Place search using SMT with State Equation took 388 ms to find 0 implicit places.
Starting structural reductions in LIVENESS mode, iteration 2 : 103/112 places, 304/356 transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 756 ms. Remains : 103/112 places, 304/356 transitions.
Discarding 104 transitions out of 304. Remains 200
Initial state reduction rules removed 1 formulas.
RANDOM walk for 40000 steps (2287 resets) in 1980 ms. (20 steps per ms) remains 91/199 properties
BEST_FIRST walk for 4002 steps (178 resets) in 31 ms. (125 steps per ms) remains 91/91 properties
BEST_FIRST walk for 4004 steps (136 resets) in 33 ms. (117 steps per ms) remains 91/91 properties
BEST_FIRST walk for 4004 steps (28 resets) in 27 ms. (143 steps per ms) remains 91/91 properties
BEST_FIRST walk for 4004 steps (42 resets) in 34 ms. (114 steps per ms) remains 89/91 properties
BEST_FIRST walk for 4002 steps (63 resets) in 39 ms. (100 steps per ms) remains 89/89 properties
BEST_FIRST walk for 4002 steps (174 resets) in 42 ms. (93 steps per ms) remains 89/89 properties
BEST_FIRST walk for 4003 steps (49 resets) in 14 ms. (266 steps per ms) remains 89/89 properties
BEST_FIRST walk for 4004 steps (59 resets) in 16 ms. (235 steps per ms) remains 89/89 properties
BEST_FIRST walk for 4003 steps (122 resets) in 14 ms. (266 steps per ms) remains 89/89 properties
BEST_FIRST walk for 4002 steps (45 resets) in 22 ms. (174 steps per ms) remains 89/89 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 87/89 properties
BEST_FIRST walk for 4002 steps (8 resets) in 25 ms. (153 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4003 steps (15 resets) in 11 ms. (333 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4004 steps (14 resets) in 12 ms. (308 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4002 steps (113 resets) in 24 ms. (160 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4000 steps (8 resets) in 19 ms. (200 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4003 steps (23 resets) in 12 ms. (307 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4003 steps (19 resets) in 16 ms. (235 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4002 steps (8 resets) in 11 ms. (333 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4004 steps (15 resets) in 19 ms. (200 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4004 steps (24 resets) in 9 ms. (400 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4003 steps (8 resets) in 9 ms. (400 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4003 steps (17 resets) in 13 ms. (285 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4004 steps (10 resets) in 11 ms. (333 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4002 steps (181 resets) in 27 ms. (142 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4002 steps (64 resets) in 12 ms. (307 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4004 steps (77 resets) in 22 ms. (174 steps per ms) remains 86/87 properties
BEST_FIRST walk for 4002 steps (123 resets) in 15 ms. (250 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4004 steps (60 resets) in 12 ms. (308 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4004 steps (9 resets) in 22 ms. (174 steps per ms) remains 84/86 properties
BEST_FIRST walk for 4004 steps (40 resets) in 15 ms. (250 steps per ms) remains 84/84 properties
BEST_FIRST walk for 4003 steps (133 resets) in 18 ms. (210 steps per ms) remains 84/84 properties
BEST_FIRST walk for 4004 steps (53 resets) in 15 ms. (250 steps per ms) remains 84/84 properties
BEST_FIRST walk for 4004 steps (9 resets) in 11 ms. (333 steps per ms) remains 82/84 properties
BEST_FIRST walk for 4002 steps (48 resets) in 11 ms. (333 steps per ms) remains 82/82 properties
BEST_FIRST walk for 4003 steps (135 resets) in 14 ms. (266 steps per ms) remains 82/82 properties
BEST_FIRST walk for 4004 steps (59 resets) in 12 ms. (308 steps per ms) remains 82/82 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 82/82 properties
BEST_FIRST walk for 4003 steps (63 resets) in 15 ms. (250 steps per ms) remains 82/82 properties
BEST_FIRST walk for 4002 steps (109 resets) in 12 ms. (307 steps per ms) remains 82/82 properties
BEST_FIRST walk for 4003 steps (67 resets) in 12 ms. (307 steps per ms) remains 82/82 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 82/82 properties
BEST_FIRST walk for 4004 steps (74 resets) in 13 ms. (286 steps per ms) remains 82/82 properties
BEST_FIRST walk for 4003 steps (127 resets) in 14 ms. (266 steps per ms) remains 82/82 properties
BEST_FIRST walk for 4003 steps (58 resets) in 13 ms. (285 steps per ms) remains 82/82 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 82/82 properties
BEST_FIRST walk for 4004 steps (57 resets) in 12 ms. (308 steps per ms) remains 82/82 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 82/82 properties
BEST_FIRST walk for 4004 steps (57 resets) in 12 ms. (308 steps per ms) remains 82/82 properties
BEST_FIRST walk for 4003 steps (120 resets) in 15 ms. (250 steps per ms) remains 82/82 properties
BEST_FIRST walk for 4001 steps (57 resets) in 13 ms. (285 steps per ms) remains 82/82 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 82/82 properties
BEST_FIRST walk for 4004 steps (56 resets) in 13 ms. (286 steps per ms) remains 82/82 properties
BEST_FIRST walk for 4003 steps (124 resets) in 16 ms. (235 steps per ms) remains 82/82 properties
BEST_FIRST walk for 4004 steps (74 resets) in 29 ms. (133 steps per ms) remains 81/82 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 80/81 properties
BEST_FIRST walk for 4004 steps (69 resets) in 28 ms. (138 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4002 steps (125 resets) in 15 ms. (250 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4004 steps (9 resets) in 10 ms. (364 steps per ms) remains 74/80 properties
BEST_FIRST walk for 4003 steps (55 resets) in 12 ms. (307 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4003 steps (10 resets) in 12 ms. (307 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (67 resets) in 13 ms. (286 steps per ms) remains 73/74 properties
BEST_FIRST walk for 4003 steps (123 resets) in 13 ms. (285 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (55 resets) in 12 ms. (308 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4002 steps (9 resets) in 14 ms. (266 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4002 steps (61 resets) in 12 ms. (307 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4001 steps (126 resets) in 27 ms. (142 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4003 steps (71 resets) in 11 ms. (333 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (61 resets) in 10 ms. (364 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (116 resets) in 11 ms. (333 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4002 steps (8 resets) in 10 ms. (363 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4003 steps (67 resets) in 12 ms. (307 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4003 steps (53 resets) in 10 ms. (363 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4003 steps (57 resets) in 28 ms. (138 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4003 steps (52 resets) in 13 ms. (285 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4003 steps (54 resets) in 11 ms. (333 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4003 steps (73 resets) in 11 ms. (333 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4002 steps (8 resets) in 10 ms. (363 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4003 steps (59 resets) in 11 ms. (333 steps per ms) remains 72/73 properties
[2024-06-02 18:06:24] [INFO ] Flow matrix only has 261 transitions (discarded 43 similar events)
[2024-06-02 18:06:24] [INFO ] Invariant cache hit.
[2024-06-02 18:06:24] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/55 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (OVERLAPS) 48/103 variables, 8/63 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 48/111 constraints. Problems are: Problem set: 0 solved, 72 unsolved
[2024-06-02 18:06:25] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 11 ms to minimize.
[2024-06-02 18:06:25] [INFO ] Deduced a trap composed of 34 places in 59 ms of which 1 ms to minimize.
[2024-06-02 18:06:25] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2024-06-02 18:06:25] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 0 ms to minimize.
[2024-06-02 18:06:25] [INFO ] Deduced a trap composed of 22 places in 144 ms of which 1 ms to minimize.
[2024-06-02 18:06:26] [INFO ] Deduced a trap composed of 33 places in 79 ms of which 1 ms to minimize.
[2024-06-02 18:06:26] [INFO ] Deduced a trap composed of 36 places in 96 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 7/118 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (OVERLAPS) 260/363 variables, 103/221 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/363 variables, 40/261 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/363 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 9 (OVERLAPS) 1/364 variables, 1/262 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/364 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 11 (OVERLAPS) 0/364 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Real declared 364/364 variables, and 262 constraints, problems are : Problem set: 0 solved, 72 unsolved in 4596 ms.
Refiners :[Domain max(s): 103/103 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 103/103 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 72 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/55 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (OVERLAPS) 48/103 variables, 8/63 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 48/111 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 7/118 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (OVERLAPS) 260/363 variables, 103/221 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/363 variables, 40/261 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/363 variables, 72/333 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/363 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 10 (OVERLAPS) 1/364 variables, 1/334 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/364 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 12 (OVERLAPS) 0/364 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Int declared 364/364 variables, and 334 constraints, problems are : Problem set: 0 solved, 72 unsolved in 4725 ms.
Refiners :[Domain max(s): 103/103 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 103/103 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 7/7 constraints]
After SMT, in 9441ms problems are : Problem set: 0 solved, 72 unsolved
Parikh walk visited 35 properties in 6326 ms.
Support contains 36 out of 103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 304/304 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 103 transition count 295
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 11 place count 101 transition count 289
Iterating global reduction 1 with 2 rules applied. Total rules applied 13 place count 101 transition count 289
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 15 place count 99 transition count 285
Iterating global reduction 1 with 2 rules applied. Total rules applied 17 place count 99 transition count 285
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 1 with 11 rules applied. Total rules applied 28 place count 99 transition count 274
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 99 transition count 276
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 32 place count 98 transition count 274
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 34 place count 98 transition count 272
Applied a total of 34 rules in 57 ms. Remains 98 /103 variables (removed 5) and now considering 272/304 (removed 32) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 98/103 places, 272/304 transitions.
RANDOM walk for 4000000 steps (229266 resets) in 26216 ms. (152 steps per ms) remains 27/37 properties
BEST_FIRST walk for 400003 steps (5977 resets) in 738 ms. (541 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400003 steps (12351 resets) in 909 ms. (439 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400003 steps (5896 resets) in 599 ms. (666 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400002 steps (5895 resets) in 544 ms. (733 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400002 steps (12280 resets) in 995 ms. (401 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400002 steps (5948 resets) in 841 ms. (475 steps per ms) remains 25/27 properties
BEST_FIRST walk for 400002 steps (286 resets) in 1351 ms. (295 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400004 steps (5831 resets) in 599 ms. (666 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400002 steps (12291 resets) in 753 ms. (530 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400002 steps (6061 resets) in 619 ms. (645 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400002 steps (240 resets) in 1154 ms. (346 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400002 steps (5888 resets) in 680 ms. (587 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400002 steps (12277 resets) in 703 ms. (568 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400003 steps (6269 resets) in 971 ms. (411 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400002 steps (255 resets) in 818 ms. (488 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400003 steps (5851 resets) in 565 ms. (706 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400001 steps (12295 resets) in 748 ms. (534 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400003 steps (5888 resets) in 694 ms. (575 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400001 steps (382 resets) in 675 ms. (591 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400003 steps (5924 resets) in 946 ms. (422 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400002 steps (6057 resets) in 642 ms. (622 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400004 steps (5810 resets) in 483 ms. (826 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400002 steps (12278 resets) in 553 ms. (722 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400002 steps (5879 resets) in 484 ms. (824 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400002 steps (5870 resets) in 482 ms. (828 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400003 steps (6068 resets) in 490 ms. (814 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400003 steps (5125 resets) in 517 ms. (772 steps per ms) remains 25/25 properties
[2024-06-02 18:06:57] [INFO ] Flow matrix only has 244 transitions (discarded 28 similar events)
// Phase 1: matrix 244 rows 98 cols
[2024-06-02 18:06:57] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 18:06:57] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (OVERLAPS) 71/94 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 25 unsolved
[2024-06-02 18:06:57] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2024-06-02 18:06:57] [INFO ] Deduced a trap composed of 33 places in 29 ms of which 2 ms to minimize.
[2024-06-02 18:06:57] [INFO ] Deduced a trap composed of 22 places in 69 ms of which 1 ms to minimize.
[2024-06-02 18:06:57] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (OVERLAPS) 4/98 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 25 unsolved
[2024-06-02 18:06:58] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/98 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 7 (OVERLAPS) 244/342 variables, 98/111 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/342 variables, 38/149 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/342 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 10 (OVERLAPS) 0/342 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Real declared 342/342 variables, and 149 constraints, problems are : Problem set: 0 solved, 25 unsolved in 1283 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 98/98 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 25 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (OVERLAPS) 71/94 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (OVERLAPS) 4/98 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 25 unsolved
[2024-06-02 18:06:58] [INFO ] Deduced a trap composed of 16 places in 20 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/98 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/98 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 8 (OVERLAPS) 244/342 variables, 98/112 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/342 variables, 38/150 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/342 variables, 25/175 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/342 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 25 unsolved
[2024-06-02 18:06:59] [INFO ] Deduced a trap composed of 44 places in 45 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/342 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/342 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 14 (OVERLAPS) 0/342 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Int declared 342/342 variables, and 176 constraints, problems are : Problem set: 0 solved, 25 unsolved in 1865 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 98/98 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 7/7 constraints]
After SMT, in 3172ms problems are : Problem set: 0 solved, 25 unsolved
Parikh walk visited 0 properties in 487 ms.
Support contains 23 out of 98 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 272/272 transitions.
Applied a total of 0 rules in 8 ms. Remains 98 /98 variables (removed 0) and now considering 272/272 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 98/98 places, 272/272 transitions.
RANDOM walk for 4000000 steps (230273 resets) in 15742 ms. (254 steps per ms) remains 24/25 properties
BEST_FIRST walk for 400004 steps (5885 resets) in 483 ms. (826 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400002 steps (5902 resets) in 477 ms. (836 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400004 steps (12350 resets) in 540 ms. (739 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400002 steps (6063 resets) in 470 ms. (849 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400002 steps (84 resets) in 784 ms. (509 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400004 steps (5795 resets) in 461 ms. (865 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400003 steps (12226 resets) in 549 ms. (727 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400004 steps (6059 resets) in 484 ms. (824 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400001 steps (138 resets) in 728 ms. (548 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400004 steps (5867 resets) in 470 ms. (849 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400002 steps (12347 resets) in 544 ms. (733 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400003 steps (6101 resets) in 458 ms. (871 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400002 steps (105 resets) in 809 ms. (493 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400004 steps (5693 resets) in 453 ms. (881 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400001 steps (12373 resets) in 521 ms. (766 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400002 steps (6040 resets) in 455 ms. (877 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400002 steps (147 resets) in 721 ms. (554 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400004 steps (5731 resets) in 483 ms. (826 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400004 steps (6107 resets) in 464 ms. (860 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400003 steps (5889 resets) in 474 ms. (842 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400004 steps (5787 resets) in 462 ms. (863 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400002 steps (5902 resets) in 468 ms. (852 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400003 steps (6062 resets) in 467 ms. (854 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400004 steps (5119 resets) in 409 ms. (975 steps per ms) remains 24/24 properties
Finished probabilistic random walk after 222974 steps, run visited all 24 properties in 1038 ms. (steps per millisecond=214 )
Probabilistic random walk after 222974 steps, saw 48361 distinct states, run finished after 1043 ms. (steps per millisecond=213 ) properties seen :24
Able to resolve query QuasiLiveness after proving 200 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK PARIKH_WALK PROBABILISTIC_WALK BESTFIRST_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 48103 ms.
ITS solved all properties within timeout

BK_STOP 1717351630422

--------------------
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="FireWire-PT-03"
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 FireWire-PT-03, 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 r560-tall-171734905700117"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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