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.r549-tall-171734898100210.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-06, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r549-tall-171734898100210
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 6.8K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K 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.4K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K 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 9.9K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K 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 90K 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

here is the order used to build the result vector(from text file)
FORMULA_NAME FireWire-PT-06-CTLFireability-2024-00
FORMULA_NAME FireWire-PT-06-CTLFireability-2024-01
FORMULA_NAME FireWire-PT-06-CTLFireability-2024-02
FORMULA_NAME FireWire-PT-06-CTLFireability-2024-03
FORMULA_NAME FireWire-PT-06-CTLFireability-2024-04
FORMULA_NAME FireWire-PT-06-CTLFireability-2024-05
FORMULA_NAME FireWire-PT-06-CTLFireability-2024-06
FORMULA_NAME FireWire-PT-06-CTLFireability-2024-07
FORMULA_NAME FireWire-PT-06-CTLFireability-2024-08
FORMULA_NAME FireWire-PT-06-CTLFireability-2024-09
FORMULA_NAME FireWire-PT-06-CTLFireability-2024-10
FORMULA_NAME FireWire-PT-06-CTLFireability-2024-11
FORMULA_NAME FireWire-PT-06-CTLFireability-2024-12
FORMULA_NAME FireWire-PT-06-CTLFireability-2024-13
FORMULA_NAME FireWire-PT-06-CTLFireability-2024-14
FORMULA_NAME FireWire-PT-06-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717366047159

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-02 22:07:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-02 22:07:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 22:07:28] [INFO ] Load time of PNML (sax parser for PT used): 79 ms
[2024-06-02 22:07:28] [INFO ] Transformed 116 places.
[2024-06-02 22:07:28] [INFO ] Transformed 368 transitions.
[2024-06-02 22:07:28] [INFO ] Found NUPN structural information;
[2024-06-02 22:07:28] [INFO ] Parsed PT model containing 116 places and 368 transitions and 1362 arcs in 174 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 19 ms.
Ensure Unique test removed 56 transitions
Reduce redundant transitions removed 56 transitions.
Support contains 71 out of 116 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 116/116 places, 312/312 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 115 transition count 310
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 115 transition count 310
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 8 place count 115 transition count 304
Applied a total of 8 rules in 29 ms. Remains 115 /116 variables (removed 1) and now considering 304/312 (removed 8) transitions.
[2024-06-02 22:07:28] [INFO ] Flow matrix only has 278 transitions (discarded 26 similar events)
// Phase 1: matrix 278 rows 115 cols
[2024-06-02 22:07:28] [INFO ] Computed 9 invariants in 19 ms
[2024-06-02 22:07:28] [INFO ] Implicit Places using invariants in 218 ms returned []
[2024-06-02 22:07:28] [INFO ] Flow matrix only has 278 transitions (discarded 26 similar events)
[2024-06-02 22:07:28] [INFO ] Invariant cache hit.
[2024-06-02 22:07:28] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-06-02 22:07:29] [INFO ] Implicit Places using invariants and state equation in 207 ms returned [36, 61]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 460 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 113/116 places, 304/312 transitions.
Applied a total of 0 rules in 6 ms. Remains 113 /113 variables (removed 0) and now considering 304/304 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 513 ms. Remains : 113/116 places, 304/312 transitions.
Support contains 71 out of 113 places after structural reductions.
[2024-06-02 22:07:29] [INFO ] Flatten gal took : 50 ms
[2024-06-02 22:07:29] [INFO ] Flatten gal took : 28 ms
[2024-06-02 22:07:29] [INFO ] Input system was already deterministic with 304 transitions.
RANDOM walk for 40000 steps (2018 resets) in 2054 ms. (19 steps per ms) remains 42/76 properties
BEST_FIRST walk for 4004 steps (8 resets) in 50 ms. (78 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (44 resets) in 71 ms. (55 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4000 steps (8 resets) in 51 ms. (76 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (50 resets) in 29 ms. (133 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4000 steps (8 resets) in 22 ms. (173 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (114 resets) in 33 ms. (117 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (8 resets) in 21 ms. (181 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (16 resets) in 12 ms. (308 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (44 resets) in 14 ms. (266 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (15 resets) in 14 ms. (266 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (13 resets) in 14 ms. (266 steps per ms) remains 41/42 properties
BEST_FIRST walk for 4003 steps (115 resets) in 17 ms. (222 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (120 resets) in 16 ms. (235 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (57 resets) in 27 ms. (143 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (51 resets) in 22 ms. (174 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4000 steps (8 resets) in 27 ms. (142 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (111 resets) in 12 ms. (308 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (11 resets) in 18 ms. (210 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (10 resets) in 14 ms. (266 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (89 resets) in 12 ms. (307 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (25 resets) in 12 ms. (308 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (54 resets) in 15 ms. (250 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (17 resets) in 12 ms. (308 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (10 resets) in 29 ms. (133 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (58 resets) in 12 ms. (308 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (53 resets) in 42 ms. (93 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (8 resets) in 13 ms. (285 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (60 resets) in 15 ms. (250 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (14 resets) in 23 ms. (166 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (84 resets) in 12 ms. (307 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (24 resets) in 23 ms. (166 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4001 steps (82 resets) in 23 ms. (166 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (14 resets) in 12 ms. (307 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (86 resets) in 15 ms. (250 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (43 resets) in 15 ms. (250 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4000 steps (8 resets) in 19 ms. (200 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (81 resets) in 12 ms. (307 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (51 resets) in 13 ms. (285 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (10 resets) in 14 ms. (266 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (78 resets) in 16 ms. (235 steps per ms) remains 41/41 properties
[2024-06-02 22:07:30] [INFO ] Flow matrix only has 278 transitions (discarded 26 similar events)
// Phase 1: matrix 278 rows 113 cols
[2024-06-02 22:07:30] [INFO ] Computed 7 invariants in 5 ms
[2024-06-02 22:07:30] [INFO ] State equation strengthened by 41 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 41 unsolved
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp65 is UNSAT
At refinement iteration 1 (OVERLAPS) 56/109 variables, 6/6 constraints. Problems are: Problem set: 4 solved, 37 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/6 constraints. Problems are: Problem set: 4 solved, 37 unsolved
At refinement iteration 3 (OVERLAPS) 2/111 variables, 1/7 constraints. Problems are: Problem set: 4 solved, 37 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 0/7 constraints. Problems are: Problem set: 4 solved, 37 unsolved
At refinement iteration 5 (OVERLAPS) 277/388 variables, 111/118 constraints. Problems are: Problem set: 4 solved, 37 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/388 variables, 40/158 constraints. Problems are: Problem set: 4 solved, 37 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/388 variables, 0/158 constraints. Problems are: Problem set: 4 solved, 37 unsolved
At refinement iteration 8 (OVERLAPS) 2/390 variables, 2/160 constraints. Problems are: Problem set: 4 solved, 37 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/390 variables, 0/160 constraints. Problems are: Problem set: 4 solved, 37 unsolved
At refinement iteration 10 (OVERLAPS) 1/391 variables, 1/161 constraints. Problems are: Problem set: 4 solved, 37 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/391 variables, 0/161 constraints. Problems are: Problem set: 4 solved, 37 unsolved
At refinement iteration 12 (OVERLAPS) 0/391 variables, 0/161 constraints. Problems are: Problem set: 4 solved, 37 unsolved
No progress, stopping.
After SMT solving in domain Real declared 391/391 variables, and 161 constraints, problems are : Problem set: 4 solved, 37 unsolved in 1425 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 113/113 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 41/41 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 37 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 37 unsolved
Problem AtomicPropp11 is UNSAT
At refinement iteration 1 (OVERLAPS) 63/109 variables, 6/6 constraints. Problems are: Problem set: 5 solved, 36 unsolved
[2024-06-02 22:07:32] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 12 ms to minimize.
[2024-06-02 22:07:32] [INFO ] Deduced a trap composed of 22 places in 76 ms of which 2 ms to minimize.
[2024-06-02 22:07:32] [INFO ] Deduced a trap composed of 42 places in 41 ms of which 1 ms to minimize.
[2024-06-02 22:07:32] [INFO ] Deduced a trap composed of 43 places in 36 ms of which 1 ms to minimize.
[2024-06-02 22:07:32] [INFO ] Deduced a trap composed of 36 places in 37 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 5/11 constraints. Problems are: Problem set: 5 solved, 36 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 0/11 constraints. Problems are: Problem set: 5 solved, 36 unsolved
At refinement iteration 4 (OVERLAPS) 2/111 variables, 1/12 constraints. Problems are: Problem set: 5 solved, 36 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/111 variables, 0/12 constraints. Problems are: Problem set: 5 solved, 36 unsolved
At refinement iteration 6 (OVERLAPS) 277/388 variables, 111/123 constraints. Problems are: Problem set: 5 solved, 36 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/388 variables, 40/163 constraints. Problems are: Problem set: 5 solved, 36 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/388 variables, 28/191 constraints. Problems are: Problem set: 5 solved, 36 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/388 variables, 0/191 constraints. Problems are: Problem set: 5 solved, 36 unsolved
At refinement iteration 10 (OVERLAPS) 2/390 variables, 2/193 constraints. Problems are: Problem set: 5 solved, 36 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/390 variables, 8/201 constraints. Problems are: Problem set: 5 solved, 36 unsolved
[2024-06-02 22:07:33] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-06-02 22:07:33] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/390 variables, 2/203 constraints. Problems are: Problem set: 5 solved, 36 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/390 variables, 0/203 constraints. Problems are: Problem set: 5 solved, 36 unsolved
At refinement iteration 14 (OVERLAPS) 1/391 variables, 1/204 constraints. Problems are: Problem set: 5 solved, 36 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/391 variables, 0/204 constraints. Problems are: Problem set: 5 solved, 36 unsolved
At refinement iteration 16 (OVERLAPS) 0/391 variables, 0/204 constraints. Problems are: Problem set: 5 solved, 36 unsolved
No progress, stopping.
After SMT solving in domain Int declared 391/391 variables, and 204 constraints, problems are : Problem set: 5 solved, 36 unsolved in 4540 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 113/113 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 36/41 constraints, Known Traps: 7/7 constraints]
After SMT, in 6082ms problems are : Problem set: 5 solved, 36 unsolved
Parikh walk visited 0 properties in 5160 ms.
Support contains 45 out of 113 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 113/113 places, 304/304 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 113 transition count 301
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 3 place count 113 transition count 300
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 112 transition count 300
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 111 transition count 299
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 9 place count 110 transition count 301
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 11 place count 110 transition count 299
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 110 transition count 298
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 13 place count 110 transition count 297
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 14 place count 109 transition count 297
Applied a total of 14 rules in 62 ms. Remains 109 /113 variables (removed 4) and now considering 297/304 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62 ms. Remains : 109/113 places, 297/304 transitions.
RANDOM walk for 40000 steps (2172 resets) in 496 ms. (80 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4001 steps (60 resets) in 10 ms. (363 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (53 resets) in 12 ms. (308 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (9 resets) in 12 ms. (307 steps per ms) remains 29/36 properties
BEST_FIRST walk for 4003 steps (11 resets) in 11 ms. (333 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (60 resets) in 27 ms. (142 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (11 resets) in 14 ms. (266 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (16 resets) in 11 ms. (333 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (152 resets) in 24 ms. (160 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (50 resets) in 26 ms. (148 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (57 resets) in 37 ms. (105 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (134 resets) in 26 ms. (148 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (105 resets) in 15 ms. (250 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (30 resets) in 17 ms. (222 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (62 resets) in 29 ms. (133 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (23 resets) in 13 ms. (286 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (10 resets) in 23 ms. (166 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (60 resets) in 26 ms. (148 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (56 resets) in 18 ms. (210 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (10 resets) in 18 ms. (210 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (103 resets) in 13 ms. (285 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (16 resets) in 10 ms. (363 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (104 resets) in 10 ms. (363 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (110 resets) in 15 ms. (250 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (56 resets) in 10 ms. (363 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4001 steps (104 resets) in 25 ms. (153 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (54 resets) in 13 ms. (285 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (9 resets) in 12 ms. (307 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (102 resets) in 13 ms. (285 steps per ms) remains 29/29 properties
[2024-06-02 22:07:42] [INFO ] Flow matrix only has 273 transitions (discarded 24 similar events)
// Phase 1: matrix 273 rows 109 cols
[2024-06-02 22:07:42] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 22:07:42] [INFO ] State equation strengthened by 42 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (OVERLAPS) 63/102 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (OVERLAPS) 5/107 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (OVERLAPS) 273/380 variables, 107/114 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/380 variables, 42/156 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/380 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 8 (OVERLAPS) 2/382 variables, 2/158 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/382 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 10 (OVERLAPS) 0/382 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Real declared 382/382 variables, and 158 constraints, problems are : Problem set: 0 solved, 29 unsolved in 829 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 109/109 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 29 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (OVERLAPS) 63/102 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 29 unsolved
[2024-06-02 22:07:43] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
[2024-06-02 22:07:43] [INFO ] Deduced a trap composed of 40 places in 63 ms of which 1 ms to minimize.
[2024-06-02 22:07:43] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 1 ms to minimize.
[2024-06-02 22:07:43] [INFO ] Deduced a trap composed of 42 places in 42 ms of which 1 ms to minimize.
[2024-06-02 22:07:43] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (OVERLAPS) 5/107 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/107 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (OVERLAPS) 273/380 variables, 107/119 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/380 variables, 42/161 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/380 variables, 24/185 constraints. Problems are: Problem set: 0 solved, 29 unsolved
[2024-06-02 22:07:44] [INFO ] Deduced a trap composed of 42 places in 39 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/380 variables, 1/186 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/380 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 11 (OVERLAPS) 2/382 variables, 2/188 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/382 variables, 5/193 constraints. Problems are: Problem set: 0 solved, 29 unsolved
[2024-06-02 22:07:45] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 3 ms to minimize.
[2024-06-02 22:07:45] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/382 variables, 2/195 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/382 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 15 (OVERLAPS) 0/382 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Int declared 382/382 variables, and 195 constraints, problems are : Problem set: 0 solved, 29 unsolved in 3324 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 109/109 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 8/8 constraints]
After SMT, in 4210ms problems are : Problem set: 0 solved, 29 unsolved
Parikh walk visited 3 properties in 4315 ms.
Support contains 37 out of 109 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 109/109 places, 297/297 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 9 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 108 transition count 296
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 108 transition count 294
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 108 transition count 293
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 6 place count 107 transition count 293
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 107 transition count 293
Applied a total of 7 rules in 45 ms. Remains 107 /109 variables (removed 2) and now considering 293/297 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 107/109 places, 293/297 transitions.
RANDOM walk for 40000 steps (2178 resets) in 262 ms. (152 steps per ms) remains 25/26 properties
BEST_FIRST walk for 4002 steps (8 resets) in 15 ms. (250 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (70 resets) in 15 ms. (250 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (13 resets) in 8 ms. (444 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (59 resets) in 11 ms. (333 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (17 resets) in 9 ms. (400 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (13 resets) in 8 ms. (444 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4001 steps (156 resets) in 10 ms. (363 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (47 resets) in 8 ms. (444 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (50 resets) in 9 ms. (400 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (131 resets) in 10 ms. (363 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (98 resets) in 8 ms. (444 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (26 resets) in 9 ms. (400 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (46 resets) in 9 ms. (400 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4001 steps (14 resets) in 8 ms. (444 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (18 resets) in 8 ms. (444 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (57 resets) in 11 ms. (333 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (104 resets) in 8 ms. (444 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (17 resets) in 9 ms. (400 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (107 resets) in 9 ms. (400 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (44 resets) in 8 ms. (444 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (109 resets) in 15 ms. (250 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (62 resets) in 11 ms. (333 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4001 steps (8 resets) in 8 ms. (444 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (97 resets) in 12 ms. (307 steps per ms) remains 25/25 properties
Interrupted probabilistic random walk after 526704 steps, run timeout after 3001 ms. (steps per millisecond=175 ) properties seen :6 out of 25
Probabilistic random walk after 526704 steps, saw 102088 distinct states, run finished after 3004 ms. (steps per millisecond=175 ) properties seen :6
[2024-06-02 22:07:53] [INFO ] Flow matrix only has 270 transitions (discarded 23 similar events)
// Phase 1: matrix 270 rows 107 cols
[2024-06-02 22:07:53] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 22:07:53] [INFO ] State equation strengthened by 41 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 74/100 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 5/105 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (OVERLAPS) 270/375 variables, 105/112 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/375 variables, 41/153 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/375 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (OVERLAPS) 2/377 variables, 2/155 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/377 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 10 (OVERLAPS) 0/377 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Real declared 377/377 variables, and 155 constraints, problems are : Problem set: 0 solved, 19 unsolved in 539 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 107/107 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 19 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 74/100 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-06-02 22:07:54] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2024-06-02 22:07:54] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 1 ms to minimize.
[2024-06-02 22:07:54] [INFO ] Deduced a trap composed of 41 places in 30 ms of which 1 ms to minimize.
[2024-06-02 22:07:54] [INFO ] Deduced a trap composed of 35 places in 34 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (OVERLAPS) 5/105 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (OVERLAPS) 270/375 variables, 105/116 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/375 variables, 41/157 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/375 variables, 17/174 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-06-02 22:07:55] [INFO ] Deduced a trap composed of 41 places in 41 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/375 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/375 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 11 (OVERLAPS) 2/377 variables, 2/177 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/377 variables, 2/179 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-06-02 22:07:55] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/377 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/377 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 15 (OVERLAPS) 0/377 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Int declared 377/377 variables, and 180 constraints, problems are : Problem set: 0 solved, 19 unsolved in 2289 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 107/107 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 6/6 constraints]
After SMT, in 2855ms problems are : Problem set: 0 solved, 19 unsolved
Parikh walk visited 0 properties in 2144 ms.
Support contains 26 out of 107 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 107/107 places, 293/293 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 106 transition count 295
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 106 transition count 293
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 106 transition count 292
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 106 transition count 294
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 9 place count 105 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 11 place count 105 transition count 290
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 105 transition count 290
Applied a total of 12 rules in 37 ms. Remains 105 /107 variables (removed 2) and now considering 290/293 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 105/107 places, 290/293 transitions.
RANDOM walk for 40000 steps (2146 resets) in 1249 ms. (32 steps per ms) remains 17/19 properties
BEST_FIRST walk for 4003 steps (42 resets) in 10 ms. (363 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (22 resets) in 9 ms. (400 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (15 resets) in 14 ms. (266 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (21 resets) in 9 ms. (400 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (150 resets) in 11 ms. (333 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (42 resets) in 9 ms. (400 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (60 resets) in 13 ms. (285 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (132 resets) in 10 ms. (363 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (108 resets) in 10 ms. (363 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (27 resets) in 9 ms. (400 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (58 resets) in 9 ms. (400 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (13 resets) in 8 ms. (444 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (18 resets) in 11 ms. (333 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4001 steps (105 resets) in 11 ms. (333 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (59 resets) in 10 ms. (364 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (109 resets) in 9 ms. (400 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (10 resets) in 8 ms. (444 steps per ms) remains 17/17 properties
[2024-06-02 22:07:59] [INFO ] Flow matrix only has 264 transitions (discarded 26 similar events)
// Phase 1: matrix 264 rows 105 cols
[2024-06-02 22:07:59] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 22:07:59] [INFO ] State equation strengthened by 41 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 73/98 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 5/103 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 264/367 variables, 103/110 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/367 variables, 41/151 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/367 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 2/369 variables, 2/153 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/369 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (OVERLAPS) 0/369 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 369/369 variables, and 153 constraints, problems are : Problem set: 0 solved, 17 unsolved in 493 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 105/105 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 73/98 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2024-06-02 22:08:00] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-06-02 22:08:00] [INFO ] Deduced a trap composed of 45 places in 60 ms of which 1 ms to minimize.
[2024-06-02 22:08:00] [INFO ] Deduced a trap composed of 40 places in 35 ms of which 1 ms to minimize.
[2024-06-02 22:08:00] [INFO ] Deduced a trap composed of 34 places in 43 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 5/103 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2024-06-02 22:08:00] [INFO ] Deduced a trap composed of 33 places in 35 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2024-06-02 22:08:00] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/103 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/103 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 264/367 variables, 103/116 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/367 variables, 41/157 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/367 variables, 15/172 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/367 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 12 (OVERLAPS) 2/369 variables, 2/174 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/369 variables, 2/176 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2024-06-02 22:08:01] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/369 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/369 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 16 (OVERLAPS) 0/369 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 369/369 variables, and 177 constraints, problems are : Problem set: 0 solved, 17 unsolved in 1920 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 105/105 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 7/7 constraints]
After SMT, in 2443ms problems are : Problem set: 0 solved, 17 unsolved
Parikh walk visited 0 properties in 452 ms.
Support contains 25 out of 105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 290/290 transitions.
Applied a total of 0 rules in 12 ms. Remains 105 /105 variables (removed 0) and now considering 290/290 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 105/105 places, 290/290 transitions.
RANDOM walk for 40000 steps (2115 resets) in 324 ms. (123 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (55 resets) in 12 ms. (307 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (14 resets) in 9 ms. (400 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (17 resets) in 11 ms. (333 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (17 resets) in 11 ms. (333 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (156 resets) in 17 ms. (222 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (44 resets) in 12 ms. (308 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (64 resets) in 11 ms. (333 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (135 resets) in 11 ms. (333 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (112 resets) in 11 ms. (333 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (28 resets) in 10 ms. (364 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (54 resets) in 9 ms. (400 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (25 resets) in 8 ms. (444 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4001 steps (14 resets) in 9 ms. (400 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (100 resets) in 8 ms. (444 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (58 resets) in 16 ms. (235 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (120 resets) in 16 ms. (235 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (10 resets) in 12 ms. (307 steps per ms) remains 17/17 properties
Interrupted probabilistic random walk after 447295 steps, run timeout after 3001 ms. (steps per millisecond=149 ) properties seen :0 out of 17
Probabilistic random walk after 447295 steps, saw 98762 distinct states, run finished after 3001 ms. (steps per millisecond=149 ) properties seen :0
[2024-06-02 22:08:05] [INFO ] Flow matrix only has 264 transitions (discarded 26 similar events)
[2024-06-02 22:08:05] [INFO ] Invariant cache hit.
[2024-06-02 22:08:05] [INFO ] State equation strengthened by 41 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 73/98 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 5/103 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 264/367 variables, 103/110 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/367 variables, 41/151 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/367 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 2/369 variables, 2/153 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/369 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (OVERLAPS) 0/369 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 369/369 variables, and 153 constraints, problems are : Problem set: 0 solved, 17 unsolved in 513 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 105/105 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 73/98 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2024-06-02 22:08:06] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2024-06-02 22:08:06] [INFO ] Deduced a trap composed of 45 places in 64 ms of which 1 ms to minimize.
[2024-06-02 22:08:06] [INFO ] Deduced a trap composed of 40 places in 35 ms of which 1 ms to minimize.
[2024-06-02 22:08:06] [INFO ] Deduced a trap composed of 34 places in 39 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2024-06-02 22:08:06] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 5/103 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2024-06-02 22:08:06] [INFO ] Deduced a trap composed of 33 places in 38 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/103 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/103 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 264/367 variables, 103/116 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/367 variables, 41/157 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/367 variables, 15/172 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/367 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 12 (OVERLAPS) 2/369 variables, 2/174 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/369 variables, 2/176 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2024-06-02 22:08:07] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 7 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/369 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/369 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 16 (OVERLAPS) 0/369 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 369/369 variables, and 177 constraints, problems are : Problem set: 0 solved, 17 unsolved in 1936 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 105/105 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 7/7 constraints]
After SMT, in 2475ms problems are : Problem set: 0 solved, 17 unsolved
Parikh walk visited 0 properties in 2698 ms.
Support contains 25 out of 105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 290/290 transitions.
Applied a total of 0 rules in 7 ms. Remains 105 /105 variables (removed 0) and now considering 290/290 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 105/105 places, 290/290 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 290/290 transitions.
Applied a total of 0 rules in 12 ms. Remains 105 /105 variables (removed 0) and now considering 290/290 (removed 0) transitions.
[2024-06-02 22:08:10] [INFO ] Flow matrix only has 264 transitions (discarded 26 similar events)
[2024-06-02 22:08:10] [INFO ] Invariant cache hit.
[2024-06-02 22:08:10] [INFO ] Implicit Places using invariants in 50 ms returned [104]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 52 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 104/105 places, 290/290 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 104 transition count 289
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 103 transition count 289
Applied a total of 2 rules in 9 ms. Remains 103 /104 variables (removed 1) and now considering 289/290 (removed 1) transitions.
[2024-06-02 22:08:10] [INFO ] Flow matrix only has 263 transitions (discarded 26 similar events)
// Phase 1: matrix 263 rows 103 cols
[2024-06-02 22:08:10] [INFO ] Computed 6 invariants in 1 ms
[2024-06-02 22:08:10] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-06-02 22:08:10] [INFO ] Flow matrix only has 263 transitions (discarded 26 similar events)
[2024-06-02 22:08:10] [INFO ] Invariant cache hit.
[2024-06-02 22:08:10] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 22:08:10] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 209 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 103/105 places, 289/290 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 282 ms. Remains : 103/105 places, 289/290 transitions.
RANDOM walk for 40000 steps (2353 resets) in 237 ms. (168 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (60 resets) in 19 ms. (200 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (18 resets) in 11 ms. (333 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (17 resets) in 10 ms. (364 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (17 resets) in 8 ms. (444 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (180 resets) in 10 ms. (363 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (35 resets) in 8 ms. (444 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4001 steps (63 resets) in 11 ms. (333 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (158 resets) in 13 ms. (285 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4001 steps (118 resets) in 9 ms. (400 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4001 steps (30 resets) in 9 ms. (400 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (63 resets) in 9 ms. (400 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (14 resets) in 8 ms. (444 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (13 resets) in 9 ms. (400 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (122 resets) in 13 ms. (285 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (47 resets) in 9 ms. (400 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (127 resets) in 8 ms. (444 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 17/17 properties
Probabilistic random walk after 1000000 steps, saw 205987 distinct states, run finished after 2545 ms. (steps per millisecond=392 ) properties seen :15
[2024-06-02 22:08:13] [INFO ] Flow matrix only has 263 transitions (discarded 26 similar events)
[2024-06-02 22:08:13] [INFO ] Invariant cache hit.
[2024-06-02 22:08:13] [INFO ] State equation strengthened by 40 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 91/98 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 3/101 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 263/364 variables, 101/107 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/364 variables, 40/147 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/364 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 2/366 variables, 2/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/366 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/366 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 366/366 variables, and 149 constraints, problems are : Problem set: 0 solved, 2 unsolved in 123 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 103/103 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 91/98 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-02 22:08:13] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 1 ms to minimize.
[2024-06-02 22:08:13] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
[2024-06-02 22:08:14] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 3/101 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-02 22:08:14] [INFO ] Deduced a trap composed of 33 places in 36 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/101 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 263/364 variables, 101/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/364 variables, 40/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/364 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 2/366 variables, 2/153 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/366 variables, 2/155 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-02 22:08:14] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/366 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/366 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/366 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 366/366 variables, and 156 constraints, problems are : Problem set: 0 solved, 2 unsolved in 529 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 103/103 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 5/5 constraints]
After SMT, in 676ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 208 ms.
Support contains 7 out of 103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 289/289 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 102 transition count 294
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 102 transition count 292
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 102 transition count 291
Applied a total of 5 rules in 13 ms. Remains 102 /103 variables (removed 1) and now considering 291/289 (removed -2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 102/103 places, 291/289 transitions.
RANDOM walk for 40000 steps (2293 resets) in 101 ms. (392 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (20 resets) in 32 ms. (1212 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (643 resets) in 50 ms. (784 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1268659 steps, run timeout after 3001 ms. (steps per millisecond=422 ) properties seen :1 out of 2
Probabilistic random walk after 1268659 steps, saw 258957 distinct states, run finished after 3001 ms. (steps per millisecond=422 ) properties seen :1
[2024-06-02 22:08:17] [INFO ] Flow matrix only has 263 transitions (discarded 28 similar events)
// Phase 1: matrix 263 rows 102 cols
[2024-06-02 22:08:17] [INFO ] Computed 6 invariants in 3 ms
[2024-06-02 22:08:17] [INFO ] State equation strengthened by 40 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 92/97 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 3/100 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 263/363 variables, 100/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/363 variables, 40/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/363 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/365 variables, 2/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/365 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/365 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 365/365 variables, and 148 constraints, problems are : Problem set: 0 solved, 1 unsolved in 101 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 102/102 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 92/97 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 22:08:17] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 3/100 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 263/363 variables, 100/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/363 variables, 40/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/363 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/365 variables, 2/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/365 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 22:08:18] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/365 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/365 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/365 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 365/365 variables, and 151 constraints, problems are : Problem set: 0 solved, 1 unsolved in 263 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 102/102 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 387ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 13 ms.
Support contains 5 out of 102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 291/291 transitions.
Applied a total of 0 rules in 5 ms. Remains 102 /102 variables (removed 0) and now considering 291/291 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 102/102 places, 291/291 transitions.
RANDOM walk for 40000 steps (2346 resets) in 73 ms. (540 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (582 resets) in 26 ms. (1481 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2128493 steps, run timeout after 3001 ms. (steps per millisecond=709 ) properties seen :0 out of 1
Probabilistic random walk after 2128493 steps, saw 440769 distinct states, run finished after 3001 ms. (steps per millisecond=709 ) properties seen :0
[2024-06-02 22:08:21] [INFO ] Flow matrix only has 263 transitions (discarded 28 similar events)
[2024-06-02 22:08:21] [INFO ] Invariant cache hit.
[2024-06-02 22:08:21] [INFO ] State equation strengthened by 40 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 92/97 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 3/100 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 263/363 variables, 100/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/363 variables, 40/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/363 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/365 variables, 2/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/365 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/365 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 365/365 variables, and 148 constraints, problems are : Problem set: 0 solved, 1 unsolved in 108 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 102/102 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 92/97 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 22:08:21] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 3/100 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 263/363 variables, 100/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/363 variables, 40/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/363 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/365 variables, 2/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/365 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 22:08:21] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/365 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/365 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/365 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 365/365 variables, and 151 constraints, problems are : Problem set: 0 solved, 1 unsolved in 296 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 102/102 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 411ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 10 ms.
Support contains 5 out of 102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 291/291 transitions.
Applied a total of 0 rules in 9 ms. Remains 102 /102 variables (removed 0) and now considering 291/291 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 102/102 places, 291/291 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 291/291 transitions.
Applied a total of 0 rules in 8 ms. Remains 102 /102 variables (removed 0) and now considering 291/291 (removed 0) transitions.
[2024-06-02 22:08:21] [INFO ] Flow matrix only has 263 transitions (discarded 28 similar events)
[2024-06-02 22:08:21] [INFO ] Invariant cache hit.
[2024-06-02 22:08:21] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-06-02 22:08:21] [INFO ] Flow matrix only has 263 transitions (discarded 28 similar events)
[2024-06-02 22:08:21] [INFO ] Invariant cache hit.
[2024-06-02 22:08:21] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 22:08:21] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 210 ms to find 0 implicit places.
[2024-06-02 22:08:21] [INFO ] Redundant transitions in 17 ms returned []
Running 290 sub problems to find dead transitions.
[2024-06-02 22:08:21] [INFO ] Flow matrix only has 263 transitions (discarded 28 similar events)
[2024-06-02 22:08:21] [INFO ] Invariant cache hit.
[2024-06-02 22:08:21] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 1 (OVERLAPS) 1/102 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 290 unsolved
[2024-06-02 22:08:23] [INFO ] Deduced a trap composed of 37 places in 55 ms of which 2 ms to minimize.
[2024-06-02 22:08:23] [INFO ] Deduced a trap composed of 33 places in 27 ms of which 1 ms to minimize.
[2024-06-02 22:08:23] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 1 ms to minimize.
[2024-06-02 22:08:23] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 1 ms to minimize.
[2024-06-02 22:08:24] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2024-06-02 22:08:24] [INFO ] Deduced a trap composed of 39 places in 32 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 4 (OVERLAPS) 263/365 variables, 102/114 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/365 variables, 40/154 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 7 (OVERLAPS) 0/365 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 290 unsolved
No progress, stopping.
After SMT solving in domain Real declared 365/365 variables, and 154 constraints, problems are : Problem set: 0 solved, 290 unsolved in 7310 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 102/102 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 290/290 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 290 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 1 (OVERLAPS) 1/102 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 4 (OVERLAPS) 263/365 variables, 102/114 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/365 variables, 40/154 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 290/444 constraints. Problems are: Problem set: 0 solved, 290 unsolved
[2024-06-02 22:08:32] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-06-02 22:08:32] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 2/446 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/365 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 9 (OVERLAPS) 0/365 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 290 unsolved
No progress, stopping.
After SMT solving in domain Int declared 365/365 variables, and 446 constraints, problems are : Problem set: 0 solved, 290 unsolved in 18390 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 102/102 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 290/290 constraints, Known Traps: 8/8 constraints]
After SMT, in 25888ms problems are : Problem set: 0 solved, 290 unsolved
Search for dead transitions found 0 dead transitions in 25893ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26142 ms. Remains : 102/102 places, 291/291 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 97 edges and 102 vertex of which 23 / 102 are part of one of the 4 SCC in 3 ms
Free SCC test removed 19 places
Drop transitions (Empty/Sink Transition effects.) removed 90 transitions
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 109 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 82 transition count 181
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 11 place count 82 transition count 173
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 1 rules applied. Total rules applied 12 place count 82 transition count 172
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 81 transition count 172
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 13 place count 81 transition count 171
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 15 place count 80 transition count 171
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 17 place count 79 transition count 171
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 18 place count 79 transition count 170
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 20 place count 79 transition count 168
Free-agglomeration rule applied 3 times with reduction of 1 identical transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 23 place count 79 transition count 164
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 27 place count 76 transition count 163
Applied a total of 27 rules in 31 ms. Remains 76 /102 variables (removed 26) and now considering 163/291 (removed 128) transitions.
Running SMT prover for 1 properties.
[2024-06-02 22:08:47] [INFO ] Flow matrix only has 162 transitions (discarded 1 similar events)
// Phase 1: matrix 162 rows 76 cols
[2024-06-02 22:08:47] [INFO ] Computed 6 invariants in 2 ms
[2024-06-02 22:08:47] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 22:08:47] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-06-02 22:08:47] [INFO ] After 38ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 22:08:47] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-06-02 22:08:47] [INFO ] After 11ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 22:08:47] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 0 ms to minimize.
[2024-06-02 22:08:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 44 ms
TRAPS : Iteration 1
[2024-06-02 22:08:47] [INFO ] After 82ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-02 22:08:47] [INFO ] After 169ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 243 ms.
Successfully simplified 5 atomic propositions for a total of 16 simplifications.
[2024-06-02 22:08:47] [INFO ] Flatten gal took : 17 ms
[2024-06-02 22:08:47] [INFO ] Flatten gal took : 18 ms
[2024-06-02 22:08:48] [INFO ] Input system was already deterministic with 304 transitions.
Support contains 66 out of 113 places (down from 67) after GAL structural reductions.
Computed a total of 3 stabilizing places and 2 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 304/304 transitions.
Applied a total of 0 rules in 1 ms. Remains 113 /113 variables (removed 0) and now considering 304/304 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 113/113 places, 304/304 transitions.
[2024-06-02 22:08:48] [INFO ] Flatten gal took : 16 ms
[2024-06-02 22:08:48] [INFO ] Flatten gal took : 17 ms
[2024-06-02 22:08:48] [INFO ] Input system was already deterministic with 304 transitions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 304/304 transitions.
Applied a total of 0 rules in 1 ms. Remains 113 /113 variables (removed 0) and now considering 304/304 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 113/113 places, 304/304 transitions.
[2024-06-02 22:08:48] [INFO ] Flatten gal took : 14 ms
[2024-06-02 22:08:48] [INFO ] Flatten gal took : 15 ms
[2024-06-02 22:08:48] [INFO ] Input system was already deterministic with 304 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 113/113 places, 304/304 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 112 transition count 303
Applied a total of 2 rules in 12 ms. Remains 112 /113 variables (removed 1) and now considering 303/304 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 12 ms. Remains : 112/113 places, 303/304 transitions.
[2024-06-02 22:08:48] [INFO ] Flatten gal took : 14 ms
[2024-06-02 22:08:48] [INFO ] Flatten gal took : 14 ms
[2024-06-02 22:08:48] [INFO ] Input system was already deterministic with 303 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 113/113 places, 304/304 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 112 transition count 302
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 111 transition count 302
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 110 transition count 301
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 110 transition count 299
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 109 transition count 298
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 8 place count 108 transition count 298
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 8 place count 108 transition count 297
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 10 place count 107 transition count 297
Applied a total of 10 rules in 22 ms. Remains 107 /113 variables (removed 6) and now considering 297/304 (removed 7) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 22 ms. Remains : 107/113 places, 297/304 transitions.
[2024-06-02 22:08:48] [INFO ] Flatten gal took : 11 ms
[2024-06-02 22:08:48] [INFO ] Flatten gal took : 11 ms
[2024-06-02 22:08:48] [INFO ] Input system was already deterministic with 297 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 113/113 places, 304/304 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 113 transition count 303
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 112 transition count 303
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 111 transition count 302
Applied a total of 4 rules in 9 ms. Remains 111 /113 variables (removed 2) and now considering 302/304 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 9 ms. Remains : 111/113 places, 302/304 transitions.
[2024-06-02 22:08:48] [INFO ] Flatten gal took : 10 ms
[2024-06-02 22:08:48] [INFO ] Flatten gal took : 12 ms
[2024-06-02 22:08:48] [INFO ] Input system was already deterministic with 302 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 113/113 places, 304/304 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 112 transition count 302
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 111 transition count 302
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 110 transition count 301
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 110 transition count 299
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 109 transition count 298
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 8 place count 108 transition count 298
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 8 place count 108 transition count 297
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 10 place count 107 transition count 297
Applied a total of 10 rules in 19 ms. Remains 107 /113 variables (removed 6) and now considering 297/304 (removed 7) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 19 ms. Remains : 107/113 places, 297/304 transitions.
[2024-06-02 22:08:48] [INFO ] Flatten gal took : 11 ms
[2024-06-02 22:08:48] [INFO ] Flatten gal took : 11 ms
[2024-06-02 22:08:48] [INFO ] Input system was already deterministic with 297 transitions.
RANDOM walk for 40000 steps (2429 resets) in 68 ms. (579 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (15 resets) in 23 ms. (1666 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 16286 steps, run visited all 1 properties in 28 ms. (steps per millisecond=581 )
Probabilistic random walk after 16286 steps, saw 4981 distinct states, run finished after 31 ms. (steps per millisecond=525 ) properties seen :1
FORMULA FireWire-PT-06-CTLFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 113/113 places, 304/304 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 112 transition count 302
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 111 transition count 302
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 110 transition count 301
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 110 transition count 299
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 109 transition count 298
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 8 place count 108 transition count 298
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 8 place count 108 transition count 297
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 10 place count 107 transition count 297
Applied a total of 10 rules in 17 ms. Remains 107 /113 variables (removed 6) and now considering 297/304 (removed 7) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 17 ms. Remains : 107/113 places, 297/304 transitions.
[2024-06-02 22:08:48] [INFO ] Flatten gal took : 10 ms
[2024-06-02 22:08:48] [INFO ] Flatten gal took : 10 ms
[2024-06-02 22:08:48] [INFO ] Input system was already deterministic with 297 transitions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 304/304 transitions.
Applied a total of 0 rules in 1 ms. Remains 113 /113 variables (removed 0) and now considering 304/304 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 113/113 places, 304/304 transitions.
[2024-06-02 22:08:48] [INFO ] Flatten gal took : 9 ms
[2024-06-02 22:08:48] [INFO ] Flatten gal took : 10 ms
[2024-06-02 22:08:48] [INFO ] Input system was already deterministic with 304 transitions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 304/304 transitions.
Applied a total of 0 rules in 1 ms. Remains 113 /113 variables (removed 0) and now considering 304/304 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 113/113 places, 304/304 transitions.
[2024-06-02 22:08:48] [INFO ] Flatten gal took : 10 ms
[2024-06-02 22:08:48] [INFO ] Flatten gal took : 10 ms
[2024-06-02 22:08:48] [INFO ] Input system was already deterministic with 304 transitions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 304/304 transitions.
Applied a total of 0 rules in 1 ms. Remains 113 /113 variables (removed 0) and now considering 304/304 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 113/113 places, 304/304 transitions.
[2024-06-02 22:08:48] [INFO ] Flatten gal took : 9 ms
[2024-06-02 22:08:48] [INFO ] Flatten gal took : 10 ms
[2024-06-02 22:08:48] [INFO ] Input system was already deterministic with 304 transitions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 304/304 transitions.
Applied a total of 0 rules in 1 ms. Remains 113 /113 variables (removed 0) and now considering 304/304 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 113/113 places, 304/304 transitions.
[2024-06-02 22:08:48] [INFO ] Flatten gal took : 9 ms
[2024-06-02 22:08:48] [INFO ] Flatten gal took : 10 ms
[2024-06-02 22:08:48] [INFO ] Input system was already deterministic with 304 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 113/113 places, 304/304 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 113 transition count 303
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 112 transition count 303
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 6 place count 110 transition count 301
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 110 transition count 299
Applied a total of 8 rules in 11 ms. Remains 110 /113 variables (removed 3) and now considering 299/304 (removed 5) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 11 ms. Remains : 110/113 places, 299/304 transitions.
[2024-06-02 22:08:48] [INFO ] Flatten gal took : 9 ms
[2024-06-02 22:08:48] [INFO ] Flatten gal took : 10 ms
[2024-06-02 22:08:48] [INFO ] Input system was already deterministic with 299 transitions.
RANDOM walk for 40000 steps (2212 resets) in 307 ms. (129 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 135 ms. (294 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2011540 steps, run timeout after 3001 ms. (steps per millisecond=670 ) properties seen :0 out of 1
Probabilistic random walk after 2011540 steps, saw 369017 distinct states, run finished after 3001 ms. (steps per millisecond=670 ) properties seen :0
[2024-06-02 22:08:51] [INFO ] Flow matrix only has 274 transitions (discarded 25 similar events)
// Phase 1: matrix 274 rows 110 cols
[2024-06-02 22:08:51] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 22:08:51] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/54 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 54/108 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 273/381 variables, 108/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/381 variables, 39/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/381 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/383 variables, 2/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/383 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/384 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/384 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/384 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 384/384 variables, and 157 constraints, problems are : Problem set: 0 solved, 1 unsolved in 122 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 110/110 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/54 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 54/108 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 273/381 variables, 108/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/381 variables, 39/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/381 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/383 variables, 2/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/383 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 22:08:52] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/383 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/383 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/384 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/384 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/384 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 384/384 variables, and 159 constraints, problems are : Problem set: 0 solved, 1 unsolved in 253 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 110/110 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 386ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 39 ms.
Support contains 2 out of 110 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 110/110 places, 299/299 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 110 transition count 296
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 7 place count 108 transition count 300
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 11 place count 108 transition count 296
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 13 place count 108 transition count 294
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 2 with 4 rules applied. Total rules applied 17 place count 108 transition count 318
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 25 place count 104 transition count 314
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 3 with 16 rules applied. Total rules applied 41 place count 104 transition count 298
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 43 place count 104 transition count 298
Applied a total of 43 rules in 26 ms. Remains 104 /110 variables (removed 6) and now considering 298/299 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 104/110 places, 298/299 transitions.
RANDOM walk for 183508 steps (10170 resets) in 307 ms. (595 steps per ms) remains 0/1 properties
FORMULA FireWire-PT-06-CTLFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 113/113 places, 304/304 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 113 transition count 303
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 112 transition count 303
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 6 place count 110 transition count 301
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 110 transition count 299
Applied a total of 8 rules in 17 ms. Remains 110 /113 variables (removed 3) and now considering 299/304 (removed 5) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 17 ms. Remains : 110/113 places, 299/304 transitions.
[2024-06-02 22:08:52] [INFO ] Flatten gal took : 9 ms
[2024-06-02 22:08:52] [INFO ] Flatten gal took : 10 ms
[2024-06-02 22:08:52] [INFO ] Input system was already deterministic with 299 transitions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 304/304 transitions.
Applied a total of 0 rules in 1 ms. Remains 113 /113 variables (removed 0) and now considering 304/304 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 113/113 places, 304/304 transitions.
[2024-06-02 22:08:52] [INFO ] Flatten gal took : 11 ms
[2024-06-02 22:08:52] [INFO ] Flatten gal took : 9 ms
[2024-06-02 22:08:52] [INFO ] Input system was already deterministic with 304 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 113/113 places, 304/304 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 112 transition count 302
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 111 transition count 302
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 110 transition count 301
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 110 transition count 299
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 109 transition count 298
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 8 place count 108 transition count 298
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 8 place count 108 transition count 297
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 10 place count 107 transition count 297
Applied a total of 10 rules in 17 ms. Remains 107 /113 variables (removed 6) and now considering 297/304 (removed 7) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 17 ms. Remains : 107/113 places, 297/304 transitions.
[2024-06-02 22:08:52] [INFO ] Flatten gal took : 8 ms
[2024-06-02 22:08:52] [INFO ] Flatten gal took : 9 ms
[2024-06-02 22:08:52] [INFO ] Input system was already deterministic with 297 transitions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 304/304 transitions.
Applied a total of 0 rules in 1 ms. Remains 113 /113 variables (removed 0) and now considering 304/304 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 113/113 places, 304/304 transitions.
[2024-06-02 22:08:52] [INFO ] Flatten gal took : 8 ms
[2024-06-02 22:08:52] [INFO ] Flatten gal took : 9 ms
[2024-06-02 22:08:52] [INFO ] Input system was already deterministic with 304 transitions.
[2024-06-02 22:08:52] [INFO ] Flatten gal took : 10 ms
[2024-06-02 22:08:52] [INFO ] Flatten gal took : 10 ms
[2024-06-02 22:08:52] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2024-06-02 22:08:52] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 113 places, 304 transitions and 1108 arcs took 3 ms.
Total runtime 84486 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running FireWire-PT-06

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/413/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 113
TRANSITIONS: 304
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.007s, Sys 0.000s]


SAVING FILE /home/mcc/execution/413/model (.net / .def) ...
EXPORT TIME: [User 0.000s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 811
MODEL NAME: /home/mcc/execution/413/model
113 places, 304 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA FireWire-PT-06-CTLFireability-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-06-CTLFireability-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-06-CTLFireability-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-06-CTLFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-06-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-06-CTLFireability-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-06-CTLFireability-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-06-CTLFireability-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-06-CTLFireability-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-06-CTLFireability-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-06-CTLFireability-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-06-CTLFireability-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-06-CTLFireability-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-06-CTLFireability-2024-12 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1717366150468

--------------------
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 CTLFireability -timeout 360 -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-06"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
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-06, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r549-tall-171734898100210"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FireWire-PT-06.tgz
mv FireWire-PT-06 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;