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

About the Execution of LTSMin+red for FireWire-PT-08

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1177.172 245750.00 537953.00 388.70 T normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r564-tall-171734907700142.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-08, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r564-tall-171734907700142
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 464K
-rw-r--r-- 1 mcc users 7.7K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 7.7K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 78K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 36K 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 97K 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 1717361688057

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-08
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 20:54:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2024-06-02 20:54:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 20:54:49] [INFO ] Load time of PNML (sax parser for PT used): 78 ms
[2024-06-02 20:54:49] [INFO ] Transformed 127 places.
[2024-06-02 20:54:49] [INFO ] Transformed 397 transitions.
[2024-06-02 20:54:49] [INFO ] Found NUPN structural information;
[2024-06-02 20:54:49] [INFO ] Parsed PT model containing 127 places and 397 transitions and 1475 arcs in 173 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 127/127 places, 397/397 transitions.
Ensure Unique test removed 53 transitions
Reduce isomorphic transitions removed 53 transitions.
Iterating post reduction 0 with 53 rules applied. Total rules applied 53 place count 127 transition count 344
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 55 place count 126 transition count 343
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 61 place count 123 transition count 349
Applied a total of 61 rules in 46 ms. Remains 123 /127 variables (removed 4) and now considering 349/397 (removed 48) transitions.
[2024-06-02 20:54:49] [INFO ] Flow matrix only has 307 transitions (discarded 42 similar events)
// Phase 1: matrix 307 rows 123 cols
[2024-06-02 20:54:49] [INFO ] Computed 8 invariants in 12 ms
[2024-06-02 20:54:49] [INFO ] Implicit Places using invariants in 237 ms returned []
[2024-06-02 20:54:49] [INFO ] Flow matrix only has 307 transitions (discarded 42 similar events)
[2024-06-02 20:54:49] [INFO ] Invariant cache hit.
[2024-06-02 20:54:49] [INFO ] State equation strengthened by 47 read => feed constraints.
[2024-06-02 20:54:49] [INFO ] Implicit Places using invariants and state equation in 222 ms returned []
Implicit Place search using SMT with State Equation took 486 ms to find 0 implicit places.
Running 348 sub problems to find dead transitions.
[2024-06-02 20:54:49] [INFO ] Flow matrix only has 307 transitions (discarded 42 similar events)
[2024-06-02 20:54:49] [INFO ] Invariant cache hit.
[2024-06-02 20:54:49] [INFO ] State equation strengthened by 47 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 122/122 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 2 (OVERLAPS) 1/123 variables, 8/130 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 348 unsolved
[2024-06-02 20:54:53] [INFO ] Deduced a trap composed of 43 places in 69 ms of which 10 ms to minimize.
[2024-06-02 20:54:53] [INFO ] Deduced a trap composed of 35 places in 60 ms of which 1 ms to minimize.
[2024-06-02 20:54:53] [INFO ] Deduced a trap composed of 42 places in 118 ms of which 2 ms to minimize.
[2024-06-02 20:54:53] [INFO ] Deduced a trap composed of 24 places in 127 ms of which 15 ms to minimize.
[2024-06-02 20:54:53] [INFO ] Deduced a trap composed of 15 places in 158 ms of which 1 ms to minimize.
[2024-06-02 20:54:54] [INFO ] Deduced a trap composed of 17 places in 132 ms of which 1 ms to minimize.
[2024-06-02 20:54:55] [INFO ] Deduced a trap composed of 17 places in 132 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 7/138 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/123 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 6 (OVERLAPS) 306/429 variables, 123/261 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/429 variables, 46/307 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/429 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 9 (OVERLAPS) 1/430 variables, 1/308 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/430 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 11 (OVERLAPS) 0/430 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 348 unsolved
No progress, stopping.
After SMT solving in domain Real declared 430/430 variables, and 308 constraints, problems are : Problem set: 0 solved, 348 unsolved in 15608 ms.
Refiners :[Domain max(s): 123/123 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 123/123 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 348/348 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 348 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 122/122 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 2 (OVERLAPS) 1/123 variables, 8/130 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 7/138 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/123 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 6 (OVERLAPS) 306/429 variables, 123/261 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/429 variables, 46/307 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/429 variables, 348/655 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/429 variables, 0/655 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 10 (OVERLAPS) 1/430 variables, 1/656 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/430 variables, 0/656 constraints. Problems are: Problem set: 0 solved, 348 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 430/430 variables, and 656 constraints, problems are : Problem set: 0 solved, 348 unsolved in 30021 ms.
Refiners :[Domain max(s): 123/123 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 123/123 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 348/348 constraints, Known Traps: 7/7 constraints]
After SMT, in 45995ms problems are : Problem set: 0 solved, 348 unsolved
Search for dead transitions found 0 dead transitions in 46013ms
Starting structural reductions in LIVENESS mode, iteration 1 : 123/127 places, 349/397 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 46572 ms. Remains : 123/127 places, 349/397 transitions.
Discarding 113 transitions out of 349. Remains 236
Initial state reduction rules removed 1 formulas.
RANDOM walk for 40000 steps (2195 resets) in 1857 ms. (21 steps per ms) remains 124/235 properties
BEST_FIRST walk for 403 steps (13 resets) in 11 ms. (33 steps per ms) remains 124/124 properties
BEST_FIRST walk for 401 steps (8 resets) in 6 ms. (57 steps per ms) remains 124/124 properties
BEST_FIRST walk for 402 steps (12 resets) in 5 ms. (67 steps per ms) remains 124/124 properties
BEST_FIRST walk for 404 steps (8 resets) in 22 ms. (17 steps per ms) remains 124/124 properties
BEST_FIRST walk for 404 steps (8 resets) in 14 ms. (26 steps per ms) remains 124/124 properties
BEST_FIRST walk for 403 steps (11 resets) in 14 ms. (26 steps per ms) remains 124/124 properties
BEST_FIRST walk for 403 steps (9 resets) in 11 ms. (33 steps per ms) remains 124/124 properties
BEST_FIRST walk for 403 steps (8 resets) in 12 ms. (31 steps per ms) remains 124/124 properties
BEST_FIRST walk for 401 steps (12 resets) in 14 ms. (26 steps per ms) remains 124/124 properties
BEST_FIRST walk for 402 steps (10 resets) in 14 ms. (26 steps per ms) remains 124/124 properties
BEST_FIRST walk for 403 steps (10 resets) in 14 ms. (26 steps per ms) remains 124/124 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 124/124 properties
BEST_FIRST walk for 404 steps (10 resets) in 14 ms. (26 steps per ms) remains 124/124 properties
BEST_FIRST walk for 403 steps (12 resets) in 20 ms. (19 steps per ms) remains 124/124 properties
BEST_FIRST walk for 403 steps (12 resets) in 17 ms. (22 steps per ms) remains 124/124 properties
BEST_FIRST walk for 402 steps (8 resets) in 13 ms. (28 steps per ms) remains 124/124 properties
BEST_FIRST walk for 403 steps (9 resets) in 14 ms. (26 steps per ms) remains 124/124 properties
BEST_FIRST walk for 402 steps (8 resets) in 7 ms. (50 steps per ms) remains 124/124 properties
BEST_FIRST walk for 402 steps (10 resets) in 8 ms. (44 steps per ms) remains 124/124 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 124/124 properties
BEST_FIRST walk for 403 steps (10 resets) in 6 ms. (57 steps per ms) remains 124/124 properties
BEST_FIRST walk for 403 steps (9 resets) in 8 ms. (44 steps per ms) remains 124/124 properties
BEST_FIRST walk for 403 steps (9 resets) in 15 ms. (25 steps per ms) remains 124/124 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 124/124 properties
BEST_FIRST walk for 403 steps (10 resets) in 7 ms. (50 steps per ms) remains 124/124 properties
BEST_FIRST walk for 404 steps (10 resets) in 10 ms. (36 steps per ms) remains 124/124 properties
BEST_FIRST walk for 402 steps (10 resets) in 7 ms. (50 steps per ms) remains 124/124 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 124/124 properties
BEST_FIRST walk for 403 steps (9 resets) in 5 ms. (67 steps per ms) remains 124/124 properties
BEST_FIRST walk for 404 steps (13 resets) in 5 ms. (67 steps per ms) remains 124/124 properties
BEST_FIRST walk for 403 steps (11 resets) in 7 ms. (50 steps per ms) remains 124/124 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 124/124 properties
BEST_FIRST walk for 402 steps (10 resets) in 8 ms. (44 steps per ms) remains 124/124 properties
BEST_FIRST walk for 404 steps (12 resets) in 17 ms. (22 steps per ms) remains 124/124 properties
BEST_FIRST walk for 402 steps (10 resets) in 7 ms. (50 steps per ms) remains 124/124 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 124/124 properties
BEST_FIRST walk for 401 steps (9 resets) in 5 ms. (66 steps per ms) remains 124/124 properties
BEST_FIRST walk for 403 steps (11 resets) in 6 ms. (57 steps per ms) remains 124/124 properties
BEST_FIRST walk for 402 steps (9 resets) in 7 ms. (50 steps per ms) remains 124/124 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 124/124 properties
BEST_FIRST walk for 403 steps (10 resets) in 5 ms. (67 steps per ms) remains 124/124 properties
BEST_FIRST walk for 404 steps (11 resets) in 8 ms. (44 steps per ms) remains 124/124 properties
BEST_FIRST walk for 404 steps (12 resets) in 10 ms. (36 steps per ms) remains 124/124 properties
BEST_FIRST walk for 402 steps (8 resets) in 18 ms. (21 steps per ms) remains 124/124 properties
BEST_FIRST walk for 404 steps (9 resets) in 5 ms. (67 steps per ms) remains 124/124 properties
BEST_FIRST walk for 402 steps (10 resets) in 7 ms. (50 steps per ms) remains 124/124 properties
BEST_FIRST walk for 403 steps (15 resets) in 5 ms. (67 steps per ms) remains 124/124 properties
BEST_FIRST walk for 404 steps (9 resets) in 5 ms. (67 steps per ms) remains 124/124 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 124/124 properties
BEST_FIRST walk for 403 steps (10 resets) in 5 ms. (67 steps per ms) remains 124/124 properties
[2024-06-02 20:55:36] [INFO ] Flow matrix only has 307 transitions (discarded 42 similar events)
[2024-06-02 20:55:36] [INFO ] Invariant cache hit.
[2024-06-02 20:55:36] [INFO ] State equation strengthened by 47 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 79/79 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/79 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 2 (OVERLAPS) 38/117 variables, 6/85 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 38/123 constraints. Problems are: Problem set: 0 solved, 124 unsolved
[2024-06-02 20:55:37] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 1 ms to minimize.
[2024-06-02 20:55:37] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2024-06-02 20:55:37] [INFO ] Deduced a trap composed of 43 places in 35 ms of which 1 ms to minimize.
[2024-06-02 20:55:37] [INFO ] Deduced a trap composed of 35 places in 28 ms of which 0 ms to minimize.
[2024-06-02 20:55:38] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 5/128 constraints. Problems are: Problem set: 0 solved, 124 unsolved
[2024-06-02 20:55:38] [INFO ] Deduced a trap composed of 42 places in 71 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/117 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 7 (OVERLAPS) 4/121 variables, 2/131 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/121 variables, 4/135 constraints. Problems are: Problem set: 0 solved, 124 unsolved
[2024-06-02 20:55:40] [INFO ] Deduced a trap composed of 26 places in 83 ms of which 8 ms to minimize.
[2024-06-02 20:55:40] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/121 variables, 2/137 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/121 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 11 (OVERLAPS) 306/427 variables, 121/258 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/427 variables, 46/304 constraints. Problems are: Problem set: 0 solved, 124 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 427/430 variables, and 304 constraints, problems are : Problem set: 0 solved, 124 unsolved in 5020 ms.
Refiners :[Domain max(s): 121/123 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 121/123 constraints, ReadFeed: 46/47 constraints, PredecessorRefiner: 124/124 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 124 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 79/79 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/79 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 2 (OVERLAPS) 38/117 variables, 6/85 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 38/123 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 6/129 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/117 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 6 (OVERLAPS) 4/121 variables, 2/131 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/121 variables, 4/135 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/121 variables, 2/137 constraints. Problems are: Problem set: 0 solved, 124 unsolved
[2024-06-02 20:55:43] [INFO ] Deduced a trap composed of 25 places in 75 ms of which 1 ms to minimize.
[2024-06-02 20:55:43] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 1 ms to minimize.
[2024-06-02 20:55:43] [INFO ] Deduced a trap composed of 43 places in 63 ms of which 2 ms to minimize.
[2024-06-02 20:55:43] [INFO ] Deduced a trap composed of 42 places in 88 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/121 variables, 4/141 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/121 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 11 (OVERLAPS) 306/427 variables, 121/262 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/427 variables, 46/308 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/427 variables, 117/425 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/427 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 124 unsolved
SMT process timed out in 10160ms, After SMT, problems are : Problem set: 0 solved, 124 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 79 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 349/349 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 123 transition count 340
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 123 transition count 331
Applied a total of 18 rules in 42 ms. Remains 123 /123 variables (removed 0) and now considering 331/349 (removed 18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 123/123 places, 331/349 transitions.
RANDOM walk for 4000000 steps (219067 resets) in 33276 ms. (120 steps per ms) remains 72/124 properties
BEST_FIRST walk for 400002 steps (15160 resets) in 1236 ms. (323 steps per ms) remains 72/72 properties
BEST_FIRST walk for 400001 steps (5793 resets) in 747 ms. (534 steps per ms) remains 72/72 properties
BEST_FIRST walk for 400003 steps (5630 resets) in 753 ms. (530 steps per ms) remains 72/72 properties
BEST_FIRST walk for 400003 steps (348 resets) in 1379 ms. (289 steps per ms) remains 70/72 properties
BEST_FIRST walk for 400002 steps (5499 resets) in 734 ms. (544 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400001 steps (10762 resets) in 841 ms. (475 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400002 steps (5619 resets) in 742 ms. (538 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400000 steps (279 resets) in 1257 ms. (317 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400002 steps (5594 resets) in 757 ms. (527 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400003 steps (10844 resets) in 860 ms. (464 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400002 steps (5647 resets) in 934 ms. (427 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400002 steps (254 resets) in 1238 ms. (322 steps per ms) remains 65/70 properties
BEST_FIRST walk for 400004 steps (5475 resets) in 738 ms. (541 steps per ms) remains 64/65 properties
BEST_FIRST walk for 400003 steps (10766 resets) in 796 ms. (501 steps per ms) remains 64/64 properties
BEST_FIRST walk for 400003 steps (5712 resets) in 716 ms. (557 steps per ms) remains 64/64 properties
BEST_FIRST walk for 400002 steps (266 resets) in 1204 ms. (331 steps per ms) remains 64/64 properties
BEST_FIRST walk for 400002 steps (5516 resets) in 962 ms. (415 steps per ms) remains 64/64 properties
BEST_FIRST walk for 400003 steps (10818 resets) in 1155 ms. (346 steps per ms) remains 64/64 properties
BEST_FIRST walk for 400003 steps (5638 resets) in 1078 ms. (370 steps per ms) remains 64/64 properties
BEST_FIRST walk for 400002 steps (282 resets) in 1259 ms. (317 steps per ms) remains 64/64 properties
BEST_FIRST walk for 400003 steps (5712 resets) in 718 ms. (556 steps per ms) remains 64/64 properties
BEST_FIRST walk for 400002 steps (10796 resets) in 814 ms. (490 steps per ms) remains 64/64 properties
BEST_FIRST walk for 400003 steps (5638 resets) in 713 ms. (560 steps per ms) remains 64/64 properties
BEST_FIRST walk for 400003 steps (384 resets) in 1119 ms. (357 steps per ms) remains 63/64 properties
BEST_FIRST walk for 400004 steps (5511 resets) in 774 ms. (516 steps per ms) remains 62/63 properties
BEST_FIRST walk for 400004 steps (10719 resets) in 806 ms. (495 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400003 steps (5593 resets) in 711 ms. (561 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400000 steps (258 resets) in 1206 ms. (331 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400003 steps (5279 resets) in 711 ms. (561 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400003 steps (10752 resets) in 797 ms. (501 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (5497 resets) in 699 ms. (571 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400002 steps (233 resets) in 1253 ms. (318 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400003 steps (5409 resets) in 711 ms. (561 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400003 steps (10694 resets) in 789 ms. (506 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400003 steps (5692 resets) in 1094 ms. (365 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400002 steps (356 resets) in 1097 ms. (364 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400002 steps (5406 resets) in 725 ms. (550 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400003 steps (10742 resets) in 779 ms. (512 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400003 steps (5641 resets) in 733 ms. (544 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400001 steps (274 resets) in 1135 ms. (352 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400002 steps (5529 resets) in 691 ms. (578 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400002 steps (10801 resets) in 770 ms. (518 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400003 steps (5580 resets) in 687 ms. (581 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400003 steps (265 resets) in 1239 ms. (322 steps per ms) remains 59/62 properties
BEST_FIRST walk for 400001 steps (5581 resets) in 727 ms. (549 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400003 steps (10684 resets) in 781 ms. (511 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400002 steps (5536 resets) in 693 ms. (576 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400003 steps (126 resets) in 1271 ms. (314 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400002 steps (5502 resets) in 687 ms. (581 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400003 steps (5694 resets) in 682 ms. (585 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400002 steps (328 resets) in 1153 ms. (346 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400004 steps (5605 resets) in 721 ms. (554 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400004 steps (10727 resets) in 786 ms. (508 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400003 steps (5600 resets) in 686 ms. (582 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400002 steps (318 resets) in 1149 ms. (347 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400003 steps (5471 resets) in 692 ms. (577 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400004 steps (5688 resets) in 694 ms. (575 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400003 steps (5540 resets) in 702 ms. (568 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400003 steps (5677 resets) in 708 ms. (564 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400004 steps (5527 resets) in 708 ms. (564 steps per ms) remains 55/59 properties
BEST_FIRST walk for 400002 steps (5735 resets) in 683 ms. (584 steps per ms) remains 55/55 properties
BEST_FIRST walk for 400003 steps (5658 resets) in 690 ms. (578 steps per ms) remains 55/55 properties
BEST_FIRST walk for 400003 steps (5516 resets) in 679 ms. (588 steps per ms) remains 55/55 properties
[2024-06-02 20:56:15] [INFO ] Flow matrix only has 303 transitions (discarded 28 similar events)
// Phase 1: matrix 303 rows 123 cols
[2024-06-02 20:56:15] [INFO ] Computed 8 invariants in 4 ms
[2024-06-02 20:56:15] [INFO ] State equation strengthened by 46 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 2 (OVERLAPS) 75/116 variables, 6/47 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 75/122 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2024-06-02 20:56:16] [INFO ] Deduced a trap composed of 24 places in 73 ms of which 1 ms to minimize.
[2024-06-02 20:56:16] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 1 ms to minimize.
[2024-06-02 20:56:16] [INFO ] Deduced a trap composed of 43 places in 36 ms of which 1 ms to minimize.
[2024-06-02 20:56:16] [INFO ] Deduced a trap composed of 35 places in 30 ms of which 1 ms to minimize.
[2024-06-02 20:56:16] [INFO ] Deduced a trap composed of 49 places in 66 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 5/127 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 6 (OVERLAPS) 4/120 variables, 2/129 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 4/133 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2024-06-02 20:56:17] [INFO ] Deduced a trap composed of 22 places in 68 ms of which 1 ms to minimize.
[2024-06-02 20:56:17] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 2/135 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 10 (OVERLAPS) 303/423 variables, 120/255 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/423 variables, 46/301 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/423 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 13 (OVERLAPS) 3/426 variables, 3/304 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/426 variables, 3/307 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/426 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 16 (OVERLAPS) 0/426 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 55 unsolved
No progress, stopping.
After SMT solving in domain Real declared 426/426 variables, and 307 constraints, problems are : Problem set: 0 solved, 55 unsolved in 3822 ms.
Refiners :[Domain max(s): 123/123 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 123/123 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 55/55 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 55 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 2 (OVERLAPS) 75/116 variables, 6/47 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 75/122 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 6/128 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 6 (OVERLAPS) 4/120 variables, 2/130 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 4/134 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2024-06-02 20:56:20] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/120 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 11 (OVERLAPS) 303/423 variables, 120/256 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/423 variables, 46/302 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/423 variables, 55/357 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/423 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 15 (OVERLAPS) 3/426 variables, 3/360 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/426 variables, 3/363 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2024-06-02 20:56:22] [INFO ] Deduced a trap composed of 46 places in 46 ms of which 0 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/426 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/426 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 19 (OVERLAPS) 0/426 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 55 unsolved
No progress, stopping.
After SMT solving in domain Int declared 426/426 variables, and 364 constraints, problems are : Problem set: 0 solved, 55 unsolved in 7537 ms.
Refiners :[Domain max(s): 123/123 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 123/123 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 55/55 constraints, Known Traps: 9/9 constraints]
After SMT, in 11413ms problems are : Problem set: 0 solved, 55 unsolved
Parikh walk visited 0 properties in 2600 ms.
Support contains 41 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 331/331 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 121 transition count 327
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 121 transition count 327
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 121 transition count 325
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 120 transition count 324
Applied a total of 7 rules in 31 ms. Remains 120 /123 variables (removed 3) and now considering 324/331 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 120/123 places, 324/331 transitions.
RANDOM walk for 4000000 steps (230899 resets) in 23031 ms. (173 steps per ms) remains 55/55 properties
BEST_FIRST walk for 400003 steps (15820 resets) in 880 ms. (454 steps per ms) remains 55/55 properties
BEST_FIRST walk for 400003 steps (5662 resets) in 619 ms. (645 steps per ms) remains 55/55 properties
BEST_FIRST walk for 400002 steps (5759 resets) in 627 ms. (636 steps per ms) remains 55/55 properties
BEST_FIRST walk for 400003 steps (123 resets) in 1071 ms. (373 steps per ms) remains 54/55 properties
BEST_FIRST walk for 400003 steps (5547 resets) in 623 ms. (641 steps per ms) remains 54/54 properties
BEST_FIRST walk for 400003 steps (11085 resets) in 685 ms. (583 steps per ms) remains 54/54 properties
BEST_FIRST walk for 400003 steps (5810 resets) in 610 ms. (654 steps per ms) remains 54/54 properties
BEST_FIRST walk for 400002 steps (343 resets) in 995 ms. (401 steps per ms) remains 54/54 properties
BEST_FIRST walk for 400002 steps (5555 resets) in 629 ms. (634 steps per ms) remains 54/54 properties
BEST_FIRST walk for 400003 steps (11100 resets) in 934 ms. (427 steps per ms) remains 54/54 properties
BEST_FIRST walk for 400004 steps (5789 resets) in 647 ms. (617 steps per ms) remains 54/54 properties
BEST_FIRST walk for 400002 steps (158 resets) in 1030 ms. (387 steps per ms) remains 54/54 properties
BEST_FIRST walk for 400002 steps (5591 resets) in 638 ms. (625 steps per ms) remains 54/54 properties
BEST_FIRST walk for 400004 steps (11056 resets) in 703 ms. (568 steps per ms) remains 54/54 properties
BEST_FIRST walk for 400003 steps (5834 resets) in 626 ms. (637 steps per ms) remains 54/54 properties
BEST_FIRST walk for 400002 steps (334 resets) in 966 ms. (413 steps per ms) remains 54/54 properties
BEST_FIRST walk for 400002 steps (5560 resets) in 613 ms. (651 steps per ms) remains 54/54 properties
BEST_FIRST walk for 400003 steps (11044 resets) in 683 ms. (584 steps per ms) remains 54/54 properties
BEST_FIRST walk for 400003 steps (5665 resets) in 612 ms. (652 steps per ms) remains 54/54 properties
BEST_FIRST walk for 400001 steps (252 resets) in 1098 ms. (363 steps per ms) remains 54/54 properties
BEST_FIRST walk for 400004 steps (5606 resets) in 622 ms. (642 steps per ms) remains 54/54 properties
BEST_FIRST walk for 400004 steps (11101 resets) in 731 ms. (546 steps per ms) remains 54/54 properties
BEST_FIRST walk for 400004 steps (5833 resets) in 657 ms. (607 steps per ms) remains 54/54 properties
BEST_FIRST walk for 400004 steps (481 resets) in 920 ms. (434 steps per ms) remains 54/54 properties
BEST_FIRST walk for 400003 steps (5599 resets) in 652 ms. (612 steps per ms) remains 54/54 properties
BEST_FIRST walk for 400001 steps (11075 resets) in 726 ms. (550 steps per ms) remains 54/54 properties
BEST_FIRST walk for 400003 steps (5889 resets) in 635 ms. (628 steps per ms) remains 54/54 properties
BEST_FIRST walk for 400002 steps (152 resets) in 1476 ms. (270 steps per ms) remains 54/54 properties
BEST_FIRST walk for 400003 steps (5516 resets) in 629 ms. (634 steps per ms) remains 54/54 properties
BEST_FIRST walk for 400001 steps (11034 resets) in 693 ms. (576 steps per ms) remains 54/54 properties
BEST_FIRST walk for 400002 steps (5584 resets) in 615 ms. (649 steps per ms) remains 54/54 properties
BEST_FIRST walk for 400001 steps (252 resets) in 1028 ms. (388 steps per ms) remains 54/54 properties
BEST_FIRST walk for 400003 steps (5535 resets) in 603 ms. (662 steps per ms) remains 54/54 properties
BEST_FIRST walk for 400003 steps (11090 resets) in 687 ms. (581 steps per ms) remains 54/54 properties
BEST_FIRST walk for 400003 steps (5779 resets) in 796 ms. (501 steps per ms) remains 54/54 properties
BEST_FIRST walk for 400003 steps (374 resets) in 976 ms. (409 steps per ms) remains 54/54 properties
BEST_FIRST walk for 400004 steps (5557 resets) in 621 ms. (643 steps per ms) remains 54/54 properties
BEST_FIRST walk for 400003 steps (11093 resets) in 719 ms. (555 steps per ms) remains 54/54 properties
BEST_FIRST walk for 400004 steps (5775 resets) in 648 ms. (616 steps per ms) remains 54/54 properties
BEST_FIRST walk for 400004 steps (367 resets) in 918 ms. (435 steps per ms) remains 54/54 properties
BEST_FIRST walk for 400004 steps (5665 resets) in 647 ms. (617 steps per ms) remains 54/54 properties
BEST_FIRST walk for 400003 steps (11157 resets) in 722 ms. (553 steps per ms) remains 54/54 properties
BEST_FIRST walk for 400003 steps (5795 resets) in 637 ms. (626 steps per ms) remains 54/54 properties
BEST_FIRST walk for 400004 steps (132 resets) in 1193 ms. (335 steps per ms) remains 54/54 properties
BEST_FIRST walk for 400003 steps (5500 resets) in 645 ms. (619 steps per ms) remains 53/54 properties
BEST_FIRST walk for 400003 steps (5758 resets) in 647 ms. (617 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400002 steps (334 resets) in 979 ms. (408 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400004 steps (5682 resets) in 638 ms. (625 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400004 steps (5781 resets) in 633 ms. (630 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400002 steps (5652 resets) in 620 ms. (644 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400004 steps (5676 resets) in 627 ms. (636 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400004 steps (5661 resets) in 623 ms. (641 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400003 steps (5713 resets) in 614 ms. (650 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400001 steps (5665 resets) in 639 ms. (625 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400004 steps (5722 resets) in 638 ms. (625 steps per ms) remains 53/53 properties
Interrupted probabilistic random walk after 10574335 steps, run timeout after 57001 ms. (steps per millisecond=185 ) properties seen :40 out of 53
Probabilistic random walk after 10574335 steps, saw 1938478 distinct states, run finished after 57015 ms. (steps per millisecond=185 ) properties seen :40
[2024-06-02 20:57:46] [INFO ] Flow matrix only has 296 transitions (discarded 28 similar events)
// Phase 1: matrix 296 rows 120 cols
[2024-06-02 20:57:46] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 20:57:46] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 53/69 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-06-02 20:57:46] [INFO ] Deduced a trap composed of 34 places in 39 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 243/312 variables, 69/73 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 23/96 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 95/407 variables, 44/140 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/407 variables, 3/143 constraints. Problems are: Problem set: 0 solved, 13 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/407 variables, 22/165 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/407 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (OVERLAPS) 9/416 variables, 7/172 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/416 variables, 2/174 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/416 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 14 (OVERLAPS) 0/416 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 416/416 variables, and 174 constraints, problems are : Problem set: 0 solved, 13 unsolved in 599 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 120/120 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 53/69 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 243/312 variables, 69/73 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 23/96 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 95/407 variables, 44/140 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/407 variables, 3/143 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/407 variables, 22/165 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/407 variables, 13/178 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-06-02 20:57:47] [INFO ] Deduced a trap composed of 42 places in 65 ms of which 1 ms to minimize.
[2024-06-02 20:57:47] [INFO ] Deduced a trap composed of 45 places in 42 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/407 variables, 2/180 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/407 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 13 (OVERLAPS) 9/416 variables, 7/187 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/416 variables, 2/189 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/416 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 16 (OVERLAPS) 0/416 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 416/416 variables, and 189 constraints, problems are : Problem set: 0 solved, 13 unsolved in 1094 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 120/120 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 3/3 constraints]
After SMT, in 1711ms problems are : Problem set: 0 solved, 13 unsolved
Parikh walk visited 0 properties in 2400 ms.
Support contains 16 out of 120 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 120/120 places, 324/324 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 116 transition count 314
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 116 transition count 314
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 116 transition count 313
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 11 place count 114 transition count 309
Iterating global reduction 1 with 2 rules applied. Total rules applied 13 place count 114 transition count 309
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 114 transition count 311
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 17 place count 113 transition count 309
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 19 place count 113 transition count 307
Applied a total of 19 rules in 36 ms. Remains 113 /120 variables (removed 7) and now considering 307/324 (removed 17) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 113/120 places, 307/324 transitions.
RANDOM walk for 4000000 steps (231499 resets) in 19766 ms. (202 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4000003 steps (57346 resets) in 3931 ms. (1017 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4000004 steps (55390 resets) in 3953 ms. (1011 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4000004 steps (57162 resets) in 3929 ms. (1017 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4000003 steps (55887 resets) in 3917 ms. (1020 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4000002 steps (57027 resets) in 4016 ms. (995 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4000003 steps (54958 resets) in 3980 ms. (1004 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4000002 steps (57817 resets) in 6638 ms. (602 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4000001 steps (56061 resets) in 4008 ms. (997 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4000003 steps (57354 resets) in 6804 ms. (587 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4000003 steps (55658 resets) in 5484 ms. (729 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4000003 steps (57436 resets) in 4167 ms. (959 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4000002 steps (55656 resets) in 4110 ms. (972 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4000004 steps (56698 resets) in 4142 ms. (965 steps per ms) remains 13/13 properties
Finished probabilistic random walk after 13485375 steps, run visited all 13 properties in 38000 ms. (steps per millisecond=354 )
Probabilistic random walk after 13485375 steps, saw 2369645 distinct states, run finished after 38006 ms. (steps per millisecond=354 ) properties seen :13
Able to resolve query QuasiLiveness after proving 236 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK PROBABILISTIC_WALK BESTFIRST_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 244527 ms.
ITS solved all properties within timeout

BK_STOP 1717361933807

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

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