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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 464K
-rw-r--r-- 1 mcc users 7.7K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 7.7K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 78K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 36K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 97K Jun 2 16:33 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717366431168

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-08
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-02 22:13:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-02 22:13:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 22:13:52] [INFO ] Load time of PNML (sax parser for PT used): 79 ms
[2024-06-02 22:13:52] [INFO ] Transformed 127 places.
[2024-06-02 22:13:52] [INFO ] Transformed 397 transitions.
[2024-06-02 22:13:52] [INFO ] Found NUPN structural information;
[2024-06-02 22:13:52] [INFO ] Parsed PT model containing 127 places and 397 transitions and 1475 arcs in 179 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 14 ms.
Ensure Unique test removed 53 transitions
Reduce redundant transitions removed 53 transitions.
Support contains 76 out of 127 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 344/344 transitions.
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 6 place count 127 transition count 338
Applied a total of 6 rules in 24 ms. Remains 127 /127 variables (removed 0) and now considering 338/344 (removed 6) transitions.
[2024-06-02 22:13:52] [INFO ] Flow matrix only has 312 transitions (discarded 26 similar events)
// Phase 1: matrix 312 rows 127 cols
[2024-06-02 22:13:52] [INFO ] Computed 8 invariants in 17 ms
[2024-06-02 22:13:52] [INFO ] Implicit Places using invariants in 235 ms returned []
[2024-06-02 22:13:52] [INFO ] Flow matrix only has 312 transitions (discarded 26 similar events)
[2024-06-02 22:13:52] [INFO ] Invariant cache hit.
[2024-06-02 22:13:52] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-06-02 22:13:53] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 439 ms to find 0 implicit places.
Running 337 sub problems to find dead transitions.
[2024-06-02 22:13:53] [INFO ] Flow matrix only has 312 transitions (discarded 26 similar events)
[2024-06-02 22:13:53] [INFO ] Invariant cache hit.
[2024-06-02 22:13:53] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 2 (OVERLAPS) 1/127 variables, 8/134 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 337 unsolved
[2024-06-02 22:13:55] [INFO ] Deduced a trap composed of 44 places in 63 ms of which 7 ms to minimize.
[2024-06-02 22:13:56] [INFO ] Deduced a trap composed of 36 places in 39 ms of which 1 ms to minimize.
[2024-06-02 22:13:56] [INFO ] Deduced a trap composed of 44 places in 68 ms of which 2 ms to minimize.
[2024-06-02 22:13:56] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 1 ms to minimize.
[2024-06-02 22:13:56] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
[2024-06-02 22:13:56] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 2 ms to minimize.
[2024-06-02 22:13:57] [INFO ] Deduced a trap composed of 25 places in 66 ms of which 1 ms to minimize.
[2024-06-02 22:13:57] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 1 ms to minimize.
[2024-06-02 22:13:57] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 9/144 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 6 (OVERLAPS) 311/438 variables, 127/271 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/438 variables, 44/315 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/438 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 9 (OVERLAPS) 1/439 variables, 1/316 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/439 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 11 (OVERLAPS) 0/439 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 337 unsolved
No progress, stopping.
After SMT solving in domain Real declared 439/439 variables, and 316 constraints, problems are : Problem set: 0 solved, 337 unsolved in 14146 ms.
Refiners :[Domain max(s): 127/127 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 127/127 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 337/337 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 337 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 2 (OVERLAPS) 1/127 variables, 8/134 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 9/144 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 6 (OVERLAPS) 311/438 variables, 127/271 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/438 variables, 44/315 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/438 variables, 337/652 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/438 variables, 0/652 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 10 (OVERLAPS) 1/439 variables, 1/653 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/439 variables, 0/653 constraints. Problems are: Problem set: 0 solved, 337 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 439/439 variables, and 653 constraints, problems are : Problem set: 0 solved, 337 unsolved in 30021 ms.
Refiners :[Domain max(s): 127/127 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 127/127 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 337/337 constraints, Known Traps: 9/9 constraints]
After SMT, in 44498ms problems are : Problem set: 0 solved, 337 unsolved
Search for dead transitions found 0 dead transitions in 44519ms
Starting structural reductions in LTL mode, iteration 1 : 127/127 places, 338/344 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45007 ms. Remains : 127/127 places, 338/344 transitions.
Support contains 76 out of 127 places after structural reductions.
[2024-06-02 22:14:37] [INFO ] Flatten gal took : 54 ms
[2024-06-02 22:14:37] [INFO ] Flatten gal took : 52 ms
[2024-06-02 22:14:37] [INFO ] Input system was already deterministic with 338 transitions.
Reduction of identical properties reduced properties to check from 79 to 77
RANDOM walk for 40000 steps (2216 resets) in 2287 ms. (17 steps per ms) remains 40/77 properties
BEST_FIRST walk for 4003 steps (21 resets) in 37 ms. (105 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (17 resets) in 16 ms. (235 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (12 resets) in 20 ms. (190 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 68 ms. (58 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (111 resets) in 73 ms. (54 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (69 resets) in 40 ms. (97 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (105 resets) in 33 ms. (117 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (53 resets) in 16 ms. (235 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (125 resets) in 20 ms. (190 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (56 resets) in 13 ms. (285 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (56 resets) in 13 ms. (286 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (17 resets) in 13 ms. (285 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (59 resets) in 14 ms. (266 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (60 resets) in 13 ms. (285 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (70 resets) in 12 ms. (307 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (16 resets) in 37 ms. (105 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (16 resets) in 28 ms. (138 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (56 resets) in 17 ms. (222 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (146 resets) in 20 ms. (190 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (102 resets) in 16 ms. (235 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (55 resets) in 14 ms. (266 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 38/40 properties
BEST_FIRST walk for 4003 steps (63 resets) in 25 ms. (153 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (53 resets) in 15 ms. (250 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (14 resets) in 12 ms. (308 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (12 resets) in 12 ms. (307 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (51 resets) in 15 ms. (250 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (58 resets) in 14 ms. (266 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (67 resets) in 12 ms. (307 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (111 resets) in 13 ms. (285 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (58 resets) in 13 ms. (285 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (47 resets) in 32 ms. (121 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (156 resets) in 16 ms. (235 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (10 resets) in 13 ms. (285 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (58 resets) in 12 ms. (308 steps per ms) remains 38/38 properties
[2024-06-02 22:14:38] [INFO ] Flow matrix only has 312 transitions (discarded 26 similar events)
[2024-06-02 22:14:38] [INFO ] Invariant cache hit.
[2024-06-02 22:14:38] [INFO ] State equation strengthened by 45 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 51/51 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 38 unsolved
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp62 is UNSAT
Problem AtomicPropp67 is UNSAT
At refinement iteration 2 (OVERLAPS) 64/115 variables, 5/56 constraints. Problems are: Problem set: 5 solved, 33 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/115 variables, 64/120 constraints. Problems are: Problem set: 5 solved, 33 unsolved
[2024-06-02 22:14:39] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 1 ms to minimize.
[2024-06-02 22:14:39] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 1 ms to minimize.
[2024-06-02 22:14:39] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 1 ms to minimize.
[2024-06-02 22:14:39] [INFO ] Deduced a trap composed of 42 places in 62 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/115 variables, 4/124 constraints. Problems are: Problem set: 5 solved, 33 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/115 variables, 0/124 constraints. Problems are: Problem set: 5 solved, 33 unsolved
At refinement iteration 6 (OVERLAPS) 9/124 variables, 3/127 constraints. Problems are: Problem set: 5 solved, 33 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/124 variables, 9/136 constraints. Problems are: Problem set: 5 solved, 33 unsolved
[2024-06-02 22:14:39] [INFO ] Deduced a trap composed of 48 places in 49 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/124 variables, 1/137 constraints. Problems are: Problem set: 5 solved, 33 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/124 variables, 0/137 constraints. Problems are: Problem set: 5 solved, 33 unsolved
At refinement iteration 10 (OVERLAPS) 311/435 variables, 124/261 constraints. Problems are: Problem set: 5 solved, 33 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/435 variables, 44/305 constraints. Problems are: Problem set: 5 solved, 33 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/435 variables, 0/305 constraints. Problems are: Problem set: 5 solved, 33 unsolved
At refinement iteration 13 (OVERLAPS) 3/438 variables, 3/308 constraints. Problems are: Problem set: 5 solved, 33 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/438 variables, 3/311 constraints. Problems are: Problem set: 5 solved, 33 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/438 variables, 0/311 constraints. Problems are: Problem set: 5 solved, 33 unsolved
At refinement iteration 16 (OVERLAPS) 1/439 variables, 1/312 constraints. Problems are: Problem set: 5 solved, 33 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/439 variables, 0/312 constraints. Problems are: Problem set: 5 solved, 33 unsolved
At refinement iteration 18 (OVERLAPS) 0/439 variables, 0/312 constraints. Problems are: Problem set: 5 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Real declared 439/439 variables, and 312 constraints, problems are : Problem set: 5 solved, 33 unsolved in 2256 ms.
Refiners :[Domain max(s): 127/127 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 127/127 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 5 solved, 33 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 44/44 constraints. Problems are: Problem set: 5 solved, 33 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 0/44 constraints. Problems are: Problem set: 5 solved, 33 unsolved
At refinement iteration 2 (OVERLAPS) 71/115 variables, 5/49 constraints. Problems are: Problem set: 5 solved, 33 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/115 variables, 71/120 constraints. Problems are: Problem set: 5 solved, 33 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/115 variables, 4/124 constraints. Problems are: Problem set: 5 solved, 33 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/115 variables, 0/124 constraints. Problems are: Problem set: 5 solved, 33 unsolved
At refinement iteration 6 (OVERLAPS) 9/124 variables, 3/127 constraints. Problems are: Problem set: 5 solved, 33 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/124 variables, 9/136 constraints. Problems are: Problem set: 5 solved, 33 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/124 variables, 1/137 constraints. Problems are: Problem set: 5 solved, 33 unsolved
[2024-06-02 22:14:41] [INFO ] Deduced a trap composed of 44 places in 48 ms of which 1 ms to minimize.
[2024-06-02 22:14:41] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-06-02 22:14:41] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/124 variables, 3/140 constraints. Problems are: Problem set: 5 solved, 33 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/124 variables, 0/140 constraints. Problems are: Problem set: 5 solved, 33 unsolved
At refinement iteration 11 (OVERLAPS) 311/435 variables, 124/264 constraints. Problems are: Problem set: 5 solved, 33 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/435 variables, 44/308 constraints. Problems are: Problem set: 5 solved, 33 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/435 variables, 32/340 constraints. Problems are: Problem set: 5 solved, 33 unsolved
[2024-06-02 22:14:42] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/435 variables, 1/341 constraints. Problems are: Problem set: 5 solved, 33 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/435 variables, 0/341 constraints. Problems are: Problem set: 5 solved, 33 unsolved
At refinement iteration 16 (OVERLAPS) 3/438 variables, 3/344 constraints. Problems are: Problem set: 5 solved, 33 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/438 variables, 3/347 constraints. Problems are: Problem set: 5 solved, 33 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/438 variables, 1/348 constraints. Problems are: Problem set: 5 solved, 33 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/438 variables, 0/348 constraints. Problems are: Problem set: 5 solved, 33 unsolved
At refinement iteration 20 (OVERLAPS) 1/439 variables, 1/349 constraints. Problems are: Problem set: 5 solved, 33 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/439 variables, 0/349 constraints. Problems are: Problem set: 5 solved, 33 unsolved
At refinement iteration 22 (OVERLAPS) 0/439 variables, 0/349 constraints. Problems are: Problem set: 5 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Int declared 439/439 variables, and 349 constraints, problems are : Problem set: 5 solved, 33 unsolved in 5013 ms.
Refiners :[Domain max(s): 127/127 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 127/127 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 33/38 constraints, Known Traps: 9/9 constraints]
After SMT, in 7317ms problems are : Problem set: 5 solved, 33 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 44 out of 127 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 127/127 places, 338/338 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 127 transition count 335
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 5 place count 125 transition count 330
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 125 transition count 330
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 124 transition count 328
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 124 transition count 328
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 1 with 2 rules applied. Total rules applied 11 place count 123 transition count 327
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 15 place count 121 transition count 331
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 19 place count 121 transition count 327
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 21 place count 121 transition count 325
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 121 transition count 327
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 25 place count 120 transition count 325
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 27 place count 120 transition count 323
Applied a total of 27 rules in 100 ms. Remains 120 /127 variables (removed 7) and now considering 323/338 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 102 ms. Remains : 120/127 places, 323/338 transitions.
RANDOM walk for 40000 steps (2225 resets) in 849 ms. (47 steps per ms) remains 30/33 properties
BEST_FIRST walk for 4004 steps (20 resets) in 12 ms. (308 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (105 resets) in 12 ms. (307 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (73 resets) in 12 ms. (307 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (112 resets) in 17 ms. (222 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (59 resets) in 15 ms. (250 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (41 resets) in 14 ms. (266 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (48 resets) in 14 ms. (266 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (19 resets) in 14 ms. (266 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (64 resets) in 12 ms. (307 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (56 resets) in 13 ms. (286 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (61 resets) in 16 ms. (235 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (11 resets) in 10 ms. (364 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (32 resets) in 12 ms. (308 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (43 resets) in 12 ms. (307 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (106 resets) in 12 ms. (307 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (8 resets) in 11 ms. (333 steps per ms) remains 29/30 properties
BEST_FIRST walk for 4004 steps (61 resets) in 11 ms. (333 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (53 resets) in 10 ms. (363 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (17 resets) in 10 ms. (363 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (8 resets) in 11 ms. (333 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (67 resets) in 13 ms. (285 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (57 resets) in 11 ms. (333 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (57 resets) in 11 ms. (333 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (79 resets) in 13 ms. (285 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (65 resets) in 13 ms. (285 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (9 resets) in 10 ms. (363 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (51 resets) in 12 ms. (308 steps per ms) remains 29/29 properties
[2024-06-02 22:14:46] [INFO ] Flow matrix only has 296 transitions (discarded 27 similar events)
// Phase 1: matrix 296 rows 120 cols
[2024-06-02 22:14:46] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 22:14:46] [INFO ] State equation strengthened by 45 read => feed constraints.
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) 70/109 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 29 unsolved
[2024-06-02 22:14:47] [INFO ] Deduced a trap composed of 35 places in 39 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (OVERLAPS) 8/117 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 29 unsolved
[2024-06-02 22:14:47] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 0 ms to minimize.
[2024-06-02 22:14:47] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/117 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 7 (OVERLAPS) 296/413 variables, 117/128 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/413 variables, 45/173 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/413 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 10 (OVERLAPS) 3/416 variables, 3/176 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/416 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 29 unsolved
[2024-06-02 22:14:48] [INFO ] Deduced a trap composed of 41 places in 72 ms of which 2 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/416 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/416 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 14 (OVERLAPS) 0/416 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Real declared 416/416 variables, and 177 constraints, problems are : Problem set: 0 solved, 29 unsolved in 2290 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 120/120 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 4/4 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) 70/109 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 29 unsolved
[2024-06-02 22:14:49] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 0 ms to minimize.
[2024-06-02 22:14:49] [INFO ] Deduced a trap composed of 24 places in 85 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 29 unsolved
[2024-06-02 22:14:49] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (OVERLAPS) 8/117 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 29 unsolved
[2024-06-02 22:14:49] [INFO ] Deduced a trap composed of 43 places in 32 ms of which 1 ms to minimize.
[2024-06-02 22:14:49] [INFO ] Deduced a trap composed of 45 places in 37 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/117 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/117 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 10 (OVERLAPS) 296/413 variables, 117/134 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/413 variables, 45/179 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/413 variables, 28/207 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/413 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 14 (OVERLAPS) 3/416 variables, 3/210 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/416 variables, 1/211 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/416 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 17 (OVERLAPS) 0/416 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Int declared 416/416 variables, and 211 constraints, problems are : Problem set: 0 solved, 29 unsolved in 3184 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 120/120 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 9/9 constraints]
After SMT, in 5510ms problems are : Problem set: 0 solved, 29 unsolved
Parikh walk visited 5 properties in 3172 ms.
Support contains 37 out of 120 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 120/120 places, 323/323 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 118 transition count 318
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 118 transition count 318
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 118 transition count 317
Applied a total of 5 rules in 15 ms. Remains 118 /120 variables (removed 2) and now considering 317/323 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 118/120 places, 317/323 transitions.
RANDOM walk for 40000 steps (2142 resets) in 329 ms. (121 steps per ms) remains 22/24 properties
BEST_FIRST walk for 4004 steps (13 resets) in 10 ms. (364 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (109 resets) in 13 ms. (285 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (57 resets) in 11 ms. (333 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (101 resets) in 14 ms. (266 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (48 resets) in 12 ms. (308 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (58 resets) in 14 ms. (266 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (16 resets) in 14 ms. (266 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (64 resets) in 13 ms. (285 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (58 resets) in 9 ms. (400 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (61 resets) in 9 ms. (400 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (14 resets) in 9 ms. (400 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (48 resets) in 10 ms. (363 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (66 resets) in 11 ms. (333 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (57 resets) in 12 ms. (307 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (62 resets) in 10 ms. (363 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (51 resets) in 8 ms. (444 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (60 resets) in 9 ms. (400 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (60 resets) in 8 ms. (444 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (66 resets) in 9 ms. (400 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 21/22 properties
BEST_FIRST walk for 4003 steps (50 resets) in 10 ms. (363 steps per ms) remains 21/21 properties
[2024-06-02 22:14:55] [INFO ] Flow matrix only has 290 transitions (discarded 27 similar events)
// Phase 1: matrix 290 rows 118 cols
[2024-06-02 22:14:55] [INFO ] Computed 8 invariants in 4 ms
[2024-06-02 22:14:55] [INFO ] State equation strengthened by 44 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 74/107 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 8/115 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/115 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 290/405 variables, 115/123 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/405 variables, 44/167 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-06-02 22:14:56] [INFO ] Deduced a trap composed of 35 places in 47 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/405 variables, 1/168 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-06-02 22:14:56] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 1 ms to minimize.
[2024-06-02 22:14:56] [INFO ] Deduced a trap composed of 38 places in 58 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/405 variables, 2/170 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-06-02 22:14:56] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/405 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/405 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 11 (OVERLAPS) 3/408 variables, 3/174 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/408 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 13 (OVERLAPS) 0/408 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Real declared 408/408 variables, and 174 constraints, problems are : Problem set: 0 solved, 21 unsolved in 1364 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 118/118 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 74/107 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (OVERLAPS) 8/115 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-06-02 22:14:57] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-06-02 22:14:57] [INFO ] Deduced a trap composed of 45 places in 42 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/115 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/115 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (OVERLAPS) 290/405 variables, 115/129 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/405 variables, 44/173 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/405 variables, 20/193 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-06-02 22:14:57] [INFO ] Deduced a trap composed of 43 places in 42 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/405 variables, 1/194 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/405 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 12 (OVERLAPS) 3/408 variables, 3/197 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/408 variables, 1/198 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-06-02 22:14:58] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/408 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/408 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 16 (OVERLAPS) 0/408 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Int declared 408/408 variables, and 199 constraints, problems are : Problem set: 0 solved, 21 unsolved in 3079 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 118/118 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 8/8 constraints]
After SMT, in 4467ms problems are : Problem set: 0 solved, 21 unsolved
Parikh walk visited 4 properties in 4091 ms.
Support contains 27 out of 118 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 118/118 places, 317/317 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 116 transition count 312
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 116 transition count 312
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 115 transition count 310
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 115 transition count 310
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 8 place count 114 transition count 312
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 10 place count 114 transition count 310
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 11 place count 114 transition count 309
Applied a total of 11 rules in 39 ms. Remains 114 /118 variables (removed 4) and now considering 309/317 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 114/118 places, 309/317 transitions.
RANDOM walk for 40000 steps (2204 resets) in 280 ms. (142 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 4002 steps (98 resets) in 10 ms. (363 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4001 steps (108 resets) in 11 ms. (333 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (55 resets) in 13 ms. (285 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (11 resets) in 8 ms. (444 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (50 resets) in 9 ms. (400 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (59 resets) in 14 ms. (266 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (49 resets) in 9 ms. (400 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (45 resets) in 9 ms. (400 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (66 resets) in 12 ms. (308 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (60 resets) in 10 ms. (364 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (61 resets) in 9 ms. (400 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (61 resets) in 9 ms. (400 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (52 resets) in 12 ms. (308 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (66 resets) in 11 ms. (333 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (9 resets) in 19 ms. (200 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (48 resets) in 40 ms. (97 steps per ms) remains 17/17 properties
Interrupted probabilistic random walk after 560042 steps, run timeout after 3001 ms. (steps per millisecond=186 ) properties seen :11 out of 17
Probabilistic random walk after 560042 steps, saw 127207 distinct states, run finished after 3005 ms. (steps per millisecond=186 ) properties seen :11
[2024-06-02 22:15:07] [INFO ] Flow matrix only has 280 transitions (discarded 29 similar events)
// Phase 1: matrix 280 rows 114 cols
[2024-06-02 22:15:07] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 22:15:07] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 56/66 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-02 22:15:07] [INFO ] Deduced a trap composed of 34 places in 27 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 45/111 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-02 22:15:07] [INFO ] Deduced a trap composed of 42 places in 28 ms of which 1 ms to minimize.
[2024-06-02 22:15:07] [INFO ] Deduced a trap composed of 42 places in 28 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/111 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/111 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 280/391 variables, 111/122 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/391 variables, 43/165 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/391 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 3/394 variables, 3/168 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/394 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 0/394 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 394/394 variables, and 168 constraints, problems are : Problem set: 0 solved, 6 unsolved in 421 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 114/114 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 56/66 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 45/111 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/111 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-02 22:15:08] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/111 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/111 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 280/391 variables, 111/123 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/391 variables, 43/166 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/391 variables, 6/172 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/391 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 3/394 variables, 3/175 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/394 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 0/394 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 394/394 variables, and 175 constraints, problems are : Problem set: 0 solved, 6 unsolved in 531 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 114/114 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 4/4 constraints]
After SMT, in 965ms problems are : Problem set: 0 solved, 6 unsolved
Parikh walk visited 0 properties in 2004 ms.
Support contains 10 out of 114 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 114/114 places, 309/309 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 112 transition count 305
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 112 transition count 305
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 6 place count 112 transition count 303
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 111 transition count 302
Applied a total of 7 rules in 30 ms. Remains 111 /114 variables (removed 3) and now considering 302/309 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 111/114 places, 302/309 transitions.
RANDOM walk for 40000 steps (2339 resets) in 151 ms. (263 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (1111 resets) in 49 ms. (800 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (540 resets) in 45 ms. (869 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (611 resets) in 43 ms. (909 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (567 resets) in 53 ms. (740 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (595 resets) in 59 ms. (666 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (64 resets) in 64 ms. (615 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 722245 steps, run timeout after 3001 ms. (steps per millisecond=240 ) properties seen :0 out of 6
Probabilistic random walk after 722245 steps, saw 160789 distinct states, run finished after 3001 ms. (steps per millisecond=240 ) properties seen :0
[2024-06-02 22:15:13] [INFO ] Flow matrix only has 273 transitions (discarded 29 similar events)
// Phase 1: matrix 273 rows 111 cols
[2024-06-02 22:15:13] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 22:15:13] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 54/64 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-02 22:15:13] [INFO ] Deduced a trap composed of 32 places in 36 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 222/286 variables, 64/68 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 22/90 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/286 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 89/375 variables, 40/130 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/375 variables, 3/133 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/375 variables, 20/153 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/375 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 9/384 variables, 7/160 constraints. Problems are: Problem set: 0 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/384 variables, 2/162 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/384 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 0/384 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 384/384 variables, and 162 constraints, problems are : Problem set: 0 solved, 6 unsolved in 386 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 111/111 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 54/64 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 222/286 variables, 64/68 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 22/90 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/286 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 89/375 variables, 40/130 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/375 variables, 3/133 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/375 variables, 20/153 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/375 variables, 6/159 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/375 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 9/384 variables, 7/166 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/384 variables, 2/168 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/384 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 0/384 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 384/384 variables, and 168 constraints, problems are : Problem set: 0 solved, 6 unsolved in 456 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 111/111 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints]
After SMT, in 866ms problems are : Problem set: 0 solved, 6 unsolved
Parikh walk visited 0 properties in 3512 ms.
Support contains 10 out of 111 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 111/111 places, 302/302 transitions.
Applied a total of 0 rules in 6 ms. Remains 111 /111 variables (removed 0) and now considering 302/302 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 111/111 places, 302/302 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 111/111 places, 302/302 transitions.
Applied a total of 0 rules in 5 ms. Remains 111 /111 variables (removed 0) and now considering 302/302 (removed 0) transitions.
[2024-06-02 22:15:18] [INFO ] Flow matrix only has 273 transitions (discarded 29 similar events)
[2024-06-02 22:15:18] [INFO ] Invariant cache hit.
[2024-06-02 22:15:18] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-06-02 22:15:18] [INFO ] Flow matrix only has 273 transitions (discarded 29 similar events)
[2024-06-02 22:15:18] [INFO ] Invariant cache hit.
[2024-06-02 22:15:18] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-06-02 22:15:18] [INFO ] Implicit Places using invariants and state equation in 219 ms returned []
Implicit Place search using SMT with State Equation took 281 ms to find 0 implicit places.
[2024-06-02 22:15:18] [INFO ] Redundant transitions in 14 ms returned []
Running 300 sub problems to find dead transitions.
[2024-06-02 22:15:18] [INFO ] Flow matrix only has 273 transitions (discarded 29 similar events)
[2024-06-02 22:15:18] [INFO ] Invariant cache hit.
[2024-06-02 22:15:18] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-06-02 22:15:19] [INFO ] Deduced a trap composed of 38 places in 60 ms of which 1 ms to minimize.
[2024-06-02 22:15:19] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 0 ms to minimize.
[2024-06-02 22:15:19] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2024-06-02 22:15:19] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-06-02 22:15:19] [INFO ] Deduced a trap composed of 45 places in 62 ms of which 1 ms to minimize.
[2024-06-02 22:15:19] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 1 ms to minimize.
[2024-06-02 22:15:19] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2024-06-02 22:15:19] [INFO ] Deduced a trap composed of 32 places in 36 ms of which 1 ms to minimize.
[2024-06-02 22:15:19] [INFO ] Deduced a trap composed of 40 places in 30 ms of which 1 ms to minimize.
[2024-06-02 22:15:20] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 1 ms to minimize.
[2024-06-02 22:15:20] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/110 variables, 11/19 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (OVERLAPS) 273/383 variables, 110/129 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/383 variables, 42/171 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-06-02 22:15:23] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 1 ms to minimize.
[2024-06-02 22:15:23] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/383 variables, 2/173 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/383 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 7 (OVERLAPS) 1/384 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/384 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 9 (OVERLAPS) 0/384 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 300 unsolved
No progress, stopping.
After SMT solving in domain Real declared 384/384 variables, and 174 constraints, problems are : Problem set: 0 solved, 300 unsolved in 14015 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 111/111 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 300 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/110 variables, 13/21 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (OVERLAPS) 273/383 variables, 110/131 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/383 variables, 42/173 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/383 variables, 300/473 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/383 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 7 (OVERLAPS) 1/384 variables, 1/474 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/384 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 9 (OVERLAPS) 0/384 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 300 unsolved
No progress, stopping.
After SMT solving in domain Int declared 384/384 variables, and 474 constraints, problems are : Problem set: 0 solved, 300 unsolved in 18886 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 111/111 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 13/13 constraints]
After SMT, in 33093ms problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 33096ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33403 ms. Remains : 111/111 places, 302/302 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 106 edges and 111 vertex of which 29 / 111 are part of one of the 4 SCC in 5 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 119 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 126 transitions.
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 3 place count 85 transition count 175
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 85 transition count 172
Free-agglomeration rule applied 3 times with reduction of 2 identical transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 9 place count 85 transition count 167
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 13 place count 82 transition count 166
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 16 place count 82 transition count 166
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 17 place count 82 transition count 165
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 81 transition count 164
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 81 transition count 164
Applied a total of 19 rules in 32 ms. Remains 81 /111 variables (removed 30) and now considering 164/302 (removed 138) transitions.
Running SMT prover for 6 properties.
[2024-06-02 22:15:51] [INFO ] Flow matrix only has 162 transitions (discarded 2 similar events)
// Phase 1: matrix 162 rows 81 cols
[2024-06-02 22:15:51] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 22:15:51] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 22:15:51] [INFO ] After 113ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-06-02 22:15:51] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2024-06-02 22:15:51] [INFO ] After 74ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
TRAPS : Iteration 0
[2024-06-02 22:15:51] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-06-02 22:15:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 45 ms
[2024-06-02 22:15:51] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 0 ms to minimize.
[2024-06-02 22:15:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 36 ms
[2024-06-02 22:15:52] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 0 ms to minimize.
[2024-06-02 22:15:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 38 ms
TRAPS : Iteration 1
[2024-06-02 22:15:52] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 12 ms to minimize.
[2024-06-02 22:15:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 59 ms
TRAPS : Iteration 2
[2024-06-02 22:15:52] [INFO ] After 442ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
[2024-06-02 22:15:52] [INFO ] After 556ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Over-approximation ignoring read arcs solved 0 properties in 718 ms.
Successfully simplified 5 atomic propositions for a total of 16 simplifications.
[2024-06-02 22:15:52] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-06-02 22:15:52] [INFO ] Flatten gal took : 19 ms
FORMULA FireWire-PT-08-CTLFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-02 22:15:52] [INFO ] Flatten gal took : 20 ms
[2024-06-02 22:15:52] [INFO ] Input system was already deterministic with 338 transitions.
Computed a total of 23 stabilizing places and 48 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 127/127 places, 338/338 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 123 transition count 328
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 123 transition count 328
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 123 transition count 326
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 12 place count 121 transition count 322
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 121 transition count 322
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 1 with 2 rules applied. Total rules applied 16 place count 120 transition count 321
Applied a total of 16 rules in 20 ms. Remains 120 /127 variables (removed 7) and now considering 321/338 (removed 17) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 20 ms. Remains : 120/127 places, 321/338 transitions.
[2024-06-02 22:15:52] [INFO ] Flatten gal took : 16 ms
[2024-06-02 22:15:52] [INFO ] Flatten gal took : 17 ms
[2024-06-02 22:15:52] [INFO ] Input system was already deterministic with 321 transitions.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 338/338 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 121 transition count 324
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 121 transition count 324
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 15 place count 121 transition count 321
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 17 place count 119 transition count 317
Iterating global reduction 1 with 2 rules applied. Total rules applied 19 place count 119 transition count 317
Applied a total of 19 rules in 3 ms. Remains 119 /127 variables (removed 8) and now considering 317/338 (removed 21) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 119/127 places, 317/338 transitions.
[2024-06-02 22:15:52] [INFO ] Flatten gal took : 14 ms
[2024-06-02 22:15:52] [INFO ] Flatten gal took : 15 ms
[2024-06-02 22:15:52] [INFO ] Input system was already deterministic with 317 transitions.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 338/338 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 122 transition count 326
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 122 transition count 326
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 122 transition count 324
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 15 place count 119 transition count 317
Iterating global reduction 1 with 3 rules applied. Total rules applied 18 place count 119 transition count 317
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 118 transition count 315
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 118 transition count 315
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 117 transition count 312
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 117 transition count 312
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 116 transition count 310
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 116 transition count 310
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 115 transition count 307
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 115 transition count 307
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 114 transition count 305
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 114 transition count 305
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 113 transition count 302
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 113 transition count 302
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 112 transition count 300
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 112 transition count 300
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 33 place count 111 transition count 297
Iterating global reduction 1 with 1 rules applied. Total rules applied 34 place count 111 transition count 297
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 35 place count 110 transition count 295
Iterating global reduction 1 with 1 rules applied. Total rules applied 36 place count 110 transition count 295
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 37 place count 109 transition count 293
Iterating global reduction 1 with 1 rules applied. Total rules applied 38 place count 109 transition count 293
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 39 place count 108 transition count 291
Iterating global reduction 1 with 1 rules applied. Total rules applied 40 place count 108 transition count 291
Applied a total of 40 rules in 12 ms. Remains 108 /127 variables (removed 19) and now considering 291/338 (removed 47) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 108/127 places, 291/338 transitions.
[2024-06-02 22:15:52] [INFO ] Flatten gal took : 12 ms
[2024-06-02 22:15:52] [INFO ] Flatten gal took : 12 ms
[2024-06-02 22:15:52] [INFO ] Input system was already deterministic with 291 transitions.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 338/338 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 121 transition count 324
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 121 transition count 324
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 15 place count 121 transition count 321
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 18 place count 118 transition count 314
Iterating global reduction 1 with 3 rules applied. Total rules applied 21 place count 118 transition count 314
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 117 transition count 312
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 117 transition count 312
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 116 transition count 309
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 116 transition count 309
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 115 transition count 307
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 115 transition count 307
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 114 transition count 304
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 114 transition count 304
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 113 transition count 302
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 113 transition count 302
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 112 transition count 299
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 112 transition count 299
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 111 transition count 297
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 111 transition count 297
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 110 transition count 294
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 110 transition count 294
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 109 transition count 292
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 109 transition count 292
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 108 transition count 290
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 108 transition count 290
Applied a total of 41 rules in 10 ms. Remains 108 /127 variables (removed 19) and now considering 290/338 (removed 48) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 108/127 places, 290/338 transitions.
[2024-06-02 22:15:52] [INFO ] Flatten gal took : 10 ms
[2024-06-02 22:15:52] [INFO ] Flatten gal took : 11 ms
[2024-06-02 22:15:52] [INFO ] Input system was already deterministic with 290 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 127/127 places, 338/338 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 120 transition count 323
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 120 transition count 323
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 15 place count 120 transition count 320
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 18 place count 117 transition count 313
Iterating global reduction 1 with 3 rules applied. Total rules applied 21 place count 117 transition count 313
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 116 transition count 311
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 116 transition count 311
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 115 transition count 308
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 115 transition count 308
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 114 transition count 306
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 114 transition count 306
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 113 transition count 303
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 113 transition count 303
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 112 transition count 301
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 112 transition count 301
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 111 transition count 298
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 111 transition count 298
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 110 transition count 296
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 110 transition count 296
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 109 transition count 293
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 109 transition count 293
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 108 transition count 291
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 108 transition count 291
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 107 transition count 289
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 107 transition count 289
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 1 with 2 rules applied. Total rules applied 43 place count 106 transition count 288
Applied a total of 43 rules in 31 ms. Remains 106 /127 variables (removed 21) and now considering 288/338 (removed 50) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 31 ms. Remains : 106/127 places, 288/338 transitions.
[2024-06-02 22:15:52] [INFO ] Flatten gal took : 10 ms
[2024-06-02 22:15:52] [INFO ] Flatten gal took : 11 ms
[2024-06-02 22:15:52] [INFO ] Input system was already deterministic with 288 transitions.
RANDOM walk for 40000 steps (2343 resets) in 402 ms. (99 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (20 resets) in 145 ms. (274 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 290 steps, run visited all 1 properties in 4 ms. (steps per millisecond=72 )
Probabilistic random walk after 290 steps, saw 224 distinct states, run finished after 7 ms. (steps per millisecond=41 ) properties seen :1
FORMULA FireWire-PT-08-CTLFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 127/127 places, 338/338 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 120 transition count 323
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 120 transition count 323
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 15 place count 120 transition count 320
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 18 place count 117 transition count 313
Iterating global reduction 1 with 3 rules applied. Total rules applied 21 place count 117 transition count 313
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 116 transition count 311
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 116 transition count 311
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 115 transition count 308
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 115 transition count 308
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 114 transition count 306
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 114 transition count 306
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 113 transition count 303
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 113 transition count 303
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 112 transition count 301
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 112 transition count 301
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 111 transition count 298
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 111 transition count 298
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 110 transition count 296
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 110 transition count 296
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 109 transition count 293
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 109 transition count 293
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 108 transition count 291
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 108 transition count 291
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 107 transition count 289
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 107 transition count 289
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 1 with 2 rules applied. Total rules applied 43 place count 106 transition count 288
Applied a total of 43 rules in 30 ms. Remains 106 /127 variables (removed 21) and now considering 288/338 (removed 50) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 30 ms. Remains : 106/127 places, 288/338 transitions.
[2024-06-02 22:15:53] [INFO ] Flatten gal took : 11 ms
[2024-06-02 22:15:53] [INFO ] Flatten gal took : 11 ms
[2024-06-02 22:15:53] [INFO ] Input system was already deterministic with 288 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 127/127 places, 338/338 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 120 transition count 323
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 120 transition count 323
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 15 place count 120 transition count 320
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 18 place count 117 transition count 313
Iterating global reduction 1 with 3 rules applied. Total rules applied 21 place count 117 transition count 313
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 116 transition count 311
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 116 transition count 311
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 115 transition count 308
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 115 transition count 308
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 114 transition count 306
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 114 transition count 306
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 113 transition count 303
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 113 transition count 303
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 112 transition count 301
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 112 transition count 301
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 111 transition count 298
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 111 transition count 298
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 110 transition count 296
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 110 transition count 296
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 109 transition count 293
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 109 transition count 293
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 108 transition count 291
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 108 transition count 291
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 107 transition count 289
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 107 transition count 289
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 42 place count 106 transition count 287
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 106 transition count 287
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 1 with 2 rules applied. Total rules applied 45 place count 105 transition count 286
Applied a total of 45 rules in 26 ms. Remains 105 /127 variables (removed 22) and now considering 286/338 (removed 52) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 26 ms. Remains : 105/127 places, 286/338 transitions.
[2024-06-02 22:15:53] [INFO ] Flatten gal took : 10 ms
[2024-06-02 22:15:53] [INFO ] Flatten gal took : 11 ms
[2024-06-02 22:15:53] [INFO ] Input system was already deterministic with 286 transitions.
RANDOM walk for 36725 steps (2165 resets) in 239 ms. (153 steps per ms) remains 0/1 properties
FORMULA FireWire-PT-08-CTLFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 338/338 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 122 transition count 326
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 122 transition count 326
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 122 transition count 324
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 15 place count 119 transition count 317
Iterating global reduction 1 with 3 rules applied. Total rules applied 18 place count 119 transition count 317
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 118 transition count 315
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 118 transition count 315
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 117 transition count 312
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 117 transition count 312
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 116 transition count 310
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 116 transition count 310
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 115 transition count 307
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 115 transition count 307
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 114 transition count 305
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 114 transition count 305
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 113 transition count 302
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 113 transition count 302
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 112 transition count 300
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 112 transition count 300
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 33 place count 111 transition count 297
Iterating global reduction 1 with 1 rules applied. Total rules applied 34 place count 111 transition count 297
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 35 place count 110 transition count 295
Iterating global reduction 1 with 1 rules applied. Total rules applied 36 place count 110 transition count 295
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 37 place count 109 transition count 293
Iterating global reduction 1 with 1 rules applied. Total rules applied 38 place count 109 transition count 293
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 39 place count 108 transition count 291
Iterating global reduction 1 with 1 rules applied. Total rules applied 40 place count 108 transition count 291
Applied a total of 40 rules in 15 ms. Remains 108 /127 variables (removed 19) and now considering 291/338 (removed 47) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15 ms. Remains : 108/127 places, 291/338 transitions.
[2024-06-02 22:15:53] [INFO ] Flatten gal took : 13 ms
[2024-06-02 22:15:53] [INFO ] Flatten gal took : 10 ms
[2024-06-02 22:15:53] [INFO ] Input system was already deterministic with 291 transitions.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 338/338 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 122 transition count 327
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 122 transition count 327
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 13 place count 122 transition count 324
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 15 place count 120 transition count 319
Iterating global reduction 1 with 2 rules applied. Total rules applied 17 place count 120 transition count 319
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 119 transition count 317
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 119 transition count 317
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 118 transition count 314
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 118 transition count 314
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 117 transition count 312
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 117 transition count 312
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 116 transition count 309
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 116 transition count 309
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 115 transition count 307
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 115 transition count 307
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 114 transition count 304
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 114 transition count 304
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 113 transition count 302
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 113 transition count 302
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 112 transition count 299
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 112 transition count 299
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 111 transition count 297
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 111 transition count 297
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 110 transition count 295
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 110 transition count 295
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 109 transition count 293
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 109 transition count 293
Applied a total of 39 rules in 12 ms. Remains 109 /127 variables (removed 18) and now considering 293/338 (removed 45) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 109/127 places, 293/338 transitions.
[2024-06-02 22:15:53] [INFO ] Flatten gal took : 10 ms
[2024-06-02 22:15:53] [INFO ] Flatten gal took : 9 ms
[2024-06-02 22:15:53] [INFO ] Input system was already deterministic with 293 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 127/127 places, 338/338 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 121 transition count 325
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 121 transition count 325
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 121 transition count 323
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 15 place count 118 transition count 316
Iterating global reduction 1 with 3 rules applied. Total rules applied 18 place count 118 transition count 316
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 117 transition count 314
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 117 transition count 314
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 1 with 2 rules applied. Total rules applied 22 place count 116 transition count 313
Applied a total of 22 rules in 11 ms. Remains 116 /127 variables (removed 11) and now considering 313/338 (removed 25) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 11 ms. Remains : 116/127 places, 313/338 transitions.
[2024-06-02 22:15:53] [INFO ] Flatten gal took : 10 ms
[2024-06-02 22:15:53] [INFO ] Flatten gal took : 10 ms
[2024-06-02 22:15:53] [INFO ] Input system was already deterministic with 313 transitions.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 338/338 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 123 transition count 330
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 123 transition count 330
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 11 place count 123 transition count 327
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 122 transition count 324
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 122 transition count 324
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 121 transition count 322
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 121 transition count 322
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 120 transition count 319
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 120 transition count 319
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 119 transition count 317
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 119 transition count 317
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 118 transition count 314
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 118 transition count 314
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 117 transition count 312
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 117 transition count 312
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 116 transition count 309
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 116 transition count 309
Applied a total of 25 rules in 6 ms. Remains 116 /127 variables (removed 11) and now considering 309/338 (removed 29) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 116/127 places, 309/338 transitions.
[2024-06-02 22:15:53] [INFO ] Flatten gal took : 9 ms
[2024-06-02 22:15:53] [INFO ] Flatten gal took : 10 ms
[2024-06-02 22:15:53] [INFO ] Input system was already deterministic with 309 transitions.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 338/338 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 121 transition count 324
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 121 transition count 324
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 15 place count 121 transition count 321
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 18 place count 118 transition count 314
Iterating global reduction 1 with 3 rules applied. Total rules applied 21 place count 118 transition count 314
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 117 transition count 312
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 117 transition count 312
Applied a total of 23 rules in 3 ms. Remains 117 /127 variables (removed 10) and now considering 312/338 (removed 26) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 117/127 places, 312/338 transitions.
[2024-06-02 22:15:53] [INFO ] Flatten gal took : 9 ms
[2024-06-02 22:15:53] [INFO ] Flatten gal took : 10 ms
[2024-06-02 22:15:53] [INFO ] Input system was already deterministic with 312 transitions.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 338/338 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 122 transition count 326
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 122 transition count 326
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 122 transition count 324
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 15 place count 119 transition count 317
Iterating global reduction 1 with 3 rules applied. Total rules applied 18 place count 119 transition count 317
Applied a total of 18 rules in 3 ms. Remains 119 /127 variables (removed 8) and now considering 317/338 (removed 21) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 119/127 places, 317/338 transitions.
[2024-06-02 22:15:53] [INFO ] Flatten gal took : 9 ms
[2024-06-02 22:15:53] [INFO ] Flatten gal took : 9 ms
[2024-06-02 22:15:53] [INFO ] Input system was already deterministic with 317 transitions.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 338/338 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 121 transition count 324
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 121 transition count 324
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 15 place count 121 transition count 321
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 18 place count 118 transition count 314
Iterating global reduction 1 with 3 rules applied. Total rules applied 21 place count 118 transition count 314
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 117 transition count 312
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 117 transition count 312
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 116 transition count 309
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 116 transition count 309
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 115 transition count 307
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 115 transition count 307
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 114 transition count 304
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 114 transition count 304
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 113 transition count 302
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 113 transition count 302
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 112 transition count 299
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 112 transition count 299
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 111 transition count 297
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 111 transition count 297
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 110 transition count 294
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 110 transition count 294
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 109 transition count 292
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 109 transition count 292
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 108 transition count 290
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 108 transition count 290
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 42 place count 107 transition count 288
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 107 transition count 288
Applied a total of 43 rules in 9 ms. Remains 107 /127 variables (removed 20) and now considering 288/338 (removed 50) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 107/127 places, 288/338 transitions.
[2024-06-02 22:15:53] [INFO ] Flatten gal took : 8 ms
[2024-06-02 22:15:53] [INFO ] Flatten gal took : 9 ms
[2024-06-02 22:15:53] [INFO ] Input system was already deterministic with 288 transitions.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 338/338 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 121 transition count 324
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 121 transition count 324
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 15 place count 121 transition count 321
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 17 place count 119 transition count 317
Iterating global reduction 1 with 2 rules applied. Total rules applied 19 place count 119 transition count 317
Applied a total of 19 rules in 2 ms. Remains 119 /127 variables (removed 8) and now considering 317/338 (removed 21) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 119/127 places, 317/338 transitions.
[2024-06-02 22:15:53] [INFO ] Flatten gal took : 9 ms
[2024-06-02 22:15:53] [INFO ] Flatten gal took : 9 ms
[2024-06-02 22:15:53] [INFO ] Input system was already deterministic with 317 transitions.
[2024-06-02 22:15:53] [INFO ] Flatten gal took : 10 ms
[2024-06-02 22:15:53] [INFO ] Flatten gal took : 10 ms
[2024-06-02 22:15:53] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2024-06-02 22:15:53] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 127 places, 338 transitions and 1249 arcs took 5 ms.
Total runtime 121376 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running FireWire-PT-08

IS_COLORED=
IS_NUPN=

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


SAVING FILE /home/mcc/execution/415/model (.net / .def) ...
EXPORT TIME: [User 0.001s, 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: 789
MODEL NAME: /home/mcc/execution/415/model
127 places, 338 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-08-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-08-CTLFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-08-CTLFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-08-CTLFireability-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-08-CTLFireability-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-08-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-08-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-08-CTLFireability-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-08-CTLFireability-2024-14 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-08-CTLFireability-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-08-CTLFireability-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-08-CTLFireability-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-08-CTLFireability-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1717366590227

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

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