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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 6.1K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K 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.3K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K 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.7K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 107K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K 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 91K 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 1717361620167

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-05
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 20:53:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2024-06-02 20:53:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 20:53:41] [INFO ] Load time of PNML (sax parser for PT used): 75 ms
[2024-06-02 20:53:41] [INFO ] Transformed 114 places.
[2024-06-02 20:53:41] [INFO ] Transformed 373 transitions.
[2024-06-02 20:53:41] [INFO ] Found NUPN structural information;
[2024-06-02 20:53:41] [INFO ] Parsed PT model containing 114 places and 373 transitions and 1389 arcs in 170 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 114/114 places, 373/373 transitions.
Ensure Unique test removed 57 transitions
Reduce isomorphic transitions removed 57 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 58 rules applied. Total rules applied 58 place count 114 transition count 315
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 59 place count 113 transition count 315
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 59 place count 113 transition count 314
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 61 place count 112 transition count 314
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 67 place count 109 transition count 320
Applied a total of 67 rules in 51 ms. Remains 109 /114 variables (removed 5) and now considering 320/373 (removed 53) transitions.
[2024-06-02 20:53:41] [INFO ] Flow matrix only has 278 transitions (discarded 42 similar events)
// Phase 1: matrix 278 rows 109 cols
[2024-06-02 20:53:41] [INFO ] Computed 8 invariants in 18 ms
[2024-06-02 20:53:41] [INFO ] Implicit Places using invariants in 235 ms returned []
[2024-06-02 20:53:41] [INFO ] Flow matrix only has 278 transitions (discarded 42 similar events)
[2024-06-02 20:53:41] [INFO ] Invariant cache hit.
[2024-06-02 20:53:41] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-06-02 20:53:41] [INFO ] Implicit Places using invariants and state equation in 206 ms returned [13, 38, 64, 67]
Discarding 4 places :
Implicit Place search using SMT with State Equation took 467 ms to find 4 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 105/114 places, 320/373 transitions.
Applied a total of 0 rules in 4 ms. Remains 105 /105 variables (removed 0) and now considering 320/320 (removed 0) transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 538 ms. Remains : 105/114 places, 320/373 transitions.
Discarding 110 transitions out of 320. Remains 210
Initial state reduction rules removed 1 formulas.
RANDOM walk for 40000 steps (2367 resets) in 2695 ms. (14 steps per ms) remains 103/209 properties
BEST_FIRST walk for 400 steps (20 resets) in 10 ms. (36 steps per ms) remains 103/103 properties
BEST_FIRST walk for 402 steps (11 resets) in 8 ms. (44 steps per ms) remains 103/103 properties
BEST_FIRST walk for 402 steps (10 resets) in 6 ms. (57 steps per ms) remains 103/103 properties
BEST_FIRST walk for 402 steps (8 resets) in 10 ms. (36 steps per ms) remains 103/103 properties
BEST_FIRST walk for 404 steps (11 resets) in 8 ms. (44 steps per ms) remains 103/103 properties
BEST_FIRST walk for 403 steps (14 resets) in 11 ms. (33 steps per ms) remains 103/103 properties
BEST_FIRST walk for 401 steps (11 resets) in 10 ms. (36 steps per ms) remains 103/103 properties
BEST_FIRST walk for 402 steps (8 resets) in 11 ms. (33 steps per ms) remains 103/103 properties
BEST_FIRST walk for 403 steps (12 resets) in 9 ms. (40 steps per ms) remains 103/103 properties
BEST_FIRST walk for 404 steps (16 resets) in 10 ms. (36 steps per ms) remains 103/103 properties
BEST_FIRST walk for 403 steps (14 resets) in 9 ms. (40 steps per ms) remains 103/103 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 103/103 properties
BEST_FIRST walk for 401 steps (13 resets) in 6 ms. (57 steps per ms) remains 103/103 properties
BEST_FIRST walk for 403 steps (12 resets) in 9 ms. (40 steps per ms) remains 103/103 properties
BEST_FIRST walk for 403 steps (12 resets) in 10 ms. (36 steps per ms) remains 103/103 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 103/103 properties
BEST_FIRST walk for 402 steps (11 resets) in 6 ms. (57 steps per ms) remains 103/103 properties
BEST_FIRST walk for 403 steps (12 resets) in 5 ms. (67 steps per ms) remains 103/103 properties
BEST_FIRST walk for 402 steps (11 resets) in 7 ms. (50 steps per ms) remains 103/103 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 103/103 properties
BEST_FIRST walk for 404 steps (12 resets) in 7 ms. (50 steps per ms) remains 103/103 properties
BEST_FIRST walk for 402 steps (11 resets) in 6 ms. (57 steps per ms) remains 103/103 properties
BEST_FIRST walk for 402 steps (21 resets) in 7 ms. (50 steps per ms) remains 103/103 properties
BEST_FIRST walk for 403 steps (11 resets) in 6 ms. (57 steps per ms) remains 103/103 properties
BEST_FIRST walk for 403 steps (8 resets) in 5 ms. (67 steps per ms) remains 103/103 properties
BEST_FIRST walk for 403 steps (12 resets) in 7 ms. (50 steps per ms) remains 103/103 properties
BEST_FIRST walk for 403 steps (12 resets) in 7 ms. (50 steps per ms) remains 103/103 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 103/103 properties
BEST_FIRST walk for 402 steps (11 resets) in 6 ms. (57 steps per ms) remains 103/103 properties
BEST_FIRST walk for 403 steps (10 resets) in 5 ms. (67 steps per ms) remains 103/103 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 103/103 properties
BEST_FIRST walk for 403 steps (10 resets) in 8 ms. (44 steps per ms) remains 103/103 properties
BEST_FIRST walk for 402 steps (10 resets) in 5 ms. (67 steps per ms) remains 103/103 properties
BEST_FIRST walk for 404 steps (14 resets) in 8 ms. (44 steps per ms) remains 103/103 properties
BEST_FIRST walk for 404 steps (11 resets) in 6 ms. (57 steps per ms) remains 103/103 properties
BEST_FIRST walk for 400 steps (8 resets) in 7 ms. (50 steps per ms) remains 103/103 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 103/103 properties
BEST_FIRST walk for 403 steps (11 resets) in 5 ms. (67 steps per ms) remains 103/103 properties
BEST_FIRST walk for 400 steps (8 resets) in 8 ms. (44 steps per ms) remains 103/103 properties
BEST_FIRST walk for 400 steps (8 resets) in 6 ms. (57 steps per ms) remains 103/103 properties
BEST_FIRST walk for 402 steps (9 resets) in 8 ms. (44 steps per ms) remains 103/103 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 103/103 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 103/103 properties
BEST_FIRST walk for 404 steps (16 resets) in 6 ms. (57 steps per ms) remains 103/103 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 103/103 properties
BEST_FIRST walk for 402 steps (11 resets) in 6 ms. (57 steps per ms) remains 103/103 properties
BEST_FIRST walk for 402 steps (9 resets) in 5 ms. (67 steps per ms) remains 103/103 properties
BEST_FIRST walk for 402 steps (18 resets) in 7 ms. (50 steps per ms) remains 103/103 properties
BEST_FIRST walk for 402 steps (10 resets) in 8 ms. (44 steps per ms) remains 103/103 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 103/103 properties
[2024-06-02 20:53:43] [INFO ] Flow matrix only has 278 transitions (discarded 42 similar events)
// Phase 1: matrix 278 rows 105 cols
[2024-06-02 20:53:43] [INFO ] Computed 4 invariants in 3 ms
[2024-06-02 20:53:43] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 71/71 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (OVERLAPS) 31/102 variables, 4/75 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 31/106 constraints. Problems are: Problem set: 0 solved, 103 unsolved
[2024-06-02 20:53:44] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 9 ms to minimize.
[2024-06-02 20:53:44] [INFO ] Deduced a trap composed of 22 places in 78 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 2/108 constraints. Problems are: Problem set: 0 solved, 103 unsolved
[2024-06-02 20:53:44] [INFO ] Deduced a trap composed of 36 places in 56 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 7 (OVERLAPS) 277/379 variables, 102/211 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/379 variables, 41/252 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/379 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 10 (OVERLAPS) 3/382 variables, 3/255 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/382 variables, 3/258 constraints. Problems are: Problem set: 0 solved, 103 unsolved
[2024-06-02 20:53:47] [INFO ] Deduced a trap composed of 27 places in 62 ms of which 1 ms to minimize.
[2024-06-02 20:53:47] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/382 variables, 2/260 constraints. Problems are: Problem set: 0 solved, 103 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 382/383 variables, and 260 constraints, problems are : Problem set: 0 solved, 103 unsolved in 5017 ms.
Refiners :[Domain max(s): 105/105 constraints, Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 105/105 constraints, ReadFeed: 41/42 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 103 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 71/71 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (OVERLAPS) 31/102 variables, 4/75 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 31/106 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 3/109 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 6 (OVERLAPS) 277/379 variables, 102/211 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/379 variables, 41/252 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/379 variables, 93/345 constraints. Problems are: Problem set: 0 solved, 103 unsolved
[2024-06-02 20:53:49] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/379 variables, 1/346 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/379 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 11 (OVERLAPS) 3/382 variables, 3/349 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/382 variables, 3/352 constraints. Problems are: Problem set: 0 solved, 103 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 382/383 variables, and 362 constraints, problems are : Problem set: 0 solved, 103 unsolved in 5013 ms.
Refiners :[Domain max(s): 105/105 constraints, Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 105/105 constraints, ReadFeed: 41/42 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 4/6 constraints]
After SMT, in 10180ms problems are : Problem set: 0 solved, 103 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 71 out of 105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 320/320 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 105 transition count 311
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 105 transition count 302
Applied a total of 18 rules in 25 ms. Remains 105 /105 variables (removed 0) and now considering 302/320 (removed 18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 105/105 places, 302/320 transitions.
RANDOM walk for 4000000 steps (241047 resets) in 23290 ms. (171 steps per ms) remains 30/103 properties
BEST_FIRST walk for 400004 steps (6318 resets) in 502 ms. (795 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400004 steps (6568 resets) in 523 ms. (763 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400001 steps (306 resets) in 746 ms. (535 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400003 steps (6464 resets) in 559 ms. (714 steps per ms) remains 29/30 properties
BEST_FIRST walk for 400003 steps (14005 resets) in 606 ms. (658 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400002 steps (6586 resets) in 527 ms. (757 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400003 steps (124 resets) in 832 ms. (480 steps per ms) remains 28/29 properties
BEST_FIRST walk for 400003 steps (6183 resets) in 550 ms. (725 steps per ms) remains 27/28 properties
BEST_FIRST walk for 400004 steps (14193 resets) in 611 ms. (653 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400002 steps (6444 resets) in 504 ms. (792 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400003 steps (448 resets) in 735 ms. (543 steps per ms) remains 26/27 properties
BEST_FIRST walk for 400003 steps (6333 resets) in 527 ms. (757 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400001 steps (14219 resets) in 602 ms. (663 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400003 steps (6409 resets) in 515 ms. (775 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400001 steps (453 resets) in 706 ms. (565 steps per ms) remains 24/26 properties
BEST_FIRST walk for 400003 steps (6362 resets) in 530 ms. (753 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400003 steps (14158 resets) in 582 ms. (686 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400003 steps (6456 resets) in 480 ms. (831 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400002 steps (324 resets) in 483 ms. (826 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400003 steps (6230 resets) in 516 ms. (773 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400003 steps (14099 resets) in 592 ms. (674 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400003 steps (6347 resets) in 479 ms. (833 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400003 steps (6525 resets) in 517 ms. (772 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400003 steps (6233 resets) in 512 ms. (779 steps per ms) remains 24/24 properties
[2024-06-02 20:54:04] [INFO ] Flow matrix only has 274 transitions (discarded 28 similar events)
// Phase 1: matrix 274 rows 105 cols
[2024-06-02 20:54:04] [INFO ] Computed 4 invariants in 2 ms
[2024-06-02 20:54:04] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (OVERLAPS) 58/77 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 58/80 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (OVERLAPS) 23/100 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 23/104 constraints. Problems are: Problem set: 0 solved, 24 unsolved
[2024-06-02 20:54:04] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/100 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/100 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 9 (OVERLAPS) 273/373 variables, 100/205 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/373 variables, 40/245 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/373 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 12 (OVERLAPS) 6/379 variables, 5/250 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/379 variables, 5/255 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/379 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/379 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 16 (OVERLAPS) 0/379 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Real declared 379/379 variables, and 256 constraints, problems are : Problem set: 0 solved, 24 unsolved in 1363 ms.
Refiners :[Domain max(s): 105/105 constraints, Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 105/105 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 24 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (OVERLAPS) 58/77 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 58/80 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (OVERLAPS) 23/100 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 23/104 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/100 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 24 unsolved
[2024-06-02 20:54:05] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/100 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/100 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 10 (OVERLAPS) 273/373 variables, 100/206 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/373 variables, 40/246 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/373 variables, 20/266 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/373 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 14 (OVERLAPS) 6/379 variables, 5/271 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/379 variables, 5/276 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/379 variables, 1/277 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/379 variables, 4/281 constraints. Problems are: Problem set: 0 solved, 24 unsolved
[2024-06-02 20:54:06] [INFO ] Deduced a trap composed of 35 places in 47 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/379 variables, 1/282 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/379 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 20 (OVERLAPS) 0/379 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Int declared 379/379 variables, and 282 constraints, problems are : Problem set: 0 solved, 24 unsolved in 2376 ms.
Refiners :[Domain max(s): 105/105 constraints, Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 105/105 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 3/3 constraints]
After SMT, in 3764ms problems are : Problem set: 0 solved, 24 unsolved
Parikh walk visited 0 properties in 798 ms.
Support contains 19 out of 105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 302/302 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 103 transition count 298
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 103 transition count 298
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 103 transition count 296
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 1 with 3 rules applied. Total rules applied 9 place count 103 transition count 296
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 14 place count 100 transition count 294
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 16 place count 100 transition count 292
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 17 place count 99 transition count 291
Applied a total of 17 rules in 48 ms. Remains 99 /105 variables (removed 6) and now considering 291/302 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 99/105 places, 291/302 transitions.
RANDOM walk for 4000000 steps (255858 resets) in 15914 ms. (251 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400002 steps (6364 resets) in 445 ms. (896 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400004 steps (6572 resets) in 468 ms. (852 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400004 steps (654 resets) in 379 ms. (1052 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400003 steps (6329 resets) in 456 ms. (875 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400003 steps (14665 resets) in 529 ms. (754 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400003 steps (6456 resets) in 481 ms. (829 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400003 steps (532 resets) in 372 ms. (1072 steps per ms) remains 12/24 properties
BEST_FIRST walk for 400003 steps (6404 resets) in 389 ms. (1025 steps per ms) remains 12/12 properties
BEST_FIRST walk for 400003 steps (6323 resets) in 389 ms. (1025 steps per ms) remains 12/12 properties
BEST_FIRST walk for 400004 steps (6677 resets) in 380 ms. (1049 steps per ms) remains 12/12 properties
BEST_FIRST walk for 400003 steps (6360 resets) in 376 ms. (1061 steps per ms) remains 12/12 properties
BEST_FIRST walk for 400004 steps (6423 resets) in 359 ms. (1111 steps per ms) remains 12/12 properties
BEST_FIRST walk for 400003 steps (6406 resets) in 411 ms. (970 steps per ms) remains 12/12 properties
BEST_FIRST walk for 400004 steps (6357 resets) in 420 ms. (950 steps per ms) remains 12/12 properties
[2024-06-02 20:54:15] [INFO ] Flow matrix only has 262 transitions (discarded 29 similar events)
// Phase 1: matrix 262 rows 99 cols
[2024-06-02 20:54:15] [INFO ] Computed 4 invariants in 6 ms
[2024-06-02 20:54:15] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 56/73 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 239/312 variables, 73/76 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 28/104 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 48/360 variables, 25/129 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/360 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/360 variables, 12/142 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/360 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (OVERLAPS) 1/361 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/361 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-06-02 20:54:15] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/361 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/361 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 14 (OVERLAPS) 0/361 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 361/361 variables, and 144 constraints, problems are : Problem set: 0 solved, 12 unsolved in 863 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 99/99 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 56/73 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 239/312 variables, 73/76 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 28/104 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 48/360 variables, 25/129 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/360 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/360 variables, 12/142 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/360 variables, 12/154 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/360 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-06-02 20:54:16] [INFO ] Deduced a trap composed of 33 places in 36 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/360 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/360 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 13 (OVERLAPS) 1/361 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/361 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-06-02 20:54:16] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/361 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/361 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 17 (OVERLAPS) 0/361 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 361/361 variables, and 158 constraints, problems are : Problem set: 0 solved, 12 unsolved in 1304 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 99/99 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 3/3 constraints]
After SMT, in 2193ms problems are : Problem set: 0 solved, 12 unsolved
Parikh walk visited 0 properties in 887 ms.
Support contains 17 out of 99 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 99/99 places, 291/291 transitions.
Applied a total of 0 rules in 9 ms. Remains 99 /99 variables (removed 0) and now considering 291/291 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 99/99 places, 291/291 transitions.
RANDOM walk for 4000000 steps (256257 resets) in 12538 ms. (319 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4000004 steps (64073 resets) in 3369 ms. (1186 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4000004 steps (2885 resets) in 3398 ms. (1176 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4000003 steps (146890 resets) in 4146 ms. (964 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4000002 steps (65748 resets) in 3478 ms. (1149 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4000002 steps (62958 resets) in 3564 ms. (1122 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4000002 steps (65786 resets) in 3517 ms. (1137 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4000003 steps (63172 resets) in 3586 ms. (1115 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4000003 steps (65700 resets) in 3550 ms. (1126 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4000004 steps (63292 resets) in 3520 ms. (1136 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4000004 steps (63767 resets) in 3481 ms. (1148 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4000003 steps (65749 resets) in 3598 ms. (1111 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4000003 steps (63269 resets) in 3795 ms. (1053 steps per ms) remains 12/12 properties
Finished probabilistic random walk after 350626 steps, run visited all 12 properties in 1258 ms. (steps per millisecond=278 )
Probabilistic random walk after 350626 steps, saw 80396 distinct states, run finished after 1262 ms. (steps per millisecond=277 ) properties seen :12
Able to resolve query QuasiLiveness after proving 210 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK PROBABILISTIC_WALK BESTFIRST_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 54434 ms.
ITS solved all properties within timeout

BK_STOP 1717361675767

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

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