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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 5.8K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 10K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K 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 84K 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-01-CTLFireability-2024-00
FORMULA_NAME FireWire-PT-01-CTLFireability-2024-01
FORMULA_NAME FireWire-PT-01-CTLFireability-2024-02
FORMULA_NAME FireWire-PT-01-CTLFireability-2024-03
FORMULA_NAME FireWire-PT-01-CTLFireability-2024-04
FORMULA_NAME FireWire-PT-01-CTLFireability-2024-05
FORMULA_NAME FireWire-PT-01-CTLFireability-2024-06
FORMULA_NAME FireWire-PT-01-CTLFireability-2024-07
FORMULA_NAME FireWire-PT-01-CTLFireability-2024-08
FORMULA_NAME FireWire-PT-01-CTLFireability-2024-09
FORMULA_NAME FireWire-PT-01-CTLFireability-2024-10
FORMULA_NAME FireWire-PT-01-CTLFireability-2024-11
FORMULA_NAME FireWire-PT-01-CTLFireability-2024-12
FORMULA_NAME FireWire-PT-01-CTLFireability-2024-13
FORMULA_NAME FireWire-PT-01-CTLFireability-2024-14
FORMULA_NAME FireWire-PT-01-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717357779216

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-01
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-06-02 19:49:40] [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 19:49:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 19:49:40] [INFO ] Load time of PNML (sax parser for PT used): 76 ms
[2024-06-02 19:49:40] [INFO ] Transformed 107 places.
[2024-06-02 19:49:40] [INFO ] Transformed 346 transitions.
[2024-06-02 19:49:40] [INFO ] Found NUPN structural information;
[2024-06-02 19:49:40] [INFO ] Parsed PT model containing 107 places and 346 transitions and 1271 arcs in 172 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 73 out of 107 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 107/107 places, 293/293 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 106 transition count 290
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 106 transition count 290
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 8 place count 106 transition count 284
Applied a total of 8 rules in 32 ms. Remains 106 /107 variables (removed 1) and now considering 284/293 (removed 9) transitions.
[2024-06-02 19:49:40] [INFO ] Flow matrix only has 258 transitions (discarded 26 similar events)
// Phase 1: matrix 258 rows 106 cols
[2024-06-02 19:49:40] [INFO ] Computed 8 invariants in 17 ms
[2024-06-02 19:49:40] [INFO ] Implicit Places using invariants in 202 ms returned []
[2024-06-02 19:49:40] [INFO ] Flow matrix only has 258 transitions (discarded 26 similar events)
[2024-06-02 19:49:40] [INFO ] Invariant cache hit.
[2024-06-02 19:49:41] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-06-02 19:49:41] [INFO ] Implicit Places using invariants and state equation in 151 ms returned [104]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 386 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 105/107 places, 284/293 transitions.
Applied a total of 0 rules in 4 ms. Remains 105 /105 variables (removed 0) and now considering 284/284 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 437 ms. Remains : 105/107 places, 284/293 transitions.
Support contains 73 out of 105 places after structural reductions.
[2024-06-02 19:49:41] [INFO ] Flatten gal took : 44 ms
[2024-06-02 19:49:41] [INFO ] Flatten gal took : 27 ms
[2024-06-02 19:49:41] [INFO ] Input system was already deterministic with 284 transitions.
RANDOM walk for 40000 steps (2215 resets) in 2220 ms. (18 steps per ms) remains 46/87 properties
BEST_FIRST walk for 4003 steps (23 resets) in 41 ms. (95 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (19 resets) in 18 ms. (210 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (61 resets) in 31 ms. (125 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (60 resets) in 69 ms. (57 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (69 resets) in 16 ms. (235 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (22 resets) in 25 ms. (154 steps per ms) remains 45/46 properties
BEST_FIRST walk for 4002 steps (57 resets) in 21 ms. (181 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (19 resets) in 21 ms. (181 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (43 resets) in 15 ms. (250 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (48 resets) in 14 ms. (266 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (12 resets) in 14 ms. (266 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (14 resets) in 24 ms. (160 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (64 resets) in 19 ms. (200 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (53 resets) in 19 ms. (200 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (14 resets) in 9 ms. (400 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (62 resets) in 20 ms. (190 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4001 steps (51 resets) in 40 ms. (97 steps per ms) remains 43/45 properties
BEST_FIRST walk for 4004 steps (14 resets) in 11 ms. (333 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (12 resets) in 15 ms. (250 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (67 resets) in 16 ms. (235 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (19 resets) in 11 ms. (333 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (66 resets) in 13 ms. (285 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (153 resets) in 16 ms. (235 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (26 resets) in 41 ms. (95 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (55 resets) in 33 ms. (117 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (13 resets) in 12 ms. (307 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4001 steps (74 resets) in 14 ms. (266 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (12 resets) in 13 ms. (285 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (16 resets) in 14 ms. (266 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (54 resets) in 22 ms. (174 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (19 resets) in 9 ms. (400 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4002 steps (59 resets) in 41 ms. (95 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4001 steps (142 resets) in 13 ms. (285 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4001 steps (17 resets) in 12 ms. (307 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (9 resets) in 12 ms. (308 steps per ms) remains 42/43 properties
BEST_FIRST walk for 4002 steps (65 resets) in 19 ms. (200 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (30 resets) in 24 ms. (160 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (46 resets) in 15 ms. (250 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (64 resets) in 13 ms. (285 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 42/42 properties
[2024-06-02 19:49:42] [INFO ] Flow matrix only has 258 transitions (discarded 26 similar events)
// Phase 1: matrix 258 rows 105 cols
[2024-06-02 19:49:42] [INFO ] Computed 7 invariants in 5 ms
[2024-06-02 19:49:42] [INFO ] State equation strengthened by 39 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 42 unsolved
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp53 is UNSAT
Problem AtomicPropp54 is UNSAT
Problem AtomicPropp61 is UNSAT
Problem AtomicPropp70 is UNSAT
At refinement iteration 1 (OVERLAPS) 46/98 variables, 5/5 constraints. Problems are: Problem set: 7 solved, 35 unsolved
[2024-06-02 19:49:42] [INFO ] Deduced a trap composed of 22 places in 77 ms of which 8 ms to minimize.
[2024-06-02 19:49:42] [INFO ] Deduced a trap composed of 37 places in 34 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 2/7 constraints. Problems are: Problem set: 7 solved, 35 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/7 constraints. Problems are: Problem set: 7 solved, 35 unsolved
At refinement iteration 4 (OVERLAPS) 4/102 variables, 2/9 constraints. Problems are: Problem set: 7 solved, 35 unsolved
[2024-06-02 19:49:43] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 1/10 constraints. Problems are: Problem set: 7 solved, 35 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 0/10 constraints. Problems are: Problem set: 7 solved, 35 unsolved
At refinement iteration 7 (OVERLAPS) 255/357 variables, 102/112 constraints. Problems are: Problem set: 7 solved, 35 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/357 variables, 38/150 constraints. Problems are: Problem set: 7 solved, 35 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/357 variables, 0/150 constraints. Problems are: Problem set: 7 solved, 35 unsolved
At refinement iteration 10 (OVERLAPS) 4/361 variables, 2/152 constraints. Problems are: Problem set: 7 solved, 35 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/361 variables, 0/152 constraints. Problems are: Problem set: 7 solved, 35 unsolved
At refinement iteration 12 (OVERLAPS) 1/362 variables, 1/153 constraints. Problems are: Problem set: 7 solved, 35 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/362 variables, 0/153 constraints. Problems are: Problem set: 7 solved, 35 unsolved
At refinement iteration 14 (OVERLAPS) 1/363 variables, 1/154 constraints. Problems are: Problem set: 7 solved, 35 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/363 variables, 0/154 constraints. Problems are: Problem set: 7 solved, 35 unsolved
At refinement iteration 16 (OVERLAPS) 0/363 variables, 0/154 constraints. Problems are: Problem set: 7 solved, 35 unsolved
No progress, stopping.
After SMT solving in domain Real declared 363/363 variables, and 154 constraints, problems are : Problem set: 7 solved, 35 unsolved in 2005 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 105/105 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 7 solved, 35 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 7 solved, 35 unsolved
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp83 is UNSAT
At refinement iteration 1 (OVERLAPS) 56/98 variables, 5/5 constraints. Problems are: Problem set: 9 solved, 33 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 2/7 constraints. Problems are: Problem set: 9 solved, 33 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/7 constraints. Problems are: Problem set: 9 solved, 33 unsolved
At refinement iteration 4 (OVERLAPS) 4/102 variables, 2/9 constraints. Problems are: Problem set: 9 solved, 33 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 1/10 constraints. Problems are: Problem set: 9 solved, 33 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 0/10 constraints. Problems are: Problem set: 9 solved, 33 unsolved
At refinement iteration 7 (OVERLAPS) 255/357 variables, 102/112 constraints. Problems are: Problem set: 9 solved, 33 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/357 variables, 38/150 constraints. Problems are: Problem set: 9 solved, 33 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/357 variables, 31/181 constraints. Problems are: Problem set: 9 solved, 33 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/357 variables, 0/181 constraints. Problems are: Problem set: 9 solved, 33 unsolved
At refinement iteration 11 (OVERLAPS) 4/361 variables, 2/183 constraints. Problems are: Problem set: 9 solved, 33 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/361 variables, 2/185 constraints. Problems are: Problem set: 9 solved, 33 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/361 variables, 0/185 constraints. Problems are: Problem set: 9 solved, 33 unsolved
At refinement iteration 14 (OVERLAPS) 1/362 variables, 1/186 constraints. Problems are: Problem set: 9 solved, 33 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/362 variables, 0/186 constraints. Problems are: Problem set: 9 solved, 33 unsolved
At refinement iteration 16 (OVERLAPS) 1/363 variables, 1/187 constraints. Problems are: Problem set: 9 solved, 33 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/363 variables, 0/187 constraints. Problems are: Problem set: 9 solved, 33 unsolved
At refinement iteration 18 (OVERLAPS) 0/363 variables, 0/187 constraints. Problems are: Problem set: 9 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Int declared 363/363 variables, and 187 constraints, problems are : Problem set: 9 solved, 33 unsolved in 3642 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 105/105 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 33/42 constraints, Known Traps: 3/3 constraints]
After SMT, in 5752ms problems are : Problem set: 9 solved, 33 unsolved
Parikh walk visited 0 properties in 2448 ms.
Support contains 40 out of 105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 284/284 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 105 transition count 280
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 5 place count 104 transition count 280
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 5 place count 104 transition count 279
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 103 transition count 279
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 9 place count 101 transition count 274
Iterating global reduction 2 with 2 rules applied. Total rules applied 11 place count 101 transition count 274
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 12 place count 100 transition count 272
Iterating global reduction 2 with 1 rules applied. Total rules applied 13 place count 100 transition count 272
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 15 place count 99 transition count 274
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 17 place count 99 transition count 272
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 18 place count 99 transition count 271
Applied a total of 18 rules in 56 ms. Remains 99 /105 variables (removed 6) and now considering 271/284 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 99/105 places, 271/284 transitions.
RANDOM walk for 40000 steps (2466 resets) in 438 ms. (91 steps per ms) remains 29/33 properties
BEST_FIRST walk for 4004 steps (9 resets) in 14 ms. (266 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (71 resets) in 16 ms. (235 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (57 resets) in 16 ms. (235 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (28 resets) in 13 ms. (285 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (8 resets) in 12 ms. (307 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (60 resets) in 12 ms. (308 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (16 resets) in 14 ms. (266 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (44 resets) in 18 ms. (210 steps per ms) remains 28/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (29 resets) in 15 ms. (250 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (70 resets) in 20 ms. (190 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (58 resets) in 16 ms. (235 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (20 resets) in 15 ms. (250 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (10 resets) in 12 ms. (308 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (72 resets) in 18 ms. (210 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (22 resets) in 12 ms. (307 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (83 resets) in 18 ms. (210 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (225 resets) in 14 ms. (266 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (77 resets) in 11 ms. (333 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (73 resets) in 11 ms. (333 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (52 resets) in 20 ms. (190 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (206 resets) in 14 ms. (266 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (10 resets) in 10 ms. (364 steps per ms) remains 27/28 properties
BEST_FIRST walk for 4003 steps (67 resets) in 12 ms. (307 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (27 resets) in 12 ms. (307 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (71 resets) in 12 ms. (307 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (53 resets) in 29 ms. (133 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4000 steps (8 resets) in 18 ms. (210 steps per ms) remains 27/27 properties
[2024-06-02 19:49:51] [INFO ] Flow matrix only has 247 transitions (discarded 24 similar events)
// Phase 1: matrix 247 rows 99 cols
[2024-06-02 19:49:51] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 19:49:51] [INFO ] State equation strengthened by 39 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (OVERLAPS) 59/93 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 27 unsolved
[2024-06-02 19:49:51] [INFO ] Deduced a trap composed of 37 places in 32 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 4 (OVERLAPS) 4/97 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/97 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 6 (OVERLAPS) 246/343 variables, 97/105 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/343 variables, 38/143 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/343 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 9 (OVERLAPS) 3/346 variables, 2/145 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/346 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/346 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 12 (OVERLAPS) 0/346 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Real declared 346/346 variables, and 146 constraints, problems are : Problem set: 0 solved, 27 unsolved in 844 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 99/99 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 27 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (OVERLAPS) 59/93 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 27 unsolved
[2024-06-02 19:49:52] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (OVERLAPS) 4/97 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/97 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 7 (OVERLAPS) 246/343 variables, 97/106 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/343 variables, 38/144 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/343 variables, 26/170 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/343 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 11 (OVERLAPS) 3/346 variables, 2/172 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/346 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/346 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 27 unsolved
[2024-06-02 19:49:53] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/346 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/346 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 16 (OVERLAPS) 0/346 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Int declared 346/346 variables, and 175 constraints, problems are : Problem set: 0 solved, 27 unsolved in 2591 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 99/99 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 3/3 constraints]
After SMT, in 3471ms problems are : Problem set: 0 solved, 27 unsolved
Parikh walk visited 2 properties in 4068 ms.
Support contains 33 out of 99 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 99/99 places, 271/271 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 99 transition count 272
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 6 place count 97 transition count 270
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 9 place count 97 transition count 267
Applied a total of 9 rules in 28 ms. Remains 97 /99 variables (removed 2) and now considering 267/271 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 97/99 places, 267/271 transitions.
RANDOM walk for 40000 steps (2358 resets) in 244 ms. (163 steps per ms) remains 21/25 properties
BEST_FIRST walk for 4003 steps (15 resets) in 14 ms. (266 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (68 resets) in 10 ms. (364 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (60 resets) in 11 ms. (333 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (11 resets) in 12 ms. (307 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (58 resets) in 10 ms. (364 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (69 resets) in 18 ms. (210 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (13 resets) in 18 ms. (210 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (12 resets) in 17 ms. (222 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (81 resets) in 13 ms. (285 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (10 resets) in 13 ms. (285 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (61 resets) in 15 ms. (250 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (216 resets) in 20 ms. (190 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (79 resets) in 13 ms. (285 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (84 resets) in 12 ms. (307 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (213 resets) in 18 ms. (210 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (9 resets) in 11 ms. (333 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (70 resets) in 12 ms. (307 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (45 resets) in 9 ms. (400 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (79 resets) in 12 ms. (307 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4000 steps (8 resets) in 11 ms. (333 steps per ms) remains 21/21 properties
[2024-06-02 19:49:58] [INFO ] Flow matrix only has 242 transitions (discarded 25 similar events)
// Phase 1: matrix 242 rows 97 cols
[2024-06-02 19:49:58] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 19:49:58] [INFO ] State equation strengthened by 39 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 60/91 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-06-02 19:49:59] [INFO ] Deduced a trap composed of 35 places in 27 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (OVERLAPS) 4/95 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-06-02 19:49:59] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/95 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/95 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (OVERLAPS) 241/336 variables, 95/104 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/336 variables, 38/142 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/336 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 10 (OVERLAPS) 3/339 variables, 2/144 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/339 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/339 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 13 (OVERLAPS) 0/339 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Real declared 339/339 variables, and 145 constraints, problems are : Problem set: 0 solved, 21 unsolved in 708 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 97/97 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 60/91 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-06-02 19:49:59] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 4/95 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/95 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-06-02 19:49:59] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/95 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/95 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 9 (OVERLAPS) 241/336 variables, 95/106 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/336 variables, 38/144 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/336 variables, 20/164 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/336 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 13 (OVERLAPS) 3/339 variables, 2/166 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/339 variables, 1/167 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/339 variables, 1/168 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/339 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 17 (OVERLAPS) 0/339 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Int declared 339/339 variables, and 168 constraints, problems are : Problem set: 0 solved, 21 unsolved in 1515 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 97/97 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 4/4 constraints]
After SMT, in 2256ms problems are : Problem set: 0 solved, 21 unsolved
Parikh walk visited 0 properties in 1286 ms.
Support contains 31 out of 97 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 267/267 transitions.
Applied a total of 0 rules in 17 ms. Remains 97 /97 variables (removed 0) and now considering 267/267 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 97/97 places, 267/267 transitions.
RANDOM walk for 40000 steps (2407 resets) in 246 ms. (161 steps per ms) remains 18/21 properties
BEST_FIRST walk for 4002 steps (64 resets) in 10 ms. (363 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (70 resets) in 10 ms. (364 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (50 resets) in 15 ms. (250 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (77 resets) in 10 ms. (363 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (19 resets) in 7 ms. (500 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (16 resets) in 9 ms. (400 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (68 resets) in 13 ms. (285 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (65 resets) in 10 ms. (363 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (223 resets) in 11 ms. (333 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (58 resets) in 11 ms. (333 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (73 resets) in 11 ms. (333 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (208 resets) in 14 ms. (266 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (65 resets) in 12 ms. (307 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (57 resets) in 11 ms. (333 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (66 resets) in 13 ms. (286 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4000 steps (8 resets) in 16 ms. (235 steps per ms) remains 18/18 properties
[2024-06-02 19:50:02] [INFO ] Flow matrix only has 242 transitions (discarded 25 similar events)
[2024-06-02 19:50:02] [INFO ] Invariant cache hit.
[2024-06-02 19:50:02] [INFO ] State equation strengthened by 39 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 64/91 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 4/95 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 241/336 variables, 95/102 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/336 variables, 38/140 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/336 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (OVERLAPS) 3/339 variables, 2/142 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/339 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/339 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 11 (OVERLAPS) 0/339 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 339/339 variables, and 143 constraints, problems are : Problem set: 0 solved, 18 unsolved in 507 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 97/97 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 64/91 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-06-02 19:50:03] [INFO ] Deduced a trap composed of 35 places in 31 ms of which 1 ms to minimize.
[2024-06-02 19:50:03] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (OVERLAPS) 4/95 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/95 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (OVERLAPS) 241/336 variables, 95/104 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/336 variables, 38/142 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/336 variables, 17/159 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/336 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 10 (OVERLAPS) 3/339 variables, 2/161 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/339 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/339 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-06-02 19:50:04] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/339 variables, 1/164 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/339 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 15 (OVERLAPS) 0/339 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Int declared 339/339 variables, and 164 constraints, problems are : Problem set: 0 solved, 18 unsolved in 1738 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 97/97 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 3/3 constraints]
After SMT, in 2264ms problems are : Problem set: 0 solved, 18 unsolved
Parikh walk visited 11 properties in 9202 ms.
Support contains 14 out of 97 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 267/267 transitions.
Applied a total of 0 rules in 20 ms. Remains 97 /97 variables (removed 0) and now considering 267/267 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 97/97 places, 267/267 transitions.
RANDOM walk for 40000 steps (2414 resets) in 138 ms. (287 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40004 steps (654 resets) in 41 ms. (952 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (621 resets) in 43 ms. (909 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40002 steps (2171 resets) in 54 ms. (727 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (699 resets) in 37 ms. (1052 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40000 steps (8 resets) in 60 ms. (655 steps per ms) remains 5/5 properties
[2024-06-02 19:50:14] [INFO ] Flow matrix only has 242 transitions (discarded 25 similar events)
[2024-06-02 19:50:14] [INFO ] Invariant cache hit.
[2024-06-02 19:50:14] [INFO ] State equation strengthened by 39 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 79/89 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-02 19:50:14] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
[2024-06-02 19:50:14] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 6/95 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-02 19:50:14] [INFO ] Deduced a trap composed of 35 places in 27 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/95 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/95 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 241/336 variables, 95/105 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/336 variables, 38/143 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/336 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 3/339 variables, 2/145 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/339 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/339 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 0/339 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 339/339 variables, and 146 constraints, problems are : Problem set: 0 solved, 5 unsolved in 356 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 97/97 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 79/89 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 6/95 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/95 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/95 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 241/336 variables, 95/105 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/336 variables, 38/143 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/336 variables, 4/147 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/336 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 3/339 variables, 2/149 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/339 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/339 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-02 19:50:14] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/339 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/339 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 0/339 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 339/339 variables, and 152 constraints, problems are : Problem set: 0 solved, 5 unsolved in 435 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 97/97 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 4/4 constraints]
After SMT, in 799ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 1 properties in 1010 ms.
Support contains 8 out of 97 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 267/267 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 96 transition count 269
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 96 transition count 267
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 96 transition count 266
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 95 transition count 265
Applied a total of 6 rules in 23 ms. Remains 95 /97 variables (removed 2) and now considering 265/267 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 95/97 places, 265/267 transitions.
RANDOM walk for 40000 steps (2527 resets) in 103 ms. (384 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (575 resets) in 36 ms. (1081 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (659 resets) in 38 ms. (1025 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (2302 resets) in 48 ms. (816 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (650 resets) in 68 ms. (579 steps per ms) remains 4/4 properties
Finished probabilistic random walk after 22789 steps, run visited all 4 properties in 105 ms. (steps per millisecond=217 )
Probabilistic random walk after 22789 steps, saw 8066 distinct states, run finished after 108 ms. (steps per millisecond=211 ) properties seen :4
Successfully simplified 9 atomic propositions for a total of 16 simplifications.
FORMULA FireWire-PT-01-CTLFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-02 19:50:16] [INFO ] Flatten gal took : 16 ms
[2024-06-02 19:50:16] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA FireWire-PT-01-CTLFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-02 19:50:16] [INFO ] Flatten gal took : 16 ms
[2024-06-02 19:50:16] [INFO ] Input system was already deterministic with 284 transitions.
Support contains 59 out of 105 places (down from 65) after GAL structural reductions.
Computed a total of 6 stabilizing places and 9 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 284/284 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 101 transition count 274
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 101 transition count 274
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 100 transition count 272
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 100 transition count 272
Applied a total of 10 rules in 5 ms. Remains 100 /105 variables (removed 5) and now considering 272/284 (removed 12) transitions.
[2024-06-02 19:50:16] [INFO ] Flow matrix only has 246 transitions (discarded 26 similar events)
// Phase 1: matrix 246 rows 100 cols
[2024-06-02 19:50:16] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 19:50:16] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-06-02 19:50:16] [INFO ] Flow matrix only has 246 transitions (discarded 26 similar events)
[2024-06-02 19:50:16] [INFO ] Invariant cache hit.
[2024-06-02 19:50:16] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-02 19:50:16] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 174 ms to find 0 implicit places.
Running 271 sub problems to find dead transitions.
[2024-06-02 19:50:16] [INFO ] Flow matrix only has 246 transitions (discarded 26 similar events)
[2024-06-02 19:50:16] [INFO ] Invariant cache hit.
[2024-06-02 19:50:16] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 1 (OVERLAPS) 1/100 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 271 unsolved
[2024-06-02 19:50:17] [INFO ] Deduced a trap composed of 34 places in 58 ms of which 1 ms to minimize.
[2024-06-02 19:50:18] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
[2024-06-02 19:50:18] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-06-02 19:50:18] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 0 ms to minimize.
[2024-06-02 19:50:18] [INFO ] Deduced a trap composed of 36 places in 33 ms of which 1 ms to minimize.
[2024-06-02 19:50:18] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-06-02 19:50:18] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 4 (OVERLAPS) 245/345 variables, 100/114 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/345 variables, 36/150 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/345 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 7 (OVERLAPS) 1/346 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/346 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 9 (OVERLAPS) 0/346 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 271 unsolved
No progress, stopping.
After SMT solving in domain Real declared 346/346 variables, and 151 constraints, problems are : Problem set: 0 solved, 271 unsolved in 9585 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 100/100 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 271/271 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 271 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 1 (OVERLAPS) 1/100 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 4 (OVERLAPS) 245/345 variables, 100/114 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/345 variables, 36/150 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/345 variables, 271/421 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/345 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 8 (OVERLAPS) 1/346 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/346 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 10 (OVERLAPS) 0/346 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 271 unsolved
No progress, stopping.
After SMT solving in domain Int declared 346/346 variables, and 422 constraints, problems are : Problem set: 0 solved, 271 unsolved in 17768 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 100/100 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 271/271 constraints, Known Traps: 7/7 constraints]
After SMT, in 27517ms problems are : Problem set: 0 solved, 271 unsolved
Search for dead transitions found 0 dead transitions in 27521ms
Starting structural reductions in LTL mode, iteration 1 : 100/105 places, 272/284 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27702 ms. Remains : 100/105 places, 272/284 transitions.
[2024-06-02 19:50:44] [INFO ] Flatten gal took : 17 ms
[2024-06-02 19:50:44] [INFO ] Flatten gal took : 15 ms
[2024-06-02 19:50:44] [INFO ] Input system was already deterministic with 272 transitions.
[2024-06-02 19:50:44] [INFO ] Flatten gal took : 11 ms
[2024-06-02 19:50:44] [INFO ] Flatten gal took : 11 ms
[2024-06-02 19:50:44] [INFO ] Time to serialize gal into /tmp/CTLFireability18004073553351346843.gal : 6 ms
[2024-06-02 19:50:44] [INFO ] Time to serialize properties into /tmp/CTLFireability2845649131834796606.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/CTLFireability18004073553351346843.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2845649131834796606.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,1.44007e+06,1.97415,66268,2,3549,5,187407,6,0,671,183138,0


Converting to forward existential form...Done !
original formula: E(AX(E((EX(((p7==1)&&(p83==1))) + !(((p7==1)&&(p46==1)))) U EG(!(((p6==1)&&(p71==1)))))) U ((EX(((p66==1)&&(p100==1))) + (p27==1)) + ((p1...173
=> equivalent forward existential formula: (([(EY(FwdU(Init,!(EX(!(E((EX(((p7==1)&&(p83==1))) + !(((p7==1)&&(p46==1)))) U EG(!(((p6==1)&&(p71==1)))))))))) ...463
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t8, t9, t11, t16, t17, t18, t19, t20, t22, t24, t29, t30, t31, t32, t33, t35, t37...551
(forward)formula 0,1,22.0112,637924,1,0,661,3.29516e+06,572,343,5703,3.2525e+06,762
FORMULA FireWire-PT-01-CTLFireability-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 284/284 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 101 transition count 274
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 101 transition count 274
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 99 transition count 270
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 99 transition count 270
Applied a total of 12 rules in 5 ms. Remains 99 /105 variables (removed 6) and now considering 270/284 (removed 14) transitions.
[2024-06-02 19:51:06] [INFO ] Flow matrix only has 244 transitions (discarded 26 similar events)
// Phase 1: matrix 244 rows 99 cols
[2024-06-02 19:51:06] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 19:51:06] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-06-02 19:51:06] [INFO ] Flow matrix only has 244 transitions (discarded 26 similar events)
[2024-06-02 19:51:06] [INFO ] Invariant cache hit.
[2024-06-02 19:51:06] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-02 19:51:06] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 176 ms to find 0 implicit places.
Running 269 sub problems to find dead transitions.
[2024-06-02 19:51:06] [INFO ] Flow matrix only has 244 transitions (discarded 26 similar events)
[2024-06-02 19:51:06] [INFO ] Invariant cache hit.
[2024-06-02 19:51:06] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 269 unsolved
[2024-06-02 19:51:07] [INFO ] Deduced a trap composed of 53 places in 69 ms of which 1 ms to minimize.
[2024-06-02 19:51:08] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 0 ms to minimize.
[2024-06-02 19:51:08] [INFO ] Deduced a trap composed of 39 places in 50 ms of which 1 ms to minimize.
[2024-06-02 19:51:08] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
[2024-06-02 19:51:08] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
[2024-06-02 19:51:08] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
[2024-06-02 19:51:08] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 0 ms to minimize.
[2024-06-02 19:51:08] [INFO ] Deduced a trap composed of 36 places in 26 ms of which 1 ms to minimize.
[2024-06-02 19:51:08] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
[2024-06-02 19:51:08] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 1 ms to minimize.
[2024-06-02 19:51:08] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 4 (OVERLAPS) 243/342 variables, 99/117 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/342 variables, 36/153 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 7 (OVERLAPS) 1/343 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/343 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 9 (OVERLAPS) 0/343 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 269 unsolved
No progress, stopping.
After SMT solving in domain Real declared 343/343 variables, and 154 constraints, problems are : Problem set: 0 solved, 269 unsolved in 10136 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 99/99 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 269/269 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 269 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 4 (OVERLAPS) 243/342 variables, 99/117 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/342 variables, 36/153 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 269/422 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/342 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 8 (OVERLAPS) 1/343 variables, 1/423 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/343 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 10 (OVERLAPS) 0/343 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 269 unsolved
No progress, stopping.
After SMT solving in domain Int declared 343/343 variables, and 423 constraints, problems are : Problem set: 0 solved, 269 unsolved in 14694 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 99/99 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 269/269 constraints, Known Traps: 11/11 constraints]
After SMT, in 24970ms problems are : Problem set: 0 solved, 269 unsolved
Search for dead transitions found 0 dead transitions in 24974ms
Starting structural reductions in LTL mode, iteration 1 : 99/105 places, 270/284 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25156 ms. Remains : 99/105 places, 270/284 transitions.
[2024-06-02 19:51:31] [INFO ] Flatten gal took : 14 ms
[2024-06-02 19:51:31] [INFO ] Flatten gal took : 10 ms
[2024-06-02 19:51:31] [INFO ] Input system was already deterministic with 270 transitions.
[2024-06-02 19:51:31] [INFO ] Flatten gal took : 10 ms
[2024-06-02 19:51:31] [INFO ] Flatten gal took : 11 ms
[2024-06-02 19:51:31] [INFO ] Time to serialize gal into /tmp/CTLFireability7079093802245020110.gal : 2 ms
[2024-06-02 19:51:31] [INFO ] Time to serialize properties into /tmp/CTLFireability5640240740308354560.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/CTLFireability7079093802245020110.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5640240740308354560.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,1.40249e+06,1.97579,65960,2,3821,5,191696,6,0,665,194070,0


Converting to forward existential form...Done !
original formula: EG(EF((AG(((p3==1)&&(p39==1))) * EX((p72==1)))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U (!(E(TRUE U !(((p3==1)&&(p39==1))))) * EX((p72==1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t8, t9, t11, t16, t17, t18, t19, t20, t22, t24, t29, t30, t31, t32, t33, t35, t37...551
(forward)formula 0,0,3.60361,78424,1,0,485,339160,566,250,5609,310170,559
FORMULA FireWire-PT-01-CTLFireability-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 105/105 places, 284/284 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 104 transition count 282
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 103 transition count 282
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 103 transition count 281
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 102 transition count 281
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 8 place count 98 transition count 271
Iterating global reduction 2 with 4 rules applied. Total rules applied 12 place count 98 transition count 271
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 14 place count 96 transition count 267
Iterating global reduction 2 with 2 rules applied. Total rules applied 16 place count 96 transition count 267
Applied a total of 16 rules in 21 ms. Remains 96 /105 variables (removed 9) and now considering 267/284 (removed 17) transitions.
[2024-06-02 19:51:35] [INFO ] Flow matrix only has 241 transitions (discarded 26 similar events)
// Phase 1: matrix 241 rows 96 cols
[2024-06-02 19:51:35] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 19:51:35] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-06-02 19:51:35] [INFO ] Flow matrix only has 241 transitions (discarded 26 similar events)
[2024-06-02 19:51:35] [INFO ] Invariant cache hit.
[2024-06-02 19:51:35] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-06-02 19:51:35] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 195 ms to find 0 implicit places.
[2024-06-02 19:51:35] [INFO ] Redundant transitions in 17 ms returned []
Running 264 sub problems to find dead transitions.
[2024-06-02 19:51:35] [INFO ] Flow matrix only has 241 transitions (discarded 26 similar events)
[2024-06-02 19:51:35] [INFO ] Invariant cache hit.
[2024-06-02 19:51:35] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 264 unsolved
[2024-06-02 19:51:36] [INFO ] Deduced a trap composed of 33 places in 51 ms of which 1 ms to minimize.
[2024-06-02 19:51:36] [INFO ] Deduced a trap composed of 16 places in 18 ms of which 1 ms to minimize.
[2024-06-02 19:51:36] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 4 ms to minimize.
[2024-06-02 19:51:36] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 1 ms to minimize.
[2024-06-02 19:51:36] [INFO ] Deduced a trap composed of 35 places in 57 ms of which 1 ms to minimize.
[2024-06-02 19:51:36] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 3 (OVERLAPS) 240/335 variables, 95/108 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/335 variables, 35/143 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/335 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 6 (OVERLAPS) 1/336 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/336 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 8 (OVERLAPS) 0/336 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 264 unsolved
No progress, stopping.
After SMT solving in domain Real declared 336/337 variables, and 144 constraints, problems are : Problem set: 0 solved, 264 unsolved in 8036 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 96/96 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 264/264 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 264 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 3 (OVERLAPS) 240/335 variables, 95/108 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/335 variables, 35/143 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/335 variables, 264/407 constraints. Problems are: Problem set: 0 solved, 264 unsolved
[2024-06-02 19:51:47] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/335 variables, 1/408 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/335 variables, 0/408 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 8 (OVERLAPS) 1/336 variables, 1/409 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/336 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 10 (OVERLAPS) 0/336 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 264 unsolved
No progress, stopping.
After SMT solving in domain Int declared 336/337 variables, and 409 constraints, problems are : Problem set: 0 solved, 264 unsolved in 15485 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 96/96 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 264/264 constraints, Known Traps: 7/7 constraints]
After SMT, in 23669ms problems are : Problem set: 0 solved, 264 unsolved
Search for dead transitions found 0 dead transitions in 23673ms
Starting structural reductions in SI_CTL mode, iteration 1 : 96/105 places, 267/284 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 23917 ms. Remains : 96/105 places, 267/284 transitions.
[2024-06-02 19:51:59] [INFO ] Flatten gal took : 16 ms
[2024-06-02 19:51:59] [INFO ] Flatten gal took : 9 ms
[2024-06-02 19:51:59] [INFO ] Input system was already deterministic with 267 transitions.
[2024-06-02 19:51:59] [INFO ] Flatten gal took : 9 ms
[2024-06-02 19:51:59] [INFO ] Flatten gal took : 9 ms
[2024-06-02 19:51:59] [INFO ] Time to serialize gal into /tmp/CTLFireability16929454172859617288.gal : 2 ms
[2024-06-02 19:51:59] [INFO ] Time to serialize properties into /tmp/CTLFireability727193750704780115.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/CTLFireability16929454172859617288.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability727193750704780115.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,1.05328e+06,3.50369,104740,2,4866,5,309860,6,0,650,411969,0


Converting to forward existential form...Done !
original formula: EG(EF(((p2==1)&&(p88==1))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U ((p2==1)&&(p88==1))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t3, t7, t8, t10, t15, t16, t17, t18, t19, t21, t23, t28, t29, t30, t31, t32, t34, t36...551
Detected timeout of ITS tools.
[2024-06-02 19:52:29] [INFO ] Flatten gal took : 9 ms
[2024-06-02 19:52:29] [INFO ] Applying decomposition
[2024-06-02 19:52:29] [INFO ] Flatten gal took : 15 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/graph738237345469670668.txt' '-o' '/tmp/graph738237345469670668.bin' '-w' '/tmp/graph738237345469670668.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph738237345469670668.bin' '-l' '-1' '-v' '-w' '/tmp/graph738237345469670668.weights' '-q' '0' '-e' '0.001'
[2024-06-02 19:52:29] [INFO ] Decomposing Gal with order
[2024-06-02 19:52:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 19:52:29] [INFO ] Removed a total of 380 redundant transitions.
[2024-06-02 19:52:29] [INFO ] Flatten gal took : 45 ms
[2024-06-02 19:52:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 57 labels/synchronizations in 8 ms.
[2024-06-02 19:52:29] [INFO ] Time to serialize gal into /tmp/CTLFireability9809851748374729627.gal : 4 ms
[2024-06-02 19:52:29] [INFO ] Time to serialize properties into /tmp/CTLFireability1196534963200964745.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/CTLFireability9809851748374729627.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1196534963200964745.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,1.05328e+06,6.43913,218892,3665,211,420399,3283,467,899305,90,24666,0


Converting to forward existential form...Done !
original formula: EG(EF(((i0.u0.p2==1)&&(i0.u27.p88==1))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U ((i0.u0.p2==1)&&(i0.u27.p88==1))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t44, t46, t50, t51, t59, t80, t82, t94, t139, t145, t149, t152, t153, t157, t196, t203, t204,...740
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 : 105/105 places, 284/284 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 101 transition count 274
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 101 transition count 274
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 99 transition count 270
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 99 transition count 270
Applied a total of 12 rules in 9 ms. Remains 99 /105 variables (removed 6) and now considering 270/284 (removed 14) transitions.
[2024-06-02 19:52:59] [INFO ] Flow matrix only has 244 transitions (discarded 26 similar events)
// Phase 1: matrix 244 rows 99 cols
[2024-06-02 19:52:59] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 19:52:59] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-06-02 19:52:59] [INFO ] Flow matrix only has 244 transitions (discarded 26 similar events)
[2024-06-02 19:52:59] [INFO ] Invariant cache hit.
[2024-06-02 19:52:59] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-02 19:52:59] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 191 ms to find 0 implicit places.
Running 269 sub problems to find dead transitions.
[2024-06-02 19:52:59] [INFO ] Flow matrix only has 244 transitions (discarded 26 similar events)
[2024-06-02 19:52:59] [INFO ] Invariant cache hit.
[2024-06-02 19:52:59] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 269 unsolved
[2024-06-02 19:53:01] [INFO ] Deduced a trap composed of 53 places in 62 ms of which 1 ms to minimize.
[2024-06-02 19:53:01] [INFO ] Deduced a trap composed of 36 places in 53 ms of which 1 ms to minimize.
[2024-06-02 19:53:01] [INFO ] Deduced a trap composed of 39 places in 55 ms of which 1 ms to minimize.
[2024-06-02 19:53:01] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 1 ms to minimize.
[2024-06-02 19:53:01] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 1 ms to minimize.
[2024-06-02 19:53:01] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2024-06-02 19:53:01] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
[2024-06-02 19:53:01] [INFO ] Deduced a trap composed of 36 places in 27 ms of which 0 ms to minimize.
[2024-06-02 19:53:01] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
[2024-06-02 19:53:01] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
[2024-06-02 19:53:02] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 4 (OVERLAPS) 243/342 variables, 99/117 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/342 variables, 36/153 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 7 (OVERLAPS) 1/343 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/343 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 9 (OVERLAPS) 0/343 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 269 unsolved
No progress, stopping.
After SMT solving in domain Real declared 343/343 variables, and 154 constraints, problems are : Problem set: 0 solved, 269 unsolved in 10002 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 99/99 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 269/269 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 269 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 4 (OVERLAPS) 243/342 variables, 99/117 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/342 variables, 36/153 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 269/422 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/342 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 8 (OVERLAPS) 1/343 variables, 1/423 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/343 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 10 (OVERLAPS) 0/343 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 269 unsolved
No progress, stopping.
After SMT solving in domain Int declared 343/343 variables, and 423 constraints, problems are : Problem set: 0 solved, 269 unsolved in 14442 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 99/99 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 269/269 constraints, Known Traps: 11/11 constraints]
After SMT, in 24588ms problems are : Problem set: 0 solved, 269 unsolved
Search for dead transitions found 0 dead transitions in 24591ms
Starting structural reductions in LTL mode, iteration 1 : 99/105 places, 270/284 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24793 ms. Remains : 99/105 places, 270/284 transitions.
[2024-06-02 19:53:24] [INFO ] Flatten gal took : 10 ms
[2024-06-02 19:53:24] [INFO ] Flatten gal took : 10 ms
[2024-06-02 19:53:24] [INFO ] Input system was already deterministic with 270 transitions.
[2024-06-02 19:53:24] [INFO ] Flatten gal took : 9 ms
[2024-06-02 19:53:24] [INFO ] Flatten gal took : 25 ms
[2024-06-02 19:53:24] [INFO ] Time to serialize gal into /tmp/CTLFireability5252726208481943707.gal : 16 ms
[2024-06-02 19:53:24] [INFO ] Time to serialize properties into /tmp/CTLFireability10267735449632778117.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/CTLFireability5252726208481943707.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10267735449632778117.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,1.40249e+06,1.89999,66028,2,3821,5,191696,6,0,665,194070,0


Converting to forward existential form...Done !
original formula: AX(AG(((p2==1)&&(p96==1))))
=> equivalent forward existential formula: [(FwdU(EY(Init),TRUE) * !(((p2==1)&&(p96==1))))] = FALSE
(forward)formula 0,0,3.2192,66820,1,0,10,192419,10,2,1353,195563,4
FORMULA FireWire-PT-01-CTLFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 284/284 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 101 transition count 274
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 101 transition count 274
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 99 transition count 270
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 99 transition count 270
Applied a total of 12 rules in 7 ms. Remains 99 /105 variables (removed 6) and now considering 270/284 (removed 14) transitions.
[2024-06-02 19:53:27] [INFO ] Flow matrix only has 244 transitions (discarded 26 similar events)
[2024-06-02 19:53:27] [INFO ] Invariant cache hit.
[2024-06-02 19:53:27] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-06-02 19:53:27] [INFO ] Flow matrix only has 244 transitions (discarded 26 similar events)
[2024-06-02 19:53:27] [INFO ] Invariant cache hit.
[2024-06-02 19:53:27] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-02 19:53:27] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 181 ms to find 0 implicit places.
Running 269 sub problems to find dead transitions.
[2024-06-02 19:53:27] [INFO ] Flow matrix only has 244 transitions (discarded 26 similar events)
[2024-06-02 19:53:27] [INFO ] Invariant cache hit.
[2024-06-02 19:53:27] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 269 unsolved
[2024-06-02 19:53:29] [INFO ] Deduced a trap composed of 53 places in 53 ms of which 1 ms to minimize.
[2024-06-02 19:53:29] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 1 ms to minimize.
[2024-06-02 19:53:29] [INFO ] Deduced a trap composed of 39 places in 51 ms of which 3 ms to minimize.
[2024-06-02 19:53:29] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 1 ms to minimize.
[2024-06-02 19:53:29] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 1 ms to minimize.
[2024-06-02 19:53:29] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
[2024-06-02 19:53:29] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 0 ms to minimize.
[2024-06-02 19:53:29] [INFO ] Deduced a trap composed of 36 places in 28 ms of which 1 ms to minimize.
[2024-06-02 19:53:29] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
[2024-06-02 19:53:30] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
[2024-06-02 19:53:30] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 4 (OVERLAPS) 243/342 variables, 99/117 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/342 variables, 36/153 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 7 (OVERLAPS) 1/343 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/343 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 9 (OVERLAPS) 0/343 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 269 unsolved
No progress, stopping.
After SMT solving in domain Real declared 343/343 variables, and 154 constraints, problems are : Problem set: 0 solved, 269 unsolved in 9924 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 99/99 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 269/269 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 269 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 4 (OVERLAPS) 243/342 variables, 99/117 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/342 variables, 36/153 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 269/422 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/342 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 8 (OVERLAPS) 1/343 variables, 1/423 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/343 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 10 (OVERLAPS) 0/343 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 269 unsolved
No progress, stopping.
After SMT solving in domain Int declared 343/343 variables, and 423 constraints, problems are : Problem set: 0 solved, 269 unsolved in 14320 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 99/99 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 269/269 constraints, Known Traps: 11/11 constraints]
After SMT, in 24399ms problems are : Problem set: 0 solved, 269 unsolved
Search for dead transitions found 0 dead transitions in 24403ms
Starting structural reductions in LTL mode, iteration 1 : 99/105 places, 270/284 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24591 ms. Remains : 99/105 places, 270/284 transitions.
[2024-06-02 19:53:52] [INFO ] Flatten gal took : 11 ms
[2024-06-02 19:53:52] [INFO ] Flatten gal took : 8 ms
[2024-06-02 19:53:52] [INFO ] Input system was already deterministic with 270 transitions.
[2024-06-02 19:53:52] [INFO ] Flatten gal took : 7 ms
[2024-06-02 19:53:52] [INFO ] Flatten gal took : 7 ms
[2024-06-02 19:53:52] [INFO ] Time to serialize gal into /tmp/CTLFireability12056063002889619687.gal : 2 ms
[2024-06-02 19:53:52] [INFO ] Time to serialize properties into /tmp/CTLFireability11212626731722311672.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/CTLFireability12056063002889619687.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11212626731722311672.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,1.40249e+06,1.85269,66096,2,3821,5,191696,6,0,665,194070,0


Converting to forward existential form...Done !
original formula: A(EX(!(((p7==1)&&(p74==1)))) U AG(EF(((p10==1)&&(p99==1)))))
=> equivalent forward existential formula: [((Init * !(EG(!(!(E(TRUE U !(E(TRUE U ((p10==1)&&(p99==1)))))))))) * !(E(!(!(E(TRUE U !(E(TRUE U ((p10==1)&&(p9...265
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t8, t9, t11, t16, t17, t18, t19, t20, t22, t24, t29, t30, t31, t32, t33, t35, t37...551
Detected timeout of ITS tools.
[2024-06-02 19:54:22] [INFO ] Flatten gal took : 8 ms
[2024-06-02 19:54:22] [INFO ] Applying decomposition
[2024-06-02 19:54:22] [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/graph8295241837270116381.txt' '-o' '/tmp/graph8295241837270116381.bin' '-w' '/tmp/graph8295241837270116381.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8295241837270116381.bin' '-l' '-1' '-v' '-w' '/tmp/graph8295241837270116381.weights' '-q' '0' '-e' '0.001'
[2024-06-02 19:54:22] [INFO ] Decomposing Gal with order
[2024-06-02 19:54:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 19:54:22] [INFO ] Removed a total of 389 redundant transitions.
[2024-06-02 19:54:22] [INFO ] Flatten gal took : 17 ms
[2024-06-02 19:54:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 64 labels/synchronizations in 6 ms.
[2024-06-02 19:54:22] [INFO ] Time to serialize gal into /tmp/CTLFireability2692256334828519292.gal : 3 ms
[2024-06-02 19:54:22] [INFO ] Time to serialize properties into /tmp/CTLFireability1482287677869373410.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/CTLFireability2692256334828519292.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1482287677869373410.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,1.40249e+06,5.90271,218304,2724,179,380731,1735,530,1.25181e+06,82,14943,0


Converting to forward existential form...Done !
original formula: A(EX(!(((i4.i0.u2.p7==1)&&(i4.i1.u32.p74==1)))) U AG(EF(((i0.u3.p10==1)&&(i4.i1.u32.p99==1)))))
=> equivalent forward existential formula: [((Init * !(EG(!(!(E(TRUE U !(E(TRUE U ((i0.u3.p10==1)&&(i4.i1.u32.p99==1)))))))))) * !(E(!(!(E(TRUE U !(E(TRUE ...332
Reverse transition relation is NOT exact ! Due to transitions t2, t45, t47, t51, t52, t60, t61, t66, t71, t76, t81, t94, t143, t144, t145, t147, t150, t153...717
Using saturation style SCC detection
Using saturation style SCC detection
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 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 an SCC at level 10
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
(forward)formula 0,0,18.5451,563536,1,0,915182,3080,2802,3.66526e+06,387,18689,1720563
FORMULA FireWire-PT-01-CTLFireability-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 105/105 places, 284/284 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 105 transition count 283
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 104 transition count 283
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 104 transition count 282
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 103 transition count 282
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 8 place count 99 transition count 272
Iterating global reduction 2 with 4 rules applied. Total rules applied 12 place count 99 transition count 272
Applied a total of 12 rules in 11 ms. Remains 99 /105 variables (removed 6) and now considering 272/284 (removed 12) transitions.
[2024-06-02 19:54:41] [INFO ] Flow matrix only has 246 transitions (discarded 26 similar events)
// Phase 1: matrix 246 rows 99 cols
[2024-06-02 19:54:41] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 19:54:41] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-06-02 19:54:41] [INFO ] Flow matrix only has 246 transitions (discarded 26 similar events)
[2024-06-02 19:54:41] [INFO ] Invariant cache hit.
[2024-06-02 19:54:41] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-02 19:54:41] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
[2024-06-02 19:54:41] [INFO ] Redundant transitions in 4 ms returned []
Running 271 sub problems to find dead transitions.
[2024-06-02 19:54:41] [INFO ] Flow matrix only has 246 transitions (discarded 26 similar events)
[2024-06-02 19:54:41] [INFO ] Invariant cache hit.
[2024-06-02 19:54:41] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 271 unsolved
[2024-06-02 19:54:42] [INFO ] Deduced a trap composed of 34 places in 55 ms of which 1 ms to minimize.
[2024-06-02 19:54:42] [INFO ] Deduced a trap composed of 36 places in 24 ms of which 1 ms to minimize.
[2024-06-02 19:54:42] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 0 ms to minimize.
[2024-06-02 19:54:42] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
[2024-06-02 19:54:43] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
[2024-06-02 19:54:43] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-06-02 19:54:43] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 4 (OVERLAPS) 245/344 variables, 99/113 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/344 variables, 36/149 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/344 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 7 (OVERLAPS) 1/345 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/345 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 9 (OVERLAPS) 0/345 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 271 unsolved
No progress, stopping.
After SMT solving in domain Real declared 345/345 variables, and 150 constraints, problems are : Problem set: 0 solved, 271 unsolved in 9586 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 99/99 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 271/271 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 271 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 4 (OVERLAPS) 245/344 variables, 99/113 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/344 variables, 36/149 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/344 variables, 271/420 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/344 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 8 (OVERLAPS) 1/345 variables, 1/421 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/345 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 10 (OVERLAPS) 0/345 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 271 unsolved
No progress, stopping.
After SMT solving in domain Int declared 345/345 variables, and 421 constraints, problems are : Problem set: 0 solved, 271 unsolved in 14364 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 99/99 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 271/271 constraints, Known Traps: 7/7 constraints]
After SMT, in 24093ms problems are : Problem set: 0 solved, 271 unsolved
Search for dead transitions found 0 dead transitions in 24097ms
Starting structural reductions in SI_CTL mode, iteration 1 : 99/105 places, 272/284 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 24286 ms. Remains : 99/105 places, 272/284 transitions.
[2024-06-02 19:55:05] [INFO ] Flatten gal took : 8 ms
[2024-06-02 19:55:05] [INFO ] Flatten gal took : 7 ms
[2024-06-02 19:55:05] [INFO ] Input system was already deterministic with 272 transitions.
[2024-06-02 19:55:05] [INFO ] Flatten gal took : 7 ms
[2024-06-02 19:55:05] [INFO ] Flatten gal took : 6 ms
[2024-06-02 19:55:05] [INFO ] Time to serialize gal into /tmp/CTLFireability13196239042741737671.gal : 2 ms
[2024-06-02 19:55:05] [INFO ] Time to serialize properties into /tmp/CTLFireability11993128756398783641.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/CTLFireability13196239042741737671.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11993128756398783641.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,1.09078e+06,4.07716,124972,2,5522,5,364943,6,0,667,514633,0


Converting to forward existential form...Done !
original formula: E((AG(((p45==1)&&(p58==1))) + ((p5==1)&&(p47==1))) U E(((p3==1)&&(p78==1)) U !(((EF(((p7==1)&&(p83==1))) + A(((p7==1)&&(p49==1)) U ((p7==...220
=> equivalent forward existential formula: [(((FwdU(FwdU(Init,(!(E(TRUE U !(((p45==1)&&(p58==1))))) + ((p5==1)&&(p47==1)))),((p3==1)&&(p78==1))) * !((((p7=...358
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t8, t9, t11, t16, t17, t18, t19, t20, t22, t24, t29, t30, t31, t32, t33, t35, t37...550
Detected timeout of ITS tools.
[2024-06-02 19:55:35] [INFO ] Flatten gal took : 11 ms
[2024-06-02 19:55:35] [INFO ] Applying decomposition
[2024-06-02 19:55:35] [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/graph3986311258262327338.txt' '-o' '/tmp/graph3986311258262327338.bin' '-w' '/tmp/graph3986311258262327338.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3986311258262327338.bin' '-l' '-1' '-v' '-w' '/tmp/graph3986311258262327338.weights' '-q' '0' '-e' '0.001'
[2024-06-02 19:55:35] [INFO ] Decomposing Gal with order
[2024-06-02 19:55:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 19:55:35] [INFO ] Removed a total of 397 redundant transitions.
[2024-06-02 19:55:35] [INFO ] Flatten gal took : 14 ms
[2024-06-02 19:55:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 80 labels/synchronizations in 6 ms.
[2024-06-02 19:55:35] [INFO ] Time to serialize gal into /tmp/CTLFireability15965907613418737658.gal : 3 ms
[2024-06-02 19:55:35] [INFO ] Time to serialize properties into /tmp/CTLFireability10172390244420362116.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/CTLFireability15965907613418737658.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10172390244420362116.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 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,1.09078e+06,12.8421,344224,2099,199,482225,11175,556,1.87399e+06,82,64089,0


Converting to forward existential form...Done !
original formula: E((AG(((i3.u14.p45==1)&&(i1.u18.p58==1))) + ((i2.u7.p5==1)&&(i3.u15.p47==1))) U E(((i0.i0.u1.p3==1)&&(i5.u25.p78==1)) U !(((EF(((i3.u2.p7...333
=> equivalent forward existential formula: [(((FwdU(FwdU(Init,(!(E(TRUE U !(((i3.u14.p45==1)&&(i1.u18.p58==1))))) + ((i2.u7.p5==1)&&(i3.u15.p47==1)))),((i0...497
Reverse transition relation is NOT exact ! Due to transitions t45, t47, t51, t52, t60, t81, t83, t95, t97, t148, t149, t152, t155, t156, t157, t164, t199, ...801
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an 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
(forward)formula 0,0,23.7537,485464,1,0,663870,15718,2996,3.04426e+06,384,82506,1113946
FORMULA FireWire-PT-01-CTLFireability-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 284/284 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 101 transition count 274
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 101 transition count 274
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 99 transition count 270
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 99 transition count 270
Applied a total of 12 rules in 6 ms. Remains 99 /105 variables (removed 6) and now considering 270/284 (removed 14) transitions.
[2024-06-02 19:55:59] [INFO ] Flow matrix only has 244 transitions (discarded 26 similar events)
// Phase 1: matrix 244 rows 99 cols
[2024-06-02 19:55:59] [INFO ] Computed 7 invariants in 10 ms
[2024-06-02 19:55:59] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-06-02 19:55:59] [INFO ] Flow matrix only has 244 transitions (discarded 26 similar events)
[2024-06-02 19:55:59] [INFO ] Invariant cache hit.
[2024-06-02 19:55:59] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-02 19:55:59] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 163 ms to find 0 implicit places.
Running 269 sub problems to find dead transitions.
[2024-06-02 19:55:59] [INFO ] Flow matrix only has 244 transitions (discarded 26 similar events)
[2024-06-02 19:55:59] [INFO ] Invariant cache hit.
[2024-06-02 19:55:59] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 269 unsolved
[2024-06-02 19:56:00] [INFO ] Deduced a trap composed of 53 places in 52 ms of which 1 ms to minimize.
[2024-06-02 19:56:01] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 1 ms to minimize.
[2024-06-02 19:56:01] [INFO ] Deduced a trap composed of 39 places in 49 ms of which 1 ms to minimize.
[2024-06-02 19:56:01] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 1 ms to minimize.
[2024-06-02 19:56:01] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2024-06-02 19:56:01] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-06-02 19:56:01] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
[2024-06-02 19:56:01] [INFO ] Deduced a trap composed of 36 places in 23 ms of which 0 ms to minimize.
[2024-06-02 19:56:01] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
[2024-06-02 19:56:01] [INFO ] Deduced a trap composed of 17 places in 20 ms of which 1 ms to minimize.
[2024-06-02 19:56:01] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 4 (OVERLAPS) 243/342 variables, 99/117 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/342 variables, 36/153 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 7 (OVERLAPS) 1/343 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/343 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 9 (OVERLAPS) 0/343 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 269 unsolved
No progress, stopping.
After SMT solving in domain Real declared 343/343 variables, and 154 constraints, problems are : Problem set: 0 solved, 269 unsolved in 9904 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 99/99 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 269/269 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 269 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 4 (OVERLAPS) 243/342 variables, 99/117 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/342 variables, 36/153 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 269/422 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/342 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 8 (OVERLAPS) 1/343 variables, 1/423 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/343 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 10 (OVERLAPS) 0/343 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 269 unsolved
No progress, stopping.
After SMT solving in domain Int declared 343/343 variables, and 423 constraints, problems are : Problem set: 0 solved, 269 unsolved in 14576 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 99/99 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 269/269 constraints, Known Traps: 11/11 constraints]
After SMT, in 24609ms problems are : Problem set: 0 solved, 269 unsolved
Search for dead transitions found 0 dead transitions in 24611ms
Starting structural reductions in LTL mode, iteration 1 : 99/105 places, 270/284 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24781 ms. Remains : 99/105 places, 270/284 transitions.
[2024-06-02 19:56:24] [INFO ] Flatten gal took : 11 ms
[2024-06-02 19:56:24] [INFO ] Flatten gal took : 6 ms
[2024-06-02 19:56:24] [INFO ] Input system was already deterministic with 270 transitions.
[2024-06-02 19:56:24] [INFO ] Flatten gal took : 6 ms
[2024-06-02 19:56:24] [INFO ] Flatten gal took : 8 ms
[2024-06-02 19:56:24] [INFO ] Time to serialize gal into /tmp/CTLFireability16124822523982293172.gal : 1 ms
[2024-06-02 19:56:24] [INFO ] Time to serialize properties into /tmp/CTLFireability1553286382602466825.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/CTLFireability16124822523982293172.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1553286382602466825.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,1.40249e+06,1.94656,66068,2,3821,5,191696,6,0,665,194070,0


Converting to forward existential form...Done !
original formula: E(EF(EG(E(AG(((p7==1)&&(p28==1))) U EF(((p8==1)&&(p92==1)))))) U AG((((AF(EX(((p5==1)&&(p83==1)))) + (p100==1)) + (((AG((p83==1)) * EX((p...283
=> equivalent forward existential formula: [(FwdU(Init,E(TRUE U EG(E(!(E(TRUE U !(((p7==1)&&(p28==1))))) U E(TRUE U ((p8==1)&&(p92==1))))))) * !(E(TRUE U !...383
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t8, t9, t11, t16, t17, t18, t19, t20, t22, t24, t29, t30, t31, t32, t33, t35, t37...551
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,24.1508,649356,1,0,670,3.6001e+06,572,378,5693,3.49104e+06,735
FORMULA FireWire-PT-01-CTLFireability-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 284/284 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 101 transition count 274
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 101 transition count 274
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 99 transition count 270
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 99 transition count 270
Applied a total of 12 rules in 2 ms. Remains 99 /105 variables (removed 6) and now considering 270/284 (removed 14) transitions.
[2024-06-02 19:56:48] [INFO ] Flow matrix only has 244 transitions (discarded 26 similar events)
[2024-06-02 19:56:48] [INFO ] Invariant cache hit.
[2024-06-02 19:56:48] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-06-02 19:56:48] [INFO ] Flow matrix only has 244 transitions (discarded 26 similar events)
[2024-06-02 19:56:48] [INFO ] Invariant cache hit.
[2024-06-02 19:56:48] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-02 19:56:48] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 186 ms to find 0 implicit places.
Running 269 sub problems to find dead transitions.
[2024-06-02 19:56:48] [INFO ] Flow matrix only has 244 transitions (discarded 26 similar events)
[2024-06-02 19:56:48] [INFO ] Invariant cache hit.
[2024-06-02 19:56:48] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 269 unsolved
[2024-06-02 19:56:50] [INFO ] Deduced a trap composed of 53 places in 49 ms of which 0 ms to minimize.
[2024-06-02 19:56:50] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 1 ms to minimize.
[2024-06-02 19:56:50] [INFO ] Deduced a trap composed of 39 places in 46 ms of which 1 ms to minimize.
[2024-06-02 19:56:50] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 0 ms to minimize.
[2024-06-02 19:56:50] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
[2024-06-02 19:56:50] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 0 ms to minimize.
[2024-06-02 19:56:50] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 0 ms to minimize.
[2024-06-02 19:56:50] [INFO ] Deduced a trap composed of 36 places in 29 ms of which 1 ms to minimize.
[2024-06-02 19:56:50] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 1 ms to minimize.
[2024-06-02 19:56:50] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
[2024-06-02 19:56:50] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 4 (OVERLAPS) 243/342 variables, 99/117 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/342 variables, 36/153 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 7 (OVERLAPS) 1/343 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/343 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 9 (OVERLAPS) 0/343 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 269 unsolved
No progress, stopping.
After SMT solving in domain Real declared 343/343 variables, and 154 constraints, problems are : Problem set: 0 solved, 269 unsolved in 9785 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 99/99 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 269/269 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 269 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 4 (OVERLAPS) 243/342 variables, 99/117 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/342 variables, 36/153 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 269/422 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/342 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 8 (OVERLAPS) 1/343 variables, 1/423 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/343 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 10 (OVERLAPS) 0/343 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 269 unsolved
No progress, stopping.
After SMT solving in domain Int declared 343/343 variables, and 423 constraints, problems are : Problem set: 0 solved, 269 unsolved in 14583 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 99/99 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 269/269 constraints, Known Traps: 11/11 constraints]
After SMT, in 24487ms problems are : Problem set: 0 solved, 269 unsolved
Search for dead transitions found 0 dead transitions in 24492ms
Starting structural reductions in LTL mode, iteration 1 : 99/105 places, 270/284 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24680 ms. Remains : 99/105 places, 270/284 transitions.
[2024-06-02 19:57:13] [INFO ] Flatten gal took : 6 ms
[2024-06-02 19:57:13] [INFO ] Flatten gal took : 6 ms
[2024-06-02 19:57:13] [INFO ] Input system was already deterministic with 270 transitions.
[2024-06-02 19:57:13] [INFO ] Flatten gal took : 6 ms
[2024-06-02 19:57:13] [INFO ] Flatten gal took : 7 ms
[2024-06-02 19:57:13] [INFO ] Time to serialize gal into /tmp/CTLFireability4381810143726324558.gal : 1 ms
[2024-06-02 19:57:13] [INFO ] Time to serialize properties into /tmp/CTLFireability1739741897129727646.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/CTLFireability4381810143726324558.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1739741897129727646.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,1.40249e+06,1.95092,66076,2,3821,5,191696,6,0,665,194070,0


Converting to forward existential form...Done !
original formula: E((((AG(((((EF(((p7==1)&&(p69==1))) + !(((p7==1)&&(p23==1)))) + ((((p8==1)&&(p88==1))&&((p6==1)&&(p32==1)))&&((p22==1)&&(p35==1)))) * (p2...467
=> equivalent forward existential formula: [((((FwdU(Init,(((!(E(TRUE U !(((((E(TRUE U ((p7==1)&&(p69==1))) + !(((p7==1)&&(p23==1)))) + ((((p8==1)&&(p88==1...564
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t8, t9, t11, t16, t17, t18, t19, t20, t22, t24, t29, t30, t31, t32, t33, t35, t37...551
Detected timeout of ITS tools.
[2024-06-02 19:57:43] [INFO ] Flatten gal took : 6 ms
[2024-06-02 19:57:43] [INFO ] Applying decomposition
[2024-06-02 19:57:43] [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/graph10182379620535994186.txt' '-o' '/tmp/graph10182379620535994186.bin' '-w' '/tmp/graph10182379620535994186.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10182379620535994186.bin' '-l' '-1' '-v' '-w' '/tmp/graph10182379620535994186.weights' '-q' '0' '-e' '0.001'
[2024-06-02 19:57:43] [INFO ] Decomposing Gal with order
[2024-06-02 19:57:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 19:57:43] [INFO ] Removed a total of 383 redundant transitions.
[2024-06-02 19:57:43] [INFO ] Flatten gal took : 13 ms
[2024-06-02 19:57:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 53 labels/synchronizations in 5 ms.
[2024-06-02 19:57:43] [INFO ] Time to serialize gal into /tmp/CTLFireability10123841852497114852.gal : 2 ms
[2024-06-02 19:57:43] [INFO ] Time to serialize properties into /tmp/CTLFireability5660225067701625238.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/CTLFireability10123841852497114852.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5660225067701625238.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.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 284/284 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 103 transition count 279
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 103 transition count 279
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 102 transition count 277
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 102 transition count 277
Applied a total of 6 rules in 3 ms. Remains 102 /105 variables (removed 3) and now considering 277/284 (removed 7) transitions.
[2024-06-02 19:58:13] [INFO ] Flow matrix only has 251 transitions (discarded 26 similar events)
// Phase 1: matrix 251 rows 102 cols
[2024-06-02 19:58:13] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 19:58:13] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-06-02 19:58:13] [INFO ] Flow matrix only has 251 transitions (discarded 26 similar events)
[2024-06-02 19:58:13] [INFO ] Invariant cache hit.
[2024-06-02 19:58:13] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-06-02 19:58:13] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
Running 276 sub problems to find dead transitions.
[2024-06-02 19:58:13] [INFO ] Flow matrix only has 251 transitions (discarded 26 similar events)
[2024-06-02 19:58:13] [INFO ] Invariant cache hit.
[2024-06-02 19:58:13] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (OVERLAPS) 1/102 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 276 unsolved
[2024-06-02 19:58:15] [INFO ] Deduced a trap composed of 36 places in 52 ms of which 1 ms to minimize.
[2024-06-02 19:58:15] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 0 ms to minimize.
[2024-06-02 19:58:15] [INFO ] Deduced a trap composed of 44 places in 44 ms of which 1 ms to minimize.
[2024-06-02 19:58:15] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-06-02 19:58:15] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
[2024-06-02 19:58:15] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2024-06-02 19:58:15] [INFO ] Deduced a trap composed of 37 places in 50 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 250/352 variables, 102/116 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/352 variables, 37/153 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/352 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 7 (OVERLAPS) 1/353 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/353 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 9 (OVERLAPS) 0/353 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Real declared 353/353 variables, and 154 constraints, problems are : Problem set: 0 solved, 276 unsolved in 10023 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 102/102 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 276 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (OVERLAPS) 1/102 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 250/352 variables, 102/116 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/352 variables, 37/153 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/352 variables, 276/429 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/352 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 8 (OVERLAPS) 1/353 variables, 1/430 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/353 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 10 (OVERLAPS) 0/353 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Int declared 353/353 variables, and 430 constraints, problems are : Problem set: 0 solved, 276 unsolved in 16302 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 102/102 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 7/7 constraints]
After SMT, in 26447ms problems are : Problem set: 0 solved, 276 unsolved
Search for dead transitions found 0 dead transitions in 26451ms
Starting structural reductions in LTL mode, iteration 1 : 102/105 places, 277/284 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26619 ms. Remains : 102/105 places, 277/284 transitions.
[2024-06-02 19:58:40] [INFO ] Flatten gal took : 9 ms
[2024-06-02 19:58:40] [INFO ] Flatten gal took : 7 ms
[2024-06-02 19:58:40] [INFO ] Input system was already deterministic with 277 transitions.
[2024-06-02 19:58:40] [INFO ] Flatten gal took : 6 ms
[2024-06-02 19:58:40] [INFO ] Flatten gal took : 6 ms
[2024-06-02 19:58:40] [INFO ] Time to serialize gal into /tmp/CTLFireability11268874228486171423.gal : 1 ms
[2024-06-02 19:58:40] [INFO ] Time to serialize properties into /tmp/CTLFireability8920177734292991900.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/CTLFireability11268874228486171423.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8920177734292991900.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,1.49018e+06,1.93053,67784,2,3794,5,190927,6,0,684,193944,0


Converting to forward existential form...Done !
original formula: AF((E(EX(EF(((p7==1)&&(p49==1)))) U ((EX(((p7==1)&&(p23==1))) * EF(((p2==1)&&(p29==1)))) * (AX(((p5==1)&&(p51==1))) * !(((p85==1)&&(p102=...203
=> equivalent forward existential formula: [FwdG(Init,!((E(EX(E(TRUE U ((p7==1)&&(p49==1)))) U ((EX(((p7==1)&&(p23==1))) * E(TRUE U ((p2==1)&&(p29==1)))) *...272
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t5, t6, t10, t11, t13, t18, t19, t20, t21, t22, t24, t26, t31, t32, t33, t34, t35...567
Detected timeout of ITS tools.
[2024-06-02 19:59:10] [INFO ] Flatten gal took : 14 ms
[2024-06-02 19:59:10] [INFO ] Applying decomposition
[2024-06-02 19:59: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/graph10785710364554285061.txt' '-o' '/tmp/graph10785710364554285061.bin' '-w' '/tmp/graph10785710364554285061.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10785710364554285061.bin' '-l' '-1' '-v' '-w' '/tmp/graph10785710364554285061.weights' '-q' '0' '-e' '0.001'
[2024-06-02 19:59:10] [INFO ] Decomposing Gal with order
[2024-06-02 19:59:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 19:59:10] [INFO ] Removed a total of 399 redundant transitions.
[2024-06-02 19:59:10] [INFO ] Flatten gal took : 13 ms
[2024-06-02 19:59:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 58 labels/synchronizations in 3 ms.
[2024-06-02 19:59:10] [INFO ] Time to serialize gal into /tmp/CTLFireability8941234565700647117.gal : 1 ms
[2024-06-02 19:59:10] [INFO ] Time to serialize properties into /tmp/CTLFireability9682865920972335864.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/CTLFireability8941234565700647117.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9682865920972335864.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,1.49018e+06,7.16656,239892,3321,196,302297,1829,536,1.56182e+06,93,17807,0


Converting to forward existential form...Done !
original formula: AF((E(EX(EF(((i3.u2.p7==1)&&(i3.u17.p49==1)))) U ((EX(((i3.u2.p7==1)&&(i2.u7.p23==1))) * EF(((i0.u0.p2==1)&&(i2.u8.p29==1)))) * (AX(((i2....286
=> equivalent forward existential formula: [FwdG(Init,!((E(EX(E(TRUE U ((i3.u2.p7==1)&&(i3.u17.p49==1)))) U ((EX(((i3.u2.p7==1)&&(i2.u7.p23==1))) * E(TRUE ...355
Reverse transition relation is NOT exact ! Due to transitions t2, t47, t49, t53, t54, t62, t63, t68, t73, t78, t83, t97, t145, t146, t147, t149, t152, t153...718
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
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
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 : 105/105 places, 284/284 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 104 transition count 282
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 103 transition count 282
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 103 transition count 281
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 102 transition count 281
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 8 place count 98 transition count 271
Iterating global reduction 2 with 4 rules applied. Total rules applied 12 place count 98 transition count 271
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 14 place count 96 transition count 267
Iterating global reduction 2 with 2 rules applied. Total rules applied 16 place count 96 transition count 267
Applied a total of 16 rules in 13 ms. Remains 96 /105 variables (removed 9) and now considering 267/284 (removed 17) transitions.
[2024-06-02 19:59:40] [INFO ] Flow matrix only has 241 transitions (discarded 26 similar events)
// Phase 1: matrix 241 rows 96 cols
[2024-06-02 19:59:40] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 19:59:40] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-06-02 19:59:40] [INFO ] Flow matrix only has 241 transitions (discarded 26 similar events)
[2024-06-02 19:59:40] [INFO ] Invariant cache hit.
[2024-06-02 19:59:40] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-06-02 19:59:40] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
[2024-06-02 19:59:40] [INFO ] Redundant transitions in 3 ms returned []
Running 264 sub problems to find dead transitions.
[2024-06-02 19:59:40] [INFO ] Flow matrix only has 241 transitions (discarded 26 similar events)
[2024-06-02 19:59:40] [INFO ] Invariant cache hit.
[2024-06-02 19:59:40] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 264 unsolved
[2024-06-02 19:59:41] [INFO ] Deduced a trap composed of 33 places in 52 ms of which 1 ms to minimize.
[2024-06-02 19:59:41] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 0 ms to minimize.
[2024-06-02 19:59:41] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 1 ms to minimize.
[2024-06-02 19:59:41] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
[2024-06-02 19:59:41] [INFO ] Deduced a trap composed of 35 places in 51 ms of which 1 ms to minimize.
[2024-06-02 19:59:41] [INFO ] Deduced a trap composed of 16 places in 19 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 3 (OVERLAPS) 240/335 variables, 95/108 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/335 variables, 35/143 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/335 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 6 (OVERLAPS) 1/336 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/336 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 8 (OVERLAPS) 0/336 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 264 unsolved
No progress, stopping.
After SMT solving in domain Real declared 336/337 variables, and 144 constraints, problems are : Problem set: 0 solved, 264 unsolved in 8276 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 96/96 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 264/264 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 264 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 3 (OVERLAPS) 240/335 variables, 95/108 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/335 variables, 35/143 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/335 variables, 264/407 constraints. Problems are: Problem set: 0 solved, 264 unsolved
[2024-06-02 19:59:52] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/335 variables, 1/408 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/335 variables, 0/408 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 8 (OVERLAPS) 1/336 variables, 1/409 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/336 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 10 (OVERLAPS) 0/336 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 264 unsolved
No progress, stopping.
After SMT solving in domain Int declared 336/337 variables, and 409 constraints, problems are : Problem set: 0 solved, 264 unsolved in 15169 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 96/96 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 264/264 constraints, Known Traps: 7/7 constraints]
After SMT, in 23567ms problems are : Problem set: 0 solved, 264 unsolved
Search for dead transitions found 0 dead transitions in 23570ms
Starting structural reductions in SI_CTL mode, iteration 1 : 96/105 places, 267/284 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 23764 ms. Remains : 96/105 places, 267/284 transitions.
[2024-06-02 20:00:04] [INFO ] Flatten gal took : 6 ms
[2024-06-02 20:00:04] [INFO ] Flatten gal took : 6 ms
[2024-06-02 20:00:04] [INFO ] Input system was already deterministic with 267 transitions.
[2024-06-02 20:00:04] [INFO ] Flatten gal took : 5 ms
[2024-06-02 20:00:04] [INFO ] Flatten gal took : 6 ms
[2024-06-02 20:00:04] [INFO ] Time to serialize gal into /tmp/CTLFireability5800657564478439155.gal : 2 ms
[2024-06-02 20:00:04] [INFO ] Time to serialize properties into /tmp/CTLFireability14653029299074835464.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/CTLFireability5800657564478439155.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14653029299074835464.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,1.05328e+06,3.36975,105268,2,4866,5,309860,6,0,650,411969,0


Converting to forward existential form...Done !
original formula: EF((E((((p4==1)&&(p21==1))||((p10==1)&&(p72==1))) U (((p7==1)&&(p73==1))||((p3==1)&&(p18==1)))) * EG((p10==0))))
=> equivalent forward existential formula: [FwdG((FwdU(Init,TRUE) * E((((p4==1)&&(p21==1))||((p10==1)&&(p72==1))) U (((p7==1)&&(p73==1))||((p3==1)&&(p18==1...180
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t3, t7, t8, t10, t15, t16, t17, t18, t19, t21, t23, t28, t29, t30, t31, t32, t34, t36...551
Hit Full ! (commute/partial/dont) 237/0/30
(forward)formula 0,1,5.05135,105268,1,0,477,377910,561,247,5682,411969,548
FORMULA FireWire-PT-01-CTLFireability-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 284/284 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 102 transition count 277
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 102 transition count 277
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 101 transition count 275
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 101 transition count 275
Applied a total of 8 rules in 6 ms. Remains 101 /105 variables (removed 4) and now considering 275/284 (removed 9) transitions.
[2024-06-02 20:00:09] [INFO ] Flow matrix only has 249 transitions (discarded 26 similar events)
// Phase 1: matrix 249 rows 101 cols
[2024-06-02 20:00:09] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 20:00:09] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-06-02 20:00:09] [INFO ] Flow matrix only has 249 transitions (discarded 26 similar events)
[2024-06-02 20:00:09] [INFO ] Invariant cache hit.
[2024-06-02 20:00:09] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-06-02 20:00:09] [INFO ] Implicit Places using invariants and state equation in 218 ms returned []
Implicit Place search using SMT with State Equation took 268 ms to find 0 implicit places.
Running 274 sub problems to find dead transitions.
[2024-06-02 20:00:09] [INFO ] Flow matrix only has 249 transitions (discarded 26 similar events)
[2024-06-02 20:00:09] [INFO ] Invariant cache hit.
[2024-06-02 20:00:09] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 1 (OVERLAPS) 1/101 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 274 unsolved
[2024-06-02 20:00:10] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 0 ms to minimize.
[2024-06-02 20:00:11] [INFO ] Deduced a trap composed of 35 places in 48 ms of which 1 ms to minimize.
[2024-06-02 20:00:11] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 1 ms to minimize.
[2024-06-02 20:00:11] [INFO ] Deduced a trap composed of 36 places in 32 ms of which 0 ms to minimize.
[2024-06-02 20:00:11] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 1 ms to minimize.
[2024-06-02 20:00:11] [INFO ] Deduced a trap composed of 17 places in 20 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 274 unsolved
[2024-06-02 20:00:11] [INFO ] Deduced a trap composed of 35 places in 52 ms of which 1 ms to minimize.
[2024-06-02 20:00:11] [INFO ] Deduced a trap composed of 34 places in 44 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 5 (OVERLAPS) 248/349 variables, 101/116 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/349 variables, 37/153 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/349 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 8 (OVERLAPS) 1/350 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 274 unsolved
[2024-06-02 20:00:16] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/350 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/350 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 274 unsolved
[2024-06-02 20:00:20] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/350 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/350 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 13 (OVERLAPS) 0/350 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 274 unsolved
No progress, stopping.
After SMT solving in domain Real declared 350/350 variables, and 156 constraints, problems are : Problem set: 0 solved, 274 unsolved in 15090 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 101/101 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 274/274 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 274 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 1 (OVERLAPS) 1/101 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 274 unsolved
[2024-06-02 20:00:25] [INFO ] Deduced a trap composed of 34 places in 57 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 5 (OVERLAPS) 248/349 variables, 101/119 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/349 variables, 37/156 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/349 variables, 274/430 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/349 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 9 (OVERLAPS) 1/350 variables, 1/431 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/350 variables, 0/431 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 11 (OVERLAPS) 0/350 variables, 0/431 constraints. Problems are: Problem set: 0 solved, 274 unsolved
No progress, stopping.
After SMT solving in domain Int declared 350/350 variables, and 431 constraints, problems are : Problem set: 0 solved, 274 unsolved in 15454 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 101/101 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 274/274 constraints, Known Traps: 11/11 constraints]
After SMT, in 30687ms problems are : Problem set: 0 solved, 274 unsolved
Search for dead transitions found 0 dead transitions in 30691ms
Starting structural reductions in LTL mode, iteration 1 : 101/105 places, 275/284 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30967 ms. Remains : 101/105 places, 275/284 transitions.
[2024-06-02 20:00:40] [INFO ] Flatten gal took : 10 ms
[2024-06-02 20:00:40] [INFO ] Flatten gal took : 6 ms
[2024-06-02 20:00:40] [INFO ] Input system was already deterministic with 275 transitions.
[2024-06-02 20:00:40] [INFO ] Flatten gal took : 8 ms
[2024-06-02 20:00:40] [INFO ] Flatten gal took : 6 ms
[2024-06-02 20:00:40] [INFO ] Time to serialize gal into /tmp/CTLFireability11435928222505667915.gal : 1 ms
[2024-06-02 20:00:40] [INFO ] Time to serialize properties into /tmp/CTLFireability5936816277964016114.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/CTLFireability11435928222505667915.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5936816277964016114.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,1.4803e+06,3.61925,112908,2,5223,5,317148,6,0,678,418546,0


Converting to forward existential form...Done !
original formula: EX(EF((E(((p7==1)&&(p51==1)) U E(((p7==1)&&(p80==1)) U (p83==1))) * EX(((AG(((p7==1)&&(p56==1))) + ((p2==1)&&(p29==1))) + ((p7==1)&&(p33=...164
=> equivalent forward existential formula: (([(EY((FwdU(EY(Init),TRUE) * E(((p7==1)&&(p51==1)) U E(((p7==1)&&(p80==1)) U (p83==1))))) * !(E(TRUE U !(((p7==...432
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t8, t9, t11, t16, t17, t18, t19, t20, t22, t24, t29, t30, t31, t32, t33, t35, t37...563
(forward)formula 0,1,8.90408,199020,1,0,504,706356,580,260,6000,771746,587
FORMULA FireWire-PT-01-CTLFireability-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 284/284 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 102 transition count 276
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 102 transition count 276
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 100 transition count 272
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 100 transition count 272
Applied a total of 10 rules in 5 ms. Remains 100 /105 variables (removed 5) and now considering 272/284 (removed 12) transitions.
[2024-06-02 20:00:49] [INFO ] Flow matrix only has 246 transitions (discarded 26 similar events)
// Phase 1: matrix 246 rows 100 cols
[2024-06-02 20:00:49] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 20:00:49] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-06-02 20:00:49] [INFO ] Flow matrix only has 246 transitions (discarded 26 similar events)
[2024-06-02 20:00:49] [INFO ] Invariant cache hit.
[2024-06-02 20:00:49] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-02 20:00:49] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 204 ms to find 0 implicit places.
Running 271 sub problems to find dead transitions.
[2024-06-02 20:00:49] [INFO ] Flow matrix only has 246 transitions (discarded 26 similar events)
[2024-06-02 20:00:49] [INFO ] Invariant cache hit.
[2024-06-02 20:00:49] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 1 (OVERLAPS) 1/100 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 271 unsolved
[2024-06-02 20:00:50] [INFO ] Deduced a trap composed of 53 places in 59 ms of which 0 ms to minimize.
[2024-06-02 20:00:50] [INFO ] Deduced a trap composed of 34 places in 44 ms of which 1 ms to minimize.
[2024-06-02 20:00:50] [INFO ] Deduced a trap composed of 37 places in 24 ms of which 1 ms to minimize.
[2024-06-02 20:00:51] [INFO ] Deduced a trap composed of 39 places in 49 ms of which 1 ms to minimize.
[2024-06-02 20:00:51] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
[2024-06-02 20:00:51] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
[2024-06-02 20:00:51] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
[2024-06-02 20:00:51] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-06-02 20:00:51] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 0 ms to minimize.
[2024-06-02 20:00:51] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 4 (OVERLAPS) 245/345 variables, 100/117 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/345 variables, 36/153 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/345 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 7 (OVERLAPS) 1/346 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/346 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 9 (OVERLAPS) 0/346 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 271 unsolved
No progress, stopping.
After SMT solving in domain Real declared 346/346 variables, and 154 constraints, problems are : Problem set: 0 solved, 271 unsolved in 9952 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 100/100 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 271/271 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 271 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 1 (OVERLAPS) 1/100 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 4 (OVERLAPS) 245/345 variables, 100/117 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/345 variables, 36/153 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/345 variables, 271/424 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/345 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 8 (OVERLAPS) 1/346 variables, 1/425 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/346 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 10 (OVERLAPS) 0/346 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 271 unsolved
No progress, stopping.
After SMT solving in domain Int declared 346/346 variables, and 425 constraints, problems are : Problem set: 0 solved, 271 unsolved in 16421 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 100/100 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 271/271 constraints, Known Traps: 10/10 constraints]
After SMT, in 26496ms problems are : Problem set: 0 solved, 271 unsolved
Search for dead transitions found 0 dead transitions in 26500ms
Starting structural reductions in LTL mode, iteration 1 : 100/105 places, 272/284 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26710 ms. Remains : 100/105 places, 272/284 transitions.
[2024-06-02 20:01:16] [INFO ] Flatten gal took : 8 ms
[2024-06-02 20:01:16] [INFO ] Flatten gal took : 6 ms
[2024-06-02 20:01:16] [INFO ] Input system was already deterministic with 272 transitions.
[2024-06-02 20:01:16] [INFO ] Flatten gal took : 6 ms
[2024-06-02 20:01:16] [INFO ] Flatten gal took : 8 ms
[2024-06-02 20:01:16] [INFO ] Time to serialize gal into /tmp/CTLFireability14870877573713742257.gal : 2 ms
[2024-06-02 20:01:16] [INFO ] Time to serialize properties into /tmp/CTLFireability17741886517501827896.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/CTLFireability14870877573713742257.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17741886517501827896.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,1.41183e+06,1.96989,67004,2,3822,5,192451,6,0,671,195973,0


Converting to forward existential form...Done !
original formula: A(E(((p4==1)||(!((p7==1)&&(p46==1)))) U EG(EF(((p7==1)&&(p25==1))))) U (E((((EG((p68==1)) + EX((p27==1))) * ((AX(((p7==1)&&(p72==1))) + (...439
=> equivalent forward existential formula: [((Init * !(EG(!((E((((EG((p68==1)) + EX((p27==1))) * ((!(EX(!(((p7==1)&&(p72==1))))) + (p104==1)) + ((p5==1)&&(...1676
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t5, t6, t10, t11, t13, t18, t19, t20, t21, t22, t24, t26, t31, t32, t33, t34, t35...555
Detected timeout of ITS tools.
[2024-06-02 20:01:46] [INFO ] Flatten gal took : 8 ms
[2024-06-02 20:01:46] [INFO ] Applying decomposition
[2024-06-02 20:01:46] [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/graph14656673592868839240.txt' '-o' '/tmp/graph14656673592868839240.bin' '-w' '/tmp/graph14656673592868839240.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14656673592868839240.bin' '-l' '-1' '-v' '-w' '/tmp/graph14656673592868839240.weights' '-q' '0' '-e' '0.001'
[2024-06-02 20:01:46] [INFO ] Decomposing Gal with order
[2024-06-02 20:01:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 20:01:46] [INFO ] Removed a total of 390 redundant transitions.
[2024-06-02 20:01:46] [INFO ] Flatten gal took : 17 ms
[2024-06-02 20:01:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 60 labels/synchronizations in 4 ms.
[2024-06-02 20:01:46] [INFO ] Time to serialize gal into /tmp/CTLFireability9629589349391011009.gal : 1 ms
[2024-06-02 20:01:46] [INFO ] Time to serialize properties into /tmp/CTLFireability8400936756064760232.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/CTLFireability9629589349391011009.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8400936756064760232.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,1.41183e+06,8.08196,292824,3806,199,585064,3291,482,1.25722e+06,86,24125,0


Converting to forward existential form...Done !
original formula: A(E(((i0.u1.p4==1)||(!((i4.u2.p7==1)&&(i4.u14.p46==1)))) U EG(EF(((i4.u2.p7==1)&&(i2.u7.p25==1))))) U (E((((EG((i5.u22.p68==1)) + EX((i2....632
=> equivalent forward existential formula: [((Init * !(EG(!((E((((EG((i5.u22.p68==1)) + EX((i2.u9.p27==1))) * ((!(EX(!(((i4.u2.p7==1)&&(i5.u24.p72==1))))) ...2349
Reverse transition relation is NOT exact ! Due to transitions t47, t49, t53, t54, t62, t67, t83, t86, t96, t148, t152, t155, t156, t164, t198, t206, t207, ...747
Using saturation style SCC detection
Using saturation style SCC detection
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
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 105/105 places, 284/284 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 104 transition count 282
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 103 transition count 282
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 103 transition count 281
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 102 transition count 281
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 8 place count 98 transition count 271
Iterating global reduction 2 with 4 rules applied. Total rules applied 12 place count 98 transition count 271
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 14 place count 96 transition count 267
Iterating global reduction 2 with 2 rules applied. Total rules applied 16 place count 96 transition count 267
Applied a total of 16 rules in 11 ms. Remains 96 /105 variables (removed 9) and now considering 267/284 (removed 17) transitions.
[2024-06-02 20:02:16] [INFO ] Flow matrix only has 241 transitions (discarded 26 similar events)
// Phase 1: matrix 241 rows 96 cols
[2024-06-02 20:02:16] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 20:02:16] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-06-02 20:02:16] [INFO ] Flow matrix only has 241 transitions (discarded 26 similar events)
[2024-06-02 20:02:16] [INFO ] Invariant cache hit.
[2024-06-02 20:02:16] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-06-02 20:02:16] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 218 ms to find 0 implicit places.
[2024-06-02 20:02:16] [INFO ] Redundant transitions in 1 ms returned []
Running 264 sub problems to find dead transitions.
[2024-06-02 20:02:16] [INFO ] Flow matrix only has 241 transitions (discarded 26 similar events)
[2024-06-02 20:02:16] [INFO ] Invariant cache hit.
[2024-06-02 20:02:16] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 264 unsolved
[2024-06-02 20:02:17] [INFO ] Deduced a trap composed of 33 places in 52 ms of which 1 ms to minimize.
[2024-06-02 20:02:17] [INFO ] Deduced a trap composed of 16 places in 20 ms of which 1 ms to minimize.
[2024-06-02 20:02:17] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
[2024-06-02 20:02:17] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
[2024-06-02 20:02:17] [INFO ] Deduced a trap composed of 35 places in 52 ms of which 1 ms to minimize.
[2024-06-02 20:02:17] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 3 (OVERLAPS) 240/335 variables, 95/108 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/335 variables, 35/143 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/335 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 6 (OVERLAPS) 1/336 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/336 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 8 (OVERLAPS) 0/336 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 264 unsolved
No progress, stopping.
After SMT solving in domain Real declared 336/337 variables, and 144 constraints, problems are : Problem set: 0 solved, 264 unsolved in 8147 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 96/96 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 264/264 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 264 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 3 (OVERLAPS) 240/335 variables, 95/108 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/335 variables, 35/143 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/335 variables, 264/407 constraints. Problems are: Problem set: 0 solved, 264 unsolved
[2024-06-02 20:02:28] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/335 variables, 1/408 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/335 variables, 0/408 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 8 (OVERLAPS) 1/336 variables, 1/409 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/336 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 10 (OVERLAPS) 0/336 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 264 unsolved
No progress, stopping.
After SMT solving in domain Int declared 336/337 variables, and 409 constraints, problems are : Problem set: 0 solved, 264 unsolved in 15605 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 96/96 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 264/264 constraints, Known Traps: 7/7 constraints]
After SMT, in 23882ms problems are : Problem set: 0 solved, 264 unsolved
Search for dead transitions found 0 dead transitions in 23885ms
Starting structural reductions in SI_CTL mode, iteration 1 : 96/105 places, 267/284 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 24121 ms. Remains : 96/105 places, 267/284 transitions.
[2024-06-02 20:02:40] [INFO ] Flatten gal took : 11 ms
[2024-06-02 20:02:40] [INFO ] Flatten gal took : 6 ms
[2024-06-02 20:02:40] [INFO ] Input system was already deterministic with 267 transitions.
[2024-06-02 20:02:40] [INFO ] Flatten gal took : 5 ms
[2024-06-02 20:02:40] [INFO ] Flatten gal took : 6 ms
[2024-06-02 20:02:40] [INFO ] Time to serialize gal into /tmp/CTLFireability12900574436094335660.gal : 8 ms
[2024-06-02 20:02:40] [INFO ] Time to serialize properties into /tmp/CTLFireability9296211536489787061.ctl : 3 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/CTLFireability12900574436094335660.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9296211536489787061.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,1.05328e+06,3.33183,105808,2,4866,5,309860,6,0,650,411969,0


Converting to forward existential form...Done !
original formula: AG((EF(((((p7==1)&&(p47==1))||(p2==0))||(p61==0))) * ((p7==0)||(p83==0))))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(E(TRUE U ((((p7==1)&&(p47==1))||(p2==0))||(p61==0)))))] = FALSE * [(FwdU(Init,TRUE) * !((...185
(forward)formula 0,0,3.33373,105808,1,0,8,309860,9,2,661,411969,1
FORMULA FireWire-PT-01-CTLFireability-2024-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 284/284 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 102 transition count 277
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 102 transition count 277
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 101 transition count 275
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 101 transition count 275
Applied a total of 8 rules in 1 ms. Remains 101 /105 variables (removed 4) and now considering 275/284 (removed 9) transitions.
[2024-06-02 20:02:43] [INFO ] Flow matrix only has 249 transitions (discarded 26 similar events)
// Phase 1: matrix 249 rows 101 cols
[2024-06-02 20:02:43] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 20:02:43] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-06-02 20:02:43] [INFO ] Flow matrix only has 249 transitions (discarded 26 similar events)
[2024-06-02 20:02:43] [INFO ] Invariant cache hit.
[2024-06-02 20:02:43] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-06-02 20:02:44] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
Running 274 sub problems to find dead transitions.
[2024-06-02 20:02:44] [INFO ] Flow matrix only has 249 transitions (discarded 26 similar events)
[2024-06-02 20:02:44] [INFO ] Invariant cache hit.
[2024-06-02 20:02:44] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 1 (OVERLAPS) 1/101 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 274 unsolved
[2024-06-02 20:02:45] [INFO ] Deduced a trap composed of 35 places in 45 ms of which 1 ms to minimize.
[2024-06-02 20:02:45] [INFO ] Deduced a trap composed of 37 places in 42 ms of which 1 ms to minimize.
[2024-06-02 20:02:45] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
[2024-06-02 20:02:45] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
[2024-06-02 20:02:45] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
[2024-06-02 20:02:45] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
[2024-06-02 20:02:45] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 2 ms to minimize.
[2024-06-02 20:02:45] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 4 (OVERLAPS) 248/349 variables, 101/116 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/349 variables, 37/153 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/349 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 7 (OVERLAPS) 1/350 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/350 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 9 (OVERLAPS) 0/350 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 274 unsolved
No progress, stopping.
After SMT solving in domain Real declared 350/350 variables, and 154 constraints, problems are : Problem set: 0 solved, 274 unsolved in 10134 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 101/101 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 274/274 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 274 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 1 (OVERLAPS) 1/101 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 4 (OVERLAPS) 248/349 variables, 101/116 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/349 variables, 37/153 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/349 variables, 274/427 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/349 variables, 0/427 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 8 (OVERLAPS) 1/350 variables, 1/428 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/350 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 10 (OVERLAPS) 0/350 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 274 unsolved
No progress, stopping.
After SMT solving in domain Int declared 350/350 variables, and 428 constraints, problems are : Problem set: 0 solved, 274 unsolved in 21174 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 101/101 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 274/274 constraints, Known Traps: 8/8 constraints]
After SMT, in 31441ms problems are : Problem set: 0 solved, 274 unsolved
Search for dead transitions found 0 dead transitions in 31445ms
Starting structural reductions in LTL mode, iteration 1 : 101/105 places, 275/284 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31619 ms. Remains : 101/105 places, 275/284 transitions.
[2024-06-02 20:03:15] [INFO ] Flatten gal took : 8 ms
[2024-06-02 20:03:15] [INFO ] Flatten gal took : 6 ms
[2024-06-02 20:03:15] [INFO ] Input system was already deterministic with 275 transitions.
[2024-06-02 20:03:15] [INFO ] Flatten gal took : 6 ms
[2024-06-02 20:03:15] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:03:15] [INFO ] Time to serialize gal into /tmp/CTLFireability716855933783158392.gal : 1 ms
[2024-06-02 20:03:15] [INFO ] Time to serialize properties into /tmp/CTLFireability9642615149774049653.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/CTLFireability716855933783158392.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9642615149774049653.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 -...282
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,1.42126e+06,2.11835,69028,2,3855,5,205523,6,0,678,195534,0


Converting to forward existential form...Done !
original formula: EF((((AG((((p2==0)||(p96==0))&&((p10==0)||(p95==0)))) * (p50==1)) * ((p7==1)&&(p99==1))) * ((p23==0) * (AF(((p2==0)||(p59==0))) + (EF(((p...203
=> equivalent forward existential formula: ([(((FwdU(Init,TRUE) * ((!(E(TRUE U !((((p2==0)||(p96==0))&&((p10==0)||(p95==0)))))) * (p50==1)) * ((p7==1)&&(p9...430
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t8, t9, t11, t16, t17, t18, t19, t20, t22, t24, t29, t30, t31, t32, t33, t35, t37...562
(forward)formula 0,0,10.5324,278936,1,0,572,1.35503e+06,583,299,5799,960034,689
FORMULA FireWire-PT-01-CTLFireability-2024-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
[2024-06-02 20:03:26] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:03:26] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:03:26] [INFO ] Applying decomposition
[2024-06-02 20:03:26] [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/graph5241424067649576778.txt' '-o' '/tmp/graph5241424067649576778.bin' '-w' '/tmp/graph5241424067649576778.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5241424067649576778.bin' '-l' '-1' '-v' '-w' '/tmp/graph5241424067649576778.weights' '-q' '0' '-e' '0.001'
[2024-06-02 20:03:26] [INFO ] Decomposing Gal with order
[2024-06-02 20:03:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 20:03:26] [INFO ] Removed a total of 412 redundant transitions.
[2024-06-02 20:03:26] [INFO ] Flatten gal took : 15 ms
[2024-06-02 20:03:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 66 labels/synchronizations in 3 ms.
[2024-06-02 20:03:26] [INFO ] Time to serialize gal into /tmp/CTLFireability10568355352620804779.gal : 2 ms
[2024-06-02 20:03:26] [INFO ] Time to serialize properties into /tmp/CTLFireability8527095810140609775.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/CTLFireability10568355352620804779.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8527095810140609775.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 4 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,1.54994e+06,48.0166,1080392,3733,199,1.18929e+06,2616,535,7.2166e+06,94,33872,0


Converting to forward existential form...Done !
original formula: EG(EF(((i0.u0.p2==1)&&(i0.u29.p88==1))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U ((i0.u0.p2==1)&&(i0.u29.p88==1))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t2, t47, t49, t53, t54, t62, t63, t68, t73, t78, t83, t96, t99, t100, t101, t102, t153, t158,...738
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
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 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
(forward)formula 0,1,86.7281,1625552,1,0,1.97671e+06,5695,2818,1.21419e+07,422,54029,3959405
FORMULA FireWire-PT-01-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: E((((AG(((((EF(((i6.u2.p7==1)&&(i5.u22.p69==1))) + !(((i6.u2.p7==1)&&(i3.u7.p23==1)))) + ((((i1.u3.p8==1)&&(i0.u29.p88==1))&&((i6.u2.p6==...684
=> equivalent forward existential formula: [((((FwdU(Init,(((!(E(TRUE U !(((((E(TRUE U ((i6.u2.p7==1)&&(i5.u22.p69==1))) + !(((i6.u2.p7==1)&&(i3.u7.p23==1)...781
(forward)formula 1,0,167.296,2203256,1,0,2.75534e+06,6775,2324,1.59404e+07,293,68791,5887810
FORMULA FireWire-PT-01-CTLFireability-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AF((E(EX(EF(((i6.u2.p7==1)&&(i4.u16.p49==1)))) U ((EX(((i6.u2.p7==1)&&(i3.u7.p23==1))) * EF(((i0.u0.p2==1)&&(i3.u9.p29==1)))) * (AX(((i3....286
=> equivalent forward existential formula: [FwdG(Init,!((E(EX(E(TRUE U ((i6.u2.p7==1)&&(i4.u16.p49==1)))) U ((EX(((i6.u2.p7==1)&&(i3.u7.p23==1))) * E(TRUE ...355
(forward)formula 2,0,218.832,2438964,1,0,2.94686e+06,6775,1253,1.68754e+07,213,71853,1891641
FORMULA FireWire-PT-01-CTLFireability-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: A(E(((i1.u1.p4==1)||(!((i6.u2.p7==1)&&(i4.u14.p46==1)))) U EG(EF(((i6.u2.p7==1)&&(i3.u7.p25==1))))) U (E((((EG((i5.u22.p68==1)) + EX((i3....635
=> equivalent forward existential formula: [((Init * !(EG(!((E((((EG((i5.u22.p68==1)) + EX((i3.u9.p27==1))) * ((!(EX(!(((i6.u2.p7==1)&&(i5.u24.p72==1))))) ...2358
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 3
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
Using saturation style SCC detection
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 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
(forward)formula 3,0,256.048,2483844,1,0,3.14412e+06,6775,2057,1.76566e+07,268,77890,5804039
FORMULA FireWire-PT-01-CTLFireability-2024-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Total runtime 1082472 ms.

BK_STOP 1717358862939

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

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