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.r564-tall-171734907600112.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is FireWire-PT-02, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r564-tall-171734907600112
=====================================================================

--------------------
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 1717361556301

Invoking MCC driver with
BK_TOOL=ltsminxred
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 ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 20:52:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2024-06-02 20:52:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 20:52:37] [INFO ] Load time of PNML (sax parser for PT used): 76 ms
[2024-06-02 20:52:37] [INFO ] Transformed 108 places.
[2024-06-02 20:52:37] [INFO ] Transformed 355 transitions.
[2024-06-02 20:52:37] [INFO ] Found NUPN structural information;
[2024-06-02 20:52:37] [INFO ] Parsed PT model containing 108 places and 355 transitions and 1311 arcs in 171 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 1 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 1 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 56 ms. Remains 103 /108 variables (removed 5) and now considering 305/355 (removed 50) transitions.
[2024-06-02 20:52:37] [INFO ] Flow matrix only has 263 transitions (discarded 42 similar events)
// Phase 1: matrix 263 rows 103 cols
[2024-06-02 20:52:37] [INFO ] Computed 8 invariants in 11 ms
[2024-06-02 20:52:37] [INFO ] Implicit Places using invariants in 266 ms returned []
[2024-06-02 20:52:37] [INFO ] Flow matrix only has 263 transitions (discarded 42 similar events)
[2024-06-02 20:52:37] [INFO ] Invariant cache hit.
[2024-06-02 20:52:38] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-06-02 20:52:38] [INFO ] Implicit Places using invariants and state equation in 190 ms returned [63]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 485 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 4 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 561 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 (2382 resets) in 2739 ms. (14 steps per ms) remains 79/200 properties
BEST_FIRST walk for 4002 steps (216 resets) in 53 ms. (74 steps per ms) remains 79/79 properties
BEST_FIRST walk for 4004 steps (58 resets) in 70 ms. (56 steps per ms) remains 78/79 properties
BEST_FIRST walk for 4001 steps (67 resets) in 46 ms. (85 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (8 resets) in 70 ms. (56 steps per ms) remains 77/78 properties
BEST_FIRST walk for 4004 steps (69 resets) in 30 ms. (129 steps per ms) remains 76/77 properties
BEST_FIRST walk for 4004 steps (155 resets) in 24 ms. (160 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4003 steps (56 resets) in 20 ms. (190 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4004 steps (10 resets) in 16 ms. (235 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4004 steps (76 resets) in 30 ms. (129 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4004 steps (152 resets) in 16 ms. (235 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4004 steps (75 resets) in 16 ms. (235 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 73/76 properties
BEST_FIRST walk for 4003 steps (45 resets) in 15 ms. (250 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (144 resets) in 16 ms. (235 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (68 resets) in 14 ms. (266 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4002 steps (8 resets) in 14 ms. (266 steps per ms) remains 70/73 properties
BEST_FIRST walk for 4002 steps (72 resets) in 17 ms. (222 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4001 steps (132 resets) in 42 ms. (93 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4001 steps (219 resets) in 33 ms. (117 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4003 steps (60 resets) in 13 ms. (285 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4002 steps (8 resets) in 12 ms. (307 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4003 steps (13 resets) in 13 ms. (285 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4004 steps (12 resets) in 9 ms. (400 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4003 steps (133 resets) in 19 ms. (200 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4000 steps (8 resets) in 29 ms. (133 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4004 steps (83 resets) in 17 ms. (222 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4003 steps (9 resets) in 13 ms. (285 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4003 steps (50 resets) in 14 ms. (266 steps per ms) remains 68/70 properties
BEST_FIRST walk for 4001 steps (141 resets) in 17 ms. (222 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4002 steps (218 resets) in 27 ms. (142 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4004 steps (58 resets) in 34 ms. (114 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4003 steps (59 resets) in 14 ms. (266 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4003 steps (32 resets) in 24 ms. (160 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4003 steps (157 resets) in 25 ms. (153 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4004 steps (58 resets) in 16 ms. (235 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4004 steps (144 resets) in 19 ms. (200 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4003 steps (59 resets) in 16 ms. (235 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4004 steps (9 resets) in 17 ms. (222 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4003 steps (48 resets) in 18 ms. (210 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4001 steps (144 resets) in 26 ms. (148 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4004 steps (71 resets) in 22 ms. (174 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 67/68 properties
BEST_FIRST walk for 4003 steps (65 resets) in 16 ms. (235 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4002 steps (155 resets) in 42 ms. (93 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4002 steps (68 resets) in 21 ms. (181 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (10 resets) in 11 ms. (333 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (10 resets) in 15 ms. (250 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4002 steps (73 resets) in 13 ms. (285 steps per ms) remains 65/67 properties
BEST_FIRST walk for 4004 steps (48 resets) in 14 ms. (266 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (132 resets) in 16 ms. (235 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (65 resets) in 15 ms. (250 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (50 resets) in 12 ms. (307 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4001 steps (149 resets) in 13 ms. (285 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4001 steps (65 resets) in 9 ms. (400 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (9 resets) in 9 ms. (400 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4004 steps (81 resets) in 10 ms. (364 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (138 resets) in 13 ms. (285 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (79 resets) in 38 ms. (102 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4004 steps (69 resets) in 14 ms. (266 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (73 resets) in 24 ms. (160 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (57 resets) in 10 ms. (363 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4002 steps (53 resets) in 13 ms. (285 steps per ms) remains 65/65 properties
[2024-06-02 20:52:39] [INFO ] Flow matrix only has 263 transitions (discarded 42 similar events)
// Phase 1: matrix 263 rows 102 cols
[2024-06-02 20:52:39] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 20:52:39] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (OVERLAPS) 50/98 variables, 6/54 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 50/104 constraints. Problems are: Problem set: 0 solved, 65 unsolved
[2024-06-02 20:52:40] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 9 ms to minimize.
[2024-06-02 20:52:40] [INFO ] Deduced a trap composed of 35 places in 37 ms of which 2 ms to minimize.
[2024-06-02 20:52:40] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 3/107 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (OVERLAPS) 2/100 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/100 variables, 2/110 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/100 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 9 (OVERLAPS) 261/361 variables, 100/210 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/361 variables, 40/250 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/361 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 12 (OVERLAPS) 3/364 variables, 2/252 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/364 variables, 2/254 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/364 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/364 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 16 (OVERLAPS) 1/365 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/365 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 18 (OVERLAPS) 0/365 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Real declared 365/365 variables, and 256 constraints, problems are : Problem set: 0 solved, 65 unsolved in 4779 ms.
Refiners :[Domain max(s): 102/102 constraints, Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 102/102 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 65 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (OVERLAPS) 50/98 variables, 6/54 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 50/104 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 3/107 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (OVERLAPS) 2/100 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/100 variables, 2/110 constraints. Problems are: Problem set: 0 solved, 65 unsolved
[2024-06-02 20:52:45] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/100 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/100 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 10 (OVERLAPS) 261/361 variables, 100/211 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/361 variables, 40/251 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/361 variables, 63/314 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/361 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 14 (OVERLAPS) 3/364 variables, 2/316 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/364 variables, 2/318 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/364 variables, 1/319 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/364 variables, 2/321 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/364 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 19 (OVERLAPS) 1/365 variables, 1/322 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/365 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 65 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 365/365 variables, and 322 constraints, problems are : Problem set: 0 solved, 65 unsolved in 5017 ms.
Refiners :[Domain max(s): 102/102 constraints, Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 102/102 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 4/4 constraints]
After SMT, in 9905ms problems are : Problem set: 0 solved, 65 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 48 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
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 101 transition count 294
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 101 transition count 294
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 12 place count 101 transition count 293
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 2 with 9 rules applied. Total rules applied 21 place count 101 transition count 284
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 101 transition count 286
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 2 with 3 rules applied. Total rules applied 25 place count 100 transition count 284
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 27 place count 100 transition count 282
Applied a total of 27 rules in 53 ms. Remains 100 /102 variables (removed 2) and now considering 282/305 (removed 23) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 100/102 places, 282/305 transitions.
RANDOM walk for 4000000 steps (240924 resets) in 23035 ms. (173 steps per ms) remains 35/65 properties
BEST_FIRST walk for 400003 steps (6355 resets) in 800 ms. (499 steps per ms) remains 35/35 properties
BEST_FIRST walk for 400003 steps (6468 resets) in 883 ms. (452 steps per ms) remains 35/35 properties
BEST_FIRST walk for 400001 steps (209 resets) in 887 ms. (450 steps per ms) remains 35/35 properties
BEST_FIRST walk for 400003 steps (6275 resets) in 582 ms. (686 steps per ms) remains 35/35 properties
BEST_FIRST walk for 400002 steps (14096 resets) in 685 ms. (583 steps per ms) remains 35/35 properties
BEST_FIRST walk for 400003 steps (6606 resets) in 586 ms. (681 steps per ms) remains 35/35 properties
BEST_FIRST walk for 400001 steps (121 resets) in 1010 ms. (395 steps per ms) remains 30/35 properties
BEST_FIRST walk for 400002 steps (14166 resets) in 680 ms. (587 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400004 steps (6388 resets) in 523 ms. (763 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400001 steps (138 resets) in 899 ms. (444 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400002 steps (6161 resets) in 525 ms. (760 steps per ms) remains 28/30 properties
BEST_FIRST walk for 400004 steps (14156 resets) in 620 ms. (644 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400003 steps (6597 resets) in 524 ms. (761 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400002 steps (314 resets) in 906 ms. (441 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400001 steps (6393 resets) in 547 ms. (729 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400001 steps (14111 resets) in 633 ms. (630 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400004 steps (6220 resets) in 511 ms. (781 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400004 steps (163 resets) in 951 ms. (420 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400004 steps (14136 resets) in 669 ms. (597 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400003 steps (6386 resets) in 481 ms. (829 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400002 steps (6184 resets) in 500 ms. (798 steps per ms) remains 27/28 properties
BEST_FIRST walk for 400002 steps (6474 resets) in 489 ms. (816 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (6402 resets) in 493 ms. (809 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (6436 resets) in 491 ms. (813 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400001 steps (201 resets) in 778 ms. (513 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400001 steps (6308 resets) in 511 ms. (781 steps per ms) remains 26/27 properties
BEST_FIRST walk for 400003 steps (6293 resets) in 490 ms. (814 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400003 steps (6225 resets) in 479 ms. (833 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400003 steps (6513 resets) in 481 ms. (829 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400002 steps (6393 resets) in 486 ms. (821 steps per ms) remains 26/26 properties
[2024-06-02 20:53:02] [INFO ] Flow matrix only has 253 transitions (discarded 29 similar events)
// Phase 1: matrix 253 rows 100 cols
[2024-06-02 20:53:03] [INFO ] Computed 7 invariants in 8 ms
[2024-06-02 20:53:03] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (OVERLAPS) 69/94 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 26 unsolved
[2024-06-02 20:53:03] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-06-02 20:53:03] [INFO ] Deduced a trap composed of 34 places in 36 ms of which 1 ms to minimize.
[2024-06-02 20:53:03] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (OVERLAPS) 4/98 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 26 unsolved
[2024-06-02 20:53:03] [INFO ] Deduced a trap composed of 16 places in 20 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/98 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 7 (OVERLAPS) 252/350 variables, 98/109 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/350 variables, 40/149 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/350 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 10 (OVERLAPS) 3/353 variables, 2/151 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/353 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/353 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 13 (OVERLAPS) 0/353 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Real declared 353/353 variables, and 152 constraints, problems are : Problem set: 0 solved, 26 unsolved in 1370 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 100/100 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 26 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (OVERLAPS) 69/94 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (OVERLAPS) 4/98 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/98 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 7 (OVERLAPS) 252/350 variables, 98/109 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/350 variables, 40/149 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/350 variables, 26/175 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/350 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 11 (OVERLAPS) 3/353 variables, 2/177 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/353 variables, 1/178 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/353 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 14 (OVERLAPS) 0/353 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Int declared 353/353 variables, and 178 constraints, problems are : Problem set: 0 solved, 26 unsolved in 1601 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 100/100 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 4/4 constraints]
After SMT, in 3017ms problems are : Problem set: 0 solved, 26 unsolved
Parikh walk visited 0 properties in 2888 ms.
Support contains 25 out of 100 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 100/100 places, 282/282 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 99 transition count 280
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 99 transition count 280
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 99 transition count 279
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 98 transition count 278
Applied a total of 4 rules in 33 ms. Remains 98 /100 variables (removed 2) and now considering 278/282 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 98/100 places, 278/282 transitions.
RANDOM walk for 4000000 steps (256492 resets) in 16354 ms. (244 steps per ms) remains 25/26 properties
BEST_FIRST walk for 400003 steps (6518 resets) in 489 ms. (816 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400003 steps (6386 resets) in 464 ms. (860 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400002 steps (263 resets) in 906 ms. (441 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400003 steps (6408 resets) in 469 ms. (851 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400002 steps (14664 resets) in 542 ms. (736 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400001 steps (6676 resets) in 490 ms. (814 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400002 steps (311 resets) in 672 ms. (594 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400004 steps (6313 resets) in 504 ms. (792 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400002 steps (14605 resets) in 556 ms. (718 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400003 steps (6590 resets) in 489 ms. (816 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400003 steps (411 resets) in 595 ms. (671 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400004 steps (6394 resets) in 493 ms. (809 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400002 steps (14686 resets) in 549 ms. (727 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400003 steps (6502 resets) in 446 ms. (894 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400002 steps (240 resets) in 707 ms. (564 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400002 steps (14644 resets) in 567 ms. (704 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400003 steps (6343 resets) in 461 ms. (865 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400004 steps (6309 resets) in 473 ms. (843 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400002 steps (6415 resets) in 465 ms. (858 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400003 steps (6383 resets) in 471 ms. (847 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400002 steps (6610 resets) in 468 ms. (852 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400002 steps (6752 resets) in 458 ms. (871 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400002 steps (6431 resets) in 463 ms. (862 steps per ms) remains 24/25 properties
BEST_FIRST walk for 400003 steps (6630 resets) in 462 ms. (863 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400003 steps (6413 resets) in 488 ms. (818 steps per ms) remains 24/24 properties
Finished probabilistic random walk after 162359 steps, run visited all 24 properties in 801 ms. (steps per millisecond=202 )
Probabilistic random walk after 162359 steps, saw 41646 distinct states, run finished after 805 ms. (steps per millisecond=201 ) properties seen :24
Able to resolve query QuasiLiveness after proving 201 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK PROBABILISTIC_WALK BESTFIRST_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 41256 ms.
ITS solved all properties within timeout

BK_STOP 1717361598682

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination QuasiLiveness -timeout 180 -rebuildPNML

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FireWire-PT-02"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is 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 r564-tall-171734907600112"
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 ;