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.r550-tall-171734898800186.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 itstools
Input is FireWire-PT-03, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r550-tall-171734898800186
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 564K
-rw-r--r-- 1 mcc users 6.9K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 13K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 141K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K 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 86K 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-03-CTLFireability-2024-00
FORMULA_NAME FireWire-PT-03-CTLFireability-2024-01
FORMULA_NAME FireWire-PT-03-CTLFireability-2024-02
FORMULA_NAME FireWire-PT-03-CTLFireability-2024-03
FORMULA_NAME FireWire-PT-03-CTLFireability-2024-04
FORMULA_NAME FireWire-PT-03-CTLFireability-2024-05
FORMULA_NAME FireWire-PT-03-CTLFireability-2024-06
FORMULA_NAME FireWire-PT-03-CTLFireability-2024-07
FORMULA_NAME FireWire-PT-03-CTLFireability-2024-08
FORMULA_NAME FireWire-PT-03-CTLFireability-2024-09
FORMULA_NAME FireWire-PT-03-CTLFireability-2024-10
FORMULA_NAME FireWire-PT-03-CTLFireability-2024-11
FORMULA_NAME FireWire-PT-03-CTLFireability-2024-12
FORMULA_NAME FireWire-PT-03-CTLFireability-2024-13
FORMULA_NAME FireWire-PT-03-CTLFireability-2024-14
FORMULA_NAME FireWire-PT-03-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717359372168

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-03
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-06-02 20:16:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-06-02 20:16:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 20:16:13] [INFO ] Load time of PNML (sax parser for PT used): 79 ms
[2024-06-02 20:16:13] [INFO ] Transformed 112 places.
[2024-06-02 20:16:13] [INFO ] Transformed 356 transitions.
[2024-06-02 20:16:13] [INFO ] Found NUPN structural information;
[2024-06-02 20:16:13] [INFO ] Parsed PT model containing 112 places and 356 transitions and 1308 arcs in 179 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 13 ms.
Ensure Unique test removed 53 transitions
Reduce redundant transitions removed 53 transitions.
Support contains 70 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 303/303 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 112 transition count 297
Applied a total of 6 rules in 23 ms. Remains 112 /112 variables (removed 0) and now considering 297/303 (removed 6) transitions.
[2024-06-02 20:16:13] [INFO ] Flow matrix only has 271 transitions (discarded 26 similar events)
// Phase 1: matrix 271 rows 112 cols
[2024-06-02 20:16:13] [INFO ] Computed 9 invariants in 20 ms
[2024-06-02 20:16:13] [INFO ] Implicit Places using invariants in 217 ms returned []
[2024-06-02 20:16:13] [INFO ] Flow matrix only has 271 transitions (discarded 26 similar events)
[2024-06-02 20:16:13] [INFO ] Invariant cache hit.
[2024-06-02 20:16:14] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-06-02 20:16:14] [INFO ] Implicit Places using invariants and state equation in 290 ms returned []
Implicit Place search using SMT with State Equation took 542 ms to find 0 implicit places.
Running 296 sub problems to find dead transitions.
[2024-06-02 20:16:14] [INFO ] Flow matrix only has 271 transitions (discarded 26 similar events)
[2024-06-02 20:16:14] [INFO ] Invariant cache hit.
[2024-06-02 20:16:14] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 2 (OVERLAPS) 1/112 variables, 9/120 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 296 unsolved
[2024-06-02 20:16:16] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 7 ms to minimize.
[2024-06-02 20:16:16] [INFO ] Deduced a trap composed of 37 places in 55 ms of which 2 ms to minimize.
[2024-06-02 20:16:17] [INFO ] Deduced a trap composed of 37 places in 62 ms of which 2 ms to minimize.
[2024-06-02 20:16:17] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 1 ms to minimize.
[2024-06-02 20:16:17] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-06-02 20:16:17] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 1 ms to minimize.
[2024-06-02 20:16:17] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 0 ms to minimize.
[2024-06-02 20:16:17] [INFO ] Deduced a trap composed of 37 places in 32 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 8/129 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 6 (OVERLAPS) 270/382 variables, 112/241 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/382 variables, 40/281 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/382 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 9 (OVERLAPS) 1/383 variables, 1/282 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/383 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 11 (OVERLAPS) 0/383 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 296 unsolved
No progress, stopping.
After SMT solving in domain Real declared 383/383 variables, and 282 constraints, problems are : Problem set: 0 solved, 296 unsolved in 13275 ms.
Refiners :[Domain max(s): 112/112 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 112/112 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 296/296 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 296 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 2 (OVERLAPS) 1/112 variables, 9/120 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 8/129 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 6 (OVERLAPS) 270/382 variables, 112/241 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/382 variables, 40/281 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/382 variables, 296/577 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/382 variables, 0/577 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 10 (OVERLAPS) 1/383 variables, 1/578 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/383 variables, 0/578 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 12 (OVERLAPS) 0/383 variables, 0/578 constraints. Problems are: Problem set: 0 solved, 296 unsolved
No progress, stopping.
After SMT solving in domain Int declared 383/383 variables, and 578 constraints, problems are : Problem set: 0 solved, 296 unsolved in 19232 ms.
Refiners :[Domain max(s): 112/112 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 112/112 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 296/296 constraints, Known Traps: 8/8 constraints]
After SMT, in 32866ms problems are : Problem set: 0 solved, 296 unsolved
Search for dead transitions found 0 dead transitions in 32886ms
Starting structural reductions in LTL mode, iteration 1 : 112/112 places, 297/303 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33476 ms. Remains : 112/112 places, 297/303 transitions.
Support contains 70 out of 112 places after structural reductions.
[2024-06-02 20:16:47] [INFO ] Flatten gal took : 45 ms
[2024-06-02 20:16:47] [INFO ] Flatten gal took : 21 ms
[2024-06-02 20:16:47] [INFO ] Input system was already deterministic with 297 transitions.
Reduction of identical properties reduced properties to check from 79 to 78
RANDOM walk for 40000 steps (2002 resets) in 1322 ms. (30 steps per ms) remains 40/78 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (63 resets) in 63 ms. (62 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (9 resets) in 46 ms. (85 steps per ms) remains 39/40 properties
BEST_FIRST walk for 4004 steps (15 resets) in 36 ms. (108 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (80 resets) in 50 ms. (78 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (8 resets) in 47 ms. (83 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (16 resets) in 21 ms. (181 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (53 resets) in 45 ms. (87 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (19 resets) in 16 ms. (235 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (51 resets) in 19 ms. (200 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4000 steps (8 resets) in 26 ms. (148 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (12 resets) in 17 ms. (222 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (63 resets) in 11 ms. (333 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (67 resets) in 13 ms. (285 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (63 resets) in 12 ms. (307 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (11 resets) in 11 ms. (333 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (17 resets) in 21 ms. (182 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (15 resets) in 26 ms. (148 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (89 resets) in 23 ms. (166 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (53 resets) in 12 ms. (308 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (83 resets) in 11 ms. (333 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (52 resets) in 23 ms. (166 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (32 resets) in 14 ms. (266 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (39 resets) in 16 ms. (235 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (52 resets) in 24 ms. (160 steps per ms) remains 38/39 properties
BEST_FIRST walk for 4003 steps (53 resets) in 12 ms. (307 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (18 resets) in 13 ms. (286 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (44 resets) in 13 ms. (285 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (12 resets) in 12 ms. (308 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (42 resets) in 11 ms. (333 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 35/38 properties
BEST_FIRST walk for 4002 steps (89 resets) in 14 ms. (266 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (19 resets) in 10 ms. (364 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (63 resets) in 13 ms. (285 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (15 resets) in 12 ms. (308 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (19 resets) in 13 ms. (286 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (48 resets) in 13 ms. (285 steps per ms) remains 35/35 properties
[2024-06-02 20:16:48] [INFO ] Flow matrix only has 271 transitions (discarded 26 similar events)
[2024-06-02 20:16:48] [INFO ] Invariant cache hit.
[2024-06-02 20:16:48] [INFO ] State equation strengthened by 41 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 47/47 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 35 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp40 is UNSAT
Problem AtomicPropp46 is UNSAT
Problem AtomicPropp59 is UNSAT
Problem AtomicPropp73 is UNSAT
Problem AtomicPropp75 is UNSAT
Problem AtomicPropp78 is UNSAT
At refinement iteration 2 (OVERLAPS) 59/106 variables, 6/53 constraints. Problems are: Problem set: 11 solved, 24 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 59/112 constraints. Problems are: Problem set: 11 solved, 24 unsolved
[2024-06-02 20:16:48] [INFO ] Deduced a trap composed of 37 places in 41 ms of which 0 ms to minimize.
[2024-06-02 20:16:48] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 1 ms to minimize.
[2024-06-02 20:16:48] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 3/115 constraints. Problems are: Problem set: 11 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/106 variables, 0/115 constraints. Problems are: Problem set: 11 solved, 24 unsolved
At refinement iteration 6 (OVERLAPS) 6/112 variables, 3/118 constraints. Problems are: Problem set: 11 solved, 24 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/112 variables, 6/124 constraints. Problems are: Problem set: 11 solved, 24 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/112 variables, 0/124 constraints. Problems are: Problem set: 11 solved, 24 unsolved
At refinement iteration 9 (OVERLAPS) 270/382 variables, 112/236 constraints. Problems are: Problem set: 11 solved, 24 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/382 variables, 40/276 constraints. Problems are: Problem set: 11 solved, 24 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/382 variables, 0/276 constraints. Problems are: Problem set: 11 solved, 24 unsolved
At refinement iteration 12 (OVERLAPS) 1/383 variables, 1/277 constraints. Problems are: Problem set: 11 solved, 24 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/383 variables, 0/277 constraints. Problems are: Problem set: 11 solved, 24 unsolved
At refinement iteration 14 (OVERLAPS) 0/383 variables, 0/277 constraints. Problems are: Problem set: 11 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Real declared 383/383 variables, and 277 constraints, problems are : Problem set: 11 solved, 24 unsolved in 1174 ms.
Refiners :[Domain max(s): 112/112 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 112/112 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 35/35 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 11 solved, 24 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 31/31 constraints. Problems are: Problem set: 11 solved, 24 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/31 constraints. Problems are: Problem set: 11 solved, 24 unsolved
At refinement iteration 2 (OVERLAPS) 75/106 variables, 6/37 constraints. Problems are: Problem set: 11 solved, 24 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 75/112 constraints. Problems are: Problem set: 11 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 3/115 constraints. Problems are: Problem set: 11 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/106 variables, 0/115 constraints. Problems are: Problem set: 11 solved, 24 unsolved
At refinement iteration 6 (OVERLAPS) 6/112 variables, 3/118 constraints. Problems are: Problem set: 11 solved, 24 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/112 variables, 6/124 constraints. Problems are: Problem set: 11 solved, 24 unsolved
[2024-06-02 20:16:49] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/112 variables, 1/125 constraints. Problems are: Problem set: 11 solved, 24 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/112 variables, 0/125 constraints. Problems are: Problem set: 11 solved, 24 unsolved
At refinement iteration 10 (OVERLAPS) 270/382 variables, 112/237 constraints. Problems are: Problem set: 11 solved, 24 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/382 variables, 40/277 constraints. Problems are: Problem set: 11 solved, 24 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/382 variables, 24/301 constraints. Problems are: Problem set: 11 solved, 24 unsolved
[2024-06-02 20:16:50] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/382 variables, 1/302 constraints. Problems are: Problem set: 11 solved, 24 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/382 variables, 0/302 constraints. Problems are: Problem set: 11 solved, 24 unsolved
At refinement iteration 15 (OVERLAPS) 1/383 variables, 1/303 constraints. Problems are: Problem set: 11 solved, 24 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/383 variables, 0/303 constraints. Problems are: Problem set: 11 solved, 24 unsolved
At refinement iteration 17 (OVERLAPS) 0/383 variables, 0/303 constraints. Problems are: Problem set: 11 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Int declared 383/383 variables, and 303 constraints, problems are : Problem set: 11 solved, 24 unsolved in 2251 ms.
Refiners :[Domain max(s): 112/112 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 112/112 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 24/35 constraints, Known Traps: 5/5 constraints]
After SMT, in 3479ms problems are : Problem set: 11 solved, 24 unsolved
Parikh walk visited 0 properties in 2267 ms.
Support contains 31 out of 112 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 112/112 places, 297/297 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 112 transition count 294
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 3 place count 112 transition count 293
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 111 transition count 293
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 110 transition count 291
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 110 transition count 291
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 11 place count 108 transition count 289
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 15 place count 106 transition count 293
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 106 transition count 289
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 23 place count 106 transition count 285
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 24 place count 106 transition count 287
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 27 place count 105 transition count 285
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 29 place count 105 transition count 283
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 31 place count 105 transition count 283
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 32 place count 104 transition count 282
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 33 place count 103 transition count 282
Applied a total of 33 rules in 79 ms. Remains 103 /112 variables (removed 9) and now considering 282/297 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 103/112 places, 282/297 transitions.
RANDOM walk for 40000 steps (2350 resets) in 708 ms. (56 steps per ms) remains 23/24 properties
BEST_FIRST walk for 4003 steps (66 resets) in 17 ms. (222 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (8 resets) in 19 ms. (200 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (96 resets) in 17 ms. (222 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (10 resets) in 10 ms. (363 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (58 resets) in 17 ms. (222 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (43 resets) in 31 ms. (125 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (69 resets) in 18 ms. (210 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (14 resets) in 13 ms. (285 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (116 resets) in 23 ms. (166 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (110 resets) in 12 ms. (308 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (77 resets) in 20 ms. (190 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (44 resets) in 12 ms. (307 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (40 resets) in 12 ms. (308 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (44 resets) in 18 ms. (210 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (63 resets) in 12 ms. (308 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (10 resets) in 10 ms. (364 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (74 resets) in 11 ms. (333 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (109 resets) in 10 ms. (363 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (14 resets) in 8 ms. (444 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (53 resets) in 16 ms. (235 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (24 resets) in 10 ms. (364 steps per ms) remains 23/23 properties
Interrupted probabilistic random walk after 511833 steps, run timeout after 3001 ms. (steps per millisecond=170 ) properties seen :6 out of 23
Probabilistic random walk after 511833 steps, saw 99694 distinct states, run finished after 3010 ms. (steps per millisecond=170 ) properties seen :6
[2024-06-02 20:16:57] [INFO ] Flow matrix only has 256 transitions (discarded 26 similar events)
// Phase 1: matrix 256 rows 103 cols
[2024-06-02 20:16:57] [INFO ] Computed 8 invariants in 3 ms
[2024-06-02 20:16:57] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 55/79 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2024-06-02 20:16:57] [INFO ] Deduced a trap composed of 33 places in 37 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 231/310 variables, 79/85 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/310 variables, 27/112 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/310 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 46/356 variables, 22/134 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/356 variables, 2/136 constraints. Problems are: Problem set: 0 solved, 17 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/356 variables, 12/148 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/356 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 11 (OVERLAPS) 3/359 variables, 2/150 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/359 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/359 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 14 (OVERLAPS) 0/359 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 359/359 variables, and 151 constraints, problems are : Problem set: 0 solved, 17 unsolved in 649 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 103/103 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 55/79 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 231/310 variables, 79/85 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/310 variables, 27/112 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/310 variables, 5/117 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/310 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 46/356 variables, 22/139 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/356 variables, 2/141 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/356 variables, 12/153 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/356 variables, 12/165 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2024-06-02 20:16:58] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/356 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/356 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 14 (OVERLAPS) 3/359 variables, 2/168 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/359 variables, 1/169 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/359 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 17 (OVERLAPS) 0/359 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 359/359 variables, and 169 constraints, problems are : Problem set: 0 solved, 17 unsolved in 1500 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 103/103 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 2/2 constraints]
After SMT, in 2179ms problems are : Problem set: 0 solved, 17 unsolved
Parikh walk visited 0 properties in 2137 ms.
Support contains 24 out of 103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 282/282 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 101 transition count 276
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 101 transition count 276
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 99 transition count 272
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 99 transition count 272
Applied a total of 8 rules in 25 ms. Remains 99 /103 variables (removed 4) and now considering 272/282 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 99/103 places, 272/282 transitions.
RANDOM walk for 40000 steps (2291 resets) in 242 ms. (164 steps per ms) remains 15/17 properties
BEST_FIRST walk for 4003 steps (66 resets) in 10 ms. (363 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (9 resets) in 10 ms. (363 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (103 resets) in 11 ms. (333 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (21 resets) in 10 ms. (363 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (68 resets) in 11 ms. (333 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (17 resets) in 11 ms. (333 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (106 resets) in 10 ms. (363 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (54 resets) in 10 ms. (364 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (47 resets) in 23 ms. (166 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4000 steps (58 resets) in 11 ms. (333 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (49 resets) in 11 ms. (333 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (14 resets) in 10 ms. (364 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (57 resets) in 14 ms. (266 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (25 resets) in 8 ms. (444 steps per ms) remains 15/15 properties
[2024-06-02 20:17:01] [INFO ] Flow matrix only has 246 transitions (discarded 26 similar events)
// Phase 1: matrix 246 rows 99 cols
[2024-06-02 20:17:01] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 20:17:01] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 56/77 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-06-02 20:17:02] [INFO ] Deduced a trap composed of 33 places in 35 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 222/299 variables, 77/83 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/299 variables, 26/109 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/299 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 43/342 variables, 20/129 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/342 variables, 2/131 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/342 variables, 11/142 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/342 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 11 (OVERLAPS) 3/345 variables, 2/144 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/345 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/345 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 14 (OVERLAPS) 0/345 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 345/345 variables, and 145 constraints, problems are : Problem set: 0 solved, 15 unsolved in 764 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 99/99 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 56/77 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 222/299 variables, 77/83 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/299 variables, 26/109 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/299 variables, 4/113 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/299 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (OVERLAPS) 43/342 variables, 20/133 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/342 variables, 2/135 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/342 variables, 11/146 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/342 variables, 11/157 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-06-02 20:17:03] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-06-02 20:17:03] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/342 variables, 2/159 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/342 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 14 (OVERLAPS) 3/345 variables, 2/161 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/345 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/345 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 17 (OVERLAPS) 0/345 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 345/345 variables, and 162 constraints, problems are : Problem set: 0 solved, 15 unsolved in 1556 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 99/99 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 3/3 constraints]
After SMT, in 2337ms problems are : Problem set: 0 solved, 15 unsolved
Fused 15 Parikh solutions to 14 different solutions.
Parikh walk visited 0 properties in 27024 ms.
Support contains 21 out of 99 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 99/99 places, 272/272 transitions.
Applied a total of 0 rules in 8 ms. Remains 99 /99 variables (removed 0) and now considering 272/272 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 99/99 places, 272/272 transitions.
RANDOM walk for 40000 steps (2274 resets) in 173 ms. (229 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (41 resets) in 8 ms. (444 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (9 resets) in 10 ms. (363 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (110 resets) in 10 ms. (363 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 7 ms. (500 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (16 resets) in 9 ms. (400 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (60 resets) in 12 ms. (307 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (16 resets) in 9 ms. (400 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (104 resets) in 8 ms. (444 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (67 resets) in 9 ms. (400 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (47 resets) in 8 ms. (444 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (55 resets) in 8 ms. (444 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (44 resets) in 8 ms. (444 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (13 resets) in 4 ms. (800 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (51 resets) in 7 ms. (500 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (19 resets) in 8 ms. (444 steps per ms) remains 15/15 properties
Interrupted probabilistic random walk after 592297 steps, run timeout after 3001 ms. (steps per millisecond=197 ) properties seen :0 out of 15
Probabilistic random walk after 592297 steps, saw 110998 distinct states, run finished after 3001 ms. (steps per millisecond=197 ) properties seen :0
[2024-06-02 20:17:34] [INFO ] Flow matrix only has 246 transitions (discarded 26 similar events)
[2024-06-02 20:17:34] [INFO ] Invariant cache hit.
[2024-06-02 20:17:34] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 56/77 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-06-02 20:17:34] [INFO ] Deduced a trap composed of 33 places in 37 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 222/299 variables, 77/83 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/299 variables, 26/109 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/299 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 43/342 variables, 20/129 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/342 variables, 2/131 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/342 variables, 11/142 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/342 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 11 (OVERLAPS) 3/345 variables, 2/144 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/345 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/345 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 14 (OVERLAPS) 0/345 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 345/345 variables, and 145 constraints, problems are : Problem set: 0 solved, 15 unsolved in 798 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 99/99 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 56/77 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 222/299 variables, 77/83 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/299 variables, 26/109 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/299 variables, 4/113 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/299 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (OVERLAPS) 43/342 variables, 20/133 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/342 variables, 2/135 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/342 variables, 11/146 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/342 variables, 11/157 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-06-02 20:17:35] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2024-06-02 20:17:35] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/342 variables, 2/159 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/342 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 14 (OVERLAPS) 3/345 variables, 2/161 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/345 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/345 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 17 (OVERLAPS) 0/345 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 345/345 variables, and 162 constraints, problems are : Problem set: 0 solved, 15 unsolved in 1358 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 99/99 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 3/3 constraints]
After SMT, in 2183ms problems are : Problem set: 0 solved, 15 unsolved
Parikh walk visited 4 properties in 6462 ms.
Support contains 18 out of 99 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 99/99 places, 272/272 transitions.
Applied a total of 0 rules in 8 ms. Remains 99 /99 variables (removed 0) and now considering 272/272 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 99/99 places, 272/272 transitions.
RANDOM walk for 40000 steps (2274 resets) in 172 ms. (231 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (67 resets) in 51 ms. (769 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (1130 resets) in 56 ms. (701 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (9 resets) in 60 ms. (655 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (553 resets) in 46 ms. (851 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (1079 resets) in 80 ms. (493 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (572 resets) in 53 ms. (740 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (527 resets) in 54 ms. (727 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (568 resets) in 43 ms. (909 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (534 resets) in 41 ms. (952 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (613 resets) in 51 ms. (769 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (28 resets) in 39 ms. (1000 steps per ms) remains 11/11 properties
Interrupted probabilistic random walk after 608825 steps, run timeout after 3001 ms. (steps per millisecond=202 ) properties seen :0 out of 11
Probabilistic random walk after 608825 steps, saw 115523 distinct states, run finished after 3001 ms. (steps per millisecond=202 ) properties seen :0
[2024-06-02 20:17:46] [INFO ] Flow matrix only has 246 transitions (discarded 26 similar events)
[2024-06-02 20:17:46] [INFO ] Invariant cache hit.
[2024-06-02 20:17:46] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 59/77 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-06-02 20:17:46] [INFO ] Deduced a trap composed of 33 places in 37 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 222/299 variables, 77/83 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/299 variables, 26/109 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/299 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 43/342 variables, 20/129 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/342 variables, 2/131 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/342 variables, 11/142 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/342 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (OVERLAPS) 3/345 variables, 2/144 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/345 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/345 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 14 (OVERLAPS) 0/345 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 345/345 variables, and 145 constraints, problems are : Problem set: 0 solved, 11 unsolved in 621 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 99/99 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 59/77 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 222/299 variables, 77/83 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/299 variables, 26/109 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/299 variables, 3/112 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/299 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 43/342 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/342 variables, 2/134 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/342 variables, 11/145 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/342 variables, 8/153 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/342 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (OVERLAPS) 3/345 variables, 2/155 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/345 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/345 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 16 (OVERLAPS) 0/345 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 345/345 variables, and 156 constraints, problems are : Problem set: 0 solved, 11 unsolved in 940 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 99/99 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 1/1 constraints]
After SMT, in 1572ms problems are : Problem set: 0 solved, 11 unsolved
Parikh walk visited 0 properties in 4863 ms.
Support contains 18 out of 99 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 99/99 places, 272/272 transitions.
Applied a total of 0 rules in 16 ms. Remains 99 /99 variables (removed 0) and now considering 272/272 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 99/99 places, 272/272 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 99/99 places, 272/272 transitions.
Applied a total of 0 rules in 6 ms. Remains 99 /99 variables (removed 0) and now considering 272/272 (removed 0) transitions.
[2024-06-02 20:17:52] [INFO ] Flow matrix only has 246 transitions (discarded 26 similar events)
[2024-06-02 20:17:52] [INFO ] Invariant cache hit.
[2024-06-02 20:17:52] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-06-02 20:17:52] [INFO ] Flow matrix only has 246 transitions (discarded 26 similar events)
[2024-06-02 20:17:52] [INFO ] Invariant cache hit.
[2024-06-02 20:17:53] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-02 20:17:53] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 243 ms to find 0 implicit places.
[2024-06-02 20:17:53] [INFO ] Redundant transitions in 15 ms returned []
Running 270 sub problems to find dead transitions.
[2024-06-02 20:17:53] [INFO ] Flow matrix only has 246 transitions (discarded 26 similar events)
[2024-06-02 20:17:53] [INFO ] Invariant cache hit.
[2024-06-02 20:17:53] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 270 unsolved
[2024-06-02 20:17:53] [INFO ] Deduced a trap composed of 36 places in 61 ms of which 1 ms to minimize.
[2024-06-02 20:17:54] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 1 ms to minimize.
[2024-06-02 20:17:54] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-06-02 20:17:54] [INFO ] Deduced a trap composed of 33 places in 34 ms of which 1 ms to minimize.
[2024-06-02 20:17:54] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
[2024-06-02 20:17:54] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
[2024-06-02 20:17:54] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 270 unsolved
[2024-06-02 20:17:55] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 1 ms to minimize.
[2024-06-02 20:17:55] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 4 (OVERLAPS) 1/99 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 270 unsolved
[2024-06-02 20:17:57] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/99 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/99 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 7 (OVERLAPS) 246/345 variables, 99/117 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/345 variables, 37/154 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/345 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 270 unsolved
[2024-06-02 20:18:01] [INFO ] Deduced a trap composed of 34 places in 60 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/345 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/345 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 12 (OVERLAPS) 0/345 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 270 unsolved
No progress, stopping.
After SMT solving in domain Real declared 345/345 variables, and 155 constraints, problems are : Problem set: 0 solved, 270 unsolved in 13444 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 99/99 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 270/270 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 270 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 3 (OVERLAPS) 1/99 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 5 (OVERLAPS) 246/345 variables, 99/118 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/345 variables, 37/155 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/345 variables, 270/425 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/345 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 9 (OVERLAPS) 0/345 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 270 unsolved
No progress, stopping.
After SMT solving in domain Int declared 345/345 variables, and 425 constraints, problems are : Problem set: 0 solved, 270 unsolved in 13267 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 99/99 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 270/270 constraints, Known Traps: 11/11 constraints]
After SMT, in 26876ms problems are : Problem set: 0 solved, 270 unsolved
Search for dead transitions found 0 dead transitions in 26879ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27151 ms. Remains : 99/99 places, 272/272 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 71 edges and 99 vertex of which 16 / 99 are part of one of the 3 SCC in 2 ms
Free SCC test removed 13 places
Drop transitions (Empty/Sink Transition effects.) removed 40 transitions
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 71 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 0 with 11 rules applied. Total rules applied 12 place count 86 transition count 190
Applied a total of 12 rules in 15 ms. Remains 86 /99 variables (removed 13) and now considering 190/272 (removed 82) transitions.
Running SMT prover for 11 properties.
// Phase 1: matrix 190 rows 86 cols
[2024-06-02 20:18:20] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 20:18:20] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 20:18:20] [INFO ] After 143ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2024-06-02 20:18:20] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2024-06-02 20:18:20] [INFO ] After 124ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
TRAPS : Iteration 0
[2024-06-02 20:18:20] [INFO ] Deduced a trap composed of 7 places in 19 ms of which 1 ms to minimize.
[2024-06-02 20:18:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 35 ms
[2024-06-02 20:18:20] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 4 ms to minimize.
[2024-06-02 20:18:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 58 ms
TRAPS : Iteration 1
[2024-06-02 20:18:20] [INFO ] After 504ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
[2024-06-02 20:18:20] [INFO ] After 683ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Over-approximation ignoring read arcs solved 0 properties in 859 ms.
Successfully simplified 11 atomic propositions for a total of 16 simplifications.
[2024-06-02 20:18:20] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2024-06-02 20:18:20] [INFO ] Flatten gal took : 17 ms
FORMULA FireWire-PT-03-CTLFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-03-CTLFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-02 20:18:20] [INFO ] Flatten gal took : 16 ms
[2024-06-02 20:18:20] [INFO ] Input system was already deterministic with 297 transitions.
Support contains 49 out of 112 places (down from 53) after GAL structural reductions.
Computed a total of 3 stabilizing places and 2 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 297/297 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 109 transition count 289
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 109 transition count 289
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 107 transition count 285
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 107 transition count 285
Applied a total of 10 rules in 4 ms. Remains 107 /112 variables (removed 5) and now considering 285/297 (removed 12) transitions.
[2024-06-02 20:18:20] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
// Phase 1: matrix 259 rows 107 cols
[2024-06-02 20:18:20] [INFO ] Computed 9 invariants in 2 ms
[2024-06-02 20:18:21] [INFO ] Implicit Places using invariants in 373 ms returned []
[2024-06-02 20:18:21] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
[2024-06-02 20:18:21] [INFO ] Invariant cache hit.
[2024-06-02 20:18:21] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-06-02 20:18:21] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 513 ms to find 0 implicit places.
Running 284 sub problems to find dead transitions.
[2024-06-02 20:18:21] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
[2024-06-02 20:18:21] [INFO ] Invariant cache hit.
[2024-06-02 20:18:21] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 284 unsolved
[2024-06-02 20:18:22] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2024-06-02 20:18:22] [INFO ] Deduced a trap composed of 36 places in 29 ms of which 1 ms to minimize.
[2024-06-02 20:18:23] [INFO ] Deduced a trap composed of 40 places in 58 ms of which 1 ms to minimize.
[2024-06-02 20:18:23] [INFO ] Deduced a trap composed of 41 places in 69 ms of which 1 ms to minimize.
[2024-06-02 20:18:23] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 1 ms to minimize.
[2024-06-02 20:18:23] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
[2024-06-02 20:18:23] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2024-06-02 20:18:23] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 2 ms to minimize.
[2024-06-02 20:18:23] [INFO ] Deduced a trap composed of 36 places in 37 ms of which 1 ms to minimize.
[2024-06-02 20:18:24] [INFO ] Deduced a trap composed of 36 places in 56 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 4 (OVERLAPS) 258/365 variables, 107/126 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/365 variables, 38/164 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 7 (OVERLAPS) 1/366 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/366 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 9 (OVERLAPS) 0/366 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 284 unsolved
No progress, stopping.
After SMT solving in domain Real declared 366/366 variables, and 165 constraints, problems are : Problem set: 0 solved, 284 unsolved in 11575 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 107/107 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 284/284 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 284 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 284 unsolved
[2024-06-02 20:18:34] [INFO ] Deduced a trap composed of 38 places in 59 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 5 (OVERLAPS) 258/365 variables, 107/127 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 38/165 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 284/449 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/365 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 9 (OVERLAPS) 1/366 variables, 1/450 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/366 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 11 (OVERLAPS) 0/366 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 284 unsolved
No progress, stopping.
After SMT solving in domain Int declared 366/366 variables, and 450 constraints, problems are : Problem set: 0 solved, 284 unsolved in 19992 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 107/107 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 284/284 constraints, Known Traps: 11/11 constraints]
After SMT, in 31719ms problems are : Problem set: 0 solved, 284 unsolved
Search for dead transitions found 0 dead transitions in 31722ms
Starting structural reductions in LTL mode, iteration 1 : 107/112 places, 285/297 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32240 ms. Remains : 107/112 places, 285/297 transitions.
[2024-06-02 20:18:53] [INFO ] Flatten gal took : 14 ms
[2024-06-02 20:18:53] [INFO ] Flatten gal took : 29 ms
[2024-06-02 20:18:53] [INFO ] Input system was already deterministic with 285 transitions.
[2024-06-02 20:18:53] [INFO ] Flatten gal took : 15 ms
[2024-06-02 20:18:53] [INFO ] Flatten gal took : 15 ms
[2024-06-02 20:18:53] [INFO ] Time to serialize gal into /tmp/CTLFireability14479443128014638631.gal : 21 ms
[2024-06-02 20:18:53] [INFO ] Time to serialize properties into /tmp/CTLFireability8217261692024931009.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14479443128014638631.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8217261692024931009.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.45564e+06,2.693,76172,2,4437,5,220184,6,0,710,221203,0


Converting to forward existential form...Done !
original formula: AX(((p3==1)&&(p91==1)))
=> equivalent forward existential formula: [(EY(Init) * !(((p3==1)&&(p91==1))))] = FALSE
(forward)formula 0,0,2.70267,76172,1,0,8,220184,9,2,1072,221203,2
FORMULA FireWire-PT-03-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 297/297 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 109 transition count 289
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 109 transition count 289
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 107 transition count 285
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 107 transition count 285
Applied a total of 10 rules in 3 ms. Remains 107 /112 variables (removed 5) and now considering 285/297 (removed 12) transitions.
[2024-06-02 20:18:56] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
[2024-06-02 20:18:56] [INFO ] Invariant cache hit.
[2024-06-02 20:18:56] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-06-02 20:18:56] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
[2024-06-02 20:18:56] [INFO ] Invariant cache hit.
[2024-06-02 20:18:56] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-06-02 20:18:56] [INFO ] Implicit Places using invariants and state equation in 189 ms returned []
Implicit Place search using SMT with State Equation took 279 ms to find 0 implicit places.
Running 284 sub problems to find dead transitions.
[2024-06-02 20:18:56] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
[2024-06-02 20:18:56] [INFO ] Invariant cache hit.
[2024-06-02 20:18:56] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 284 unsolved
[2024-06-02 20:18:57] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2024-06-02 20:18:57] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 0 ms to minimize.
[2024-06-02 20:18:57] [INFO ] Deduced a trap composed of 40 places in 78 ms of which 1 ms to minimize.
[2024-06-02 20:18:58] [INFO ] Deduced a trap composed of 41 places in 78 ms of which 1 ms to minimize.
[2024-06-02 20:18:58] [INFO ] Deduced a trap composed of 22 places in 76 ms of which 1 ms to minimize.
[2024-06-02 20:18:58] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 1 ms to minimize.
[2024-06-02 20:18:58] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2024-06-02 20:18:58] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 0 ms to minimize.
[2024-06-02 20:18:58] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 0 ms to minimize.
[2024-06-02 20:18:58] [INFO ] Deduced a trap composed of 36 places in 72 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 4 (OVERLAPS) 258/365 variables, 107/126 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/365 variables, 38/164 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 7 (OVERLAPS) 1/366 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/366 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 9 (OVERLAPS) 0/366 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 284 unsolved
No progress, stopping.
After SMT solving in domain Real declared 366/366 variables, and 165 constraints, problems are : Problem set: 0 solved, 284 unsolved in 11737 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 107/107 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 284/284 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 284 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 284 unsolved
[2024-06-02 20:19:09] [INFO ] Deduced a trap composed of 38 places in 55 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 5 (OVERLAPS) 258/365 variables, 107/127 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 38/165 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 284/449 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/365 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 9 (OVERLAPS) 1/366 variables, 1/450 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/366 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 11 (OVERLAPS) 0/366 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 284 unsolved
No progress, stopping.
After SMT solving in domain Int declared 366/366 variables, and 450 constraints, problems are : Problem set: 0 solved, 284 unsolved in 20046 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 107/107 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 284/284 constraints, Known Traps: 11/11 constraints]
After SMT, in 31970ms problems are : Problem set: 0 solved, 284 unsolved
Search for dead transitions found 0 dead transitions in 31973ms
Starting structural reductions in LTL mode, iteration 1 : 107/112 places, 285/297 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32256 ms. Remains : 107/112 places, 285/297 transitions.
[2024-06-02 20:19:28] [INFO ] Flatten gal took : 16 ms
[2024-06-02 20:19:28] [INFO ] Flatten gal took : 14 ms
[2024-06-02 20:19:28] [INFO ] Input system was already deterministic with 285 transitions.
[2024-06-02 20:19:28] [INFO ] Flatten gal took : 11 ms
[2024-06-02 20:19:28] [INFO ] Flatten gal took : 11 ms
[2024-06-02 20:19:28] [INFO ] Time to serialize gal into /tmp/CTLFireability9840796097373122958.gal : 19 ms
[2024-06-02 20:19:28] [INFO ] Time to serialize properties into /tmp/CTLFireability15207612894420319464.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9840796097373122958.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15207612894420319464.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.45564e+06,2.44075,76184,2,4437,5,220184,6,0,710,221203,0


Converting to forward existential form...Done !
original formula: EF(AG((AG(((p10==1)&&(p99==1))) * !(A(A((p22==1) U ((p8==1)&&(p61==1))) U EX(((p7==1)&&(p23==1))))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((!(E(TRUE U !(((p10==1)&&(p99==1))))) * !(!((E(!(EX(((p7==1)&&(p23==1)))) U (!(...338
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t6, t10, t11, t13, t18, t19, t20, t21, t22, t24, t26, t31, t32, t33, t34, t35...578
Detected timeout of ITS tools.
[2024-06-02 20:19:58] [INFO ] Flatten gal took : 11 ms
[2024-06-02 20:19:58] [INFO ] Applying decomposition
[2024-06-02 20:19:58] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph5306781517086752979.txt' '-o' '/tmp/graph5306781517086752979.bin' '-w' '/tmp/graph5306781517086752979.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5306781517086752979.bin' '-l' '-1' '-v' '-w' '/tmp/graph5306781517086752979.weights' '-q' '0' '-e' '0.001'
[2024-06-02 20:19:58] [INFO ] Decomposing Gal with order
[2024-06-02 20:19:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 20:19:58] [INFO ] Removed a total of 405 redundant transitions.
[2024-06-02 20:19:58] [INFO ] Flatten gal took : 106 ms
[2024-06-02 20:19:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 65 labels/synchronizations in 23 ms.
[2024-06-02 20:19:58] [INFO ] Time to serialize gal into /tmp/CTLFireability3073549529796870492.gal : 4 ms
[2024-06-02 20:19:58] [INFO ] Time to serialize properties into /tmp/CTLFireability7819565479838922997.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3073549529796870492.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7819565479838922997.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.45564e+06,9.47402,318600,2644,176,387937,2170,563,2.38703e+06,104,21523,0


Converting to forward existential form...Done !
original formula: EF(AG((AG(((i1.u3.p10==1)&&(i1.u3.p99==1))) * !(A(A((i2.u7.p22==1) U ((i1.u3.p8==1)&&(i6.u32.p61==1))) U EX(((i3.u2.p7==1)&&(i2.u7.p23==1...163
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((!(E(TRUE U !(((i1.u3.p10==1)&&(i1.u3.p99==1))))) * !(!((E(!(EX(((i3.u2.p7==1)&...431
Reverse transition relation is NOT exact ! Due to transitions t4, t47, t49, t53, t54, t62, t63, t68, t73, t78, t83, t97, t99, t100, t101, t102, t139, t148,...735
Fast SCC detection found a local SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 112/112 places, 297/297 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 111 transition count 295
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 110 transition count 295
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 5 place count 107 transition count 287
Iterating global reduction 0 with 3 rules applied. Total rules applied 8 place count 107 transition count 287
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 105 transition count 283
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 105 transition count 283
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 104 transition count 282
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 104 transition count 280
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 17 place count 103 transition count 279
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 18 place count 102 transition count 279
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 18 place count 102 transition count 278
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 20 place count 101 transition count 278
Applied a total of 20 rules in 71 ms. Remains 101 /112 variables (removed 11) and now considering 278/297 (removed 19) transitions.
[2024-06-02 20:20:29] [INFO ] Flow matrix only has 253 transitions (discarded 25 similar events)
// Phase 1: matrix 253 rows 101 cols
[2024-06-02 20:20:29] [INFO ] Computed 8 invariants in 22 ms
[2024-06-02 20:20:29] [INFO ] Implicit Places using invariants in 131 ms returned []
[2024-06-02 20:20:29] [INFO ] Flow matrix only has 253 transitions (discarded 25 similar events)
[2024-06-02 20:20:29] [INFO ] Invariant cache hit.
[2024-06-02 20:20:29] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-06-02 20:20:29] [INFO ] Implicit Places using invariants and state equation in 392 ms returned []
Implicit Place search using SMT with State Equation took 537 ms to find 0 implicit places.
[2024-06-02 20:20:29] [INFO ] Redundant transitions in 4 ms returned []
Running 275 sub problems to find dead transitions.
[2024-06-02 20:20:29] [INFO ] Flow matrix only has 253 transitions (discarded 25 similar events)
[2024-06-02 20:20:29] [INFO ] Invariant cache hit.
[2024-06-02 20:20:29] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 275 unsolved
[2024-06-02 20:20:30] [INFO ] Deduced a trap composed of 35 places in 62 ms of which 1 ms to minimize.
[2024-06-02 20:20:30] [INFO ] Deduced a trap composed of 34 places in 38 ms of which 3 ms to minimize.
[2024-06-02 20:20:30] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 1 ms to minimize.
[2024-06-02 20:20:30] [INFO ] Deduced a trap composed of 40 places in 109 ms of which 2 ms to minimize.
[2024-06-02 20:20:30] [INFO ] Deduced a trap composed of 21 places in 73 ms of which 1 ms to minimize.
[2024-06-02 20:20:30] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 1 ms to minimize.
[2024-06-02 20:20:31] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 0 ms to minimize.
[2024-06-02 20:20:31] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 3 (OVERLAPS) 252/353 variables, 101/117 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/353 variables, 35/152 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/353 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 6 (OVERLAPS) 0/353 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 275 unsolved
No progress, stopping.
After SMT solving in domain Real declared 353/354 variables, and 152 constraints, problems are : Problem set: 0 solved, 275 unsolved in 7705 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 101/101 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 275/275 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 275 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 3 (OVERLAPS) 252/353 variables, 101/117 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/353 variables, 35/152 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/353 variables, 275/427 constraints. Problems are: Problem set: 0 solved, 275 unsolved
[2024-06-02 20:20:40] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/353 variables, 1/428 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/353 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 8 (OVERLAPS) 0/353 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 275 unsolved
No progress, stopping.
After SMT solving in domain Int declared 353/354 variables, and 428 constraints, problems are : Problem set: 0 solved, 275 unsolved in 13576 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 101/101 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 275/275 constraints, Known Traps: 9/9 constraints]
After SMT, in 21473ms problems are : Problem set: 0 solved, 275 unsolved
Search for dead transitions found 0 dead transitions in 21475ms
Starting structural reductions in SI_CTL mode, iteration 1 : 101/112 places, 278/297 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 22102 ms. Remains : 101/112 places, 278/297 transitions.
[2024-06-02 20:20:51] [INFO ] Flatten gal took : 9 ms
[2024-06-02 20:20:51] [INFO ] Flatten gal took : 43 ms
[2024-06-02 20:20:51] [INFO ] Input system was already deterministic with 278 transitions.
[2024-06-02 20:20:51] [INFO ] Flatten gal took : 33 ms
[2024-06-02 20:20:51] [INFO ] Flatten gal took : 9 ms
[2024-06-02 20:20:51] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4828942096774770988.gal : 3 ms
[2024-06-02 20:20:51] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7723449006095795948.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4828942096774770988.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7723449006095795948.prop' '--nowitness' '--gen-order' 'FOLLOW'
RANDOM walk for 40000 steps (2402 resets) in 150 ms. (264 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (28 resets) in 20 ms. (1904 steps per ms) remains 1/1 properties

Finished probabilistic random walk after 261 steps, run visited all 1 properties in 12 ms. (steps per millisecond=21 )
Probabilistic random walk after 261 steps, saw 202 distinct states, run finished after 21 ms. (steps per millisecond=12 ) properties seen :1
FORMULA FireWire-PT-03-CTLFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 112/112 places, 297/297 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 111 transition count 295
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 110 transition count 295
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 5 place count 107 transition count 287
Iterating global reduction 0 with 3 rules applied. Total rules applied 8 place count 107 transition count 287
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 105 transition count 283
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 105 transition count 283
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 104 transition count 282
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 104 transition count 280
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 17 place count 103 transition count 279
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 18 place count 102 transition count 279
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 18 place count 102 transition count 278
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 20 place count 101 transition count 278
Applied a total of 20 rules in 54 ms. Remains 101 /112 variables (removed 11) and now considering 278/297 (removed 19) transitions.
[2024-06-02 20:20:51] [INFO ] Flow matrix only has 253 transitions (discarded 25 similar events)
[2024-06-02 20:20:51] [INFO ] Invariant cache hit.
[2024-06-02 20:20:51] [INFO ] Implicit Places using invariants in 516 ms returned []
[2024-06-02 20:20:51] [INFO ] Flow matrix only has 253 transitions (discarded 25 similar events)
[2024-06-02 20:20:51] [INFO ] Invariant cache hit.
[2024-06-02 20:20:52] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-06-02 20:20:52] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 646 ms to find 0 implicit places.
[2024-06-02 20:20:52] [INFO ] Redundant transitions in 3 ms returned []
Running 275 sub problems to find dead transitions.
[2024-06-02 20:20:52] [INFO ] Flow matrix only has 253 transitions (discarded 25 similar events)
[2024-06-02 20:20:52] [INFO ] Invariant cache hit.
[2024-06-02 20:20:52] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 275 unsolved
[2024-06-02 20:20:52] [INFO ] Deduced a trap composed of 35 places in 64 ms of which 1 ms to minimize.
[2024-06-02 20:20:52] [INFO ] Deduced a trap composed of 34 places in 28 ms of which 0 ms to minimize.
[2024-06-02 20:20:53] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 0 ms to minimize.
[2024-06-02 20:20:53] [INFO ] Deduced a trap composed of 40 places in 52 ms of which 1 ms to minimize.
[2024-06-02 20:20:53] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 1 ms to minimize.
[2024-06-02 20:20:53] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2024-06-02 20:20:53] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-06-02 20:20:53] [INFO ] Deduced a trap composed of 33 places in 39 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 3 (OVERLAPS) 252/353 variables, 101/117 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/353 variables, 35/152 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/353 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 6 (OVERLAPS) 0/353 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 275 unsolved
No progress, stopping.
After SMT solving in domain Real declared 353/354 variables, and 152 constraints, problems are : Problem set: 0 solved, 275 unsolved in 7573 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 101/101 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 275/275 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 275 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 3 (OVERLAPS) 252/353 variables, 101/117 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/353 variables, 35/152 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/353 variables, 275/427 constraints. Problems are: Problem set: 0 solved, 275 unsolved
[2024-06-02 20:21:02] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/353 variables, 1/428 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/353 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 8 (OVERLAPS) 0/353 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 275 unsolved
No progress, stopping.
After SMT solving in domain Int declared 353/354 variables, and 428 constraints, problems are : Problem set: 0 solved, 275 unsolved in 13540 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 101/101 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 275/275 constraints, Known Traps: 9/9 constraints]
After SMT, in 21255ms problems are : Problem set: 0 solved, 275 unsolved
Search for dead transitions found 0 dead transitions in 21258ms
Starting structural reductions in SI_CTL mode, iteration 1 : 101/112 places, 278/297 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 21973 ms. Remains : 101/112 places, 278/297 transitions.
[2024-06-02 20:21:13] [INFO ] Flatten gal took : 24 ms
[2024-06-02 20:21:13] [INFO ] Flatten gal took : 25 ms
[2024-06-02 20:21:13] [INFO ] Input system was already deterministic with 278 transitions.
[2024-06-02 20:21:13] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:21:13] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:21:13] [INFO ] Time to serialize gal into /tmp/CTLFireability8283393276640171320.gal : 29 ms
[2024-06-02 20:21:13] [INFO ] Time to serialize properties into /tmp/CTLFireability5517343589474850700.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8283393276640171320.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5517343589474850700.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.07891e+06,0.836413,33656,2,2732,5,88705,6,0,682,95997,0


Converting to forward existential form...Done !
original formula: AF(AG((EF(((p5==1)&&(p27==1))) + AF(((p7==0)||(p49==0))))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !((E(TRUE U ((p5==1)&&(p27==1))) + !(EG(!(((p7==0)||(p49==0)))))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t3, t6, t7, t9, t14, t15, t16, t17, t18, t20, t22, t27, t28, t29, t30, t31, t33, t35,...542
Detected timeout of ITS tools.
[2024-06-02 20:21:43] [INFO ] Flatten gal took : 11 ms
[2024-06-02 20:21:43] [INFO ] Applying decomposition
[2024-06-02 20:21:43] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph7203882734312384676.txt' '-o' '/tmp/graph7203882734312384676.bin' '-w' '/tmp/graph7203882734312384676.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7203882734312384676.bin' '-l' '-1' '-v' '-w' '/tmp/graph7203882734312384676.weights' '-q' '0' '-e' '0.001'
[2024-06-02 20:21:43] [INFO ] Decomposing Gal with order
[2024-06-02 20:21:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 20:21:43] [INFO ] Removed a total of 406 redundant transitions.
[2024-06-02 20:21:43] [INFO ] Flatten gal took : 47 ms
[2024-06-02 20:21:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 63 labels/synchronizations in 22 ms.
[2024-06-02 20:21:43] [INFO ] Time to serialize gal into /tmp/CTLFireability5059912819683446801.gal : 6 ms
[2024-06-02 20:21:43] [INFO ] Time to serialize properties into /tmp/CTLFireability14676176242098883316.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5059912819683446801.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14676176242098883316.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.07891e+06,20.0604,499376,2015,121,581652,1655,497,3.45615e+06,86,15299,0


Converting to forward existential form...Done !
original formula: AF(AG((EF(((i2.u7.p5==1)&&(i2.u9.p27==1))) + AF(((i5.u2.p7==0)||(i3.u17.p49==0))))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !((E(TRUE U ((i2.u7.p5==1)&&(i2.u9.p27==1))) + !(EG(!(((i5.u2.p7==0)||(i3.u17.p49==0))))...171
Reverse transition relation is NOT exact ! Due to transitions t1, t43, t49, t50, t59, t64, t69, t74, t79, t93, t95, t131, t140, t145, t147, t148, t149, t15...686
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 297/297 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 109 transition count 289
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 109 transition count 289
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 107 transition count 285
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 107 transition count 285
Applied a total of 10 rules in 3 ms. Remains 107 /112 variables (removed 5) and now considering 285/297 (removed 12) transitions.
[2024-06-02 20:22:13] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
// Phase 1: matrix 259 rows 107 cols
[2024-06-02 20:22:13] [INFO ] Computed 9 invariants in 1 ms
[2024-06-02 20:22:14] [INFO ] Implicit Places using invariants in 358 ms returned []
[2024-06-02 20:22:14] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
[2024-06-02 20:22:14] [INFO ] Invariant cache hit.
[2024-06-02 20:22:14] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-06-02 20:22:14] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 561 ms to find 0 implicit places.
Running 284 sub problems to find dead transitions.
[2024-06-02 20:22:14] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
[2024-06-02 20:22:14] [INFO ] Invariant cache hit.
[2024-06-02 20:22:14] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 284 unsolved
[2024-06-02 20:22:15] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 1 ms to minimize.
[2024-06-02 20:22:15] [INFO ] Deduced a trap composed of 36 places in 51 ms of which 0 ms to minimize.
[2024-06-02 20:22:16] [INFO ] Deduced a trap composed of 40 places in 60 ms of which 1 ms to minimize.
[2024-06-02 20:22:16] [INFO ] Deduced a trap composed of 41 places in 69 ms of which 1 ms to minimize.
[2024-06-02 20:22:16] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 1 ms to minimize.
[2024-06-02 20:22:16] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 1 ms to minimize.
[2024-06-02 20:22:16] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-06-02 20:22:16] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-06-02 20:22:16] [INFO ] Deduced a trap composed of 36 places in 39 ms of which 1 ms to minimize.
[2024-06-02 20:22:16] [INFO ] Deduced a trap composed of 36 places in 60 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 4 (OVERLAPS) 258/365 variables, 107/126 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/365 variables, 38/164 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 7 (OVERLAPS) 1/366 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/366 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 9 (OVERLAPS) 0/366 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 284 unsolved
No progress, stopping.
After SMT solving in domain Real declared 366/366 variables, and 165 constraints, problems are : Problem set: 0 solved, 284 unsolved in 11659 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 107/107 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 284/284 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 284 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 284 unsolved
[2024-06-02 20:22:26] [INFO ] Deduced a trap composed of 38 places in 51 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 5 (OVERLAPS) 258/365 variables, 107/127 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 38/165 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 284/449 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/365 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 9 (OVERLAPS) 1/366 variables, 1/450 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/366 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 11 (OVERLAPS) 0/366 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 284 unsolved
No progress, stopping.
After SMT solving in domain Int declared 366/366 variables, and 450 constraints, problems are : Problem set: 0 solved, 284 unsolved in 20122 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 107/107 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 284/284 constraints, Known Traps: 11/11 constraints]
After SMT, in 31938ms problems are : Problem set: 0 solved, 284 unsolved
Search for dead transitions found 0 dead transitions in 31940ms
Starting structural reductions in LTL mode, iteration 1 : 107/112 places, 285/297 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32511 ms. Remains : 107/112 places, 285/297 transitions.
[2024-06-02 20:22:46] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:22:46] [INFO ] Flatten gal took : 8 ms
[2024-06-02 20:22:46] [INFO ] Input system was already deterministic with 285 transitions.
[2024-06-02 20:22:46] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:22:46] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:22:46] [INFO ] Time to serialize gal into /tmp/CTLFireability7945427892540257632.gal : 2 ms
[2024-06-02 20:22:46] [INFO ] Time to serialize properties into /tmp/CTLFireability9101341904348863097.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7945427892540257632.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9101341904348863097.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.45564e+06,2.42572,76452,2,4437,5,220184,6,0,710,221203,0


Converting to forward existential form...Done !
original formula: ((EF(EG(AG((p54==1)))) + AX(((p10==1)&&(p66==1)))) + AG(((AX(((p5==1)&&(p73==1))) * AG((p1==0))) * (AG((p76==0)) * (p23==0)))))
=> equivalent forward existential formula: (([(EY(FwdU((Init * !((E(TRUE U EG(!(E(TRUE U !((p54==1)))))) + !(EX(!(((p10==1)&&(p66==1)))))))),TRUE)) * !(((p...582
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t6, t10, t11, t13, t18, t19, t20, t21, t22, t24, t26, t31, t32, t33, t34, t35...578
(forward)formula 0,0,7.00356,178328,1,0,514,651681,601,267,6266,666537,588
FORMULA FireWire-PT-03-CTLFireability-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 112/112 places, 297/297 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 112 transition count 296
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 111 transition count 296
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 5 place count 108 transition count 288
Iterating global reduction 0 with 3 rules applied. Total rules applied 8 place count 108 transition count 288
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 106 transition count 284
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 106 transition count 284
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 104 transition count 282
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 104 transition count 280
Applied a total of 18 rules in 34 ms. Remains 104 /112 variables (removed 8) and now considering 280/297 (removed 17) transitions.
[2024-06-02 20:22:53] [INFO ] Flow matrix only has 255 transitions (discarded 25 similar events)
// Phase 1: matrix 255 rows 104 cols
[2024-06-02 20:22:53] [INFO ] Computed 9 invariants in 1 ms
[2024-06-02 20:22:53] [INFO ] Implicit Places using invariants in 100 ms returned [103]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 117 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 103/112 places, 280/297 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 103 transition count 279
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 102 transition count 279
Applied a total of 2 rules in 6 ms. Remains 102 /103 variables (removed 1) and now considering 279/280 (removed 1) transitions.
[2024-06-02 20:22:53] [INFO ] Flow matrix only has 254 transitions (discarded 25 similar events)
// Phase 1: matrix 254 rows 102 cols
[2024-06-02 20:22:53] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 20:22:54] [INFO ] Implicit Places using invariants in 607 ms returned []
[2024-06-02 20:22:54] [INFO ] Flow matrix only has 254 transitions (discarded 25 similar events)
[2024-06-02 20:22:54] [INFO ] Invariant cache hit.
[2024-06-02 20:22:54] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-02 20:22:54] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 746 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 102/112 places, 279/297 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 904 ms. Remains : 102/112 places, 279/297 transitions.
[2024-06-02 20:22:54] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:22:54] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:22:54] [INFO ] Input system was already deterministic with 279 transitions.
[2024-06-02 20:22:54] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:22:54] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:22:54] [INFO ] Time to serialize gal into /tmp/CTLFireability5136174289437327636.gal : 1 ms
[2024-06-02 20:22:54] [INFO ] Time to serialize properties into /tmp/CTLFireability1059600418166904159.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5136174289437327636.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1059600418166904159.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.07891e+06,1.16945,40020,2,3095,5,103575,6,0,686,116427,0


Converting to forward existential form...Done !
original formula: EF(EG((AG(((p7==1)&&(p73==1))) * ((A(((p7==1)&&(p33==1)) U ((p6==1)&&(p47==1))) + AG(((p9==1)&&(p100==1)))) + ((p27==1)||(p7==1))))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),(!(E(TRUE U !(((p7==1)&&(p73==1))))) * ((!((E(!(((p6==1)&&(p47==1))) U (!(((p7==1)&&(p33==...292
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t3, t6, t7, t9, t14, t15, t16, t17, t18, t20, t22, t27, t28, t29, t30, t31, t33, t35,...542
(forward)formula 0,0,27.1631,767472,1,0,679,4.43414e+06,596,351,5938,4.13013e+06,791
FORMULA FireWire-PT-03-CTLFireability-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 297/297 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 109 transition count 289
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 109 transition count 289
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 107 transition count 285
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 107 transition count 285
Applied a total of 10 rules in 7 ms. Remains 107 /112 variables (removed 5) and now considering 285/297 (removed 12) transitions.
[2024-06-02 20:23:21] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
// Phase 1: matrix 259 rows 107 cols
[2024-06-02 20:23:21] [INFO ] Computed 9 invariants in 2 ms
[2024-06-02 20:23:21] [INFO ] Implicit Places using invariants in 121 ms returned []
[2024-06-02 20:23:21] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
[2024-06-02 20:23:21] [INFO ] Invariant cache hit.
[2024-06-02 20:23:21] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-06-02 20:23:22] [INFO ] Implicit Places using invariants and state equation in 216 ms returned []
Implicit Place search using SMT with State Equation took 359 ms to find 0 implicit places.
Running 284 sub problems to find dead transitions.
[2024-06-02 20:23:22] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
[2024-06-02 20:23:22] [INFO ] Invariant cache hit.
[2024-06-02 20:23:22] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 284 unsolved
[2024-06-02 20:23:23] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
[2024-06-02 20:23:23] [INFO ] Deduced a trap composed of 36 places in 33 ms of which 0 ms to minimize.
[2024-06-02 20:23:23] [INFO ] Deduced a trap composed of 40 places in 46 ms of which 1 ms to minimize.
[2024-06-02 20:23:23] [INFO ] Deduced a trap composed of 41 places in 70 ms of which 1 ms to minimize.
[2024-06-02 20:23:23] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 1 ms to minimize.
[2024-06-02 20:23:23] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 1 ms to minimize.
[2024-06-02 20:23:23] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 1 ms to minimize.
[2024-06-02 20:23:24] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 0 ms to minimize.
[2024-06-02 20:23:24] [INFO ] Deduced a trap composed of 36 places in 36 ms of which 1 ms to minimize.
[2024-06-02 20:23:24] [INFO ] Deduced a trap composed of 36 places in 60 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 4 (OVERLAPS) 258/365 variables, 107/126 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/365 variables, 38/164 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 7 (OVERLAPS) 1/366 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/366 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 9 (OVERLAPS) 0/366 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 284 unsolved
No progress, stopping.
After SMT solving in domain Real declared 366/366 variables, and 165 constraints, problems are : Problem set: 0 solved, 284 unsolved in 11616 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 107/107 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 284/284 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 284 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 284 unsolved
[2024-06-02 20:23:34] [INFO ] Deduced a trap composed of 38 places in 67 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 5 (OVERLAPS) 258/365 variables, 107/127 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 38/165 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 284/449 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/365 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 9 (OVERLAPS) 1/366 variables, 1/450 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/366 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 11 (OVERLAPS) 0/366 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 284 unsolved
No progress, stopping.
After SMT solving in domain Int declared 366/366 variables, and 450 constraints, problems are : Problem set: 0 solved, 284 unsolved in 20064 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 107/107 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 284/284 constraints, Known Traps: 11/11 constraints]
After SMT, in 31859ms problems are : Problem set: 0 solved, 284 unsolved
Search for dead transitions found 0 dead transitions in 31861ms
Starting structural reductions in LTL mode, iteration 1 : 107/112 places, 285/297 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32229 ms. Remains : 107/112 places, 285/297 transitions.
[2024-06-02 20:23:53] [INFO ] Flatten gal took : 6 ms
[2024-06-02 20:23:53] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:23:53] [INFO ] Input system was already deterministic with 285 transitions.
[2024-06-02 20:23:53] [INFO ] Flatten gal took : 19 ms
[2024-06-02 20:23:54] [INFO ] Flatten gal took : 16 ms
[2024-06-02 20:23:54] [INFO ] Time to serialize gal into /tmp/CTLFireability17341142615913128821.gal : 6 ms
[2024-06-02 20:23:54] [INFO ] Time to serialize properties into /tmp/CTLFireability8760039788847820064.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17341142615913128821.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8760039788847820064.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.45564e+06,2.47624,76384,2,4437,5,220184,6,0,710,221203,0


Converting to forward existential form...Done !
original formula: AX(EF((p85==1)))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U (p85==1))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t6, t10, t11, t13, t18, t19, t20, t21, t22, t24, t26, t31, t32, t33, t34, t35...578
(forward)formula 0,1,14.8156,364124,1,0,580,1.75147e+06,588,299,6005,1.32598e+06,672
FORMULA FireWire-PT-03-CTLFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 297/297 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 110 transition count 292
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 110 transition count 292
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 109 transition count 290
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 109 transition count 290
Applied a total of 6 rules in 2 ms. Remains 109 /112 variables (removed 3) and now considering 290/297 (removed 7) transitions.
[2024-06-02 20:24:08] [INFO ] Flow matrix only has 264 transitions (discarded 26 similar events)
// Phase 1: matrix 264 rows 109 cols
[2024-06-02 20:24:08] [INFO ] Computed 9 invariants in 1 ms
[2024-06-02 20:24:09] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-06-02 20:24:09] [INFO ] Flow matrix only has 264 transitions (discarded 26 similar events)
[2024-06-02 20:24:09] [INFO ] Invariant cache hit.
[2024-06-02 20:24:09] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 20:24:09] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 253 ms to find 0 implicit places.
Running 289 sub problems to find dead transitions.
[2024-06-02 20:24:09] [INFO ] Flow matrix only has 264 transitions (discarded 26 similar events)
[2024-06-02 20:24:09] [INFO ] Invariant cache hit.
[2024-06-02 20:24:09] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (OVERLAPS) 1/109 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-06-02 20:24:10] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2024-06-02 20:24:10] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
[2024-06-02 20:24:10] [INFO ] Deduced a trap composed of 36 places in 50 ms of which 1 ms to minimize.
[2024-06-02 20:24:10] [INFO ] Deduced a trap composed of 22 places in 72 ms of which 1 ms to minimize.
[2024-06-02 20:24:11] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 1 ms to minimize.
[2024-06-02 20:24:11] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 1 ms to minimize.
[2024-06-02 20:24:11] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 0 ms to minimize.
[2024-06-02 20:24:11] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 4 (OVERLAPS) 263/372 variables, 109/126 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/372 variables, 39/165 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/372 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 7 (OVERLAPS) 1/373 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/373 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 9 (OVERLAPS) 0/373 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 289 unsolved
No progress, stopping.
After SMT solving in domain Real declared 373/373 variables, and 166 constraints, problems are : Problem set: 0 solved, 289 unsolved in 11969 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 109/109 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 289/289 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 289 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (OVERLAPS) 1/109 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 4 (OVERLAPS) 263/372 variables, 109/126 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/372 variables, 39/165 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/372 variables, 289/454 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/372 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 8 (OVERLAPS) 1/373 variables, 1/455 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/373 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 10 (OVERLAPS) 0/373 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 289 unsolved
No progress, stopping.
After SMT solving in domain Int declared 373/373 variables, and 455 constraints, problems are : Problem set: 0 solved, 289 unsolved in 16156 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 109/109 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 289/289 constraints, Known Traps: 8/8 constraints]
After SMT, in 28265ms problems are : Problem set: 0 solved, 289 unsolved
Search for dead transitions found 0 dead transitions in 28269ms
Starting structural reductions in LTL mode, iteration 1 : 109/112 places, 290/297 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28524 ms. Remains : 109/112 places, 290/297 transitions.
[2024-06-02 20:24:37] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:24:37] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:24:37] [INFO ] Input system was already deterministic with 290 transitions.
[2024-06-02 20:24:37] [INFO ] Flatten gal took : 11 ms
[2024-06-02 20:24:37] [INFO ] Flatten gal took : 6 ms
[2024-06-02 20:24:37] [INFO ] Time to serialize gal into /tmp/CTLFireability16727786127198055295.gal : 15 ms
[2024-06-02 20:24:37] [INFO ] Time to serialize properties into /tmp/CTLFireability10499924061532825208.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16727786127198055295.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10499924061532825208.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.7602e+06,1.08193,38256,2,3567,5,99997,6,0,723,112627,0


Converting to forward existential form...Done !
original formula: EX(EF(((EF((((p3==1)&&(p53==1))||(p24==1))) * (p8==1)) * (p52==1))))
=> equivalent forward existential formula: [(FwdU(((FwdU(EY(Init),TRUE) * (p52==1)) * (p8==1)),TRUE) * (((p3==1)&&(p53==1))||(p24==1)))] != FALSE
(forward)formula 0,1,2.26094,49764,1,0,13,135363,11,3,1441,163162,8
FORMULA FireWire-PT-03-CTLFireability-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 297/297 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 109 transition count 289
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 109 transition count 289
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 107 transition count 285
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 107 transition count 285
Applied a total of 10 rules in 4 ms. Remains 107 /112 variables (removed 5) and now considering 285/297 (removed 12) transitions.
[2024-06-02 20:24:39] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
// Phase 1: matrix 259 rows 107 cols
[2024-06-02 20:24:39] [INFO ] Computed 9 invariants in 2 ms
[2024-06-02 20:24:39] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-06-02 20:24:39] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
[2024-06-02 20:24:39] [INFO ] Invariant cache hit.
[2024-06-02 20:24:39] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-06-02 20:24:40] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 233 ms to find 0 implicit places.
Running 284 sub problems to find dead transitions.
[2024-06-02 20:24:40] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
[2024-06-02 20:24:40] [INFO ] Invariant cache hit.
[2024-06-02 20:24:40] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 284 unsolved
[2024-06-02 20:24:41] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2024-06-02 20:24:41] [INFO ] Deduced a trap composed of 36 places in 36 ms of which 1 ms to minimize.
[2024-06-02 20:24:41] [INFO ] Deduced a trap composed of 40 places in 65 ms of which 1 ms to minimize.
[2024-06-02 20:24:41] [INFO ] Deduced a trap composed of 41 places in 58 ms of which 1 ms to minimize.
[2024-06-02 20:24:41] [INFO ] Deduced a trap composed of 22 places in 70 ms of which 0 ms to minimize.
[2024-06-02 20:24:41] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 1 ms to minimize.
[2024-06-02 20:24:41] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 1 ms to minimize.
[2024-06-02 20:24:42] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 0 ms to minimize.
[2024-06-02 20:24:42] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
[2024-06-02 20:24:42] [INFO ] Deduced a trap composed of 36 places in 71 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 4 (OVERLAPS) 258/365 variables, 107/126 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/365 variables, 38/164 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 7 (OVERLAPS) 1/366 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/366 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 9 (OVERLAPS) 0/366 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 284 unsolved
No progress, stopping.
After SMT solving in domain Real declared 366/366 variables, and 165 constraints, problems are : Problem set: 0 solved, 284 unsolved in 11610 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 107/107 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 284/284 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 284 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 284 unsolved
[2024-06-02 20:24:52] [INFO ] Deduced a trap composed of 38 places in 57 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 5 (OVERLAPS) 258/365 variables, 107/127 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 38/165 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 284/449 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/365 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 9 (OVERLAPS) 1/366 variables, 1/450 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/366 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 11 (OVERLAPS) 0/366 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 284 unsolved
No progress, stopping.
After SMT solving in domain Int declared 366/366 variables, and 450 constraints, problems are : Problem set: 0 solved, 284 unsolved in 19874 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 107/107 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 284/284 constraints, Known Traps: 11/11 constraints]
After SMT, in 31627ms problems are : Problem set: 0 solved, 284 unsolved
Search for dead transitions found 0 dead transitions in 31630ms
Starting structural reductions in LTL mode, iteration 1 : 107/112 places, 285/297 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31869 ms. Remains : 107/112 places, 285/297 transitions.
[2024-06-02 20:25:11] [INFO ] Flatten gal took : 14 ms
[2024-06-02 20:25:11] [INFO ] Flatten gal took : 11 ms
[2024-06-02 20:25:11] [INFO ] Input system was already deterministic with 285 transitions.
[2024-06-02 20:25:11] [INFO ] Flatten gal took : 27 ms
[2024-06-02 20:25:11] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:25:11] [INFO ] Time to serialize gal into /tmp/CTLFireability8654544275271591542.gal : 4 ms
[2024-06-02 20:25:11] [INFO ] Time to serialize properties into /tmp/CTLFireability8694680527486555552.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8654544275271591542.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8694680527486555552.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.45564e+06,2.43667,76388,2,4437,5,220184,6,0,710,221203,0


Converting to forward existential form...Done !
original formula: AF(AX((AF(((p11==1)&&(p100==1))) + A(((p7==1)&&(p24==1)) U ((p3==1)&&(p89==1))))))
=> equivalent forward existential formula: [FwdG(Init,!(!(EX(!((!(EG(!(((p11==1)&&(p100==1))))) + !((E(!(((p3==1)&&(p89==1))) U (!(((p7==1)&&(p24==1))) * !...224
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t6, t10, t11, t13, t18, t19, t20, t21, t22, t24, t26, t31, t32, t33, t34, t35...578
Detected timeout of ITS tools.
[2024-06-02 20:25:41] [INFO ] Flatten gal took : 11 ms
[2024-06-02 20:25:41] [INFO ] Applying decomposition
[2024-06-02 20:25:41] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph9826570544204097976.txt' '-o' '/tmp/graph9826570544204097976.bin' '-w' '/tmp/graph9826570544204097976.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9826570544204097976.bin' '-l' '-1' '-v' '-w' '/tmp/graph9826570544204097976.weights' '-q' '0' '-e' '0.001'
[2024-06-02 20:25:41] [INFO ] Decomposing Gal with order
[2024-06-02 20:25:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 20:25:41] [INFO ] Removed a total of 408 redundant transitions.
[2024-06-02 20:25:41] [INFO ] Flatten gal took : 14 ms
[2024-06-02 20:25:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 66 labels/synchronizations in 5 ms.
[2024-06-02 20:25:41] [INFO ] Time to serialize gal into /tmp/CTLFireability3676586925139122081.gal : 6 ms
[2024-06-02 20:25:41] [INFO ] Time to serialize properties into /tmp/CTLFireability16113244456544275561.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3676586925139122081.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16113244456544275561.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.45564e+06,7.22447,250768,1346,192,270517,9003,615,2.06028e+06,93,73535,0


Converting to forward existential form...Done !
original formula: AF(AX((AF(((i0.i1.u3.p11==1)&&(i0.i1.u3.p100==1))) + A(((i2.u2.p7==1)&&(i1.u7.p24==1)) U ((i0.i0.u1.p3==1)&&(i3.u29.p89==1))))))
=> equivalent forward existential formula: [FwdG(Init,!(!(EX(!((!(EG(!(((i0.i1.u3.p11==1)&&(i0.i1.u3.p100==1))))) + !((E(!(((i0.i0.u1.p3==1)&&(i3.u29.p89==...302
Reverse transition relation is NOT exact ! Due to transitions t4, t47, t49, t53, t54, t62, t63, t68, t73, t78, t83, t97, t99, t100, t101, t102, t139, t148,...780
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 297/297 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 111 transition count 295
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 111 transition count 295
Applied a total of 2 rules in 2 ms. Remains 111 /112 variables (removed 1) and now considering 295/297 (removed 2) transitions.
[2024-06-02 20:26:12] [INFO ] Flow matrix only has 269 transitions (discarded 26 similar events)
// Phase 1: matrix 269 rows 111 cols
[2024-06-02 20:26:12] [INFO ] Computed 9 invariants in 4 ms
[2024-06-02 20:26:12] [INFO ] Implicit Places using invariants in 332 ms returned []
[2024-06-02 20:26:12] [INFO ] Flow matrix only has 269 transitions (discarded 26 similar events)
[2024-06-02 20:26:12] [INFO ] Invariant cache hit.
[2024-06-02 20:26:12] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-06-02 20:26:12] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 470 ms to find 0 implicit places.
Running 294 sub problems to find dead transitions.
[2024-06-02 20:26:12] [INFO ] Flow matrix only has 269 transitions (discarded 26 similar events)
[2024-06-02 20:26:12] [INFO ] Invariant cache hit.
[2024-06-02 20:26:12] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 1 (OVERLAPS) 1/111 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 294 unsolved
[2024-06-02 20:26:13] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
[2024-06-02 20:26:13] [INFO ] Deduced a trap composed of 36 places in 33 ms of which 1 ms to minimize.
[2024-06-02 20:26:14] [INFO ] Deduced a trap composed of 37 places in 47 ms of which 1 ms to minimize.
[2024-06-02 20:26:14] [INFO ] Deduced a trap composed of 22 places in 71 ms of which 1 ms to minimize.
[2024-06-02 20:26:14] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-06-02 20:26:14] [INFO ] Deduced a trap composed of 17 places in 20 ms of which 0 ms to minimize.
[2024-06-02 20:26:14] [INFO ] Deduced a trap composed of 17 places in 19 ms of which 1 ms to minimize.
[2024-06-02 20:26:14] [INFO ] Deduced a trap composed of 36 places in 57 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 4 (OVERLAPS) 268/379 variables, 111/128 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/379 variables, 40/168 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/379 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 7 (OVERLAPS) 1/380 variables, 1/169 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/380 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 9 (OVERLAPS) 0/380 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 294 unsolved
No progress, stopping.
After SMT solving in domain Real declared 380/380 variables, and 169 constraints, problems are : Problem set: 0 solved, 294 unsolved in 12126 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 111/111 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 294/294 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 294 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 1 (OVERLAPS) 1/111 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 4 (OVERLAPS) 268/379 variables, 111/128 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/379 variables, 40/168 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/379 variables, 294/462 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/379 variables, 0/462 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 8 (OVERLAPS) 1/380 variables, 1/463 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/380 variables, 0/463 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 10 (OVERLAPS) 0/380 variables, 0/463 constraints. Problems are: Problem set: 0 solved, 294 unsolved
No progress, stopping.
After SMT solving in domain Int declared 380/380 variables, and 463 constraints, problems are : Problem set: 0 solved, 294 unsolved in 15284 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 111/111 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 294/294 constraints, Known Traps: 8/8 constraints]
After SMT, in 27565ms problems are : Problem set: 0 solved, 294 unsolved
Search for dead transitions found 0 dead transitions in 27570ms
Starting structural reductions in LTL mode, iteration 1 : 111/112 places, 295/297 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28042 ms. Remains : 111/112 places, 295/297 transitions.
[2024-06-02 20:26:40] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:26:40] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:26:40] [INFO ] Input system was already deterministic with 295 transitions.
[2024-06-02 20:26:40] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:26:40] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:26:40] [INFO ] Time to serialize gal into /tmp/CTLFireability13523398275596005521.gal : 1 ms
[2024-06-02 20:26:40] [INFO ] Time to serialize properties into /tmp/CTLFireability6619623970939372486.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13523398275596005521.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6619623970939372486.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.07872e+06,2.63587,73004,2,4249,5,216277,6,0,736,208203,0


Converting to forward existential form...Done !
original formula: E((EG(AF(EX(((p7==1)&&(p56==1))))) * !(AF(AG(((p11==1)&&(p82==1)))))) U (!(((p87==1) * ((((p2==1)&&(p52==1)) + EG(((p103==1)&&(p108==1)))...364
=> equivalent forward existential formula: (([((FwdU(Init,(EG(!(EG(!(EX(((p7==1)&&(p56==1))))))) * !(!(EG(!(!(E(TRUE U !(((p11==1)&&(p82==1))))))))))) * !(...1299
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t6, t10, t11, t13, t18, t19, t20, t21, t22, t24, t26, t31, t32, t33, t34, t35...602
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Detected timeout of ITS tools.
[2024-06-02 20:27:10] [INFO ] Flatten gal took : 11 ms
[2024-06-02 20:27:10] [INFO ] Applying decomposition
[2024-06-02 20:27:10] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph13046330240294653263.txt' '-o' '/tmp/graph13046330240294653263.bin' '-w' '/tmp/graph13046330240294653263.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13046330240294653263.bin' '-l' '-1' '-v' '-w' '/tmp/graph13046330240294653263.weights' '-q' '0' '-e' '0.001'
[2024-06-02 20:27:10] [INFO ] Decomposing Gal with order
[2024-06-02 20:27:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 20:27:10] [INFO ] Removed a total of 432 redundant transitions.
[2024-06-02 20:27:10] [INFO ] Flatten gal took : 14 ms
[2024-06-02 20:27:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 78 labels/synchronizations in 6 ms.
[2024-06-02 20:27:10] [INFO ] Time to serialize gal into /tmp/CTLFireability13488527193596994550.gal : 2 ms
[2024-06-02 20:27:10] [INFO ] Time to serialize properties into /tmp/CTLFireability7115777905136609631.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13488527193596994550.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7115777905136609631.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.07872e+06,3.2014,97400,1287,193,120712,1696,559,529489,87,17050,0


Converting to forward existential form...Done !
original formula: E((EG(AF(EX(((i3.u2.p7==1)&&(i3.u16.p56==1))))) * !(AF(AG(((i4.u3.p11==1)&&(i5.u27.p82==1)))))) U (!(((i0.u29.p87==1) * ((((i0.u0.p2==1)&...535
=> equivalent forward existential formula: (([((FwdU(Init,(EG(!(EG(!(EX(((i3.u2.p7==1)&&(i3.u16.p56==1))))))) * !(!(EG(!(!(E(TRUE U !(((i4.u3.p11==1)&&(i5....1779
Reverse transition relation is NOT exact ! Due to transitions t4, t47, t49, t50, t53, t54, t57, t59, t62, t63, t68, t73, t78, t83, t97, t99, t100, t101, t1...764
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found a local SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 297/297 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 109 transition count 289
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 109 transition count 289
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 108 transition count 287
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 108 transition count 287
Applied a total of 8 rules in 2 ms. Remains 108 /112 variables (removed 4) and now considering 287/297 (removed 10) transitions.
[2024-06-02 20:27:40] [INFO ] Flow matrix only has 261 transitions (discarded 26 similar events)
// Phase 1: matrix 261 rows 108 cols
[2024-06-02 20:27:40] [INFO ] Computed 9 invariants in 2 ms
[2024-06-02 20:27:40] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-06-02 20:27:40] [INFO ] Flow matrix only has 261 transitions (discarded 26 similar events)
[2024-06-02 20:27:40] [INFO ] Invariant cache hit.
[2024-06-02 20:27:40] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-06-02 20:27:40] [INFO ] Implicit Places using invariants and state equation in 236 ms returned []
Implicit Place search using SMT with State Equation took 302 ms to find 0 implicit places.
Running 286 sub problems to find dead transitions.
[2024-06-02 20:27:40] [INFO ] Flow matrix only has 261 transitions (discarded 26 similar events)
[2024-06-02 20:27:40] [INFO ] Invariant cache hit.
[2024-06-02 20:27:40] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 1 (OVERLAPS) 1/108 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 286 unsolved
[2024-06-02 20:27:41] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2024-06-02 20:27:41] [INFO ] Deduced a trap composed of 36 places in 31 ms of which 1 ms to minimize.
[2024-06-02 20:27:42] [INFO ] Deduced a trap composed of 38 places in 63 ms of which 1 ms to minimize.
[2024-06-02 20:27:42] [INFO ] Deduced a trap composed of 39 places in 55 ms of which 1 ms to minimize.
[2024-06-02 20:27:42] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 1 ms to minimize.
[2024-06-02 20:27:42] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 1 ms to minimize.
[2024-06-02 20:27:42] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-06-02 20:27:42] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 0 ms to minimize.
[2024-06-02 20:27:42] [INFO ] Deduced a trap composed of 36 places in 39 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 9/18 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 4 (OVERLAPS) 260/368 variables, 108/126 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/368 variables, 38/164 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/368 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 7 (OVERLAPS) 1/369 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 286 unsolved
[2024-06-02 20:27:47] [INFO ] Deduced a trap composed of 57 places in 58 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/369 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/369 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 10 (OVERLAPS) 0/369 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 286 unsolved
No progress, stopping.
After SMT solving in domain Real declared 369/369 variables, and 166 constraints, problems are : Problem set: 0 solved, 286 unsolved in 13319 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 108/108 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 286/286 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 286 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 1 (OVERLAPS) 1/108 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 4 (OVERLAPS) 260/368 variables, 108/127 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/368 variables, 38/165 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/368 variables, 286/451 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/368 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 8 (OVERLAPS) 1/369 variables, 1/452 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/369 variables, 0/452 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 10 (OVERLAPS) 0/369 variables, 0/452 constraints. Problems are: Problem set: 0 solved, 286 unsolved
No progress, stopping.
After SMT solving in domain Int declared 369/369 variables, and 452 constraints, problems are : Problem set: 0 solved, 286 unsolved in 18481 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 108/108 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 286/286 constraints, Known Traps: 10/10 constraints]
After SMT, in 31938ms problems are : Problem set: 0 solved, 286 unsolved
Search for dead transitions found 0 dead transitions in 31940ms
Starting structural reductions in LTL mode, iteration 1 : 108/112 places, 287/297 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32249 ms. Remains : 108/112 places, 287/297 transitions.
[2024-06-02 20:28:12] [INFO ] Flatten gal took : 6 ms
[2024-06-02 20:28:12] [INFO ] Flatten gal took : 6 ms
[2024-06-02 20:28:12] [INFO ] Input system was already deterministic with 287 transitions.
[2024-06-02 20:28:12] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:28:12] [INFO ] Flatten gal took : 6 ms
[2024-06-02 20:28:12] [INFO ] Time to serialize gal into /tmp/CTLFireability6970864318448910719.gal : 4 ms
[2024-06-02 20:28:12] [INFO ] Time to serialize properties into /tmp/CTLFireability16085510549919847099.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6970864318448910719.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16085510549919847099.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.60248e+06,1.19448,41776,2,3598,5,107671,6,0,716,121327,0


Converting to forward existential form...Done !
original formula: AG(AX((AG(((p7==0)||(p76==0))) + (!(A(((p3==1)&&(p37==1)) U (p26==1))) * EF(((p6==0)||(p56==0)))))))
=> equivalent forward existential formula: [(FwdU((EY(FwdU(Init,TRUE)) * !((!(!((E(!((p26==1)) U (!(((p3==1)&&(p37==1))) * !((p26==1)))) + EG(!((p26==1))))...233
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t6, t10, t11, t13, t18, t19, t20, t21, t22, t24, t26, t31, t32, t33, t34, t35...578
(forward)formula 0,0,27.3654,766108,1,0,732,4.37698e+06,607,375,6200,4.21512e+06,837
FORMULA FireWire-PT-03-CTLFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 297/297 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 110 transition count 291
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 110 transition count 291
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 108 transition count 287
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 108 transition count 287
Applied a total of 8 rules in 6 ms. Remains 108 /112 variables (removed 4) and now considering 287/297 (removed 10) transitions.
[2024-06-02 20:28:40] [INFO ] Flow matrix only has 261 transitions (discarded 26 similar events)
// Phase 1: matrix 261 rows 108 cols
[2024-06-02 20:28:40] [INFO ] Computed 9 invariants in 4 ms
[2024-06-02 20:28:40] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-06-02 20:28:40] [INFO ] Flow matrix only has 261 transitions (discarded 26 similar events)
[2024-06-02 20:28:40] [INFO ] Invariant cache hit.
[2024-06-02 20:28:40] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-06-02 20:28:40] [INFO ] Implicit Places using invariants and state equation in 234 ms returned []
Implicit Place search using SMT with State Equation took 309 ms to find 0 implicit places.
Running 286 sub problems to find dead transitions.
[2024-06-02 20:28:40] [INFO ] Flow matrix only has 261 transitions (discarded 26 similar events)
[2024-06-02 20:28:40] [INFO ] Invariant cache hit.
[2024-06-02 20:28:40] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 1 (OVERLAPS) 1/108 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 286 unsolved
[2024-06-02 20:28:41] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
[2024-06-02 20:28:41] [INFO ] Deduced a trap composed of 37 places in 47 ms of which 1 ms to minimize.
[2024-06-02 20:28:42] [INFO ] Deduced a trap composed of 40 places in 66 ms of which 1 ms to minimize.
[2024-06-02 20:28:42] [INFO ] Deduced a trap composed of 36 places in 67 ms of which 0 ms to minimize.
[2024-06-02 20:28:42] [INFO ] Deduced a trap composed of 22 places in 73 ms of which 1 ms to minimize.
[2024-06-02 20:28:42] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 1 ms to minimize.
[2024-06-02 20:28:42] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-06-02 20:28:42] [INFO ] Deduced a trap composed of 17 places in 21 ms of which 2 ms to minimize.
[2024-06-02 20:28:42] [INFO ] Deduced a trap composed of 37 places in 41 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 9/18 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 4 (OVERLAPS) 260/368 variables, 108/126 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/368 variables, 38/164 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/368 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 7 (OVERLAPS) 1/369 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/369 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 9 (OVERLAPS) 0/369 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 286 unsolved
No progress, stopping.
After SMT solving in domain Real declared 369/369 variables, and 165 constraints, problems are : Problem set: 0 solved, 286 unsolved in 12118 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 108/108 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 286/286 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 286 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 1 (OVERLAPS) 1/108 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 9/18 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 4 (OVERLAPS) 260/368 variables, 108/126 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/368 variables, 38/164 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/368 variables, 286/450 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/368 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 8 (OVERLAPS) 1/369 variables, 1/451 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/369 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 10 (OVERLAPS) 0/369 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 286 unsolved
No progress, stopping.
After SMT solving in domain Int declared 369/369 variables, and 451 constraints, problems are : Problem set: 0 solved, 286 unsolved in 14937 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 108/108 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 286/286 constraints, Known Traps: 9/9 constraints]
After SMT, in 27188ms problems are : Problem set: 0 solved, 286 unsolved
Search for dead transitions found 0 dead transitions in 27190ms
Starting structural reductions in LTL mode, iteration 1 : 108/112 places, 287/297 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27508 ms. Remains : 108/112 places, 287/297 transitions.
[2024-06-02 20:29:07] [INFO ] Flatten gal took : 8 ms
[2024-06-02 20:29:07] [INFO ] Flatten gal took : 6 ms
[2024-06-02 20:29:07] [INFO ] Input system was already deterministic with 287 transitions.
[2024-06-02 20:29:07] [INFO ] Flatten gal took : 6 ms
[2024-06-02 20:29:07] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:29:07] [INFO ] Time to serialize gal into /tmp/CTLFireability5535957747143830026.gal : 1 ms
[2024-06-02 20:29:07] [INFO ] Time to serialize properties into /tmp/CTLFireability9200045372455278128.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5535957747143830026.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9200045372455278128.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.5677e+06,1.05383,36556,2,3455,5,97647,6,0,716,108289,0


Converting to forward existential form...Done !
original formula: AF(EX(E(((!(((p7==1)&&(p33==1))) + AX((p83==1))) + E(((p7==1)&&(p33==1)) U ((p7==1)&&(p23==1)))) U (EF(((p7==1)&&(p85==1))) * E(((p8==1)&...193
=> equivalent forward existential formula: [FwdG(Init,!(EX(E(((!(((p7==1)&&(p33==1))) + !(EX(!((p83==1))))) + E(((p7==1)&&(p33==1)) U ((p7==1)&&(p23==1))))...250
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t6, t7, t8, t12, t13, t15, t20, t21, t22, t23, t24, t26, t28, t33, t34, t35, ...587
(forward)formula 0,1,17.6495,486248,1,0,793,2.7834e+06,614,452,6058,2.4266e+06,879
FORMULA FireWire-PT-03-CTLFireability-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 297/297 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 109 transition count 289
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 109 transition count 289
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 107 transition count 285
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 107 transition count 285
Applied a total of 10 rules in 2 ms. Remains 107 /112 variables (removed 5) and now considering 285/297 (removed 12) transitions.
[2024-06-02 20:29:25] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
// Phase 1: matrix 259 rows 107 cols
[2024-06-02 20:29:25] [INFO ] Computed 9 invariants in 3 ms
[2024-06-02 20:29:25] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-06-02 20:29:25] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
[2024-06-02 20:29:25] [INFO ] Invariant cache hit.
[2024-06-02 20:29:25] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-06-02 20:29:25] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 243 ms to find 0 implicit places.
Running 284 sub problems to find dead transitions.
[2024-06-02 20:29:25] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
[2024-06-02 20:29:25] [INFO ] Invariant cache hit.
[2024-06-02 20:29:25] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 284 unsolved
[2024-06-02 20:29:27] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
[2024-06-02 20:29:27] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 0 ms to minimize.
[2024-06-02 20:29:27] [INFO ] Deduced a trap composed of 40 places in 65 ms of which 1 ms to minimize.
[2024-06-02 20:29:27] [INFO ] Deduced a trap composed of 41 places in 77 ms of which 1 ms to minimize.
[2024-06-02 20:29:27] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 0 ms to minimize.
[2024-06-02 20:29:27] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 1 ms to minimize.
[2024-06-02 20:29:27] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 1 ms to minimize.
[2024-06-02 20:29:27] [INFO ] Deduced a trap composed of 17 places in 21 ms of which 1 ms to minimize.
[2024-06-02 20:29:28] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
[2024-06-02 20:29:28] [INFO ] Deduced a trap composed of 36 places in 66 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 4 (OVERLAPS) 258/365 variables, 107/126 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/365 variables, 38/164 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 7 (OVERLAPS) 1/366 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/366 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 9 (OVERLAPS) 0/366 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 284 unsolved
No progress, stopping.
After SMT solving in domain Real declared 366/366 variables, and 165 constraints, problems are : Problem set: 0 solved, 284 unsolved in 11591 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 107/107 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 284/284 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 284 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 284 unsolved
[2024-06-02 20:29:38] [INFO ] Deduced a trap composed of 38 places in 75 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 5 (OVERLAPS) 258/365 variables, 107/127 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 38/165 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 284/449 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/365 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 9 (OVERLAPS) 1/366 variables, 1/450 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/366 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 11 (OVERLAPS) 0/366 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 284 unsolved
No progress, stopping.
After SMT solving in domain Int declared 366/366 variables, and 450 constraints, problems are : Problem set: 0 solved, 284 unsolved in 20320 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 107/107 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 284/284 constraints, Known Traps: 11/11 constraints]
After SMT, in 32075ms problems are : Problem set: 0 solved, 284 unsolved
Search for dead transitions found 0 dead transitions in 32077ms
Starting structural reductions in LTL mode, iteration 1 : 107/112 places, 285/297 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32322 ms. Remains : 107/112 places, 285/297 transitions.
[2024-06-02 20:29:57] [INFO ] Flatten gal took : 6 ms
[2024-06-02 20:29:57] [INFO ] Flatten gal took : 6 ms
[2024-06-02 20:29:57] [INFO ] Input system was already deterministic with 285 transitions.
[2024-06-02 20:29:57] [INFO ] Flatten gal took : 6 ms
[2024-06-02 20:29:57] [INFO ] Flatten gal took : 6 ms
[2024-06-02 20:29:57] [INFO ] Time to serialize gal into /tmp/CTLFireability14584386487014410076.gal : 2 ms
[2024-06-02 20:29:57] [INFO ] Time to serialize properties into /tmp/CTLFireability9791417138686059470.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14584386487014410076.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9791417138686059470.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.45564e+06,2.84943,76384,2,4437,5,220184,6,0,710,221203,0


Converting to forward existential form...Done !
original formula: (AF(AX((((p5==0)||(p48==0)) * AG(((p10==0)||(p18==0)))))) * EF(((p7==1)&&(p72==1))))
=> equivalent forward existential formula: ([FwdG(Init,!(!(EX(!((((p5==0)||(p48==0)) * !(E(TRUE U !(((p10==0)||(p18==0)))))))))))] = FALSE * [(Init * !(E(T...193
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t6, t10, t11, t13, t18, t19, t20, t21, t22, t24, t26, t31, t32, t33, t34, t35...578
Detected timeout of ITS tools.
[2024-06-02 20:30:27] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:30:27] [INFO ] Applying decomposition
[2024-06-02 20:30:27] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph4369823690637781626.txt' '-o' '/tmp/graph4369823690637781626.bin' '-w' '/tmp/graph4369823690637781626.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4369823690637781626.bin' '-l' '-1' '-v' '-w' '/tmp/graph4369823690637781626.weights' '-q' '0' '-e' '0.001'
[2024-06-02 20:30:28] [INFO ] Decomposing Gal with order
[2024-06-02 20:30:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 20:30:28] [INFO ] Removed a total of 414 redundant transitions.
[2024-06-02 20:30:28] [INFO ] Flatten gal took : 13 ms
[2024-06-02 20:30:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 75 labels/synchronizations in 4 ms.
[2024-06-02 20:30:28] [INFO ] Time to serialize gal into /tmp/CTLFireability5984442962753724037.gal : 1 ms
[2024-06-02 20:30:28] [INFO ] Time to serialize properties into /tmp/CTLFireability900595247014870786.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5984442962753724037.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability900595247014870786.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.45564e+06,6.2369,162180,1604,195,189694,3304,610,1.07516e+06,89,27304,0


Converting to forward existential form...Done !
original formula: (AF(AX((((i2.u7.p5==0)||(i3.u15.p48==0)) * AG(((i1.i1.u3.p10==0)||(i1.i1.u5.p18==0)))))) * EF(((i3.u2.p7==1)&&(i4.u24.p72==1))))
=> equivalent forward existential formula: ([FwdG(Init,!(!(EX(!((((i2.u7.p5==0)||(i3.u15.p48==0)) * !(E(TRUE U !(((i1.i1.u3.p10==0)||(i1.i1.u5.p18==0))))))...237
Reverse transition relation is NOT exact ! Due to transitions t4, t47, t49, t53, t54, t62, t63, t68, t73, t78, t83, t97, t99, t139, t148, t153, t155, t156,...790
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 297/297 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 109 transition count 289
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 109 transition count 289
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 107 transition count 285
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 107 transition count 285
Applied a total of 10 rules in 2 ms. Remains 107 /112 variables (removed 5) and now considering 285/297 (removed 12) transitions.
[2024-06-02 20:30:58] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
[2024-06-02 20:30:58] [INFO ] Invariant cache hit.
[2024-06-02 20:30:58] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-06-02 20:30:58] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
[2024-06-02 20:30:58] [INFO ] Invariant cache hit.
[2024-06-02 20:30:58] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-06-02 20:30:58] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 207 ms to find 0 implicit places.
Running 284 sub problems to find dead transitions.
[2024-06-02 20:30:58] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
[2024-06-02 20:30:58] [INFO ] Invariant cache hit.
[2024-06-02 20:30:58] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 284 unsolved
[2024-06-02 20:30:59] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2024-06-02 20:30:59] [INFO ] Deduced a trap composed of 36 places in 30 ms of which 1 ms to minimize.
[2024-06-02 20:30:59] [INFO ] Deduced a trap composed of 40 places in 60 ms of which 1 ms to minimize.
[2024-06-02 20:30:59] [INFO ] Deduced a trap composed of 41 places in 54 ms of which 1 ms to minimize.
[2024-06-02 20:31:00] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 1 ms to minimize.
[2024-06-02 20:31:00] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
[2024-06-02 20:31:00] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2024-06-02 20:31:00] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 0 ms to minimize.
[2024-06-02 20:31:00] [INFO ] Deduced a trap composed of 36 places in 39 ms of which 0 ms to minimize.
[2024-06-02 20:31:00] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 4 (OVERLAPS) 258/365 variables, 107/126 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/365 variables, 38/164 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 7 (OVERLAPS) 1/366 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/366 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 9 (OVERLAPS) 0/366 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 284 unsolved
No progress, stopping.
After SMT solving in domain Real declared 366/366 variables, and 165 constraints, problems are : Problem set: 0 solved, 284 unsolved in 11633 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 107/107 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 284/284 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 284 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 284 unsolved
[2024-06-02 20:31:10] [INFO ] Deduced a trap composed of 38 places in 59 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 5 (OVERLAPS) 258/365 variables, 107/127 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 38/165 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 284/449 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/365 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 9 (OVERLAPS) 1/366 variables, 1/450 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/366 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 11 (OVERLAPS) 0/366 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 284 unsolved
No progress, stopping.
After SMT solving in domain Int declared 366/366 variables, and 450 constraints, problems are : Problem set: 0 solved, 284 unsolved in 20557 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 107/107 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 284/284 constraints, Known Traps: 11/11 constraints]
After SMT, in 32346ms problems are : Problem set: 0 solved, 284 unsolved
Search for dead transitions found 0 dead transitions in 32350ms
Starting structural reductions in LTL mode, iteration 1 : 107/112 places, 285/297 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32560 ms. Remains : 107/112 places, 285/297 transitions.
[2024-06-02 20:31:30] [INFO ] Flatten gal took : 8 ms
[2024-06-02 20:31:30] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:31:30] [INFO ] Input system was already deterministic with 285 transitions.
[2024-06-02 20:31:30] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:31:30] [INFO ] Flatten gal took : 6 ms
[2024-06-02 20:31:30] [INFO ] Time to serialize gal into /tmp/CTLFireability10676274048267084928.gal : 1 ms
[2024-06-02 20:31:30] [INFO ] Time to serialize properties into /tmp/CTLFireability7614687790502534210.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability10676274048267084928.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7614687790502534210.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.45564e+06,2.83719,76356,2,4437,5,220184,6,0,710,221203,0


Converting to forward existential form...Done !
original formula: AG((A(AG(AX(((p7==1)&&(p24==1)))) U ((EX(((p7==1)&&(p23==1))) + EF(((p7==1)&&(p46==1)))) + AX((((p7==1)&&(p48==1))&&((p7==1)&&(p75==1))))...185
=> equivalent forward existential formula: [FwdG((FwdU(Init,TRUE) * !(!((E(!(((EX(((p7==1)&&(p23==1))) + E(TRUE U ((p7==1)&&(p46==1)))) + !(EX(!((((p7==1)&...527
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t6, t10, t11, t13, t18, t19, t20, t21, t22, t24, t26, t31, t32, t33, t34, t35...578
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Hit Full ! (commute/partial/dont) 231/0/54
(forward)formula 0,0,24.9946,563580,1,0,639,2.79632e+06,610,346,6401,2.52199e+06,738
FORMULA FireWire-PT-03-CTLFireability-2024-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
[2024-06-02 20:31:55] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:31:55] [INFO ] Flatten gal took : 8 ms
[2024-06-02 20:31:55] [INFO ] Applying decomposition
[2024-06-02 20:31:55] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph2883581311656753885.txt' '-o' '/tmp/graph2883581311656753885.bin' '-w' '/tmp/graph2883581311656753885.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2883581311656753885.bin' '-l' '-1' '-v' '-w' '/tmp/graph2883581311656753885.weights' '-q' '0' '-e' '0.001'
[2024-06-02 20:31:55] [INFO ] Decomposing Gal with order
[2024-06-02 20:31:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 20:31:56] [INFO ] Removed a total of 433 redundant transitions.
[2024-06-02 20:31:56] [INFO ] Flatten gal took : 15 ms
[2024-06-02 20:31:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 88 labels/synchronizations in 8 ms.
[2024-06-02 20:31:56] [INFO ] Time to serialize gal into /tmp/CTLFireability12272031096016654231.gal : 3 ms
[2024-06-02 20:31:56] [INFO ] Time to serialize properties into /tmp/CTLFireability16959483598726171318.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability12272031096016654231.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16959483598726171318.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 5 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.20421e+06,3.34554,96124,1315,225,135407,2210,582,445130,89,20941,0


Converting to forward existential form...Done !
original formula: EF(AG((AG(((i0.u3.p10==1)&&(i0.u3.p99==1))) * !(A(A((i2.u7.p22==1) U ((i0.u3.p8==1)&&(i5.i0.u25.p61==1))) U EX(((i5.i1.u2.p7==1)&&(i2.u7....169
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((!(E(TRUE U !(((i0.u3.p10==1)&&(i0.u3.p99==1))))) * !(!((E(!(EX(((i5.i1.u2.p7==...449
Reverse transition relation is NOT exact ! Due to transitions t4, t49, t51, t52, t55, t56, t59, t61, t64, t65, t70, t75, t80, t85, t99, t101, t102, t103, t...791
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
(forward)formula 0,0,16.9939,420084,1,0,642185,5358,3055,1.88969e+06,416,34458,1155030
FORMULA FireWire-PT-03-CTLFireability-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

original formula: AF(AG((EF(((i2.u7.p5==1)&&(i2.u8.p27==1))) + AF(((i5.i1.u2.p7==0)||(i4.u16.p49==0))))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !((E(TRUE U ((i2.u7.p5==1)&&(i2.u8.p27==1))) + !(EG(!(((i5.i1.u2.p7==0)||(i4.u16.p49==0)...174
(forward)formula 1,0,36.4006,883984,1,0,1.38346e+06,6364,3140,3.87114e+06,418,53950,2746092
FORMULA FireWire-PT-03-CTLFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

original formula: AF(AX((AF(((i0.u3.p11==1)&&(i0.u3.p100==1))) + A(((i5.i1.u2.p7==1)&&(i2.u7.p24==1)) U ((i3.u1.p3==1)&&(i1.u30.p89==1))))))
=> equivalent forward existential formula: [FwdG(Init,!(!(EX(!((!(EG(!(((i0.u3.p11==1)&&(i0.u3.p100==1))))) + !((E(!(((i3.u1.p3==1)&&(i1.u30.p89==1))) U (!...290
(forward)formula 2,0,53.7051,1293936,1,0,1.99084e+06,8360,3224,5.65352e+06,425,88330,4124182
FORMULA FireWire-PT-03-CTLFireability-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

original formula: E((EG(AF(EX(((i5.i1.u2.p7==1)&&(i4.u16.p56==1))))) * !(AF(AG(((i0.u3.p11==1)&&(i5.i0.u27.p82==1)))))) U (!(((i1.u29.p87==1) * ((((i1.u0.p...553
=> equivalent forward existential formula: (([((FwdU(Init,(EG(!(EG(!(EX(((i5.i1.u2.p7==1)&&(i4.u16.p56==1))))))) * !(!(EG(!(!(E(TRUE U !(((i0.u3.p11==1)&&(...1824
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
(forward)formula 3,0,72.1411,1719760,1,0,2.63358e+06,9167,3378,7.27388e+06,425,97778,5427853
FORMULA FireWire-PT-03-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

original formula: (AF(AX((((i2.u7.p5==0)||(i4.u15.p48==0)) * AG(((i0.u3.p10==0)||(i0.u5.p18==0)))))) * EF(((i5.i1.u2.p7==1)&&(i5.i1.u24.p72==1))))
=> equivalent forward existential formula: ([FwdG(Init,!(!(EX(!((((i2.u7.p5==0)||(i4.u15.p48==0)) * !(E(TRUE U !(((i0.u3.p10==0)||(i0.u5.p18==0)))))))))))]...237
(forward)formula 4,0,88.8174,2086456,1,0,3.20684e+06,9262,3404,8.72738e+06,427,100677,6685319
FORMULA FireWire-PT-03-CTLFireability-2024-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

Total runtime 1031889 ms.

BK_STOP 1717360405242

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-03"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="itstools"
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 itstools"
echo " Input is FireWire-PT-03, 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 r550-tall-171734898800186"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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