About the Execution of GreatSPN+red for FireWire-PT-04
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 690.088 | 95201.00 | 269982.00 | 314.60 | T | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r560-tall-171734905700122.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is FireWire-PT-04, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r560-tall-171734905700122
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 6.2K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 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 16K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 13K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 137K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K 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 89K 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 1717351607088
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=FireWire-PT-04
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-02 18:06:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2024-06-02 18:06:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:06:48] [INFO ] Load time of PNML (sax parser for PT used): 72 ms
[2024-06-02 18:06:48] [INFO ] Transformed 113 places.
[2024-06-02 18:06:48] [INFO ] Transformed 364 transitions.
[2024-06-02 18:06:48] [INFO ] Found NUPN structural information;
[2024-06-02 18:06:48] [INFO ] Parsed PT model containing 113 places and 364 transitions and 1349 arcs in 167 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 113/113 places, 364/364 transitions.
Ensure Unique test removed 56 transitions
Reduce isomorphic transitions removed 56 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 57 rules applied. Total rules applied 57 place count 113 transition count 307
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 58 place count 112 transition count 307
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 58 place count 112 transition count 306
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 60 place count 111 transition count 306
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 2 with 2 rules applied. Total rules applied 62 place count 110 transition count 305
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 68 place count 107 transition count 311
Applied a total of 68 rules in 55 ms. Remains 107 /113 variables (removed 6) and now considering 311/364 (removed 53) transitions.
[2024-06-02 18:06:48] [INFO ] Flow matrix only has 269 transitions (discarded 42 similar events)
// Phase 1: matrix 269 rows 107 cols
[2024-06-02 18:06:48] [INFO ] Computed 8 invariants in 13 ms
[2024-06-02 18:06:48] [INFO ] Implicit Places using invariants in 240 ms returned []
[2024-06-02 18:06:48] [INFO ] Flow matrix only has 269 transitions (discarded 42 similar events)
[2024-06-02 18:06:48] [INFO ] Invariant cache hit.
[2024-06-02 18:06:48] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-06-02 18:06:48] [INFO ] Implicit Places using invariants and state equation in 222 ms returned [35, 59, 102, 105]
Discarding 4 places :
Implicit Place search using SMT with State Equation took 492 ms to find 4 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 103/113 places, 311/364 transitions.
Applied a total of 0 rules in 5 ms. Remains 103 /103 variables (removed 0) and now considering 311/311 (removed 0) transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 567 ms. Remains : 103/113 places, 311/364 transitions.
Discarding 108 transitions out of 311. Remains 203
Initial state reduction rules removed 1 formulas.
RANDOM walk for 40000 steps (2428 resets) in 1879 ms. (21 steps per ms) remains 85/202 properties
BEST_FIRST walk for 4004 steps (62 resets) in 90 ms. (44 steps per ms) remains 85/85 properties
BEST_FIRST walk for 4003 steps (65 resets) in 79 ms. (50 steps per ms) remains 85/85 properties
BEST_FIRST walk for 4004 steps (8 resets) in 67 ms. (58 steps per ms) remains 85/85 properties
BEST_FIRST walk for 4002 steps (213 resets) in 60 ms. (65 steps per ms) remains 85/85 properties
BEST_FIRST walk for 4004 steps (64 resets) in 17 ms. (222 steps per ms) remains 85/85 properties
BEST_FIRST walk for 4003 steps (72 resets) in 15 ms. (250 steps per ms) remains 85/85 properties
BEST_FIRST walk for 4001 steps (137 resets) in 30 ms. (129 steps per ms) remains 85/85 properties
BEST_FIRST walk for 4004 steps (60 resets) in 30 ms. (129 steps per ms) remains 85/85 properties
BEST_FIRST walk for 4002 steps (8 resets) in 13 ms. (285 steps per ms) remains 84/85 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 84/84 properties
BEST_FIRST walk for 4000 steps (8 resets) in 22 ms. (173 steps per ms) remains 84/84 properties
BEST_FIRST walk for 4004 steps (9 resets) in 16 ms. (235 steps per ms) remains 84/84 properties
BEST_FIRST walk for 4003 steps (18 resets) in 13 ms. (285 steps per ms) remains 84/84 properties
BEST_FIRST walk for 4004 steps (25 resets) in 14 ms. (266 steps per ms) remains 84/84 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 84/84 properties
BEST_FIRST walk for 4004 steps (16 resets) in 14 ms. (266 steps per ms) remains 84/84 properties
BEST_FIRST walk for 4003 steps (14 resets) in 13 ms. (285 steps per ms) remains 84/84 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 84/84 properties
BEST_FIRST walk for 4002 steps (15 resets) in 29 ms. (133 steps per ms) remains 84/84 properties
BEST_FIRST walk for 4004 steps (17 resets) in 13 ms. (286 steps per ms) remains 84/84 properties
BEST_FIRST walk for 4003 steps (222 resets) in 21 ms. (181 steps per ms) remains 84/84 properties
BEST_FIRST walk for 4004 steps (58 resets) in 16 ms. (235 steps per ms) remains 83/84 properties
BEST_FIRST walk for 4002 steps (77 resets) in 14 ms. (266 steps per ms) remains 83/83 properties
BEST_FIRST walk for 4002 steps (146 resets) in 26 ms. (148 steps per ms) remains 83/83 properties
BEST_FIRST walk for 4003 steps (66 resets) in 15 ms. (250 steps per ms) remains 83/83 properties
BEST_FIRST walk for 4004 steps (10 resets) in 13 ms. (286 steps per ms) remains 83/83 properties
BEST_FIRST walk for 4004 steps (68 resets) in 17 ms. (222 steps per ms) remains 79/83 properties
BEST_FIRST walk for 4003 steps (130 resets) in 25 ms. (153 steps per ms) remains 79/79 properties
BEST_FIRST walk for 4003 steps (52 resets) in 15 ms. (250 steps per ms) remains 79/79 properties
BEST_FIRST walk for 4004 steps (9 resets) in 15 ms. (250 steps per ms) remains 78/79 properties
BEST_FIRST walk for 4003 steps (80 resets) in 22 ms. (174 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4003 steps (147 resets) in 17 ms. (222 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4003 steps (55 resets) in 16 ms. (235 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4003 steps (9 resets) in 14 ms. (266 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (64 resets) in 34 ms. (114 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (137 resets) in 27 ms. (143 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (70 resets) in 19 ms. (200 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4003 steps (90 resets) in 17 ms. (222 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4001 steps (141 resets) in 15 ms. (250 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4003 steps (74 resets) in 14 ms. (266 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 77/78 properties
BEST_FIRST walk for 4003 steps (56 resets) in 14 ms. (266 steps per ms) remains 77/77 properties
BEST_FIRST walk for 4003 steps (9 resets) in 13 ms. (285 steps per ms) remains 77/77 properties
BEST_FIRST walk for 4002 steps (75 resets) in 17 ms. (222 steps per ms) remains 77/77 properties
BEST_FIRST walk for 4002 steps (133 resets) in 15 ms. (250 steps per ms) remains 77/77 properties
BEST_FIRST walk for 4001 steps (65 resets) in 14 ms. (266 steps per ms) remains 77/77 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 77/77 properties
BEST_FIRST walk for 4004 steps (47 resets) in 31 ms. (125 steps per ms) remains 77/77 properties
BEST_FIRST walk for 4003 steps (152 resets) in 17 ms. (222 steps per ms) remains 77/77 properties
BEST_FIRST walk for 4002 steps (81 resets) in 14 ms. (266 steps per ms) remains 77/77 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 77/77 properties
BEST_FIRST walk for 4004 steps (53 resets) in 14 ms. (266 steps per ms) remains 77/77 properties
BEST_FIRST walk for 4003 steps (9 resets) in 15 ms. (250 steps per ms) remains 75/77 properties
BEST_FIRST walk for 4004 steps (145 resets) in 17 ms. (222 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4004 steps (58 resets) in 21 ms. (182 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4004 steps (10 resets) in 10 ms. (364 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4002 steps (147 resets) in 14 ms. (266 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4003 steps (60 resets) in 16 ms. (235 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4002 steps (66 resets) in 16 ms. (235 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4003 steps (74 resets) in 16 ms. (235 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4003 steps (135 resets) in 16 ms. (235 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4002 steps (71 resets) in 15 ms. (250 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4004 steps (71 resets) in 16 ms. (235 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4003 steps (123 resets) in 17 ms. (222 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4003 steps (66 resets) in 15 ms. (250 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4004 steps (9 resets) in 19 ms. (200 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4004 steps (57 resets) in 14 ms. (266 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4001 steps (142 resets) in 15 ms. (250 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4004 steps (63 resets) in 13 ms. (286 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4003 steps (9 resets) in 11 ms. (333 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4004 steps (69 resets) in 13 ms. (286 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4004 steps (138 resets) in 14 ms. (266 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4003 steps (10 resets) in 11 ms. (333 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4001 steps (54 resets) in 11 ms. (333 steps per ms) remains 74/75 properties
BEST_FIRST walk for 4004 steps (51 resets) in 12 ms. (308 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 74/74 properties
[2024-06-02 18:06:50] [INFO ] Flow matrix only has 269 transitions (discarded 42 similar events)
// Phase 1: matrix 269 rows 103 cols
[2024-06-02 18:06:50] [INFO ] Computed 4 invariants in 6 ms
[2024-06-02 18:06:50] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (OVERLAPS) 47/99 variables, 4/56 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 47/103 constraints. Problems are: Problem set: 0 solved, 74 unsolved
[2024-06-02 18:06:51] [INFO ] Deduced a trap composed of 22 places in 80 ms of which 9 ms to minimize.
[2024-06-02 18:06:51] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 2/105 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/99 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (OVERLAPS) 267/366 variables, 99/204 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/366 variables, 40/244 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/366 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 9 (OVERLAPS) 5/371 variables, 4/248 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/371 variables, 4/252 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/371 variables, 1/253 constraints. Problems are: Problem set: 0 solved, 74 unsolved
[2024-06-02 18:06:53] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/371 variables, 1/254 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/371 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 14 (OVERLAPS) 1/372 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/372 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 74 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 372/372 variables, and 255 constraints, problems are : Problem set: 0 solved, 74 unsolved in 5014 ms.
Refiners :[Domain max(s): 103/103 constraints, Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 103/103 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 74 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (OVERLAPS) 47/99 variables, 4/56 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 47/103 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 2/105 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/99 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (OVERLAPS) 267/366 variables, 99/204 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/366 variables, 40/244 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/366 variables, 68/312 constraints. Problems are: Problem set: 0 solved, 74 unsolved
[2024-06-02 18:06:56] [INFO ] Deduced a trap composed of 35 places in 43 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/366 variables, 1/313 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/366 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 11 (OVERLAPS) 5/371 variables, 4/317 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/371 variables, 4/321 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/371 variables, 1/322 constraints. Problems are: Problem set: 0 solved, 74 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 371/372 variables, and 328 constraints, problems are : Problem set: 0 solved, 74 unsolved in 5018 ms.
Refiners :[Domain max(s): 103/103 constraints, Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 103/103 constraints, ReadFeed: 41/42 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 3/4 constraints]
After SMT, in 10157ms problems are : Problem set: 0 solved, 74 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 52 out of 103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 311/311 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 103 transition count 302
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 103 transition count 293
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 1 with 3 rules applied. Total rules applied 21 place count 103 transition count 295
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 27 place count 100 transition count 292
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 29 place count 100 transition count 290
Applied a total of 29 rules in 50 ms. Remains 100 /103 variables (removed 3) and now considering 290/311 (removed 21) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 100/103 places, 290/311 transitions.
RANDOM walk for 4000000 steps (240235 resets) in 22781 ms. (175 steps per ms) remains 41/74 properties
BEST_FIRST walk for 400003 steps (6329 resets) in 924 ms. (432 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400003 steps (14087 resets) in 696 ms. (573 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400002 steps (223 resets) in 619 ms. (645 steps per ms) remains 39/41 properties
BEST_FIRST walk for 400003 steps (8 resets) in 480 ms. (831 steps per ms) remains 39/39 properties
BEST_FIRST walk for 400004 steps (6347 resets) in 521 ms. (766 steps per ms) remains 39/39 properties
BEST_FIRST walk for 400002 steps (6300 resets) in 554 ms. (720 steps per ms) remains 39/39 properties
BEST_FIRST walk for 400003 steps (14183 resets) in 661 ms. (604 steps per ms) remains 39/39 properties
BEST_FIRST walk for 400003 steps (6300 resets) in 554 ms. (720 steps per ms) remains 39/39 properties
BEST_FIRST walk for 400002 steps (261 resets) in 559 ms. (714 steps per ms) remains 38/39 properties
BEST_FIRST walk for 400002 steps (6392 resets) in 539 ms. (740 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400003 steps (14144 resets) in 652 ms. (612 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400002 steps (6669 resets) in 535 ms. (746 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400003 steps (614 resets) in 450 ms. (886 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400000 steps (6413 resets) in 546 ms. (731 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400003 steps (14114 resets) in 630 ms. (633 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400003 steps (6587 resets) in 540 ms. (739 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400001 steps (518 resets) in 453 ms. (881 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400002 steps (6426 resets) in 565 ms. (706 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400003 steps (14213 resets) in 635 ms. (628 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (6352 resets) in 527 ms. (757 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (426 resets) in 522 ms. (764 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400003 steps (6220 resets) in 641 ms. (623 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400003 steps (14121 resets) in 670 ms. (596 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400003 steps (6436 resets) in 535 ms. (746 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400002 steps (632 resets) in 452 ms. (883 steps per ms) remains 35/38 properties
BEST_FIRST walk for 400003 steps (6504 resets) in 596 ms. (670 steps per ms) remains 35/35 properties
BEST_FIRST walk for 400003 steps (6418 resets) in 580 ms. (688 steps per ms) remains 35/35 properties
BEST_FIRST walk for 400003 steps (6533 resets) in 566 ms. (705 steps per ms) remains 35/35 properties
BEST_FIRST walk for 400004 steps (6275 resets) in 562 ms. (710 steps per ms) remains 35/35 properties
BEST_FIRST walk for 400004 steps (6578 resets) in 549 ms. (727 steps per ms) remains 35/35 properties
BEST_FIRST walk for 400003 steps (341 resets) in 494 ms. (808 steps per ms) remains 35/35 properties
BEST_FIRST walk for 400002 steps (6377 resets) in 572 ms. (698 steps per ms) remains 34/35 properties
BEST_FIRST walk for 400002 steps (14181 resets) in 628 ms. (635 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400004 steps (6605 resets) in 531 ms. (751 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400003 steps (6342 resets) in 530 ms. (753 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400002 steps (6294 resets) in 548 ms. (728 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400003 steps (6199 resets) in 537 ms. (743 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400003 steps (554 resets) in 420 ms. (950 steps per ms) remains 34/34 properties
[2024-06-02 18:07:14] [INFO ] Flow matrix only has 261 transitions (discarded 29 similar events)
// Phase 1: matrix 261 rows 100 cols
[2024-06-02 18:07:14] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 18:07:14] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 2 (OVERLAPS) 68/95 variables, 4/31 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 68/99 constraints. Problems are: Problem set: 0 solved, 34 unsolved
[2024-06-02 18:07:14] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2024-06-02 18:07:14] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 2/101 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/95 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 6 (OVERLAPS) 260/355 variables, 95/196 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/355 variables, 40/236 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/355 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 9 (OVERLAPS) 6/361 variables, 5/241 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/361 variables, 5/246 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/361 variables, 1/247 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/361 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 13 (OVERLAPS) 0/361 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 34 unsolved
No progress, stopping.
After SMT solving in domain Real declared 361/361 variables, and 247 constraints, problems are : Problem set: 0 solved, 34 unsolved in 1669 ms.
Refiners :[Domain max(s): 100/100 constraints, Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 100/100 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 34/34 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 34 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 2 (OVERLAPS) 68/95 variables, 4/31 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 68/99 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 2/101 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/95 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 6 (OVERLAPS) 260/355 variables, 95/196 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/355 variables, 40/236 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/355 variables, 30/266 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/355 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 10 (OVERLAPS) 6/361 variables, 5/271 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/361 variables, 5/276 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/361 variables, 1/277 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/361 variables, 4/281 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/361 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 34 unsolved
[2024-06-02 18:07:17] [INFO ] Deduced a trap composed of 33 places in 41 ms of which 0 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/361 variables, 1/282 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/361 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 17 (OVERLAPS) 0/361 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 34 unsolved
No progress, stopping.
After SMT solving in domain Int declared 361/361 variables, and 282 constraints, problems are : Problem set: 0 solved, 34 unsolved in 3441 ms.
Refiners :[Domain max(s): 100/100 constraints, Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 100/100 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 34/34 constraints, Known Traps: 3/3 constraints]
After SMT, in 5159ms problems are : Problem set: 0 solved, 34 unsolved
Parikh walk visited 0 properties in 3872 ms.
Support contains 27 out of 100 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 100/100 places, 290/290 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 100 transition count 289
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 99 transition count 289
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 98 transition count 288
Applied a total of 3 rules in 27 ms. Remains 98 /100 variables (removed 2) and now considering 288/290 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 98/100 places, 288/290 transitions.
RANDOM walk for 4000000 steps (255539 resets) in 20050 ms. (199 steps per ms) remains 30/34 properties
BEST_FIRST walk for 400004 steps (6325 resets) in 502 ms. (795 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400002 steps (14525 resets) in 624 ms. (640 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400002 steps (648 resets) in 418 ms. (954 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400003 steps (6307 resets) in 522 ms. (764 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400002 steps (6609 resets) in 507 ms. (787 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400001 steps (538 resets) in 420 ms. (950 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400003 steps (6435 resets) in 548 ms. (728 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400004 steps (14672 resets) in 626 ms. (637 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400004 steps (6536 resets) in 520 ms. (767 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400003 steps (649 resets) in 417 ms. (956 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400003 steps (6256 resets) in 518 ms. (770 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400002 steps (14597 resets) in 615 ms. (649 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400002 steps (6644 resets) in 531 ms. (751 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400002 steps (635 resets) in 404 ms. (987 steps per ms) remains 23/30 properties
BEST_FIRST walk for 400004 steps (6546 resets) in 567 ms. (704 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400003 steps (676 resets) in 453 ms. (881 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400002 steps (6468 resets) in 572 ms. (698 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400002 steps (6355 resets) in 585 ms. (682 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400004 steps (6465 resets) in 569 ms. (701 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400004 steps (6764 resets) in 561 ms. (711 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400001 steps (652 resets) in 443 ms. (900 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400003 steps (6344 resets) in 546 ms. (731 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400003 steps (14769 resets) in 663 ms. (602 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400002 steps (6693 resets) in 568 ms. (702 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400003 steps (6301 resets) in 575 ms. (694 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400003 steps (6718 resets) in 567 ms. (704 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400003 steps (6298 resets) in 567 ms. (704 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400004 steps (595 resets) in 442 ms. (902 steps per ms) remains 21/23 properties
[2024-06-02 18:07:36] [INFO ] Flow matrix only has 259 transitions (discarded 29 similar events)
// Phase 1: matrix 259 rows 98 cols
[2024-06-02 18:07:36] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 18:07:36] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (OVERLAPS) 69/93 variables, 4/28 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 69/97 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-06-02 18:07:36] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2024-06-02 18:07:36] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 2/99 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (OVERLAPS) 258/351 variables, 93/192 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/351 variables, 40/232 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/351 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 9 (OVERLAPS) 5/356 variables, 4/236 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/356 variables, 4/240 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/356 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 12 (OVERLAPS) 1/357 variables, 1/241 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/357 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/357 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 15 (OVERLAPS) 0/357 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Real declared 357/357 variables, and 242 constraints, problems are : Problem set: 0 solved, 21 unsolved in 1387 ms.
Refiners :[Domain max(s): 98/98 constraints, Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 98/98 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (OVERLAPS) 69/93 variables, 4/28 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 69/97 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 2/99 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (OVERLAPS) 258/351 variables, 93/192 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/351 variables, 40/232 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/351 variables, 20/252 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-06-02 18:07:38] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/351 variables, 1/253 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/351 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 11 (OVERLAPS) 5/356 variables, 4/257 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/356 variables, 4/261 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/356 variables, 1/262 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/356 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 15 (OVERLAPS) 1/357 variables, 1/263 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/357 variables, 1/264 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/357 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 18 (OVERLAPS) 0/357 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Int declared 357/357 variables, and 264 constraints, problems are : Problem set: 0 solved, 21 unsolved in 2458 ms.
Refiners :[Domain max(s): 98/98 constraints, Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 98/98 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 3/3 constraints]
After SMT, in 3875ms problems are : Problem set: 0 solved, 21 unsolved
Fused 21 Parikh solutions to 20 different solutions.
Parikh walk visited 0 properties in 5 ms.
Support contains 24 out of 98 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 288/288 transitions.
Applied a total of 0 rules in 9 ms. Remains 98 /98 variables (removed 0) and now considering 288/288 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 98/98 places, 288/288 transitions.
RANDOM walk for 4000000 steps (257102 resets) in 16799 ms. (238 steps per ms) remains 15/21 properties
BEST_FIRST walk for 400004 steps (6360 resets) in 423 ms. (943 steps per ms) remains 15/15 properties
BEST_FIRST walk for 400003 steps (6324 resets) in 402 ms. (992 steps per ms) remains 15/15 properties
BEST_FIRST walk for 400001 steps (6525 resets) in 407 ms. (980 steps per ms) remains 15/15 properties
BEST_FIRST walk for 400003 steps (6363 resets) in 390 ms. (1023 steps per ms) remains 14/15 properties
BEST_FIRST walk for 400004 steps (6669 resets) in 384 ms. (1038 steps per ms) remains 14/14 properties
BEST_FIRST walk for 400004 steps (6369 resets) in 391 ms. (1020 steps per ms) remains 14/14 properties
BEST_FIRST walk for 400004 steps (6572 resets) in 388 ms. (1028 steps per ms) remains 14/14 properties
BEST_FIRST walk for 400004 steps (6742 resets) in 401 ms. (995 steps per ms) remains 14/14 properties
BEST_FIRST walk for 400003 steps (6321 resets) in 401 ms. (995 steps per ms) remains 14/14 properties
BEST_FIRST walk for 400004 steps (6676 resets) in 402 ms. (992 steps per ms) remains 14/14 properties
BEST_FIRST walk for 400003 steps (633 resets) in 335 ms. (1190 steps per ms) remains 14/14 properties
BEST_FIRST walk for 400004 steps (6321 resets) in 397 ms. (1005 steps per ms) remains 14/14 properties
BEST_FIRST walk for 400002 steps (6589 resets) in 397 ms. (1005 steps per ms) remains 14/14 properties
BEST_FIRST walk for 400003 steps (6321 resets) in 397 ms. (1005 steps per ms) remains 14/14 properties
[2024-06-02 18:07:47] [INFO ] Flow matrix only has 259 transitions (discarded 29 similar events)
[2024-06-02 18:07:47] [INFO ] Invariant cache hit.
[2024-06-02 18:07:47] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/17 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (OVERLAPS) 76/93 variables, 4/21 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 76/97 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-06-02 18:07:47] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2024-06-02 18:07:47] [INFO ] Deduced a trap composed of 44 places in 55 ms of which 1 ms to minimize.
[2024-06-02 18:07:47] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 3/100 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (OVERLAPS) 258/351 variables, 93/193 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/351 variables, 40/233 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/351 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (OVERLAPS) 5/356 variables, 4/237 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/356 variables, 4/241 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/356 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 12 (OVERLAPS) 1/357 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/357 variables, 1/243 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/357 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 15 (OVERLAPS) 0/357 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 357/357 variables, and 243 constraints, problems are : Problem set: 0 solved, 14 unsolved in 1066 ms.
Refiners :[Domain max(s): 98/98 constraints, Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 98/98 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/17 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (OVERLAPS) 76/93 variables, 4/21 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 76/97 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 3/100 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (OVERLAPS) 258/351 variables, 93/193 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/351 variables, 40/233 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/351 variables, 14/247 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-06-02 18:07:48] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/351 variables, 1/248 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/351 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 11 (OVERLAPS) 5/356 variables, 4/252 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/356 variables, 4/256 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/356 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 14 (OVERLAPS) 1/357 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/357 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/357 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 17 (OVERLAPS) 0/357 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Int declared 357/357 variables, and 258 constraints, problems are : Problem set: 0 solved, 14 unsolved in 1455 ms.
Refiners :[Domain max(s): 98/98 constraints, Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 98/98 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 4/4 constraints]
After SMT, in 2533ms problems are : Problem set: 0 solved, 14 unsolved
Parikh walk visited 0 properties in 14186 ms.
Support contains 17 out of 98 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 288/288 transitions.
Applied a total of 0 rules in 7 ms. Remains 98 /98 variables (removed 0) and now considering 288/288 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 98/98 places, 288/288 transitions.
RANDOM walk for 4000000 steps (256173 resets) in 13580 ms. (294 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000003 steps (63758 resets) in 3683 ms. (1085 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000003 steps (63375 resets) in 3833 ms. (1043 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000002 steps (65359 resets) in 3976 ms. (1005 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000004 steps (63924 resets) in 3865 ms. (1034 steps per ms) remains 13/14 properties
BEST_FIRST walk for 4000001 steps (65740 resets) in 3648 ms. (1096 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4000003 steps (64541 resets) in 3671 ms. (1089 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4000004 steps (65838 resets) in 3664 ms. (1091 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4000003 steps (65064 resets) in 3679 ms. (1086 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4000004 steps (63502 resets) in 3694 ms. (1082 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4000004 steps (65772 resets) in 3693 ms. (1082 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4000003 steps (63390 resets) in 3765 ms. (1062 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4000003 steps (65531 resets) in 3644 ms. (1097 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4000004 steps (63581 resets) in 3729 ms. (1072 steps per ms) remains 13/13 properties
Finished probabilistic random walk after 253547 steps, run visited all 13 properties in 1084 ms. (steps per millisecond=233 )
Probabilistic random walk after 253547 steps, saw 57848 distinct states, run finished after 1090 ms. (steps per millisecond=232 ) properties seen :13
Able to resolve query QuasiLiveness after proving 203 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK PROBABILISTIC_WALK BESTFIRST_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 94020 ms.
ITS solved all properties within timeout
BK_STOP 1717351702289
--------------------
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-04"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is FireWire-PT-04, examination is QuasiLiveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r560-tall-171734905700122"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FireWire-PT-04.tgz
mv FireWire-PT-04 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 '
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 ;