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.r026-smll-171620167300242.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 AutonomousCar-PT-02b, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r026-smll-171620167300242
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 448K
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 18:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K Apr 12 18:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Apr 12 18:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Apr 12 18:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 49K May 18 16:42 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 AutonomousCar-PT-02b-CTLFireability-2024-00
FORMULA_NAME AutonomousCar-PT-02b-CTLFireability-2024-01
FORMULA_NAME AutonomousCar-PT-02b-CTLFireability-2024-02
FORMULA_NAME AutonomousCar-PT-02b-CTLFireability-2024-03
FORMULA_NAME AutonomousCar-PT-02b-CTLFireability-2024-04
FORMULA_NAME AutonomousCar-PT-02b-CTLFireability-2024-05
FORMULA_NAME AutonomousCar-PT-02b-CTLFireability-2024-06
FORMULA_NAME AutonomousCar-PT-02b-CTLFireability-2024-07
FORMULA_NAME AutonomousCar-PT-02b-CTLFireability-2024-08
FORMULA_NAME AutonomousCar-PT-02b-CTLFireability-2024-09
FORMULA_NAME AutonomousCar-PT-02b-CTLFireability-2024-10
FORMULA_NAME AutonomousCar-PT-02b-CTLFireability-2024-11
FORMULA_NAME AutonomousCar-PT-02b-CTLFireability-2023-12
FORMULA_NAME AutonomousCar-PT-02b-CTLFireability-2023-13
FORMULA_NAME AutonomousCar-PT-02b-CTLFireability-2023-14
FORMULA_NAME AutonomousCar-PT-02b-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716320284739

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-02b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-21 19:38:06] [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-05-21 19:38:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 19:38:07] [INFO ] Load time of PNML (sax parser for PT used): 117 ms
[2024-05-21 19:38:07] [INFO ] Transformed 155 places.
[2024-05-21 19:38:07] [INFO ] Transformed 194 transitions.
[2024-05-21 19:38:07] [INFO ] Found NUPN structural information;
[2024-05-21 19:38:07] [INFO ] Parsed PT model containing 155 places and 194 transitions and 620 arcs in 306 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 24 ms.
Support contains 84 out of 155 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 155/155 places, 194/194 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 149 transition count 188
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 149 transition count 188
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 28 place count 149 transition count 172
Applied a total of 28 rules in 61 ms. Remains 149 /155 variables (removed 6) and now considering 172/194 (removed 22) transitions.
// Phase 1: matrix 172 rows 149 cols
[2024-05-21 19:38:07] [INFO ] Computed 7 invariants in 28 ms
[2024-05-21 19:38:07] [INFO ] Implicit Places using invariants in 314 ms returned []
[2024-05-21 19:38:07] [INFO ] Invariant cache hit.
[2024-05-21 19:38:08] [INFO ] Implicit Places using invariants and state equation in 300 ms returned []
Implicit Place search using SMT with State Equation took 666 ms to find 0 implicit places.
Running 171 sub problems to find dead transitions.
[2024-05-21 19:38:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/148 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 1 (OVERLAPS) 1/149 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 171 unsolved
[2024-05-21 19:38:11] [INFO ] Deduced a trap composed of 16 places in 222 ms of which 37 ms to minimize.
[2024-05-21 19:38:11] [INFO ] Deduced a trap composed of 16 places in 154 ms of which 3 ms to minimize.
[2024-05-21 19:38:11] [INFO ] Deduced a trap composed of 26 places in 126 ms of which 4 ms to minimize.
[2024-05-21 19:38:11] [INFO ] Deduced a trap composed of 45 places in 121 ms of which 3 ms to minimize.
[2024-05-21 19:38:11] [INFO ] Deduced a trap composed of 28 places in 132 ms of which 3 ms to minimize.
[2024-05-21 19:38:11] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 2 ms to minimize.
[2024-05-21 19:38:11] [INFO ] Deduced a trap composed of 33 places in 98 ms of which 3 ms to minimize.
[2024-05-21 19:38:12] [INFO ] Deduced a trap composed of 33 places in 107 ms of which 3 ms to minimize.
[2024-05-21 19:38:12] [INFO ] Deduced a trap composed of 22 places in 225 ms of which 4 ms to minimize.
[2024-05-21 19:38:12] [INFO ] Deduced a trap composed of 21 places in 124 ms of which 5 ms to minimize.
[2024-05-21 19:38:12] [INFO ] Deduced a trap composed of 22 places in 150 ms of which 13 ms to minimize.
[2024-05-21 19:38:12] [INFO ] Deduced a trap composed of 35 places in 106 ms of which 2 ms to minimize.
[2024-05-21 19:38:13] [INFO ] Deduced a trap composed of 35 places in 47 ms of which 1 ms to minimize.
[2024-05-21 19:38:13] [INFO ] Deduced a trap composed of 33 places in 86 ms of which 2 ms to minimize.
[2024-05-21 19:38:13] [INFO ] Deduced a trap composed of 47 places in 100 ms of which 3 ms to minimize.
[2024-05-21 19:38:13] [INFO ] Deduced a trap composed of 34 places in 96 ms of which 3 ms to minimize.
[2024-05-21 19:38:13] [INFO ] Deduced a trap composed of 33 places in 80 ms of which 2 ms to minimize.
[2024-05-21 19:38:13] [INFO ] Deduced a trap composed of 37 places in 90 ms of which 3 ms to minimize.
[2024-05-21 19:38:14] [INFO ] Deduced a trap composed of 41 places in 54 ms of which 2 ms to minimize.
[2024-05-21 19:38:14] [INFO ] Deduced a trap composed of 41 places in 56 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 171 unsolved
[2024-05-21 19:38:14] [INFO ] Deduced a trap composed of 35 places in 106 ms of which 3 ms to minimize.
[2024-05-21 19:38:14] [INFO ] Deduced a trap composed of 21 places in 94 ms of which 3 ms to minimize.
[2024-05-21 19:38:15] [INFO ] Deduced a trap composed of 15 places in 103 ms of which 2 ms to minimize.
[2024-05-21 19:38:15] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/149 variables, 4/31 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/149 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 171 unsolved
Problem TDEAD10 is UNSAT
Problem TDEAD160 is UNSAT
At refinement iteration 5 (OVERLAPS) 172/321 variables, 149/180 constraints. Problems are: Problem set: 2 solved, 169 unsolved
[2024-05-21 19:38:18] [INFO ] Deduced a trap composed of 34 places in 87 ms of which 2 ms to minimize.
[2024-05-21 19:38:19] [INFO ] Deduced a trap composed of 5 places in 118 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/321 variables, 2/182 constraints. Problems are: Problem set: 2 solved, 169 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/321 variables, 0/182 constraints. Problems are: Problem set: 2 solved, 169 unsolved
At refinement iteration 8 (OVERLAPS) 0/321 variables, 0/182 constraints. Problems are: Problem set: 2 solved, 169 unsolved
No progress, stopping.
After SMT solving in domain Real declared 321/321 variables, and 182 constraints, problems are : Problem set: 2 solved, 169 unsolved in 15904 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 149/149 constraints, PredecessorRefiner: 171/171 constraints, Known Traps: 26/26 constraints]
Escalating to Integer solving :Problem set: 2 solved, 169 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/147 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 169 unsolved
At refinement iteration 1 (OVERLAPS) 2/149 variables, 7/7 constraints. Problems are: Problem set: 2 solved, 169 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 26/33 constraints. Problems are: Problem set: 2 solved, 169 unsolved
[2024-05-21 19:38:25] [INFO ] Deduced a trap composed of 45 places in 119 ms of which 3 ms to minimize.
[2024-05-21 19:38:26] [INFO ] Deduced a trap composed of 33 places in 93 ms of which 3 ms to minimize.
[2024-05-21 19:38:26] [INFO ] Deduced a trap composed of 38 places in 91 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/149 variables, 3/36 constraints. Problems are: Problem set: 2 solved, 169 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/149 variables, 0/36 constraints. Problems are: Problem set: 2 solved, 169 unsolved
At refinement iteration 5 (OVERLAPS) 172/321 variables, 149/185 constraints. Problems are: Problem set: 2 solved, 169 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/321 variables, 169/354 constraints. Problems are: Problem set: 2 solved, 169 unsolved
[2024-05-21 19:38:30] [INFO ] Deduced a trap composed of 39 places in 65 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/321 variables, 1/355 constraints. Problems are: Problem set: 2 solved, 169 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/321 variables, 0/355 constraints. Problems are: Problem set: 2 solved, 169 unsolved
At refinement iteration 9 (OVERLAPS) 0/321 variables, 0/355 constraints. Problems are: Problem set: 2 solved, 169 unsolved
No progress, stopping.
After SMT solving in domain Int declared 321/321 variables, and 355 constraints, problems are : Problem set: 2 solved, 169 unsolved in 13788 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 149/149 constraints, PredecessorRefiner: 169/171 constraints, Known Traps: 30/30 constraints]
After SMT, in 29872ms problems are : Problem set: 2 solved, 169 unsolved
Search for dead transitions found 2 dead transitions in 29908ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in LTL mode, iteration 1 : 149/155 places, 170/194 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 148 transition count 170
Applied a total of 1 rules in 16 ms. Remains 148 /149 variables (removed 1) and now considering 170/170 (removed 0) transitions.
// Phase 1: matrix 170 rows 148 cols
[2024-05-21 19:38:38] [INFO ] Computed 7 invariants in 4 ms
[2024-05-21 19:38:38] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-21 19:38:38] [INFO ] Invariant cache hit.
[2024-05-21 19:38:38] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 251 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 148/155 places, 170/194 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 30942 ms. Remains : 148/155 places, 170/194 transitions.
Support contains 84 out of 148 places after structural reductions.
[2024-05-21 19:38:38] [INFO ] Flatten gal took : 55 ms
[2024-05-21 19:38:38] [INFO ] Flatten gal took : 23 ms
[2024-05-21 19:38:38] [INFO ] Input system was already deterministic with 170 transitions.
Reduction of identical properties reduced properties to check from 77 to 76
RANDOM walk for 40000 steps (28 resets) in 2629 ms. (15 steps per ms) remains 19/76 properties
BEST_FIRST walk for 4002 steps (11 resets) in 51 ms. (76 steps per ms) remains 14/19 properties
BEST_FIRST walk for 4003 steps (12 resets) in 27 ms. (142 steps per ms) remains 13/14 properties
BEST_FIRST walk for 4001 steps (10 resets) in 30 ms. (129 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4002 steps (12 resets) in 30 ms. (129 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4003 steps (17 resets) in 42 ms. (93 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4000 steps (9 resets) in 19 ms. (200 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4001 steps (10 resets) in 20 ms. (190 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4002 steps (12 resets) in 18 ms. (210 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4001 steps (15 resets) in 24 ms. (160 steps per ms) remains 10/13 properties
BEST_FIRST walk for 4002 steps (18 resets) in 33 ms. (117 steps per ms) remains 10/10 properties
BEST_FIRST walk for 4004 steps (12 resets) in 17 ms. (222 steps per ms) remains 10/10 properties
BEST_FIRST walk for 4002 steps (12 resets) in 16 ms. (235 steps per ms) remains 10/10 properties
BEST_FIRST walk for 4002 steps (11 resets) in 12 ms. (307 steps per ms) remains 10/10 properties
[2024-05-21 19:38:39] [INFO ] Invariant cache hit.
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, 10 unsolved
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp46 is UNSAT
Problem AtomicPropp58 is UNSAT
Problem AtomicPropp64 is UNSAT
At refinement iteration 1 (OVERLAPS) 121/148 variables, 7/7 constraints. Problems are: Problem set: 4 solved, 6 unsolved
[2024-05-21 19:38:40] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 2 ms to minimize.
[2024-05-21 19:38:40] [INFO ] Deduced a trap composed of 45 places in 68 ms of which 2 ms to minimize.
[2024-05-21 19:38:40] [INFO ] Deduced a trap composed of 34 places in 62 ms of which 2 ms to minimize.
[2024-05-21 19:38:40] [INFO ] Deduced a trap composed of 33 places in 83 ms of which 2 ms to minimize.
[2024-05-21 19:38:40] [INFO ] Deduced a trap composed of 41 places in 60 ms of which 8 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/148 variables, 5/12 constraints. Problems are: Problem set: 4 solved, 6 unsolved
[2024-05-21 19:38:40] [INFO ] Deduced a trap composed of 34 places in 69 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/148 variables, 1/13 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/148 variables, 0/13 constraints. Problems are: Problem set: 4 solved, 6 unsolved
Problem AtomicPropp0 is UNSAT
At refinement iteration 5 (OVERLAPS) 170/318 variables, 148/161 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/318 variables, 0/161 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/318 variables, 0/161 constraints. Problems are: Problem set: 5 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 318/318 variables, and 161 constraints, problems are : Problem set: 5 solved, 5 unsolved in 795 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 148/148 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 5 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 136/148 variables, 7/7 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/148 variables, 6/13 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/148 variables, 0/13 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 170/318 variables, 148/161 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/318 variables, 5/166 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/318 variables, 0/166 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/318 variables, 0/166 constraints. Problems are: Problem set: 5 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 318/318 variables, and 166 constraints, problems are : Problem set: 5 solved, 5 unsolved in 399 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 148/148 constraints, PredecessorRefiner: 5/10 constraints, Known Traps: 6/6 constraints]
After SMT, in 1217ms problems are : Problem set: 5 solved, 5 unsolved
Parikh walk visited 2 properties in 1504 ms.
Support contains 10 out of 148 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 148/148 places, 170/170 transitions.
Graph (trivial) has 128 edges and 148 vertex of which 4 / 148 are part of one of the 2 SCC in 3 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 284 edges and 146 vertex of which 140 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 0 with 64 rules applied. Total rules applied 66 place count 140 transition count 98
Reduce places removed 62 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 78 rules applied. Total rules applied 144 place count 78 transition count 82
Reduce places removed 8 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 10 rules applied. Total rules applied 154 place count 70 transition count 80
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 4 rules applied. Total rules applied 158 place count 68 transition count 78
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 159 place count 67 transition count 78
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 6 Pre rules applied. Total rules applied 159 place count 67 transition count 72
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 171 place count 61 transition count 72
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 179 place count 53 transition count 64
Iterating global reduction 5 with 8 rules applied. Total rules applied 187 place count 53 transition count 64
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 187 place count 53 transition count 63
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 189 place count 52 transition count 63
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 190 place count 51 transition count 61
Iterating global reduction 5 with 1 rules applied. Total rules applied 191 place count 51 transition count 61
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 5 with 32 rules applied. Total rules applied 223 place count 35 transition count 45
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 224 place count 34 transition count 42
Iterating global reduction 5 with 1 rules applied. Total rules applied 225 place count 34 transition count 42
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 229 place count 32 transition count 51
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 230 place count 32 transition count 50
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 231 place count 31 transition count 50
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 232 place count 30 transition count 49
Applied a total of 232 rules in 55 ms. Remains 30 /148 variables (removed 118) and now considering 49/170 (removed 121) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 30/148 places, 49/170 transitions.
RANDOM walk for 39361 steps (2895 resets) in 259 ms. (151 steps per ms) remains 0/3 properties
Successfully simplified 5 atomic propositions for a total of 16 simplifications.
[2024-05-21 19:38:42] [INFO ] Flatten gal took : 14 ms
[2024-05-21 19:38:42] [INFO ] Flatten gal took : 14 ms
[2024-05-21 19:38:42] [INFO ] Input system was already deterministic with 170 transitions.
Support contains 69 out of 148 places (down from 70) after GAL structural reductions.
Computed a total of 36 stabilizing places and 36 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 148/148 places, 170/170 transitions.
Graph (trivial) has 129 edges and 148 vertex of which 4 / 148 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 67 transitions
Trivial Post-agglo rules discarded 67 transitions
Performed 67 trivial Post agglomeration. Transition count delta: 67
Iterating post reduction 0 with 67 rules applied. Total rules applied 68 place count 145 transition count 100
Reduce places removed 67 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 81 rules applied. Total rules applied 149 place count 78 transition count 86
Reduce places removed 7 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 10 rules applied. Total rules applied 159 place count 71 transition count 83
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 5 rules applied. Total rules applied 164 place count 68 transition count 81
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 165 place count 67 transition count 81
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 165 place count 67 transition count 77
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 173 place count 63 transition count 77
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 183 place count 53 transition count 67
Iterating global reduction 5 with 10 rules applied. Total rules applied 193 place count 53 transition count 67
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 193 place count 53 transition count 65
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 197 place count 51 transition count 65
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 198 place count 50 transition count 63
Iterating global reduction 5 with 1 rules applied. Total rules applied 199 place count 50 transition count 63
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 200 place count 50 transition count 62
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 6 with 22 rules applied. Total rules applied 222 place count 39 transition count 51
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 226 place count 35 transition count 42
Iterating global reduction 6 with 4 rules applied. Total rules applied 230 place count 35 transition count 42
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 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 6 with 2 rules applied. Total rules applied 232 place count 35 transition count 40
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 233 place count 34 transition count 40
Partial Post-agglomeration rule applied 3 times.
Drop transitions (Partial Post agglomeration) removed 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 236 place count 34 transition count 40
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 238 place count 32 transition count 38
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 239 place count 31 transition count 38
Applied a total of 239 rules in 36 ms. Remains 31 /148 variables (removed 117) and now considering 38/170 (removed 132) transitions.
// Phase 1: matrix 38 rows 31 cols
[2024-05-21 19:38:42] [INFO ] Computed 5 invariants in 1 ms
[2024-05-21 19:38:43] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-21 19:38:43] [INFO ] Invariant cache hit.
[2024-05-21 19:38:43] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 19:38:43] [INFO ] Implicit Places using invariants and state equation in 60 ms returned [30]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 115 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 30/148 places, 38/170 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 38/38 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 154 ms. Remains : 30/148 places, 38/170 transitions.
[2024-05-21 19:38:43] [INFO ] Flatten gal took : 4 ms
[2024-05-21 19:38:43] [INFO ] Flatten gal took : 4 ms
[2024-05-21 19:38:43] [INFO ] Input system was already deterministic with 38 transitions.
[2024-05-21 19:38:43] [INFO ] Flatten gal took : 4 ms
[2024-05-21 19:38:43] [INFO ] Flatten gal took : 4 ms
[2024-05-21 19:38:43] [INFO ] Time to serialize gal into /tmp/CTLFireability16483961859454434174.gal : 3 ms
[2024-05-21 19:38:43] [INFO ] Time to serialize properties into /tmp/CTLFireability12051461271634040526.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/CTLFireability16483961859454434174.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12051461271634040526.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,2332,0.025249,3496,2,157,5,994,6,0,157,1023,0


Converting to forward existential form...Done !
original formula: (EG(AF((p17==1))) * (EG((AG(((p89==1)&&(p128==1))) * ((p73==0)||(p98==0)))) + AF((p133==1))))
=> equivalent forward existential formula: ([(Init * !(EG(!(EG(!((p17==1)))))))] = FALSE * [FwdG((Init * !(EG((!(E(TRUE U !(((p89==1)&&(p128==1))))) * ((p7...199
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t3, t7, t9, t11, t13, t15, t31, t35, t37, Intersection with reachable at each step e...210
Hit Full ! (commute/partial/dont) 36/0/2
(forward)formula 0,0,0.065534,4900,1,0,97,6915,114,45,1194,7157,98
FORMULA AutonomousCar-PT-02b-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 148/148 places, 170/170 transitions.
Graph (trivial) has 137 edges and 148 vertex of which 4 / 148 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 0 with 71 rules applied. Total rules applied 72 place count 145 transition count 96
Reduce places removed 71 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 88 rules applied. Total rules applied 160 place count 74 transition count 79
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 169 place count 65 transition count 79
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 169 place count 65 transition count 73
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 181 place count 59 transition count 73
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 191 place count 49 transition count 63
Iterating global reduction 3 with 10 rules applied. Total rules applied 201 place count 49 transition count 63
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 201 place count 49 transition count 62
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 203 place count 48 transition count 62
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 229 place count 35 transition count 49
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 233 place count 31 transition count 40
Iterating global reduction 3 with 4 rules applied. Total rules applied 237 place count 31 transition count 40
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 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 3 with 2 rules applied. Total rules applied 239 place count 31 transition count 38
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 240 place count 30 transition count 38
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 241 place count 30 transition count 37
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 242 place count 30 transition count 37
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 244 place count 28 transition count 35
Applied a total of 244 rules in 22 ms. Remains 28 /148 variables (removed 120) and now considering 35/170 (removed 135) transitions.
// Phase 1: matrix 35 rows 28 cols
[2024-05-21 19:38:43] [INFO ] Computed 6 invariants in 1 ms
[2024-05-21 19:38:43] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-21 19:38:43] [INFO ] Invariant cache hit.
[2024-05-21 19:38:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 19:38:43] [INFO ] Implicit Places using invariants and state equation in 58 ms returned [22, 27]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 93 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 26/148 places, 35/170 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 26 transition count 34
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 25 transition count 34
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 25 transition count 33
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 24 transition count 33
Applied a total of 4 rules in 4 ms. Remains 24 /26 variables (removed 2) and now considering 33/35 (removed 2) transitions.
// Phase 1: matrix 33 rows 24 cols
[2024-05-21 19:38:43] [INFO ] Computed 4 invariants in 0 ms
[2024-05-21 19:38:43] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-21 19:38:43] [INFO ] Invariant cache hit.
[2024-05-21 19:38:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 19:38:43] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 24/148 places, 33/170 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 209 ms. Remains : 24/148 places, 33/170 transitions.
[2024-05-21 19:38:43] [INFO ] Flatten gal took : 5 ms
[2024-05-21 19:38:43] [INFO ] Flatten gal took : 6 ms
[2024-05-21 19:38:43] [INFO ] Input system was already deterministic with 33 transitions.
RANDOM walk for 767 steps (62 resets) in 15 ms. (47 steps per ms) remains 0/1 properties
FORMULA AutonomousCar-PT-02b-CTLFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-21 19:38:43] [INFO ] Flatten gal took : 5 ms
[2024-05-21 19:38:43] [INFO ] Flatten gal took : 4 ms
[2024-05-21 19:38:43] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9975288899449662091.gal : 2 ms
[2024-05-21 19:38:43] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4449522316708620853.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality9975288899449662091.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4449522316708620853.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 148/148 places, 170/170 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 129 transition count 151
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 129 transition count 151
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 42 place count 125 transition count 147
Iterating global reduction 0 with 4 rules applied. Total rules applied 46 place count 125 transition count 147
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 124 transition count 146
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 124 transition count 146
Applied a total of 48 rules in 45 ms. Remains 124 /148 variables (removed 24) and now considering 146/170 (removed 24) transitions.
// Phase 1: matrix 146 rows 124 cols
[2024-05-21 19:38:43] [INFO ] Computed 7 invariants in 6 ms
[2024-05-21 19:38:43] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-05-21 19:38:43] [INFO ] Invariant cache hit.
[2024-05-21 19:38:43] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 277 ms to find 0 implicit places.
Running 145 sub problems to find dead transitions.
[2024-05-21 19:38:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-05-21 19:38:45] [INFO ] Deduced a trap composed of 17 places in 88 ms of which 2 ms to minimize.
[2024-05-21 19:38:45] [INFO ] Deduced a trap composed of 19 places in 78 ms of which 2 ms to minimize.
[2024-05-21 19:38:45] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 3 ms to minimize.
[2024-05-21 19:38:45] [INFO ] Deduced a trap composed of 27 places in 67 ms of which 2 ms to minimize.
[2024-05-21 19:38:45] [INFO ] Deduced a trap composed of 44 places in 75 ms of which 2 ms to minimize.
[2024-05-21 19:38:45] [INFO ] Deduced a trap composed of 22 places in 72 ms of which 2 ms to minimize.
[2024-05-21 19:38:45] [INFO ] Deduced a trap composed of 29 places in 88 ms of which 2 ms to minimize.
[2024-05-21 19:38:46] [INFO ] Deduced a trap composed of 36 places in 78 ms of which 2 ms to minimize.
[2024-05-21 19:38:46] [INFO ] Deduced a trap composed of 20 places in 126 ms of which 2 ms to minimize.
[2024-05-21 19:38:46] [INFO ] Deduced a trap composed of 14 places in 87 ms of which 3 ms to minimize.
[2024-05-21 19:38:46] [INFO ] Deduced a trap composed of 44 places in 84 ms of which 2 ms to minimize.
[2024-05-21 19:38:46] [INFO ] Deduced a trap composed of 32 places in 68 ms of which 2 ms to minimize.
[2024-05-21 19:38:46] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 2 ms to minimize.
[2024-05-21 19:38:46] [INFO ] Deduced a trap composed of 30 places in 99 ms of which 2 ms to minimize.
[2024-05-21 19:38:47] [INFO ] Deduced a trap composed of 39 places in 106 ms of which 4 ms to minimize.
[2024-05-21 19:38:47] [INFO ] Deduced a trap composed of 38 places in 66 ms of which 2 ms to minimize.
[2024-05-21 19:38:47] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 1 ms to minimize.
[2024-05-21 19:38:47] [INFO ] Deduced a trap composed of 17 places in 94 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 18/25 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-05-21 19:38:48] [INFO ] Deduced a trap composed of 29 places in 87 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-05-21 19:38:49] [INFO ] Deduced a trap composed of 32 places in 88 ms of which 18 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 6 (OVERLAPS) 146/270 variables, 124/151 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-05-21 19:38:52] [INFO ] Deduced a trap composed of 5 places in 80 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/270 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/270 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 9 (OVERLAPS) 0/270 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 145 unsolved
No progress, stopping.
After SMT solving in domain Real declared 270/270 variables, and 152 constraints, problems are : Problem set: 0 solved, 145 unsolved in 12685 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 145/145 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 145 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 21/28 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 4 (OVERLAPS) 146/270 variables, 124/152 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 145/297 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-05-21 19:38:59] [INFO ] Deduced a trap composed of 31 places in 66 ms of which 2 ms to minimize.
[2024-05-21 19:38:59] [INFO ] Deduced a trap composed of 34 places in 48 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 2/299 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-05-21 19:39:02] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/270 variables, 1/300 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/270 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 9 (OVERLAPS) 0/270 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 145 unsolved
No progress, stopping.
After SMT solving in domain Int declared 270/270 variables, and 300 constraints, problems are : Problem set: 0 solved, 145 unsolved in 12427 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 145/145 constraints, Known Traps: 24/24 constraints]
After SMT, in 25169ms problems are : Problem set: 0 solved, 145 unsolved
Search for dead transitions found 0 dead transitions in 25175ms
Starting structural reductions in LTL mode, iteration 1 : 124/148 places, 146/170 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25500 ms. Remains : 124/148 places, 146/170 transitions.
[2024-05-21 19:39:09] [INFO ] Flatten gal took : 15 ms
[2024-05-21 19:39:09] [INFO ] Flatten gal took : 15 ms
[2024-05-21 19:39:09] [INFO ] Input system was already deterministic with 146 transitions.
[2024-05-21 19:39:09] [INFO ] Flatten gal took : 14 ms
[2024-05-21 19:39:09] [INFO ] Flatten gal took : 14 ms
[2024-05-21 19:39:09] [INFO ] Time to serialize gal into /tmp/CTLFireability16857583935686626376.gal : 7 ms
[2024-05-21 19:39:09] [INFO ] Time to serialize properties into /tmp/CTLFireability4152923027063813677.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/CTLFireability16857583935686626376.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4152923027063813677.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.72657e+06,0.352043,9604,2,2580,5,24320,6,0,644,28437,0


Converting to forward existential form...Done !
original formula: AG(EF(AX(AX((p73==0)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(EX(!(!(EX(!((p73==0))))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t10, t16, t17, t24, t32, t35, t36, t37, t61, t62, t65, t66, t68, t81, t86, t87, t90, t91, t93...305
(forward)formula 0,1,2.13182,48620,1,0,249,234003,314,140,4020,179465,310
FORMULA AutonomousCar-PT-02b-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 148/148 places, 170/170 transitions.
Graph (trivial) has 135 edges and 148 vertex of which 4 / 148 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 70 rules applied. Total rules applied 71 place count 145 transition count 97
Reduce places removed 70 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 87 rules applied. Total rules applied 158 place count 75 transition count 80
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 167 place count 66 transition count 80
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 167 place count 66 transition count 73
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 181 place count 59 transition count 73
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 191 place count 49 transition count 63
Iterating global reduction 3 with 10 rules applied. Total rules applied 201 place count 49 transition count 63
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 201 place count 49 transition count 62
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 203 place count 48 transition count 62
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 204 place count 47 transition count 60
Iterating global reduction 3 with 1 rules applied. Total rules applied 205 place count 47 transition count 60
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 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 3 with 2 rules applied. Total rules applied 207 place count 47 transition count 58
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 208 place count 46 transition count 58
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 5 with 24 rules applied. Total rules applied 232 place count 34 transition count 46
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 234 place count 32 transition count 42
Iterating global reduction 5 with 2 rules applied. Total rules applied 236 place count 32 transition count 42
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 237 place count 32 transition count 41
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 238 place count 32 transition count 41
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 239 place count 31 transition count 40
Applied a total of 239 rules in 37 ms. Remains 31 /148 variables (removed 117) and now considering 40/170 (removed 130) transitions.
// Phase 1: matrix 40 rows 31 cols
[2024-05-21 19:39:11] [INFO ] Computed 6 invariants in 0 ms
[2024-05-21 19:39:11] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-21 19:39:11] [INFO ] Invariant cache hit.
[2024-05-21 19:39:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 19:39:11] [INFO ] Implicit Places using invariants and state equation in 60 ms returned [25, 30]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 118 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 29/148 places, 40/170 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 29 transition count 39
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 28 transition count 39
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 28 transition count 38
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 27 transition count 38
Applied a total of 4 rules in 4 ms. Remains 27 /29 variables (removed 2) and now considering 38/40 (removed 2) transitions.
// Phase 1: matrix 38 rows 27 cols
[2024-05-21 19:39:11] [INFO ] Computed 4 invariants in 0 ms
[2024-05-21 19:39:11] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-21 19:39:11] [INFO ] Invariant cache hit.
[2024-05-21 19:39:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 19:39:11] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 27/148 places, 38/170 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 252 ms. Remains : 27/148 places, 38/170 transitions.
[2024-05-21 19:39:11] [INFO ] Flatten gal took : 5 ms
[2024-05-21 19:39:11] [INFO ] Flatten gal took : 5 ms
[2024-05-21 19:39:11] [INFO ] Input system was already deterministic with 38 transitions.
[2024-05-21 19:39:11] [INFO ] Flatten gal took : 5 ms
[2024-05-21 19:39:11] [INFO ] Flatten gal took : 5 ms
[2024-05-21 19:39:11] [INFO ] Time to serialize gal into /tmp/CTLFireability17435817734299134194.gal : 2 ms
[2024-05-21 19:39:11] [INFO ] Time to serialize properties into /tmp/CTLFireability4329858935170760205.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/CTLFireability17435817734299134194.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4329858935170760205.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,3332,0.031392,4008,2,202,5,2060,6,0,144,2273,0


Converting to forward existential form...Done !
original formula: AF(((((p6==1)&&(p9==1))&&((p41==1)&&(p112==1)))&&(p76==1)))
=> equivalent forward existential formula: [FwdG(Init,!(((((p6==1)&&(p9==1))&&((p41==1)&&(p112==1)))&&(p76==1))))] = FALSE
Hit Full ! (commute/partial/dont) 16/0/22
(forward)formula 0,0,0.112842,5328,1,0,15,9968,20,4,882,9754,14
FORMULA AutonomousCar-PT-02b-CTLFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 148/148 places, 170/170 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 129 transition count 151
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 129 transition count 151
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 42 place count 125 transition count 147
Iterating global reduction 0 with 4 rules applied. Total rules applied 46 place count 125 transition count 147
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 124 transition count 146
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 124 transition count 146
Applied a total of 48 rules in 13 ms. Remains 124 /148 variables (removed 24) and now considering 146/170 (removed 24) transitions.
// Phase 1: matrix 146 rows 124 cols
[2024-05-21 19:39:11] [INFO ] Computed 7 invariants in 2 ms
[2024-05-21 19:39:11] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-21 19:39:11] [INFO ] Invariant cache hit.
[2024-05-21 19:39:12] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 241 ms to find 0 implicit places.
Running 145 sub problems to find dead transitions.
[2024-05-21 19:39:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-05-21 19:39:13] [INFO ] Deduced a trap composed of 17 places in 97 ms of which 2 ms to minimize.
[2024-05-21 19:39:13] [INFO ] Deduced a trap composed of 19 places in 112 ms of which 3 ms to minimize.
[2024-05-21 19:39:13] [INFO ] Deduced a trap composed of 16 places in 96 ms of which 3 ms to minimize.
[2024-05-21 19:39:13] [INFO ] Deduced a trap composed of 27 places in 92 ms of which 3 ms to minimize.
[2024-05-21 19:39:14] [INFO ] Deduced a trap composed of 44 places in 93 ms of which 3 ms to minimize.
[2024-05-21 19:39:14] [INFO ] Deduced a trap composed of 22 places in 96 ms of which 3 ms to minimize.
[2024-05-21 19:39:14] [INFO ] Deduced a trap composed of 29 places in 83 ms of which 3 ms to minimize.
[2024-05-21 19:39:14] [INFO ] Deduced a trap composed of 36 places in 86 ms of which 2 ms to minimize.
[2024-05-21 19:39:14] [INFO ] Deduced a trap composed of 20 places in 106 ms of which 3 ms to minimize.
[2024-05-21 19:39:14] [INFO ] Deduced a trap composed of 14 places in 87 ms of which 2 ms to minimize.
[2024-05-21 19:39:14] [INFO ] Deduced a trap composed of 44 places in 101 ms of which 2 ms to minimize.
[2024-05-21 19:39:14] [INFO ] Deduced a trap composed of 32 places in 77 ms of which 2 ms to minimize.
[2024-05-21 19:39:15] [INFO ] Deduced a trap composed of 23 places in 98 ms of which 2 ms to minimize.
[2024-05-21 19:39:15] [INFO ] Deduced a trap composed of 30 places in 92 ms of which 2 ms to minimize.
[2024-05-21 19:39:15] [INFO ] Deduced a trap composed of 39 places in 98 ms of which 2 ms to minimize.
[2024-05-21 19:39:15] [INFO ] Deduced a trap composed of 38 places in 62 ms of which 2 ms to minimize.
[2024-05-21 19:39:15] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 2 ms to minimize.
[2024-05-21 19:39:15] [INFO ] Deduced a trap composed of 17 places in 92 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 18/25 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-05-21 19:39:16] [INFO ] Deduced a trap composed of 29 places in 86 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-05-21 19:39:18] [INFO ] Deduced a trap composed of 32 places in 87 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 6 (OVERLAPS) 146/270 variables, 124/151 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-05-21 19:39:20] [INFO ] Deduced a trap composed of 5 places in 80 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/270 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/270 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 9 (OVERLAPS) 0/270 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 145 unsolved
No progress, stopping.
After SMT solving in domain Real declared 270/270 variables, and 152 constraints, problems are : Problem set: 0 solved, 145 unsolved in 12212 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 145/145 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 145 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 21/28 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 4 (OVERLAPS) 146/270 variables, 124/152 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 145/297 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-05-21 19:39:27] [INFO ] Deduced a trap composed of 31 places in 72 ms of which 2 ms to minimize.
[2024-05-21 19:39:27] [INFO ] Deduced a trap composed of 34 places in 52 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 2/299 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-05-21 19:39:29] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/270 variables, 1/300 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/270 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 9 (OVERLAPS) 0/270 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 145 unsolved
No progress, stopping.
After SMT solving in domain Int declared 270/270 variables, and 300 constraints, problems are : Problem set: 0 solved, 145 unsolved in 9513 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 145/145 constraints, Known Traps: 24/24 constraints]
After SMT, in 21776ms problems are : Problem set: 0 solved, 145 unsolved
Search for dead transitions found 0 dead transitions in 21780ms
Starting structural reductions in LTL mode, iteration 1 : 124/148 places, 146/170 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22035 ms. Remains : 124/148 places, 146/170 transitions.
[2024-05-21 19:39:33] [INFO ] Flatten gal took : 8 ms
[2024-05-21 19:39:33] [INFO ] Flatten gal took : 9 ms
[2024-05-21 19:39:33] [INFO ] Input system was already deterministic with 146 transitions.
[2024-05-21 19:39:33] [INFO ] Flatten gal took : 9 ms
[2024-05-21 19:39:33] [INFO ] Flatten gal took : 8 ms
[2024-05-21 19:39:33] [INFO ] Time to serialize gal into /tmp/CTLFireability1219330581270522794.gal : 5 ms
[2024-05-21 19:39:33] [INFO ] Time to serialize properties into /tmp/CTLFireability12061238027165887701.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/CTLFireability1219330581270522794.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12061238027165887701.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.72657e+06,0.327812,9604,2,2580,5,24320,6,0,644,28437,0


Converting to forward existential form...Done !
original formula: EX(A((((p6==1)&&(p14==1))&&((p60==1)&&(p112==1))) U EX(((AG((((p6==1)&&(p9==1))&&((p60==1)&&(p112==1)))) + EF((p34==1))) + (((p6==1)&&(p1...190
=> equivalent forward existential formula: [((EY(Init) * !(EG(!(EX(((!(E(TRUE U !((((p6==1)&&(p9==1))&&((p60==1)&&(p112==1)))))) + E(TRUE U (p34==1))) + ((...557
Reverse transition relation is NOT exact ! Due to transitions t10, t16, t17, t24, t32, t35, t36, t37, t61, t62, t65, t66, t68, t81, t86, t87, t90, t91, t93...305
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,21.1133,505576,1,0,1128,3.4436e+06,326,623,4363,3.04466e+06,1150
FORMULA AutonomousCar-PT-02b-CTLFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 148/148 places, 170/170 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 132 transition count 154
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 132 transition count 154
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 36 place count 128 transition count 150
Iterating global reduction 0 with 4 rules applied. Total rules applied 40 place count 128 transition count 150
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 127 transition count 149
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 127 transition count 149
Applied a total of 42 rules in 16 ms. Remains 127 /148 variables (removed 21) and now considering 149/170 (removed 21) transitions.
// Phase 1: matrix 149 rows 127 cols
[2024-05-21 19:39:55] [INFO ] Computed 7 invariants in 2 ms
[2024-05-21 19:39:55] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-21 19:39:55] [INFO ] Invariant cache hit.
[2024-05-21 19:39:55] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 225 ms to find 0 implicit places.
Running 148 sub problems to find dead transitions.
[2024-05-21 19:39:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 1 (OVERLAPS) 1/127 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 148 unsolved
[2024-05-21 19:39:56] [INFO ] Deduced a trap composed of 14 places in 79 ms of which 2 ms to minimize.
[2024-05-21 19:39:56] [INFO ] Deduced a trap composed of 17 places in 99 ms of which 2 ms to minimize.
[2024-05-21 19:39:57] [INFO ] Deduced a trap composed of 17 places in 89 ms of which 2 ms to minimize.
[2024-05-21 19:39:57] [INFO ] Deduced a trap composed of 36 places in 88 ms of which 2 ms to minimize.
[2024-05-21 19:39:57] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 2 ms to minimize.
[2024-05-21 19:39:57] [INFO ] Deduced a trap composed of 21 places in 83 ms of which 3 ms to minimize.
[2024-05-21 19:39:57] [INFO ] Deduced a trap composed of 25 places in 90 ms of which 2 ms to minimize.
[2024-05-21 19:39:57] [INFO ] Deduced a trap composed of 32 places in 49 ms of which 1 ms to minimize.
[2024-05-21 19:39:57] [INFO ] Deduced a trap composed of 21 places in 108 ms of which 3 ms to minimize.
[2024-05-21 19:39:57] [INFO ] Deduced a trap composed of 19 places in 102 ms of which 2 ms to minimize.
[2024-05-21 19:39:57] [INFO ] Deduced a trap composed of 31 places in 69 ms of which 1 ms to minimize.
[2024-05-21 19:39:58] [INFO ] Deduced a trap composed of 41 places in 67 ms of which 1 ms to minimize.
[2024-05-21 19:39:58] [INFO ] Deduced a trap composed of 51 places in 67 ms of which 2 ms to minimize.
[2024-05-21 19:39:58] [INFO ] Deduced a trap composed of 30 places in 67 ms of which 1 ms to minimize.
[2024-05-21 19:39:58] [INFO ] Deduced a trap composed of 32 places in 63 ms of which 1 ms to minimize.
[2024-05-21 19:39:58] [INFO ] Deduced a trap composed of 29 places in 55 ms of which 1 ms to minimize.
[2024-05-21 19:39:58] [INFO ] Deduced a trap composed of 32 places in 73 ms of which 2 ms to minimize.
[2024-05-21 19:39:58] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 2 ms to minimize.
[2024-05-21 19:39:58] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 1 ms to minimize.
[2024-05-21 19:39:58] [INFO ] Deduced a trap composed of 29 places in 63 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 148 unsolved
[2024-05-21 19:39:58] [INFO ] Deduced a trap composed of 32 places in 66 ms of which 1 ms to minimize.
[2024-05-21 19:39:59] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
[2024-05-21 19:39:59] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 2 ms to minimize.
[2024-05-21 19:39:59] [INFO ] Deduced a trap composed of 33 places in 47 ms of which 2 ms to minimize.
[2024-05-21 19:39:59] [INFO ] Deduced a trap composed of 33 places in 43 ms of which 2 ms to minimize.
[2024-05-21 19:39:59] [INFO ] Deduced a trap composed of 39 places in 36 ms of which 2 ms to minimize.
[2024-05-21 19:39:59] [INFO ] Deduced a trap composed of 51 places in 66 ms of which 2 ms to minimize.
[2024-05-21 19:39:59] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 8/35 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 5 (OVERLAPS) 149/276 variables, 127/162 constraints. Problems are: Problem set: 0 solved, 148 unsolved
[2024-05-21 19:40:01] [INFO ] Deduced a trap composed of 32 places in 71 ms of which 3 ms to minimize.
[2024-05-21 19:40:01] [INFO ] Deduced a trap composed of 39 places in 49 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/276 variables, 2/164 constraints. Problems are: Problem set: 0 solved, 148 unsolved
[2024-05-21 19:40:03] [INFO ] Deduced a trap composed of 39 places in 60 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/276 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 148 unsolved
[2024-05-21 19:40:05] [INFO ] Deduced a trap composed of 5 places in 57 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/276 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/276 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 148 unsolved
[2024-05-21 19:40:08] [INFO ] Deduced a trap composed of 30 places in 72 ms of which 3 ms to minimize.
[2024-05-21 19:40:08] [INFO ] Deduced a trap composed of 39 places in 69 ms of which 2 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/276 variables, 2/168 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/276 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 12 (OVERLAPS) 0/276 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 148 unsolved
No progress, stopping.
After SMT solving in domain Real declared 276/276 variables, and 168 constraints, problems are : Problem set: 0 solved, 148 unsolved in 17043 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 127/127 constraints, PredecessorRefiner: 148/148 constraints, Known Traps: 34/34 constraints]
Escalating to Integer solving :Problem set: 0 solved, 148 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 1 (OVERLAPS) 1/127 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 34/41 constraints. Problems are: Problem set: 0 solved, 148 unsolved
[2024-05-21 19:40:13] [INFO ] Deduced a trap composed of 25 places in 68 ms of which 2 ms to minimize.
[2024-05-21 19:40:13] [INFO ] Deduced a trap composed of 18 places in 78 ms of which 1 ms to minimize.
[2024-05-21 19:40:13] [INFO ] Deduced a trap composed of 52 places in 55 ms of which 2 ms to minimize.
[2024-05-21 19:40:14] [INFO ] Deduced a trap composed of 34 places in 61 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 4/45 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 5 (OVERLAPS) 149/276 variables, 127/172 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/276 variables, 148/320 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/276 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 8 (OVERLAPS) 0/276 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 148 unsolved
No progress, stopping.
After SMT solving in domain Int declared 276/276 variables, and 320 constraints, problems are : Problem set: 0 solved, 148 unsolved in 8982 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 127/127 constraints, PredecessorRefiner: 148/148 constraints, Known Traps: 38/38 constraints]
After SMT, in 26074ms problems are : Problem set: 0 solved, 148 unsolved
Search for dead transitions found 0 dead transitions in 26079ms
Starting structural reductions in LTL mode, iteration 1 : 127/148 places, 149/170 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26322 ms. Remains : 127/148 places, 149/170 transitions.
[2024-05-21 19:40:21] [INFO ] Flatten gal took : 13 ms
[2024-05-21 19:40:21] [INFO ] Flatten gal took : 12 ms
[2024-05-21 19:40:21] [INFO ] Input system was already deterministic with 149 transitions.
[2024-05-21 19:40:21] [INFO ] Flatten gal took : 11 ms
[2024-05-21 19:40:21] [INFO ] Flatten gal took : 12 ms
[2024-05-21 19:40:21] [INFO ] Time to serialize gal into /tmp/CTLFireability17457266762153075512.gal : 6 ms
[2024-05-21 19:40:21] [INFO ] Time to serialize properties into /tmp/CTLFireability5823087952488385733.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/CTLFireability17457266762153075512.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5823087952488385733.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.97145e+06,0.296403,9364,2,2614,5,22786,6,0,659,26158,0


Converting to forward existential form...Done !
original formula: EX(EG((((!(A((((p6==1)&&(p9==1))&&((p29==1)&&(p112==1))) U (p57==1))) + EX((p26==1))) + (EF((p132==1)) + (p6==0))) + (((p9==0)||(p79==0))...183
=> equivalent forward existential formula: [FwdG(EY(Init),(((!(!((E(!((p57==1)) U (!((((p6==1)&&(p9==1))&&((p29==1)&&(p112==1)))) * !((p57==1)))) + EG(!((p...277
Reverse transition relation is NOT exact ! Due to transitions t10, t16, t17, t25, t29, t33, t36, t37, t38, t62, t63, t66, t67, t69, t83, t88, t89, t92, t93...316
(forward)formula 0,1,17.5884,461928,1,0,1154,3.01782e+06,336,498,4414,2.9511e+06,1312
FORMULA AutonomousCar-PT-02b-CTLFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 148/148 places, 170/170 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 130 transition count 152
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 130 transition count 152
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 40 place count 126 transition count 148
Iterating global reduction 0 with 4 rules applied. Total rules applied 44 place count 126 transition count 148
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 125 transition count 147
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 125 transition count 147
Applied a total of 46 rules in 9 ms. Remains 125 /148 variables (removed 23) and now considering 147/170 (removed 23) transitions.
// Phase 1: matrix 147 rows 125 cols
[2024-05-21 19:40:39] [INFO ] Computed 7 invariants in 1 ms
[2024-05-21 19:40:39] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-05-21 19:40:39] [INFO ] Invariant cache hit.
[2024-05-21 19:40:39] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 240 ms to find 0 implicit places.
Running 146 sub problems to find dead transitions.
[2024-05-21 19:40:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (OVERLAPS) 1/125 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 146 unsolved
[2024-05-21 19:40:40] [INFO ] Deduced a trap composed of 14 places in 100 ms of which 3 ms to minimize.
[2024-05-21 19:40:40] [INFO ] Deduced a trap composed of 28 places in 114 ms of which 3 ms to minimize.
[2024-05-21 19:40:40] [INFO ] Deduced a trap composed of 31 places in 94 ms of which 3 ms to minimize.
[2024-05-21 19:40:40] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-05-21 19:40:41] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 2 ms to minimize.
[2024-05-21 19:40:41] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 2 ms to minimize.
[2024-05-21 19:40:41] [INFO ] Deduced a trap composed of 33 places in 60 ms of which 2 ms to minimize.
[2024-05-21 19:40:41] [INFO ] Deduced a trap composed of 20 places in 73 ms of which 2 ms to minimize.
[2024-05-21 19:40:41] [INFO ] Deduced a trap composed of 14 places in 85 ms of which 2 ms to minimize.
[2024-05-21 19:40:41] [INFO ] Deduced a trap composed of 36 places in 91 ms of which 2 ms to minimize.
[2024-05-21 19:40:41] [INFO ] Deduced a trap composed of 31 places in 93 ms of which 2 ms to minimize.
[2024-05-21 19:40:41] [INFO ] Deduced a trap composed of 38 places in 60 ms of which 2 ms to minimize.
[2024-05-21 19:40:41] [INFO ] Deduced a trap composed of 38 places in 52 ms of which 1 ms to minimize.
[2024-05-21 19:40:41] [INFO ] Deduced a trap composed of 22 places in 89 ms of which 2 ms to minimize.
[2024-05-21 19:40:42] [INFO ] Deduced a trap composed of 49 places in 72 ms of which 2 ms to minimize.
[2024-05-21 19:40:42] [INFO ] Deduced a trap composed of 29 places in 70 ms of which 2 ms to minimize.
[2024-05-21 19:40:42] [INFO ] Deduced a trap composed of 29 places in 71 ms of which 2 ms to minimize.
[2024-05-21 19:40:42] [INFO ] Deduced a trap composed of 36 places in 93 ms of which 2 ms to minimize.
[2024-05-21 19:40:42] [INFO ] Deduced a trap composed of 42 places in 89 ms of which 2 ms to minimize.
[2024-05-21 19:40:42] [INFO ] Deduced a trap composed of 22 places in 91 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 146 unsolved
[2024-05-21 19:40:42] [INFO ] Deduced a trap composed of 40 places in 41 ms of which 1 ms to minimize.
[2024-05-21 19:40:43] [INFO ] Deduced a trap composed of 31 places in 86 ms of which 2 ms to minimize.
[2024-05-21 19:40:43] [INFO ] Deduced a trap composed of 32 places in 62 ms of which 2 ms to minimize.
[2024-05-21 19:40:43] [INFO ] Deduced a trap composed of 31 places in 100 ms of which 2 ms to minimize.
[2024-05-21 19:40:43] [INFO ] Deduced a trap composed of 5 places in 67 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 5/32 constraints. Problems are: Problem set: 0 solved, 146 unsolved
[2024-05-21 19:40:45] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 2 ms to minimize.
[2024-05-21 19:40:45] [INFO ] Deduced a trap composed of 14 places in 75 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 146 unsolved
[2024-05-21 19:40:45] [INFO ] Deduced a trap composed of 19 places in 86 ms of which 2 ms to minimize.
[2024-05-21 19:40:46] [INFO ] Deduced a trap composed of 32 places in 86 ms of which 2 ms to minimize.
[2024-05-21 19:40:46] [INFO ] Deduced a trap composed of 38 places in 57 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 3/37 constraints. Problems are: Problem set: 0 solved, 146 unsolved
[2024-05-21 19:40:47] [INFO ] Deduced a trap composed of 34 places in 62 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 146 unsolved
[2024-05-21 19:40:49] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/125 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 9 (OVERLAPS) 147/272 variables, 125/164 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/272 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 11 (OVERLAPS) 0/272 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Real declared 272/272 variables, and 164 constraints, problems are : Problem set: 0 solved, 146 unsolved in 14204 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 125/125 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 32/32 constraints]
Escalating to Integer solving :Problem set: 0 solved, 146 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (OVERLAPS) 1/125 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 32/39 constraints. Problems are: Problem set: 0 solved, 146 unsolved
[2024-05-21 19:40:55] [INFO ] Deduced a trap composed of 52 places in 68 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (OVERLAPS) 147/272 variables, 125/165 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/272 variables, 146/311 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/272 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 146 unsolved
[2024-05-21 19:40:59] [INFO ] Deduced a trap composed of 31 places in 62 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/272 variables, 1/312 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/272 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 10 (OVERLAPS) 0/272 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Int declared 272/272 variables, and 312 constraints, problems are : Problem set: 0 solved, 146 unsolved in 14399 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 125/125 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 34/34 constraints]
After SMT, in 28635ms problems are : Problem set: 0 solved, 146 unsolved
Search for dead transitions found 0 dead transitions in 28637ms
Starting structural reductions in LTL mode, iteration 1 : 125/148 places, 147/170 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28887 ms. Remains : 125/148 places, 147/170 transitions.
[2024-05-21 19:41:08] [INFO ] Flatten gal took : 12 ms
[2024-05-21 19:41:08] [INFO ] Flatten gal took : 11 ms
[2024-05-21 19:41:08] [INFO ] Input system was already deterministic with 147 transitions.
[2024-05-21 19:41:08] [INFO ] Flatten gal took : 12 ms
[2024-05-21 19:41:08] [INFO ] Flatten gal took : 11 ms
[2024-05-21 19:41:08] [INFO ] Time to serialize gal into /tmp/CTLFireability14285499263026927638.gal : 7 ms
[2024-05-21 19:41:08] [INFO ] Time to serialize properties into /tmp/CTLFireability15640845251375823239.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/CTLFireability14285499263026927638.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15640845251375823239.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.77244e+06,0.280799,9084,2,2584,5,22309,6,0,649,25755,0


Converting to forward existential form...Done !
original formula: AX(AG((p93==0)))
=> equivalent forward existential formula: [(FwdU(EY(Init),TRUE) * !((p93==0)))] = FALSE
(forward)formula 0,0,0.453795,9612,1,0,10,22737,10,2,1318,26076,4
FORMULA AutonomousCar-PT-02b-CTLFireability-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 148/148 places, 170/170 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 131 transition count 153
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 131 transition count 153
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 37 place count 128 transition count 150
Iterating global reduction 0 with 3 rules applied. Total rules applied 40 place count 128 transition count 150
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 127 transition count 149
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 127 transition count 149
Applied a total of 42 rules in 11 ms. Remains 127 /148 variables (removed 21) and now considering 149/170 (removed 21) transitions.
// Phase 1: matrix 149 rows 127 cols
[2024-05-21 19:41:08] [INFO ] Computed 7 invariants in 2 ms
[2024-05-21 19:41:08] [INFO ] Implicit Places using invariants in 103 ms returned []
[2024-05-21 19:41:08] [INFO ] Invariant cache hit.
[2024-05-21 19:41:08] [INFO ] Implicit Places using invariants and state equation in 184 ms returned []
Implicit Place search using SMT with State Equation took 291 ms to find 0 implicit places.
Running 148 sub problems to find dead transitions.
[2024-05-21 19:41:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 1 (OVERLAPS) 1/127 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 148 unsolved
[2024-05-21 19:41:10] [INFO ] Deduced a trap composed of 14 places in 108 ms of which 2 ms to minimize.
[2024-05-21 19:41:10] [INFO ] Deduced a trap composed of 19 places in 108 ms of which 2 ms to minimize.
[2024-05-21 19:41:10] [INFO ] Deduced a trap composed of 31 places in 95 ms of which 2 ms to minimize.
[2024-05-21 19:41:11] [INFO ] Deduced a trap composed of 39 places in 42 ms of which 1 ms to minimize.
[2024-05-21 19:41:11] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 2 ms to minimize.
[2024-05-21 19:41:11] [INFO ] Deduced a trap composed of 21 places in 110 ms of which 2 ms to minimize.
[2024-05-21 19:41:11] [INFO ] Deduced a trap composed of 14 places in 97 ms of which 3 ms to minimize.
[2024-05-21 19:41:11] [INFO ] Deduced a trap composed of 23 places in 91 ms of which 2 ms to minimize.
[2024-05-21 19:41:11] [INFO ] Deduced a trap composed of 24 places in 92 ms of which 2 ms to minimize.
[2024-05-21 19:41:11] [INFO ] Deduced a trap composed of 28 places in 87 ms of which 2 ms to minimize.
[2024-05-21 19:41:11] [INFO ] Deduced a trap composed of 28 places in 85 ms of which 1 ms to minimize.
[2024-05-21 19:41:11] [INFO ] Deduced a trap composed of 21 places in 89 ms of which 2 ms to minimize.
[2024-05-21 19:41:12] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 2 ms to minimize.
[2024-05-21 19:41:12] [INFO ] Deduced a trap composed of 22 places in 70 ms of which 2 ms to minimize.
[2024-05-21 19:41:12] [INFO ] Deduced a trap composed of 31 places in 71 ms of which 2 ms to minimize.
[2024-05-21 19:41:12] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 2 ms to minimize.
[2024-05-21 19:41:12] [INFO ] Deduced a trap composed of 33 places in 69 ms of which 2 ms to minimize.
[2024-05-21 19:41:12] [INFO ] Deduced a trap composed of 38 places in 55 ms of which 2 ms to minimize.
[2024-05-21 19:41:12] [INFO ] Deduced a trap composed of 14 places in 86 ms of which 2 ms to minimize.
[2024-05-21 19:41:12] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 148 unsolved
[2024-05-21 19:41:13] [INFO ] Deduced a trap composed of 41 places in 93 ms of which 3 ms to minimize.
[2024-05-21 19:41:13] [INFO ] Deduced a trap composed of 21 places in 107 ms of which 3 ms to minimize.
[2024-05-21 19:41:13] [INFO ] Deduced a trap composed of 38 places in 53 ms of which 2 ms to minimize.
[2024-05-21 19:41:13] [INFO ] Deduced a trap composed of 31 places in 48 ms of which 2 ms to minimize.
[2024-05-21 19:41:13] [INFO ] Deduced a trap composed of 17 places in 94 ms of which 3 ms to minimize.
[2024-05-21 19:41:14] [INFO ] Deduced a trap composed of 27 places in 89 ms of which 3 ms to minimize.
[2024-05-21 19:41:14] [INFO ] Deduced a trap composed of 29 places in 74 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 7/34 constraints. Problems are: Problem set: 0 solved, 148 unsolved
[2024-05-21 19:41:15] [INFO ] Deduced a trap composed of 32 places in 77 ms of which 2 ms to minimize.
[2024-05-21 19:41:15] [INFO ] Deduced a trap composed of 30 places in 94 ms of which 2 ms to minimize.
[2024-05-21 19:41:15] [INFO ] Deduced a trap composed of 31 places in 61 ms of which 1 ms to minimize.
[2024-05-21 19:41:15] [INFO ] Deduced a trap composed of 42 places in 62 ms of which 2 ms to minimize.
[2024-05-21 19:41:15] [INFO ] Deduced a trap composed of 41 places in 64 ms of which 2 ms to minimize.
[2024-05-21 19:41:15] [INFO ] Deduced a trap composed of 34 places in 67 ms of which 2 ms to minimize.
[2024-05-21 19:41:16] [INFO ] Deduced a trap composed of 34 places in 63 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 7/41 constraints. Problems are: Problem set: 0 solved, 148 unsolved
[2024-05-21 19:41:16] [INFO ] Deduced a trap composed of 29 places in 76 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/127 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 7 (OVERLAPS) 149/276 variables, 127/169 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/276 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 9 (OVERLAPS) 0/276 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 148 unsolved
No progress, stopping.
After SMT solving in domain Real declared 276/276 variables, and 169 constraints, problems are : Problem set: 0 solved, 148 unsolved in 13855 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 127/127 constraints, PredecessorRefiner: 148/148 constraints, Known Traps: 35/35 constraints]
Escalating to Integer solving :Problem set: 0 solved, 148 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 1 (OVERLAPS) 1/127 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 35/42 constraints. Problems are: Problem set: 0 solved, 148 unsolved
[2024-05-21 19:41:24] [INFO ] Deduced a trap composed of 5 places in 68 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 5 (OVERLAPS) 149/276 variables, 127/170 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/276 variables, 148/318 constraints. Problems are: Problem set: 0 solved, 148 unsolved
[2024-05-21 19:41:27] [INFO ] Deduced a trap composed of 25 places in 85 ms of which 2 ms to minimize.
[2024-05-21 19:41:27] [INFO ] Deduced a trap composed of 30 places in 98 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/276 variables, 2/320 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/276 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 9 (OVERLAPS) 0/276 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 148 unsolved
No progress, stopping.
After SMT solving in domain Int declared 276/276 variables, and 320 constraints, problems are : Problem set: 0 solved, 148 unsolved in 11845 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 127/127 constraints, PredecessorRefiner: 148/148 constraints, Known Traps: 38/38 constraints]
After SMT, in 25753ms problems are : Problem set: 0 solved, 148 unsolved
Search for dead transitions found 0 dead transitions in 25756ms
Starting structural reductions in LTL mode, iteration 1 : 127/148 places, 149/170 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26058 ms. Remains : 127/148 places, 149/170 transitions.
[2024-05-21 19:41:34] [INFO ] Flatten gal took : 7 ms
[2024-05-21 19:41:34] [INFO ] Flatten gal took : 8 ms
[2024-05-21 19:41:34] [INFO ] Input system was already deterministic with 149 transitions.
[2024-05-21 19:41:34] [INFO ] Flatten gal took : 7 ms
[2024-05-21 19:41:34] [INFO ] Flatten gal took : 6 ms
[2024-05-21 19:41:34] [INFO ] Time to serialize gal into /tmp/CTLFireability3626236007392815488.gal : 2 ms
[2024-05-21 19:41:34] [INFO ] Time to serialize properties into /tmp/CTLFireability3300226992068557153.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/CTLFireability3626236007392815488.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3300226992068557153.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.8183e+06,0.28198,10148,2,2819,5,26018,6,0,659,29155,0


Converting to forward existential form...Done !
original formula: AF(((A(AX((p123==1)) U (p24==1)) * (p82==1)) * AF((p114==1))))
=> equivalent forward existential formula: [FwdG(Init,!(((!((E(!((p24==1)) U (!(!(EX(!((p123==1))))) * !((p24==1)))) + EG(!((p24==1))))) * (p82==1)) * !(EG...182
Reverse transition relation is NOT exact ! Due to transitions t10, t16, t17, t25, t29, t35, t39, t40, t54, t64, t65, t68, t69, t71, t84, t89, t90, t93, t94...316
(forward)formula 0,0,21.0989,534384,1,0,1857,3.53861e+06,332,817,4266,3.32334e+06,2115
FORMULA AutonomousCar-PT-02b-CTLFireability-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 148/148 places, 170/170 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 129 transition count 151
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 129 transition count 151
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 42 place count 125 transition count 147
Iterating global reduction 0 with 4 rules applied. Total rules applied 46 place count 125 transition count 147
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 124 transition count 146
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 124 transition count 146
Applied a total of 48 rules in 8 ms. Remains 124 /148 variables (removed 24) and now considering 146/170 (removed 24) transitions.
// Phase 1: matrix 146 rows 124 cols
[2024-05-21 19:41:56] [INFO ] Computed 7 invariants in 2 ms
[2024-05-21 19:41:56] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-05-21 19:41:56] [INFO ] Invariant cache hit.
[2024-05-21 19:41:56] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 238 ms to find 0 implicit places.
Running 145 sub problems to find dead transitions.
[2024-05-21 19:41:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-05-21 19:41:57] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 2 ms to minimize.
[2024-05-21 19:41:57] [INFO ] Deduced a trap composed of 19 places in 77 ms of which 1 ms to minimize.
[2024-05-21 19:41:57] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 2 ms to minimize.
[2024-05-21 19:41:57] [INFO ] Deduced a trap composed of 27 places in 72 ms of which 2 ms to minimize.
[2024-05-21 19:41:57] [INFO ] Deduced a trap composed of 44 places in 69 ms of which 2 ms to minimize.
[2024-05-21 19:41:58] [INFO ] Deduced a trap composed of 22 places in 81 ms of which 2 ms to minimize.
[2024-05-21 19:41:58] [INFO ] Deduced a trap composed of 29 places in 52 ms of which 1 ms to minimize.
[2024-05-21 19:41:58] [INFO ] Deduced a trap composed of 36 places in 74 ms of which 2 ms to minimize.
[2024-05-21 19:41:58] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 2 ms to minimize.
[2024-05-21 19:41:58] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 2 ms to minimize.
[2024-05-21 19:41:58] [INFO ] Deduced a trap composed of 44 places in 88 ms of which 2 ms to minimize.
[2024-05-21 19:41:58] [INFO ] Deduced a trap composed of 32 places in 77 ms of which 2 ms to minimize.
[2024-05-21 19:41:58] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 1 ms to minimize.
[2024-05-21 19:41:58] [INFO ] Deduced a trap composed of 30 places in 99 ms of which 3 ms to minimize.
[2024-05-21 19:41:59] [INFO ] Deduced a trap composed of 39 places in 66 ms of which 2 ms to minimize.
[2024-05-21 19:41:59] [INFO ] Deduced a trap composed of 38 places in 43 ms of which 1 ms to minimize.
[2024-05-21 19:41:59] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2024-05-21 19:41:59] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 18/25 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-05-21 19:42:00] [INFO ] Deduced a trap composed of 29 places in 73 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-05-21 19:42:01] [INFO ] Deduced a trap composed of 32 places in 63 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 6 (OVERLAPS) 146/270 variables, 124/151 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-05-21 19:42:04] [INFO ] Deduced a trap composed of 5 places in 75 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/270 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/270 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 9 (OVERLAPS) 0/270 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 145 unsolved
No progress, stopping.
After SMT solving in domain Real declared 270/270 variables, and 152 constraints, problems are : Problem set: 0 solved, 145 unsolved in 10016 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 145/145 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 145 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 21/28 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 4 (OVERLAPS) 146/270 variables, 124/152 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 145/297 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-05-21 19:42:08] [INFO ] Deduced a trap composed of 31 places in 50 ms of which 1 ms to minimize.
[2024-05-21 19:42:08] [INFO ] Deduced a trap composed of 34 places in 76 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 2/299 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-05-21 19:42:11] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/270 variables, 1/300 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/270 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 9 (OVERLAPS) 0/270 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 145 unsolved
No progress, stopping.
After SMT solving in domain Int declared 270/270 variables, and 300 constraints, problems are : Problem set: 0 solved, 145 unsolved in 10138 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 145/145 constraints, Known Traps: 24/24 constraints]
After SMT, in 20198ms problems are : Problem set: 0 solved, 145 unsolved
Search for dead transitions found 0 dead transitions in 20201ms
Starting structural reductions in LTL mode, iteration 1 : 124/148 places, 146/170 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20449 ms. Remains : 124/148 places, 146/170 transitions.
[2024-05-21 19:42:16] [INFO ] Flatten gal took : 8 ms
[2024-05-21 19:42:16] [INFO ] Flatten gal took : 7 ms
[2024-05-21 19:42:16] [INFO ] Input system was already deterministic with 146 transitions.
[2024-05-21 19:42:16] [INFO ] Flatten gal took : 5 ms
[2024-05-21 19:42:16] [INFO ] Flatten gal took : 9 ms
[2024-05-21 19:42:16] [INFO ] Time to serialize gal into /tmp/CTLFireability16979707607655345070.gal : 4 ms
[2024-05-21 19:42:16] [INFO ] Time to serialize properties into /tmp/CTLFireability8879658045737730529.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/CTLFireability16979707607655345070.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8879658045737730529.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.72657e+06,0.217297,9612,2,2580,5,24320,6,0,644,28437,0


Converting to forward existential form...Done !
original formula: AX(AX(EF((AX((p10==1)) + EG((p19==1))))))
=> equivalent forward existential formula: [(EY(EY(Init)) * !(E(TRUE U (!(EX(!((p10==1)))) + EG((p19==1))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t10, t16, t17, t24, t32, t35, t36, t37, t61, t62, t65, t66, t68, t81, t86, t87, t90, t91, t93...305
(forward)formula 0,1,6.1415,161124,1,0,497,939093,321,202,4125,772046,609
FORMULA AutonomousCar-PT-02b-CTLFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 148/148 places, 170/170 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 129 transition count 151
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 129 transition count 151
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 42 place count 125 transition count 147
Iterating global reduction 0 with 4 rules applied. Total rules applied 46 place count 125 transition count 147
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 124 transition count 146
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 124 transition count 146
Applied a total of 48 rules in 4 ms. Remains 124 /148 variables (removed 24) and now considering 146/170 (removed 24) transitions.
[2024-05-21 19:42:22] [INFO ] Invariant cache hit.
[2024-05-21 19:42:22] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-05-21 19:42:22] [INFO ] Invariant cache hit.
[2024-05-21 19:42:23] [INFO ] Implicit Places using invariants and state equation in 191 ms returned []
Implicit Place search using SMT with State Equation took 281 ms to find 0 implicit places.
Running 145 sub problems to find dead transitions.
[2024-05-21 19:42:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-05-21 19:42:24] [INFO ] Deduced a trap composed of 17 places in 94 ms of which 3 ms to minimize.
[2024-05-21 19:42:24] [INFO ] Deduced a trap composed of 19 places in 113 ms of which 3 ms to minimize.
[2024-05-21 19:42:24] [INFO ] Deduced a trap composed of 16 places in 91 ms of which 2 ms to minimize.
[2024-05-21 19:42:25] [INFO ] Deduced a trap composed of 27 places in 93 ms of which 2 ms to minimize.
[2024-05-21 19:42:25] [INFO ] Deduced a trap composed of 44 places in 83 ms of which 3 ms to minimize.
[2024-05-21 19:42:25] [INFO ] Deduced a trap composed of 22 places in 91 ms of which 3 ms to minimize.
[2024-05-21 19:42:25] [INFO ] Deduced a trap composed of 29 places in 81 ms of which 2 ms to minimize.
[2024-05-21 19:42:25] [INFO ] Deduced a trap composed of 36 places in 85 ms of which 2 ms to minimize.
[2024-05-21 19:42:25] [INFO ] Deduced a trap composed of 20 places in 92 ms of which 3 ms to minimize.
[2024-05-21 19:42:25] [INFO ] Deduced a trap composed of 14 places in 85 ms of which 2 ms to minimize.
[2024-05-21 19:42:25] [INFO ] Deduced a trap composed of 44 places in 71 ms of which 2 ms to minimize.
[2024-05-21 19:42:26] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 2 ms to minimize.
[2024-05-21 19:42:26] [INFO ] Deduced a trap composed of 23 places in 86 ms of which 2 ms to minimize.
[2024-05-21 19:42:26] [INFO ] Deduced a trap composed of 30 places in 70 ms of which 2 ms to minimize.
[2024-05-21 19:42:26] [INFO ] Deduced a trap composed of 39 places in 90 ms of which 2 ms to minimize.
[2024-05-21 19:42:26] [INFO ] Deduced a trap composed of 38 places in 62 ms of which 2 ms to minimize.
[2024-05-21 19:42:26] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 2 ms to minimize.
[2024-05-21 19:42:26] [INFO ] Deduced a trap composed of 17 places in 88 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 18/25 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-05-21 19:42:27] [INFO ] Deduced a trap composed of 29 places in 88 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-05-21 19:42:28] [INFO ] Deduced a trap composed of 32 places in 55 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 6 (OVERLAPS) 146/270 variables, 124/151 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-05-21 19:42:30] [INFO ] Deduced a trap composed of 5 places in 59 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/270 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/270 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 9 (OVERLAPS) 0/270 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 145 unsolved
No progress, stopping.
After SMT solving in domain Real declared 270/270 variables, and 152 constraints, problems are : Problem set: 0 solved, 145 unsolved in 10668 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 145/145 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 145 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 21/28 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 4 (OVERLAPS) 146/270 variables, 124/152 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 145/297 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-05-21 19:42:36] [INFO ] Deduced a trap composed of 31 places in 72 ms of which 2 ms to minimize.
[2024-05-21 19:42:36] [INFO ] Deduced a trap composed of 34 places in 56 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 2/299 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-05-21 19:42:38] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/270 variables, 1/300 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/270 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 9 (OVERLAPS) 0/270 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 145 unsolved
No progress, stopping.
After SMT solving in domain Int declared 270/270 variables, and 300 constraints, problems are : Problem set: 0 solved, 145 unsolved in 11637 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 145/145 constraints, Known Traps: 24/24 constraints]
After SMT, in 22343ms problems are : Problem set: 0 solved, 145 unsolved
Search for dead transitions found 0 dead transitions in 22347ms
Starting structural reductions in LTL mode, iteration 1 : 124/148 places, 146/170 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22634 ms. Remains : 124/148 places, 146/170 transitions.
[2024-05-21 19:42:45] [INFO ] Flatten gal took : 9 ms
[2024-05-21 19:42:45] [INFO ] Flatten gal took : 9 ms
[2024-05-21 19:42:45] [INFO ] Input system was already deterministic with 146 transitions.
[2024-05-21 19:42:45] [INFO ] Flatten gal took : 8 ms
[2024-05-21 19:42:45] [INFO ] Flatten gal took : 8 ms
[2024-05-21 19:42:45] [INFO ] Time to serialize gal into /tmp/CTLFireability14896338933757758906.gal : 2 ms
[2024-05-21 19:42:45] [INFO ] Time to serialize properties into /tmp/CTLFireability13890055213478766663.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/CTLFireability14896338933757758906.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13890055213478766663.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.72657e+06,0.232991,9604,2,2580,5,24320,6,0,644,28437,0


Converting to forward existential form...Done !
original formula: EG(EX((p127==0)))
=> equivalent forward existential formula: [FwdG(Init,EX((p127==0)))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t10, t16, t17, t24, t32, t35, t36, t37, t61, t62, t65, t66, t68, t81, t86, t87, t90, t91, t93...305
(forward)formula 0,1,6.89987,184016,1,0,821,821639,314,469,3969,1.13912e+06,758
FORMULA AutonomousCar-PT-02b-CTLFireability-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 148/148 places, 170/170 transitions.
Graph (trivial) has 131 edges and 148 vertex of which 4 / 148 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 65 rules applied. Total rules applied 66 place count 145 transition count 102
Reduce places removed 65 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 79 rules applied. Total rules applied 145 place count 80 transition count 88
Reduce places removed 7 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 9 rules applied. Total rules applied 154 place count 73 transition count 86
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 156 place count 71 transition count 86
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 156 place count 71 transition count 81
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 166 place count 66 transition count 81
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 175 place count 57 transition count 72
Iterating global reduction 4 with 9 rules applied. Total rules applied 184 place count 57 transition count 72
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 184 place count 57 transition count 71
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 186 place count 56 transition count 71
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 187 place count 55 transition count 69
Iterating global reduction 4 with 1 rules applied. Total rules applied 188 place count 55 transition count 69
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 216 place count 41 transition count 55
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 219 place count 38 transition count 49
Iterating global reduction 4 with 3 rules applied. Total rules applied 222 place count 38 transition count 49
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 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 4 with 2 rules applied. Total rules applied 224 place count 38 transition count 47
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 225 place count 37 transition count 47
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 227 place count 37 transition count 45
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 6 with 1 rules applied. Total rules applied 228 place count 37 transition count 44
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 229 place count 36 transition count 44
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 230 place count 36 transition count 44
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 232 place count 34 transition count 42
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 233 place count 33 transition count 42
Applied a total of 233 rules in 35 ms. Remains 33 /148 variables (removed 115) and now considering 42/170 (removed 128) transitions.
// Phase 1: matrix 42 rows 33 cols
[2024-05-21 19:42:52] [INFO ] Computed 5 invariants in 0 ms
[2024-05-21 19:42:52] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-21 19:42:52] [INFO ] Invariant cache hit.
[2024-05-21 19:42:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 19:42:52] [INFO ] Implicit Places using invariants and state equation in 57 ms returned [25, 31]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 105 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 31/148 places, 42/170 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 31 transition count 41
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 30 transition count 41
Applied a total of 2 rules in 3 ms. Remains 30 /31 variables (removed 1) and now considering 41/42 (removed 1) transitions.
// Phase 1: matrix 41 rows 30 cols
[2024-05-21 19:42:52] [INFO ] Computed 3 invariants in 1 ms
[2024-05-21 19:42:52] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-21 19:42:52] [INFO ] Invariant cache hit.
[2024-05-21 19:42:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 19:42:52] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 30/148 places, 41/170 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 237 ms. Remains : 30/148 places, 41/170 transitions.
[2024-05-21 19:42:52] [INFO ] Flatten gal took : 2 ms
[2024-05-21 19:42:52] [INFO ] Flatten gal took : 2 ms
[2024-05-21 19:42:52] [INFO ] Input system was already deterministic with 41 transitions.
[2024-05-21 19:42:52] [INFO ] Flatten gal took : 2 ms
[2024-05-21 19:42:52] [INFO ] Flatten gal took : 2 ms
[2024-05-21 19:42:52] [INFO ] Time to serialize gal into /tmp/CTLFireability4891224060228908192.gal : 1 ms
[2024-05-21 19:42:52] [INFO ] Time to serialize properties into /tmp/CTLFireability5708159219454062649.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/CTLFireability4891224060228908192.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5708159219454062649.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,2234,0.01359,3644,2,197,5,1267,6,0,159,1220,0


Converting to forward existential form...Done !
original formula: EF(((E(A((p63==1) U (p154==1)) U (p88==1)) + EG(((p102==1)&&(p45==1)))) + EF((p64==1))))
=> equivalent forward existential formula: (([(FwdU(FwdU(Init,TRUE),!((E(!((p154==1)) U (!((p63==1)) * !((p154==1)))) + EG(!((p154==1)))))) * (p88==1))] !=...273
Reverse transition relation is NOT exact ! Due to transitions t2, t4, t5, t7, t13, t15, t19, t21, t24, t26, t29, t39, Intersection with reachable at each ...216
(forward)formula 0,1,0.206657,10296,1,0,344,40477,113,148,1125,44651,383
FORMULA AutonomousCar-PT-02b-CTLFireability-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 148/148 places, 170/170 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 131 transition count 153
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 131 transition count 153
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 36 place count 129 transition count 151
Iterating global reduction 0 with 2 rules applied. Total rules applied 38 place count 129 transition count 151
Applied a total of 38 rules in 2 ms. Remains 129 /148 variables (removed 19) and now considering 151/170 (removed 19) transitions.
// Phase 1: matrix 151 rows 129 cols
[2024-05-21 19:42:52] [INFO ] Computed 7 invariants in 1 ms
[2024-05-21 19:42:52] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-05-21 19:42:52] [INFO ] Invariant cache hit.
[2024-05-21 19:42:53] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 251 ms to find 0 implicit places.
Running 150 sub problems to find dead transitions.
[2024-05-21 19:42:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (OVERLAPS) 1/129 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-05-21 19:42:54] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 3 ms to minimize.
[2024-05-21 19:42:54] [INFO ] Deduced a trap composed of 19 places in 105 ms of which 3 ms to minimize.
[2024-05-21 19:42:54] [INFO ] Deduced a trap composed of 14 places in 103 ms of which 3 ms to minimize.
[2024-05-21 19:42:55] [INFO ] Deduced a trap composed of 21 places in 105 ms of which 2 ms to minimize.
[2024-05-21 19:42:55] [INFO ] Deduced a trap composed of 31 places in 77 ms of which 3 ms to minimize.
[2024-05-21 19:42:55] [INFO ] Deduced a trap composed of 30 places in 94 ms of which 2 ms to minimize.
[2024-05-21 19:42:55] [INFO ] Deduced a trap composed of 26 places in 90 ms of which 3 ms to minimize.
[2024-05-21 19:42:55] [INFO ] Deduced a trap composed of 33 places in 80 ms of which 2 ms to minimize.
[2024-05-21 19:42:55] [INFO ] Deduced a trap composed of 21 places in 86 ms of which 3 ms to minimize.
[2024-05-21 19:42:55] [INFO ] Deduced a trap composed of 31 places in 89 ms of which 3 ms to minimize.
[2024-05-21 19:42:55] [INFO ] Deduced a trap composed of 23 places in 86 ms of which 2 ms to minimize.
[2024-05-21 19:42:56] [INFO ] Deduced a trap composed of 33 places in 85 ms of which 2 ms to minimize.
[2024-05-21 19:42:56] [INFO ] Deduced a trap composed of 30 places in 95 ms of which 4 ms to minimize.
[2024-05-21 19:42:56] [INFO ] Deduced a trap composed of 32 places in 71 ms of which 2 ms to minimize.
[2024-05-21 19:42:56] [INFO ] Deduced a trap composed of 38 places in 58 ms of which 2 ms to minimize.
[2024-05-21 19:42:56] [INFO ] Deduced a trap composed of 41 places in 82 ms of which 2 ms to minimize.
[2024-05-21 19:42:56] [INFO ] Deduced a trap composed of 31 places in 78 ms of which 2 ms to minimize.
[2024-05-21 19:42:56] [INFO ] Deduced a trap composed of 51 places in 99 ms of which 2 ms to minimize.
[2024-05-21 19:42:56] [INFO ] Deduced a trap composed of 32 places in 61 ms of which 1 ms to minimize.
[2024-05-21 19:42:56] [INFO ] Deduced a trap composed of 38 places in 78 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-05-21 19:42:57] [INFO ] Deduced a trap composed of 43 places in 45 ms of which 1 ms to minimize.
[2024-05-21 19:42:57] [INFO ] Deduced a trap composed of 33 places in 86 ms of which 3 ms to minimize.
[2024-05-21 19:42:57] [INFO ] Deduced a trap composed of 5 places in 71 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 3/30 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-05-21 19:42:59] [INFO ] Deduced a trap composed of 20 places in 97 ms of which 2 ms to minimize.
[2024-05-21 19:42:59] [INFO ] Deduced a trap composed of 14 places in 92 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (OVERLAPS) 151/280 variables, 129/161 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-05-21 19:43:02] [INFO ] Deduced a trap composed of 31 places in 66 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/280 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/280 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 9 (OVERLAPS) 0/280 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Real declared 280/280 variables, and 162 constraints, problems are : Problem set: 0 solved, 150 unsolved in 13706 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 129/129 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 26/26 constraints]
Escalating to Integer solving :Problem set: 0 solved, 150 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (OVERLAPS) 1/129 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 26/33 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-05-21 19:43:08] [INFO ] Deduced a trap composed of 27 places in 84 ms of which 2 ms to minimize.
[2024-05-21 19:43:08] [INFO ] Deduced a trap composed of 21 places in 76 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (OVERLAPS) 151/280 variables, 129/164 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/280 variables, 150/314 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/280 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 8 (OVERLAPS) 0/280 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Int declared 280/280 variables, and 314 constraints, problems are : Problem set: 0 solved, 150 unsolved in 9042 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 129/129 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 28/28 constraints]
After SMT, in 22777ms problems are : Problem set: 0 solved, 150 unsolved
Search for dead transitions found 0 dead transitions in 22779ms
Starting structural reductions in LTL mode, iteration 1 : 129/148 places, 151/170 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23034 ms. Remains : 129/148 places, 151/170 transitions.
[2024-05-21 19:43:15] [INFO ] Flatten gal took : 6 ms
[2024-05-21 19:43:15] [INFO ] Flatten gal took : 5 ms
[2024-05-21 19:43:15] [INFO ] Input system was already deterministic with 151 transitions.
[2024-05-21 19:43:15] [INFO ] Flatten gal took : 4 ms
[2024-05-21 19:43:15] [INFO ] Flatten gal took : 5 ms
[2024-05-21 19:43:15] [INFO ] Time to serialize gal into /tmp/CTLFireability16332776340710088461.gal : 4 ms
[2024-05-21 19:43:15] [INFO ] Time to serialize properties into /tmp/CTLFireability5642436936360014041.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/CTLFireability16332776340710088461.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5642436936360014041.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.9564e+06,0.22437,9632,2,2545,5,24314,6,0,669,27898,0


Converting to forward existential form...Done !
original formula: E(!((((p54==1) + ((AG((p132==1)) * EX((p136==1))) * ((p147!=1)&&(p121!=1)))) + (!(((E((p15==1) U (p111==1)) * (p52==1)) * ((p83==1)&&(p11...247
=> equivalent forward existential formula: [((FwdU(Init,!((((p54==1) + ((!(E(TRUE U !((p132==1)))) * EX((p136==1))) * ((p147!=1)&&(p121!=1)))) + (!(((E((p1...483
Reverse transition relation is NOT exact ! Due to transitions t10, t17, t18, t27, t35, t38, t39, t40, t64, t65, t68, t69, t71, t84, t90, t91, t94, t95, t97...311
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Using saturation style SCC detection
(forward)formula 0,1,27.3624,676712,1,0,1875,4.60356e+06,362,983,4454,4.0733e+06,2029
FORMULA AutonomousCar-PT-02b-CTLFireability-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 148/148 places, 170/170 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 133 transition count 155
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 133 transition count 155
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 33 place count 130 transition count 152
Iterating global reduction 0 with 3 rules applied. Total rules applied 36 place count 130 transition count 152
Applied a total of 36 rules in 3 ms. Remains 130 /148 variables (removed 18) and now considering 152/170 (removed 18) transitions.
// Phase 1: matrix 152 rows 130 cols
[2024-05-21 19:43:43] [INFO ] Computed 7 invariants in 6 ms
[2024-05-21 19:43:43] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-21 19:43:43] [INFO ] Invariant cache hit.
[2024-05-21 19:43:43] [INFO ] Implicit Places using invariants and state equation in 156 ms returned []
Implicit Place search using SMT with State Equation took 230 ms to find 0 implicit places.
Running 151 sub problems to find dead transitions.
[2024-05-21 19:43:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 1 (OVERLAPS) 1/130 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 151 unsolved
[2024-05-21 19:43:45] [INFO ] Deduced a trap composed of 17 places in 97 ms of which 3 ms to minimize.
[2024-05-21 19:43:45] [INFO ] Deduced a trap composed of 16 places in 97 ms of which 3 ms to minimize.
[2024-05-21 19:43:45] [INFO ] Deduced a trap composed of 24 places in 98 ms of which 2 ms to minimize.
[2024-05-21 19:43:45] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 2 ms to minimize.
[2024-05-21 19:43:46] [INFO ] Deduced a trap composed of 20 places in 106 ms of which 2 ms to minimize.
[2024-05-21 19:43:46] [INFO ] Deduced a trap composed of 40 places in 99 ms of which 2 ms to minimize.
[2024-05-21 19:43:46] [INFO ] Deduced a trap composed of 28 places in 94 ms of which 2 ms to minimize.
[2024-05-21 19:43:46] [INFO ] Deduced a trap composed of 31 places in 96 ms of which 2 ms to minimize.
[2024-05-21 19:43:46] [INFO ] Deduced a trap composed of 23 places in 86 ms of which 3 ms to minimize.
[2024-05-21 19:43:46] [INFO ] Deduced a trap composed of 33 places in 83 ms of which 2 ms to minimize.
[2024-05-21 19:43:46] [INFO ] Deduced a trap composed of 33 places in 98 ms of which 3 ms to minimize.
[2024-05-21 19:43:46] [INFO ] Deduced a trap composed of 50 places in 95 ms of which 3 ms to minimize.
[2024-05-21 19:43:47] [INFO ] Deduced a trap composed of 32 places in 84 ms of which 2 ms to minimize.
[2024-05-21 19:43:47] [INFO ] Deduced a trap composed of 40 places in 60 ms of which 2 ms to minimize.
[2024-05-21 19:43:47] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 1 ms to minimize.
[2024-05-21 19:43:47] [INFO ] Deduced a trap composed of 5 places in 100 ms of which 2 ms to minimize.
[2024-05-21 19:43:47] [INFO ] Deduced a trap composed of 22 places in 72 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 17/24 constraints. Problems are: Problem set: 0 solved, 151 unsolved
[2024-05-21 19:43:48] [INFO ] Deduced a trap composed of 35 places in 72 ms of which 2 ms to minimize.
[2024-05-21 19:43:48] [INFO ] Deduced a trap composed of 14 places in 85 ms of which 3 ms to minimize.
[2024-05-21 19:43:48] [INFO ] Deduced a trap composed of 21 places in 91 ms of which 2 ms to minimize.
[2024-05-21 19:43:48] [INFO ] Deduced a trap composed of 33 places in 93 ms of which 3 ms to minimize.
[2024-05-21 19:43:48] [INFO ] Deduced a trap composed of 42 places in 55 ms of which 1 ms to minimize.
[2024-05-21 19:43:48] [INFO ] Deduced a trap composed of 20 places in 78 ms of which 2 ms to minimize.
[2024-05-21 19:43:49] [INFO ] Deduced a trap composed of 14 places in 83 ms of which 2 ms to minimize.
[2024-05-21 19:43:49] [INFO ] Deduced a trap composed of 17 places in 133 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 8/32 constraints. Problems are: Problem set: 0 solved, 151 unsolved
[2024-05-21 19:43:50] [INFO ] Deduced a trap composed of 30 places in 84 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 151 unsolved
[2024-05-21 19:43:51] [INFO ] Deduced a trap composed of 31 places in 94 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 7 (OVERLAPS) 152/282 variables, 130/164 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/282 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 9 (OVERLAPS) 0/282 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 151 unsolved
No progress, stopping.
After SMT solving in domain Real declared 282/282 variables, and 164 constraints, problems are : Problem set: 0 solved, 151 unsolved in 14003 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 130/130 constraints, PredecessorRefiner: 151/151 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 0 solved, 151 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 1 (OVERLAPS) 1/130 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 27/34 constraints. Problems are: Problem set: 0 solved, 151 unsolved
[2024-05-21 19:43:59] [INFO ] Deduced a trap composed of 38 places in 54 ms of which 1 ms to minimize.
[2024-05-21 19:43:59] [INFO ] Deduced a trap composed of 31 places in 47 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 151 unsolved
[2024-05-21 19:44:00] [INFO ] Deduced a trap composed of 35 places in 56 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 151 unsolved
[2024-05-21 19:44:00] [INFO ] Deduced a trap composed of 26 places in 80 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 7 (OVERLAPS) 152/282 variables, 130/168 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/282 variables, 151/319 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/282 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 10 (OVERLAPS) 0/282 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 151 unsolved
No progress, stopping.
After SMT solving in domain Int declared 282/282 variables, and 319 constraints, problems are : Problem set: 0 solved, 151 unsolved in 10180 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 130/130 constraints, PredecessorRefiner: 151/151 constraints, Known Traps: 31/31 constraints]
After SMT, in 24208ms problems are : Problem set: 0 solved, 151 unsolved
Search for dead transitions found 0 dead transitions in 24210ms
Starting structural reductions in LTL mode, iteration 1 : 130/148 places, 152/170 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24443 ms. Remains : 130/148 places, 152/170 transitions.
[2024-05-21 19:44:07] [INFO ] Flatten gal took : 7 ms
[2024-05-21 19:44:07] [INFO ] Flatten gal took : 6 ms
[2024-05-21 19:44:07] [INFO ] Input system was already deterministic with 152 transitions.
[2024-05-21 19:44:07] [INFO ] Flatten gal took : 7 ms
[2024-05-21 19:44:07] [INFO ] Flatten gal took : 6 ms
[2024-05-21 19:44:07] [INFO ] Time to serialize gal into /tmp/CTLFireability8648534526481207092.gal : 2 ms
[2024-05-21 19:44:07] [INFO ] Time to serialize properties into /tmp/CTLFireability15913511823674755867.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/CTLFireability8648534526481207092.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15913511823674755867.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,2.01526e+06,0.394127,10692,2,2696,5,27389,6,0,674,32951,0


Converting to forward existential form...Done !
original formula: EX((EX(E((A((p153==1) U (p137==1)) * ((p122==1)||(p51==1))) U EF((p7==1)))) * (E(!(A((p38==1) U (p20==1))) U EX(EG((((p6==1)&&(p14==1))&&...462
=> equivalent forward existential formula: ([FwdG(EY(FwdU((EY(Init) * EX(E((!((E(!((p137==1)) U (!((p153==1)) * !((p137==1)))) + EG(!((p137==1))))) * ((p12...1985
Reverse transition relation is NOT exact ! Due to transitions t10, t16, t17, t25, t34, t37, t38, t39, t63, t64, t67, t68, t70, t83, t88, t89, t92, t94, t95...304
Detected timeout of ITS tools.
[2024-05-21 19:44:38] [INFO ] Flatten gal took : 5 ms
[2024-05-21 19:44:38] [INFO ] Applying decomposition
[2024-05-21 19:44:38] [INFO ] Flatten gal took : 5 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/graph4820423046575691321.txt' '-o' '/tmp/graph4820423046575691321.bin' '-w' '/tmp/graph4820423046575691321.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4820423046575691321.bin' '-l' '-1' '-v' '-w' '/tmp/graph4820423046575691321.weights' '-q' '0' '-e' '0.001'
[2024-05-21 19:44:38] [INFO ] Decomposing Gal with order
[2024-05-21 19:44:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 19:44:38] [INFO ] Removed a total of 50 redundant transitions.
[2024-05-21 19:44:38] [INFO ] Flatten gal took : 85 ms
[2024-05-21 19:44:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 14 ms.
[2024-05-21 19:44:38] [INFO ] Time to serialize gal into /tmp/CTLFireability13399156259911427540.gal : 8 ms
[2024-05-21 19:44:38] [INFO ] Time to serialize properties into /tmp/CTLFireability4824943842605413638.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/CTLFireability13399156259911427540.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4824943842605413638.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.01526e+06,0.047169,4632,303,74,1782,332,356,2303,59,693,0


Converting to forward existential form...Done !
original formula: EX((EX(E((A((i10.i1.u50.p153==1) U (i11.i1.u46.p137==1)) * ((i9.i0.u39.p122==1)||(i5.i1.u18.p51==1))) U EF((i0.u2.p7==1)))) * (E(!(A((i5....704
=> equivalent forward existential formula: ([FwdG(EY(FwdU((EY(Init) * EX(E((!((E(!((i11.i1.u46.p137==1)) U (!((i10.i1.u50.p153==1)) * !((i11.i1.u46.p137==1...2875
Reverse transition relation is NOT exact ! Due to transitions t122, t149, u36.t34, u36.t37, u36.t38, u36.t39, i0.t120, i0.t117, i0.u1.t121, i4.u15.t94, i4....470
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
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
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 a local SCC at level 1
Fast SCC detection found a local SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
(forward)formula 0,0,2.30543,78544,1,0,161397,1112,2368,219543,318,4974,205771
FORMULA AutonomousCar-PT-02b-CTLFireability-2023-12 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 : 148/148 places, 170/170 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 133 transition count 155
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 133 transition count 155
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 33 place count 130 transition count 152
Iterating global reduction 0 with 3 rules applied. Total rules applied 36 place count 130 transition count 152
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 129 transition count 151
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 129 transition count 151
Applied a total of 38 rules in 9 ms. Remains 129 /148 variables (removed 19) and now considering 151/170 (removed 19) transitions.
// Phase 1: matrix 151 rows 129 cols
[2024-05-21 19:44:40] [INFO ] Computed 7 invariants in 1 ms
[2024-05-21 19:44:40] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-21 19:44:40] [INFO ] Invariant cache hit.
[2024-05-21 19:44:40] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 220 ms to find 0 implicit places.
Running 150 sub problems to find dead transitions.
[2024-05-21 19:44:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (OVERLAPS) 1/129 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-05-21 19:44:42] [INFO ] Deduced a trap composed of 21 places in 106 ms of which 4 ms to minimize.
[2024-05-21 19:44:42] [INFO ] Deduced a trap composed of 32 places in 106 ms of which 3 ms to minimize.
[2024-05-21 19:44:42] [INFO ] Deduced a trap composed of 18 places in 96 ms of which 2 ms to minimize.
[2024-05-21 19:44:42] [INFO ] Deduced a trap composed of 14 places in 127 ms of which 2 ms to minimize.
[2024-05-21 19:44:43] [INFO ] Deduced a trap composed of 20 places in 103 ms of which 3 ms to minimize.
[2024-05-21 19:44:43] [INFO ] Deduced a trap composed of 37 places in 108 ms of which 3 ms to minimize.
[2024-05-21 19:44:43] [INFO ] Deduced a trap composed of 45 places in 98 ms of which 2 ms to minimize.
[2024-05-21 19:44:43] [INFO ] Deduced a trap composed of 32 places in 88 ms of which 2 ms to minimize.
[2024-05-21 19:44:43] [INFO ] Deduced a trap composed of 21 places in 113 ms of which 2 ms to minimize.
[2024-05-21 19:44:43] [INFO ] Deduced a trap composed of 41 places in 97 ms of which 2 ms to minimize.
[2024-05-21 19:44:43] [INFO ] Deduced a trap composed of 32 places in 103 ms of which 2 ms to minimize.
[2024-05-21 19:44:43] [INFO ] Deduced a trap composed of 33 places in 81 ms of which 2 ms to minimize.
[2024-05-21 19:44:44] [INFO ] Deduced a trap composed of 32 places in 68 ms of which 2 ms to minimize.
[2024-05-21 19:44:44] [INFO ] Deduced a trap composed of 22 places in 90 ms of which 2 ms to minimize.
[2024-05-21 19:44:44] [INFO ] Deduced a trap composed of 20 places in 90 ms of which 2 ms to minimize.
[2024-05-21 19:44:44] [INFO ] Deduced a trap composed of 32 places in 96 ms of which 3 ms to minimize.
[2024-05-21 19:44:44] [INFO ] Deduced a trap composed of 39 places in 91 ms of which 2 ms to minimize.
[2024-05-21 19:44:44] [INFO ] Deduced a trap composed of 32 places in 76 ms of which 2 ms to minimize.
[2024-05-21 19:44:44] [INFO ] Deduced a trap composed of 39 places in 76 ms of which 2 ms to minimize.
[2024-05-21 19:44:45] [INFO ] Deduced a trap composed of 5 places in 72 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-05-21 19:44:45] [INFO ] Deduced a trap composed of 40 places in 53 ms of which 2 ms to minimize.
[2024-05-21 19:44:45] [INFO ] Deduced a trap composed of 30 places in 112 ms of which 3 ms to minimize.
[2024-05-21 19:44:45] [INFO ] Deduced a trap composed of 30 places in 138 ms of which 4 ms to minimize.
[2024-05-21 19:44:45] [INFO ] Deduced a trap composed of 32 places in 91 ms of which 2 ms to minimize.
[2024-05-21 19:44:45] [INFO ] Deduced a trap composed of 24 places in 84 ms of which 2 ms to minimize.
[2024-05-21 19:44:46] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 6/33 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-05-21 19:44:47] [INFO ] Deduced a trap composed of 36 places in 70 ms of which 1 ms to minimize.
[2024-05-21 19:44:48] [INFO ] Deduced a trap composed of 17 places in 89 ms of which 2 ms to minimize.
[2024-05-21 19:44:48] [INFO ] Deduced a trap composed of 17 places in 87 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (OVERLAPS) 151/280 variables, 129/165 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/280 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-05-21 19:44:52] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 2 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/280 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/280 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 10 (OVERLAPS) 0/280 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Real declared 280/280 variables, and 166 constraints, problems are : Problem set: 0 solved, 150 unsolved in 15618 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 129/129 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 30/30 constraints]
Escalating to Integer solving :Problem set: 0 solved, 150 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (OVERLAPS) 1/129 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 30/37 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (OVERLAPS) 151/280 variables, 129/166 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 150/316 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/280 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-05-21 19:45:01] [INFO ] Deduced a trap composed of 30 places in 82 ms of which 2 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/280 variables, 1/317 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/280 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 9 (OVERLAPS) 0/280 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Int declared 280/280 variables, and 317 constraints, problems are : Problem set: 0 solved, 150 unsolved in 11976 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 129/129 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 31/31 constraints]
After SMT, in 27630ms problems are : Problem set: 0 solved, 150 unsolved
Search for dead transitions found 0 dead transitions in 27634ms
Starting structural reductions in LTL mode, iteration 1 : 129/148 places, 151/170 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27865 ms. Remains : 129/148 places, 151/170 transitions.
[2024-05-21 19:45:08] [INFO ] Flatten gal took : 9 ms
[2024-05-21 19:45:08] [INFO ] Flatten gal took : 8 ms
[2024-05-21 19:45:08] [INFO ] Input system was already deterministic with 151 transitions.
[2024-05-21 19:45:08] [INFO ] Flatten gal took : 7 ms
[2024-05-21 19:45:08] [INFO ] Flatten gal took : 6 ms
[2024-05-21 19:45:08] [INFO ] Time to serialize gal into /tmp/CTLFireability7094771092087830406.gal : 3 ms
[2024-05-21 19:45:08] [INFO ] Time to serialize properties into /tmp/CTLFireability4371520946956123761.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/CTLFireability7094771092087830406.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4371520946956123761.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.90278e+06,0.274474,8864,2,2447,5,20566,6,0,669,23455,0


Converting to forward existential form...Done !
original formula: A(EG(!((EG((p146==1)) * EX(AF((p85==1)))))) U ((AX(FALSE) * !((EF((p71!=1)) * ((EF((p126==1)) + (EG((p45==1)) * AX((p144==1)))) + ((((p6=...302
=> equivalent forward existential formula: [((Init * !(EG(!(((!(EX(!(FALSE))) * !((E(TRUE U (p71!=1)) * ((E(TRUE U (p126==1)) + (EG((p45==1)) * !(EX(!((p14...1102
Reverse transition relation is NOT exact ! Due to transitions t10, t17, t18, t25, t33, t36, t38, t39, t53, t64, t65, t68, t69, t71, t74, t84, t85, t90, t91...314
Detected timeout of ITS tools.
[2024-05-21 19:45:38] [INFO ] Flatten gal took : 8 ms
[2024-05-21 19:45:38] [INFO ] Applying decomposition
[2024-05-21 19:45:38] [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/graph12432186032770261336.txt' '-o' '/tmp/graph12432186032770261336.bin' '-w' '/tmp/graph12432186032770261336.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12432186032770261336.bin' '-l' '-1' '-v' '-w' '/tmp/graph12432186032770261336.weights' '-q' '0' '-e' '0.001'
[2024-05-21 19:45:38] [INFO ] Decomposing Gal with order
[2024-05-21 19:45:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 19:45:38] [INFO ] Removed a total of 48 redundant transitions.
[2024-05-21 19:45:38] [INFO ] Flatten gal took : 26 ms
[2024-05-21 19:45:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 6 ms.
[2024-05-21 19:45:38] [INFO ] Time to serialize gal into /tmp/CTLFireability3717891760885019373.gal : 6 ms
[2024-05-21 19:45:38] [INFO ] Time to serialize properties into /tmp/CTLFireability1364635332012835150.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/CTLFireability3717891760885019373.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1364635332012835150.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.90278e+06,0.06264,4664,273,60,1335,314,376,1620,59,480,0


Converting to forward existential form...Done !
original formula: A(EG(!((EG((i9.i0.u47.p146==1)) * EX(AF((i5.i0.u28.p85==1)))))) U ((AX(FALSE) * !((EF((i5.i2.u27.p71!=1)) * ((EF((i8.u40.p126==1)) + (EG(...448
=> equivalent forward existential formula: [((Init * !(EG(!(((!(EX(!(FALSE))) * !((E(TRUE U (i5.i2.u27.p71!=1)) * ((E(TRUE U (i8.u40.p126==1)) + (EG((i3.i0...1560
Reverse transition relation is NOT exact ! Due to transitions t122, t130, i0.t120, i0.t118, i3.i0.u14.t94, i3.i0.u14.t97, i3.i0.u15.t95, i3.i1.t111, i3.i1....492
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
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
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 2
Fast SCC detection found a local SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
(forward)formula 0,0,1.43684,45052,1,0,95129,943,2361,126039,309,3193,134943
FORMULA AutonomousCar-PT-02b-CTLFireability-2023-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 148/148 places, 170/170 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 129 transition count 151
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 129 transition count 151
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 42 place count 125 transition count 147
Iterating global reduction 0 with 4 rules applied. Total rules applied 46 place count 125 transition count 147
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 124 transition count 146
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 124 transition count 146
Applied a total of 48 rules in 4 ms. Remains 124 /148 variables (removed 24) and now considering 146/170 (removed 24) transitions.
// Phase 1: matrix 146 rows 124 cols
[2024-05-21 19:45:40] [INFO ] Computed 7 invariants in 2 ms
[2024-05-21 19:45:40] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-21 19:45:40] [INFO ] Invariant cache hit.
[2024-05-21 19:45:40] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 220 ms to find 0 implicit places.
Running 145 sub problems to find dead transitions.
[2024-05-21 19:45:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-05-21 19:45:42] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 2 ms to minimize.
[2024-05-21 19:45:42] [INFO ] Deduced a trap composed of 19 places in 81 ms of which 2 ms to minimize.
[2024-05-21 19:45:42] [INFO ] Deduced a trap composed of 16 places in 98 ms of which 3 ms to minimize.
[2024-05-21 19:45:42] [INFO ] Deduced a trap composed of 27 places in 102 ms of which 2 ms to minimize.
[2024-05-21 19:45:42] [INFO ] Deduced a trap composed of 44 places in 105 ms of which 3 ms to minimize.
[2024-05-21 19:45:42] [INFO ] Deduced a trap composed of 22 places in 95 ms of which 2 ms to minimize.
[2024-05-21 19:45:42] [INFO ] Deduced a trap composed of 29 places in 97 ms of which 2 ms to minimize.
[2024-05-21 19:45:42] [INFO ] Deduced a trap composed of 36 places in 92 ms of which 2 ms to minimize.
[2024-05-21 19:45:43] [INFO ] Deduced a trap composed of 20 places in 96 ms of which 3 ms to minimize.
[2024-05-21 19:45:43] [INFO ] Deduced a trap composed of 14 places in 91 ms of which 2 ms to minimize.
[2024-05-21 19:45:43] [INFO ] Deduced a trap composed of 44 places in 106 ms of which 2 ms to minimize.
[2024-05-21 19:45:43] [INFO ] Deduced a trap composed of 32 places in 74 ms of which 2 ms to minimize.
[2024-05-21 19:45:43] [INFO ] Deduced a trap composed of 23 places in 103 ms of which 2 ms to minimize.
[2024-05-21 19:45:43] [INFO ] Deduced a trap composed of 30 places in 93 ms of which 2 ms to minimize.
[2024-05-21 19:45:43] [INFO ] Deduced a trap composed of 39 places in 94 ms of which 3 ms to minimize.
[2024-05-21 19:45:44] [INFO ] Deduced a trap composed of 38 places in 54 ms of which 1 ms to minimize.
[2024-05-21 19:45:44] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 2 ms to minimize.
[2024-05-21 19:45:44] [INFO ] Deduced a trap composed of 17 places in 97 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 18/25 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-05-21 19:45:45] [INFO ] Deduced a trap composed of 29 places in 76 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-05-21 19:45:46] [INFO ] Deduced a trap composed of 32 places in 68 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 6 (OVERLAPS) 146/270 variables, 124/151 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-05-21 19:45:49] [INFO ] Deduced a trap composed of 5 places in 71 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/270 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/270 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 9 (OVERLAPS) 0/270 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 145 unsolved
No progress, stopping.
After SMT solving in domain Real declared 270/270 variables, and 152 constraints, problems are : Problem set: 0 solved, 145 unsolved in 13057 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 145/145 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 145 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 21/28 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 4 (OVERLAPS) 146/270 variables, 124/152 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 145/297 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-05-21 19:45:56] [INFO ] Deduced a trap composed of 31 places in 77 ms of which 3 ms to minimize.
[2024-05-21 19:45:57] [INFO ] Deduced a trap composed of 34 places in 55 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 2/299 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-05-21 19:45:59] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/270 variables, 1/300 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/270 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 9 (OVERLAPS) 0/270 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 145 unsolved
No progress, stopping.
After SMT solving in domain Int declared 270/270 variables, and 300 constraints, problems are : Problem set: 0 solved, 145 unsolved in 12274 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 145/145 constraints, Known Traps: 24/24 constraints]
After SMT, in 25359ms problems are : Problem set: 0 solved, 145 unsolved
Search for dead transitions found 0 dead transitions in 25361ms
Starting structural reductions in LTL mode, iteration 1 : 124/148 places, 146/170 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25586 ms. Remains : 124/148 places, 146/170 transitions.
[2024-05-21 19:46:05] [INFO ] Flatten gal took : 6 ms
[2024-05-21 19:46:05] [INFO ] Flatten gal took : 4 ms
[2024-05-21 19:46:05] [INFO ] Input system was already deterministic with 146 transitions.
[2024-05-21 19:46:05] [INFO ] Flatten gal took : 4 ms
[2024-05-21 19:46:05] [INFO ] Flatten gal took : 5 ms
[2024-05-21 19:46:05] [INFO ] Time to serialize gal into /tmp/CTLFireability10603746784913499607.gal : 2 ms
[2024-05-21 19:46:05] [INFO ] Time to serialize properties into /tmp/CTLFireability8967749347785909332.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/CTLFireability10603746784913499607.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8967749347785909332.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.72657e+06,0.202558,9632,2,2580,5,24320,6,0,644,28437,0


Converting to forward existential form...Done !
original formula: EX(AX(((p108==0) * AG((p145==0)))))
=> equivalent forward existential formula: [(EY(Init) * !(EX(!(((p108==0) * !(E(TRUE U !((p145==0)))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t10, t16, t17, t24, t32, t35, t36, t37, t61, t62, t65, t66, t68, t81, t86, t87, t90, t91, t93...305
(forward)formula 0,0,2.82517,74736,1,0,312,426620,315,174,4133,317293,386
FORMULA AutonomousCar-PT-02b-CTLFireability-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 148/148 places, 170/170 transitions.
Graph (trivial) has 122 edges and 148 vertex of which 4 / 148 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 0 with 62 rules applied. Total rules applied 63 place count 145 transition count 105
Reduce places removed 62 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 77 rules applied. Total rules applied 140 place count 83 transition count 90
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 9 rules applied. Total rules applied 149 place count 75 transition count 89
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 150 place count 74 transition count 89
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 10 Pre rules applied. Total rules applied 150 place count 74 transition count 79
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 170 place count 64 transition count 79
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 180 place count 54 transition count 69
Iterating global reduction 4 with 10 rules applied. Total rules applied 190 place count 54 transition count 69
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 191 place count 54 transition count 68
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 192 place count 53 transition count 66
Iterating global reduction 5 with 1 rules applied. Total rules applied 193 place count 53 transition count 66
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 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 5 with 2 rules applied. Total rules applied 195 place count 53 transition count 64
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 196 place count 52 transition count 64
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 7 with 22 rules applied. Total rules applied 218 place count 41 transition count 53
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 220 place count 39 transition count 50
Iterating global reduction 7 with 2 rules applied. Total rules applied 222 place count 39 transition count 50
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 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 7 with 2 rules applied. Total rules applied 224 place count 39 transition count 48
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 225 place count 38 transition count 48
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 226 place count 38 transition count 47
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 227 place count 37 transition count 46
Applied a total of 227 rules in 25 ms. Remains 37 /148 variables (removed 111) and now considering 46/170 (removed 124) transitions.
// Phase 1: matrix 46 rows 37 cols
[2024-05-21 19:46:08] [INFO ] Computed 6 invariants in 1 ms
[2024-05-21 19:46:08] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-21 19:46:08] [INFO ] Invariant cache hit.
[2024-05-21 19:46:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 19:46:08] [INFO ] Implicit Places using invariants and state equation in 66 ms returned [36]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 113 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 36/148 places, 46/170 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 35 transition count 45
Applied a total of 2 rules in 2 ms. Remains 35 /36 variables (removed 1) and now considering 45/46 (removed 1) transitions.
// Phase 1: matrix 45 rows 35 cols
[2024-05-21 19:46:08] [INFO ] Computed 5 invariants in 1 ms
[2024-05-21 19:46:08] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-21 19:46:08] [INFO ] Invariant cache hit.
[2024-05-21 19:46:09] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 19:46:09] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 35/148 places, 45/170 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 234 ms. Remains : 35/148 places, 45/170 transitions.
[2024-05-21 19:46:09] [INFO ] Flatten gal took : 3 ms
[2024-05-21 19:46:09] [INFO ] Flatten gal took : 2 ms
[2024-05-21 19:46:09] [INFO ] Input system was already deterministic with 45 transitions.
[2024-05-21 19:46:09] [INFO ] Flatten gal took : 2 ms
[2024-05-21 19:46:09] [INFO ] Flatten gal took : 3 ms
[2024-05-21 19:46:09] [INFO ] Time to serialize gal into /tmp/CTLFireability9895480519810806173.gal : 2 ms
[2024-05-21 19:46:09] [INFO ] Time to serialize properties into /tmp/CTLFireability17352730420221044114.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/CTLFireability9895480519810806173.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17352730420221044114.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,8270,0.058679,4612,2,591,5,4516,6,0,180,5282,0


Converting to forward existential form...Done !
original formula: EF((((AF(((((((((p52==0)||(p77==0))||(p113==0))&&(p130==0)) + AG((p120==0))) * (p6==1)) * ((p14==1)&&(p45==1))) * (p112==1))) * (p6==1)) ...191
=> equivalent forward existential formula: [((((FwdU(Init,TRUE) * (p112==1)) * ((p9==1)&&(p45==1))) * (p6==1)) * !(EG(!(((((((((p52==0)||(p77==0))||(p113==...261
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t5, t6, t8, t10, t11, t14, t16, t18, t26, t27, t30, t31, t32, t35, t39, t40, t41,...264
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,1.32379,33940,1,0,423,188588,124,227,1370,202735,385
FORMULA AutonomousCar-PT-02b-CTLFireability-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

[2024-05-21 19:46:10] [INFO ] Flatten gal took : 4 ms
[2024-05-21 19:46:10] [INFO ] Flatten gal took : 4 ms
Total runtime 483581 ms.

BK_STOP 1716320770490

--------------------
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="AutonomousCar-PT-02b"
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 AutonomousCar-PT-02b, 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 r026-smll-171620167300242"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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