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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 516K
-rw-r--r-- 1 mcc users 6.9K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K 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.2K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K 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 19K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 9.6K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 104K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K 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 1717351568169

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-02
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-02 18:06:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2024-06-02 18:06:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:06:09] [INFO ] Load time of PNML (sax parser for PT used): 85 ms
[2024-06-02 18:06:09] [INFO ] Transformed 108 places.
[2024-06-02 18:06:09] [INFO ] Transformed 355 transitions.
[2024-06-02 18:06:09] [INFO ] Found NUPN structural information;
[2024-06-02 18:06:09] [INFO ] Parsed PT model containing 108 places and 355 transitions and 1311 arcs in 185 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 108/108 places, 355/355 transitions.
Ensure Unique test removed 54 transitions
Reduce isomorphic transitions removed 54 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 55 rules applied. Total rules applied 55 place count 108 transition count 300
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 56 place count 107 transition count 300
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 56 place count 107 transition count 299
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 58 place count 106 transition count 299
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 4 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 64 place count 103 transition count 305
Applied a total of 64 rules in 68 ms. Remains 103 /108 variables (removed 5) and now considering 305/355 (removed 50) transitions.
[2024-06-02 18:06:09] [INFO ] Flow matrix only has 263 transitions (discarded 42 similar events)
// Phase 1: matrix 263 rows 103 cols
[2024-06-02 18:06:09] [INFO ] Computed 8 invariants in 18 ms
[2024-06-02 18:06:09] [INFO ] Implicit Places using invariants in 308 ms returned []
[2024-06-02 18:06:09] [INFO ] Flow matrix only has 263 transitions (discarded 42 similar events)
[2024-06-02 18:06:09] [INFO ] Invariant cache hit.
[2024-06-02 18:06:10] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-06-02 18:06:10] [INFO ] Implicit Places using invariants and state equation in 242 ms returned [63]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 579 ms to find 1 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 102/108 places, 305/355 transitions.
Applied a total of 0 rules in 3 ms. Remains 102 /102 variables (removed 0) and now considering 305/305 (removed 0) transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 667 ms. Remains : 102/108 places, 305/355 transitions.
Discarding 104 transitions out of 305. Remains 201
Initial state reduction rules removed 1 formulas.
RANDOM walk for 40000 steps (2435 resets) in 2232 ms. (17 steps per ms) remains 106/200 properties
BEST_FIRST walk for 402 steps (19 resets) in 10 ms. (36 steps per ms) remains 106/106 properties
BEST_FIRST walk for 404 steps (10 resets) in 9 ms. (40 steps per ms) remains 106/106 properties
BEST_FIRST walk for 403 steps (12 resets) in 14 ms. (26 steps per ms) remains 106/106 properties
BEST_FIRST walk for 401 steps (8 resets) in 19 ms. (20 steps per ms) remains 106/106 properties
BEST_FIRST walk for 402 steps (11 resets) in 11 ms. (33 steps per ms) remains 106/106 properties
BEST_FIRST walk for 403 steps (15 resets) in 21 ms. (18 steps per ms) remains 106/106 properties
BEST_FIRST walk for 402 steps (10 resets) in 11 ms. (33 steps per ms) remains 106/106 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 106/106 properties
BEST_FIRST walk for 403 steps (13 resets) in 10 ms. (36 steps per ms) remains 106/106 properties
BEST_FIRST walk for 404 steps (12 resets) in 9 ms. (40 steps per ms) remains 106/106 properties
BEST_FIRST walk for 402 steps (12 resets) in 23 ms. (16 steps per ms) remains 106/106 properties
BEST_FIRST walk for 403 steps (8 resets) in 12 ms. (31 steps per ms) remains 106/106 properties
BEST_FIRST walk for 401 steps (13 resets) in 12 ms. (30 steps per ms) remains 106/106 properties
BEST_FIRST walk for 404 steps (16 resets) in 12 ms. (31 steps per ms) remains 106/106 properties
BEST_FIRST walk for 402 steps (11 resets) in 11 ms. (33 steps per ms) remains 106/106 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 106/106 properties
BEST_FIRST walk for 403 steps (10 resets) in 14 ms. (26 steps per ms) remains 106/106 properties
BEST_FIRST walk for 404 steps (13 resets) in 15 ms. (25 steps per ms) remains 106/106 properties
BEST_FIRST walk for 402 steps (22 resets) in 14 ms. (26 steps per ms) remains 106/106 properties
BEST_FIRST walk for 403 steps (11 resets) in 14 ms. (26 steps per ms) remains 106/106 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 106/106 properties
BEST_FIRST walk for 404 steps (10 resets) in 11 ms. (33 steps per ms) remains 106/106 properties
BEST_FIRST walk for 404 steps (10 resets) in 9 ms. (40 steps per ms) remains 106/106 properties
BEST_FIRST walk for 403 steps (8 resets) in 12 ms. (31 steps per ms) remains 106/106 properties
BEST_FIRST walk for 404 steps (11 resets) in 12 ms. (31 steps per ms) remains 106/106 properties
BEST_FIRST walk for 403 steps (9 resets) in 16 ms. (23 steps per ms) remains 106/106 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 106/106 properties
BEST_FIRST walk for 403 steps (9 resets) in 19 ms. (20 steps per ms) remains 106/106 properties
BEST_FIRST walk for 404 steps (12 resets) in 6 ms. (57 steps per ms) remains 106/106 properties
BEST_FIRST walk for 404 steps (15 resets) in 5 ms. (67 steps per ms) remains 106/106 properties
BEST_FIRST walk for 403 steps (11 resets) in 6 ms. (57 steps per ms) remains 106/106 properties
BEST_FIRST walk for 400 steps (8 resets) in 17 ms. (22 steps per ms) remains 106/106 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 106/106 properties
BEST_FIRST walk for 403 steps (10 resets) in 6 ms. (57 steps per ms) remains 106/106 properties
BEST_FIRST walk for 404 steps (11 resets) in 10 ms. (36 steps per ms) remains 106/106 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 106/106 properties
BEST_FIRST walk for 404 steps (11 resets) in 6 ms. (57 steps per ms) remains 106/106 properties
BEST_FIRST walk for 404 steps (10 resets) in 7 ms. (50 steps per ms) remains 106/106 properties
BEST_FIRST walk for 400 steps (8 resets) in 7 ms. (50 steps per ms) remains 106/106 properties
BEST_FIRST walk for 400 steps (8 resets) in 5 ms. (66 steps per ms) remains 106/106 properties
BEST_FIRST walk for 400 steps (8 resets) in 5 ms. (66 steps per ms) remains 106/106 properties
BEST_FIRST walk for 404 steps (9 resets) in 4 ms. (80 steps per ms) remains 106/106 properties
BEST_FIRST walk for 402 steps (8 resets) in 5 ms. (67 steps per ms) remains 106/106 properties
BEST_FIRST walk for 404 steps (10 resets) in 5 ms. (67 steps per ms) remains 106/106 properties
BEST_FIRST walk for 403 steps (9 resets) in 7 ms. (50 steps per ms) remains 106/106 properties
BEST_FIRST walk for 403 steps (10 resets) in 8 ms. (44 steps per ms) remains 106/106 properties
BEST_FIRST walk for 402 steps (8 resets) in 5 ms. (67 steps per ms) remains 106/106 properties
BEST_FIRST walk for 404 steps (10 resets) in 7 ms. (50 steps per ms) remains 106/106 properties
BEST_FIRST walk for 403 steps (15 resets) in 4 ms. (80 steps per ms) remains 106/106 properties
BEST_FIRST walk for 403 steps (18 resets) in 5 ms. (67 steps per ms) remains 106/106 properties
[2024-06-02 18:06:11] [INFO ] Flow matrix only has 263 transitions (discarded 42 similar events)
// Phase 1: matrix 263 rows 102 cols
[2024-06-02 18:06:11] [INFO ] Computed 7 invariants in 9 ms
[2024-06-02 18:06:11] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 67/67 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (OVERLAPS) 32/99 variables, 6/73 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 32/105 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-06-02 18:06:12] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 9 ms to minimize.
[2024-06-02 18:06:12] [INFO ] Deduced a trap composed of 35 places in 50 ms of which 2 ms to minimize.
[2024-06-02 18:06:12] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 1 ms to minimize.
[2024-06-02 18:06:12] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 1 ms to minimize.
[2024-06-02 18:06:12] [INFO ] Deduced a trap composed of 35 places in 60 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 5/110 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/99 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (OVERLAPS) 2/101 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/101 variables, 2/113 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-06-02 18:06:13] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/101 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/101 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 10 (OVERLAPS) 262/363 variables, 101/215 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/363 variables, 41/256 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/363 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 13 (OVERLAPS) 1/364 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/364 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/364 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 106 unsolved
SMT process timed out in 5188ms, After SMT, problems are : Problem set: 0 solved, 106 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 67 out of 102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 305/305 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 102 transition count 296
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 1 with 9 rules applied. Total rules applied 18 place count 102 transition count 287
Applied a total of 18 rules in 25 ms. Remains 102 /102 variables (removed 0) and now considering 287/305 (removed 18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 102/102 places, 287/305 transitions.
RANDOM walk for 4000000 steps (241273 resets) in 23503 ms. (170 steps per ms) remains 33/106 properties
BEST_FIRST walk for 400001 steps (21814 resets) in 1256 ms. (318 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400004 steps (6295 resets) in 714 ms. (559 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400003 steps (6465 resets) in 666 ms. (599 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400004 steps (161 resets) in 1284 ms. (311 steps per ms) remains 30/33 properties
BEST_FIRST walk for 400004 steps (6289 resets) in 699 ms. (571 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400002 steps (14185 resets) in 760 ms. (525 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400004 steps (6532 resets) in 537 ms. (743 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400002 steps (157 resets) in 814 ms. (490 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400002 steps (6572 resets) in 540 ms. (739 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400003 steps (14130 resets) in 617 ms. (647 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400002 steps (6486 resets) in 510 ms. (782 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400000 steps (268 resets) in 849 ms. (470 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400003 steps (6282 resets) in 676 ms. (590 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400002 steps (14223 resets) in 616 ms. (648 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400004 steps (6582 resets) in 516 ms. (773 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400003 steps (287 resets) in 823 ms. (485 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400003 steps (6201 resets) in 495 ms. (806 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400003 steps (14277 resets) in 610 ms. (654 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400000 steps (21853 resets) in 791 ms. (505 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400003 steps (6319 resets) in 500 ms. (798 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400002 steps (6232 resets) in 495 ms. (806 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400002 steps (6198 resets) in 495 ms. (806 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400003 steps (13969 resets) in 598 ms. (667 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400003 steps (6361 resets) in 519 ms. (769 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400002 steps (246 resets) in 915 ms. (436 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400004 steps (6341 resets) in 529 ms. (754 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400002 steps (6384 resets) in 520 ms. (767 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400003 steps (6356 resets) in 547 ms. (729 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400003 steps (6441 resets) in 564 ms. (707 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400003 steps (6414 resets) in 543 ms. (735 steps per ms) remains 30/30 properties
[2024-06-02 18:06:29] [INFO ] Flow matrix only has 259 transitions (discarded 28 similar events)
// Phase 1: matrix 259 rows 102 cols
[2024-06-02 18:06:29] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 18:06:29] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (OVERLAPS) 72/96 variables, 5/29 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 72/101 constraints. Problems are: Problem set: 0 solved, 30 unsolved
[2024-06-02 18:06:29] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 2 ms to minimize.
[2024-06-02 18:06:29] [INFO ] Deduced a trap composed of 35 places in 32 ms of which 1 ms to minimize.
[2024-06-02 18:06:29] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 3/104 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/96 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (OVERLAPS) 4/100 variables, 2/106 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/100 variables, 4/110 constraints. Problems are: Problem set: 0 solved, 30 unsolved
[2024-06-02 18:06:29] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/100 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/100 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 10 (OVERLAPS) 258/358 variables, 100/211 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/358 variables, 40/251 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/358 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 13 (OVERLAPS) 3/361 variables, 2/253 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/361 variables, 2/255 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/361 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/361 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 17 (OVERLAPS) 0/361 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Real declared 361/361 variables, and 256 constraints, problems are : Problem set: 0 solved, 30 unsolved in 1678 ms.
Refiners :[Domain max(s): 102/102 constraints, Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 102/102 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 30 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (OVERLAPS) 72/96 variables, 5/29 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 72/101 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 3/104 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/96 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (OVERLAPS) 4/100 variables, 2/106 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/100 variables, 4/110 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/100 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/100 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 10 (OVERLAPS) 258/358 variables, 100/211 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/358 variables, 40/251 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/358 variables, 30/281 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/358 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 14 (OVERLAPS) 3/361 variables, 2/283 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/361 variables, 2/285 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/361 variables, 1/286 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/361 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 18 (OVERLAPS) 0/361 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Int declared 361/361 variables, and 286 constraints, problems are : Problem set: 0 solved, 30 unsolved in 2022 ms.
Refiners :[Domain max(s): 102/102 constraints, Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 102/102 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 4/4 constraints]
After SMT, in 3735ms problems are : Problem set: 0 solved, 30 unsolved
Parikh walk visited 0 properties in 1195 ms.
Support contains 24 out of 102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 287/287 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 100 transition count 283
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 100 transition count 283
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 6 place count 100 transition count 281
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 100 transition count 283
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 10 place count 99 transition count 281
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 12 place count 99 transition count 279
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 13 place count 98 transition count 278
Applied a total of 13 rules in 45 ms. Remains 98 /102 variables (removed 4) and now considering 278/287 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 98/102 places, 278/287 transitions.
RANDOM walk for 4000000 steps (255654 resets) in 17035 ms. (234 steps per ms) remains 22/30 properties
BEST_FIRST walk for 400004 steps (6370 resets) in 533 ms. (749 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400001 steps (6559 resets) in 513 ms. (778 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400003 steps (379 resets) in 798 ms. (500 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400004 steps (6487 resets) in 569 ms. (701 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400002 steps (14647 resets) in 633 ms. (630 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400003 steps (6675 resets) in 528 ms. (756 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400001 steps (207 resets) in 928 ms. (430 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400003 steps (6230 resets) in 579 ms. (689 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400002 steps (14686 resets) in 639 ms. (625 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400004 steps (6528 resets) in 545 ms. (732 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400001 steps (304 resets) in 808 ms. (494 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400003 steps (6365 resets) in 565 ms. (706 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400002 steps (14559 resets) in 645 ms. (619 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400004 steps (6462 resets) in 508 ms. (785 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400002 steps (6345 resets) in 521 ms. (766 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400003 steps (6420 resets) in 508 ms. (785 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400003 steps (14668 resets) in 607 ms. (657 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400004 steps (6804 resets) in 543 ms. (735 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400003 steps (332 resets) in 819 ms. (487 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400002 steps (6550 resets) in 539 ms. (740 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400002 steps (6396 resets) in 504 ms. (792 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400002 steps (6695 resets) in 537 ms. (743 steps per ms) remains 22/22 properties
[2024-06-02 18:06:43] [INFO ] Flow matrix only has 249 transitions (discarded 29 similar events)
// Phase 1: matrix 249 rows 98 cols
[2024-06-02 18:06:43] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 18:06:43] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 71/90 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 22 unsolved
[2024-06-02 18:06:43] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-06-02 18:06:43] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 22 unsolved
[2024-06-02 18:06:43] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (OVERLAPS) 245/335 variables, 90/97 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/335 variables, 40/137 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/335 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 8 (OVERLAPS) 11/346 variables, 7/144 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/346 variables, 3/147 constraints. Problems are: Problem set: 0 solved, 22 unsolved
[2024-06-02 18:06:44] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/346 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/346 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 12 (OVERLAPS) 1/347 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/347 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 14 (OVERLAPS) 0/347 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Real declared 347/347 variables, and 149 constraints, problems are : Problem set: 0 solved, 22 unsolved in 1580 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 98/98 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 22 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 71/90 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (OVERLAPS) 245/335 variables, 90/98 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/335 variables, 40/138 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/335 variables, 18/156 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/335 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 8 (OVERLAPS) 11/346 variables, 7/163 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/346 variables, 3/166 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/346 variables, 4/170 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/346 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 12 (OVERLAPS) 1/347 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 22 unsolved
[2024-06-02 18:06:46] [INFO ] Deduced a trap composed of 33 places in 39 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/347 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/347 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 15 (OVERLAPS) 0/347 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Int declared 347/347 variables, and 172 constraints, problems are : Problem set: 0 solved, 22 unsolved in 1741 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 98/98 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 5/5 constraints]
After SMT, in 3354ms problems are : Problem set: 0 solved, 22 unsolved
Fused 22 Parikh solutions to 21 different solutions.
Parikh walk visited 0 properties in 3 ms.
Support contains 19 out of 98 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 278/278 transitions.
Applied a total of 0 rules in 10 ms. Remains 98 /98 variables (removed 0) and now considering 278/278 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 98/98 places, 278/278 transitions.
RANDOM walk for 4000000 steps (257333 resets) in 18369 ms. (217 steps per ms) remains 21/22 properties
BEST_FIRST walk for 400002 steps (6335 resets) in 478 ms. (835 steps per ms) remains 21/21 properties
BEST_FIRST walk for 400004 steps (6463 resets) in 491 ms. (813 steps per ms) remains 21/21 properties
BEST_FIRST walk for 400004 steps (309 resets) in 742 ms. (538 steps per ms) remains 20/21 properties
BEST_FIRST walk for 400004 steps (6500 resets) in 533 ms. (749 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400002 steps (14606 resets) in 573 ms. (696 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400002 steps (6556 resets) in 503 ms. (793 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400002 steps (283 resets) in 769 ms. (519 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400003 steps (6541 resets) in 544 ms. (733 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400003 steps (14608 resets) in 594 ms. (672 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400003 steps (6576 resets) in 495 ms. (806 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400002 steps (270 resets) in 883 ms. (452 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400002 steps (6334 resets) in 665 ms. (600 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400003 steps (14447 resets) in 725 ms. (550 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400003 steps (6460 resets) in 598 ms. (667 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400004 steps (6305 resets) in 658 ms. (606 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400004 steps (6329 resets) in 622 ms. (642 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400002 steps (6568 resets) in 1048 ms. (381 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400002 steps (6559 resets) in 606 ms. (658 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400002 steps (6460 resets) in 960 ms. (416 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400001 steps (6747 resets) in 1068 ms. (374 steps per ms) remains 20/20 properties
Finished probabilistic random walk after 162359 steps, run visited all 20 properties in 656 ms. (steps per millisecond=247 )
Probabilistic random walk after 162359 steps, saw 41646 distinct states, run finished after 660 ms. (steps per millisecond=245 ) properties seen :20
Able to resolve query QuasiLiveness after proving 201 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK PROBABILISTIC_WALK BESTFIRST_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 48767 ms.
ITS solved all properties within timeout

BK_STOP 1717351618171

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

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