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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 5.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 47K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K 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 17K Apr 22 14:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.8K Apr 12 18:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 92K Apr 12 18:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Apr 12 18:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K 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 110K 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-04b-CTLFireability-2024-00
FORMULA_NAME AutonomousCar-PT-04b-CTLFireability-2024-01
FORMULA_NAME AutonomousCar-PT-04b-CTLFireability-2024-02
FORMULA_NAME AutonomousCar-PT-04b-CTLFireability-2024-03
FORMULA_NAME AutonomousCar-PT-04b-CTLFireability-2024-04
FORMULA_NAME AutonomousCar-PT-04b-CTLFireability-2024-05
FORMULA_NAME AutonomousCar-PT-04b-CTLFireability-2024-06
FORMULA_NAME AutonomousCar-PT-04b-CTLFireability-2024-07
FORMULA_NAME AutonomousCar-PT-04b-CTLFireability-2024-08
FORMULA_NAME AutonomousCar-PT-04b-CTLFireability-2024-09
FORMULA_NAME AutonomousCar-PT-04b-CTLFireability-2024-10
FORMULA_NAME AutonomousCar-PT-04b-CTLFireability-2024-11
FORMULA_NAME AutonomousCar-PT-04b-CTLFireability-2023-12
FORMULA_NAME AutonomousCar-PT-04b-CTLFireability-2023-13
FORMULA_NAME AutonomousCar-PT-04b-CTLFireability-2023-14
FORMULA_NAME AutonomousCar-PT-04b-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716322661844

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-04b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-21 20:17:44] [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 20:17:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 20:17:44] [INFO ] Load time of PNML (sax parser for PT used): 200 ms
[2024-05-21 20:17:44] [INFO ] Transformed 221 places.
[2024-05-21 20:17:44] [INFO ] Transformed 368 transitions.
[2024-05-21 20:17:44] [INFO ] Found NUPN structural information;
[2024-05-21 20:17:44] [INFO ] Parsed PT model containing 221 places and 368 transitions and 1658 arcs in 430 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 45 ms.
Support contains 106 out of 221 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 221/221 places, 368/368 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 210 transition count 357
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 210 transition count 357
Applied a total of 22 rules in 84 ms. Remains 210 /221 variables (removed 11) and now considering 357/368 (removed 11) transitions.
// Phase 1: matrix 357 rows 210 cols
[2024-05-21 20:17:44] [INFO ] Computed 9 invariants in 44 ms
[2024-05-21 20:17:45] [INFO ] Implicit Places using invariants in 494 ms returned []
[2024-05-21 20:17:45] [INFO ] Invariant cache hit.
[2024-05-21 20:17:45] [INFO ] Implicit Places using invariants and state equation in 438 ms returned []
Implicit Place search using SMT with State Equation took 1006 ms to find 0 implicit places.
Running 356 sub problems to find dead transitions.
[2024-05-21 20:17:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/209 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 1 (OVERLAPS) 1/210 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 356 unsolved
[2024-05-21 20:17:52] [INFO ] Deduced a trap composed of 18 places in 299 ms of which 42 ms to minimize.
[2024-05-21 20:17:53] [INFO ] Deduced a trap composed of 16 places in 267 ms of which 5 ms to minimize.
[2024-05-21 20:17:53] [INFO ] Deduced a trap composed of 37 places in 216 ms of which 4 ms to minimize.
[2024-05-21 20:17:53] [INFO ] Deduced a trap composed of 47 places in 77 ms of which 2 ms to minimize.
[2024-05-21 20:17:54] [INFO ] Deduced a trap composed of 34 places in 82 ms of which 2 ms to minimize.
[2024-05-21 20:17:54] [INFO ] Deduced a trap composed of 51 places in 173 ms of which 3 ms to minimize.
[2024-05-21 20:17:54] [INFO ] Deduced a trap composed of 41 places in 133 ms of which 2 ms to minimize.
[2024-05-21 20:17:54] [INFO ] Deduced a trap composed of 26 places in 130 ms of which 3 ms to minimize.
[2024-05-21 20:17:54] [INFO ] Deduced a trap composed of 34 places in 123 ms of which 2 ms to minimize.
[2024-05-21 20:17:54] [INFO ] Deduced a trap composed of 38 places in 119 ms of which 3 ms to minimize.
[2024-05-21 20:17:54] [INFO ] Deduced a trap composed of 36 places in 119 ms of which 2 ms to minimize.
[2024-05-21 20:17:55] [INFO ] Deduced a trap composed of 39 places in 125 ms of which 2 ms to minimize.
[2024-05-21 20:17:55] [INFO ] Deduced a trap composed of 42 places in 129 ms of which 2 ms to minimize.
[2024-05-21 20:17:55] [INFO ] Deduced a trap composed of 34 places in 223 ms of which 3 ms to minimize.
[2024-05-21 20:17:55] [INFO ] Deduced a trap composed of 34 places in 207 ms of which 3 ms to minimize.
[2024-05-21 20:17:55] [INFO ] Deduced a trap composed of 27 places in 185 ms of which 3 ms to minimize.
[2024-05-21 20:17:56] [INFO ] Deduced a trap composed of 43 places in 87 ms of which 2 ms to minimize.
[2024-05-21 20:17:56] [INFO ] Deduced a trap composed of 43 places in 76 ms of which 2 ms to minimize.
[2024-05-21 20:17:56] [INFO ] Deduced a trap composed of 52 places in 113 ms of which 2 ms to minimize.
[2024-05-21 20:17:56] [INFO ] Deduced a trap composed of 48 places in 107 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/210 variables, 20/29 constraints. Problems are: Problem set: 0 solved, 356 unsolved
[2024-05-21 20:17:56] [INFO ] Deduced a trap composed of 36 places in 191 ms of which 3 ms to minimize.
[2024-05-21 20:17:57] [INFO ] Deduced a trap composed of 23 places in 195 ms of which 3 ms to minimize.
[2024-05-21 20:17:57] [INFO ] Deduced a trap composed of 35 places in 138 ms of which 3 ms to minimize.
[2024-05-21 20:17:57] [INFO ] Deduced a trap composed of 41 places in 98 ms of which 2 ms to minimize.
[2024-05-21 20:17:58] [INFO ] Deduced a trap composed of 43 places in 90 ms of which 2 ms to minimize.
[2024-05-21 20:17:58] [INFO ] Deduced a trap composed of 43 places in 94 ms of which 2 ms to minimize.
[2024-05-21 20:17:58] [INFO ] Deduced a trap composed of 39 places in 66 ms of which 2 ms to minimize.
[2024-05-21 20:17:58] [INFO ] Deduced a trap composed of 41 places in 59 ms of which 2 ms to minimize.
[2024-05-21 20:17:58] [INFO ] Deduced a trap composed of 42 places in 112 ms of which 3 ms to minimize.
[2024-05-21 20:17:58] [INFO ] Deduced a trap composed of 43 places in 90 ms of which 3 ms to minimize.
[2024-05-21 20:17:59] [INFO ] Deduced a trap composed of 41 places in 91 ms of which 2 ms to minimize.
[2024-05-21 20:17:59] [INFO ] Deduced a trap composed of 19 places in 166 ms of which 3 ms to minimize.
[2024-05-21 20:17:59] [INFO ] Deduced a trap composed of 9 places in 117 ms of which 2 ms to minimize.
[2024-05-21 20:17:59] [INFO ] Deduced a trap composed of 20 places in 193 ms of which 4 ms to minimize.
[2024-05-21 20:18:00] [INFO ] Deduced a trap composed of 10 places in 208 ms of which 10 ms to minimize.
[2024-05-21 20:18:00] [INFO ] Deduced a trap composed of 49 places in 200 ms of which 4 ms to minimize.
[2024-05-21 20:18:00] [INFO ] Deduced a trap composed of 35 places in 190 ms of which 3 ms to minimize.
[2024-05-21 20:18:01] [INFO ] Deduced a trap composed of 22 places in 108 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/210 variables, 18/47 constraints. Problems are: Problem set: 0 solved, 356 unsolved
[2024-05-21 20:18:05] [INFO ] Deduced a trap composed of 39 places in 201 ms of which 4 ms to minimize.
[2024-05-21 20:18:06] [INFO ] Deduced a trap composed of 44 places in 172 ms of which 5 ms to minimize.
[2024-05-21 20:18:07] [INFO ] Deduced a trap composed of 40 places in 112 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/210 variables, 3/50 constraints. Problems are: Problem set: 0 solved, 356 unsolved
[2024-05-21 20:18:09] [INFO ] Deduced a trap composed of 22 places in 227 ms of which 4 ms to minimize.
[2024-05-21 20:18:10] [INFO ] Deduced a trap composed of 38 places in 155 ms of which 3 ms to minimize.
[2024-05-21 20:18:10] [INFO ] Deduced a trap composed of 36 places in 176 ms of which 3 ms to minimize.
[2024-05-21 20:18:10] [INFO ] Deduced a trap composed of 36 places in 160 ms of which 3 ms to minimize.
[2024-05-21 20:18:11] [INFO ] Deduced a trap composed of 39 places in 159 ms of which 3 ms to minimize.
[2024-05-21 20:18:11] [INFO ] Deduced a trap composed of 33 places in 166 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/210 variables, 6/56 constraints. Problems are: Problem set: 0 solved, 356 unsolved
[2024-05-21 20:18:13] [INFO ] Deduced a trap composed of 39 places in 151 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/210 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 356 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 210/567 variables, and 57 constraints, problems are : Problem set: 0 solved, 356 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 0/210 constraints, PredecessorRefiner: 356/356 constraints, Known Traps: 48/48 constraints]
Escalating to Integer solving :Problem set: 0 solved, 356 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/209 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 1 (OVERLAPS) 1/210 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/210 variables, 48/57 constraints. Problems are: Problem set: 0 solved, 356 unsolved
[2024-05-21 20:18:20] [INFO ] Deduced a trap composed of 32 places in 103 ms of which 3 ms to minimize.
[2024-05-21 20:18:21] [INFO ] Deduced a trap composed of 35 places in 172 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/210 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/210 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 356 unsolved
Problem TDEAD10 is UNSAT
Problem TDEAD331 is UNSAT
At refinement iteration 5 (OVERLAPS) 357/567 variables, 210/269 constraints. Problems are: Problem set: 2 solved, 354 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/567 variables, 354/623 constraints. Problems are: Problem set: 2 solved, 354 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/567 variables, 0/623 constraints. Problems are: Problem set: 2 solved, 354 unsolved
At refinement iteration 8 (OVERLAPS) 0/567 variables, 0/623 constraints. Problems are: Problem set: 2 solved, 354 unsolved
No progress, stopping.
After SMT solving in domain Int declared 567/567 variables, and 623 constraints, problems are : Problem set: 2 solved, 354 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 210/210 constraints, PredecessorRefiner: 354/356 constraints, Known Traps: 50/50 constraints]
After SMT, in 61186ms problems are : Problem set: 2 solved, 354 unsolved
Search for dead transitions found 2 dead transitions in 61236ms
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 : 210/221 places, 355/368 transitions.
Deduced a syphon composed of 1 places in 3 ms
Applied a total of 0 rules in 13 ms. Remains 210 /210 variables (removed 0) and now considering 355/355 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 62396 ms. Remains : 210/221 places, 355/368 transitions.
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Support contains 103 out of 209 places after structural reductions.
[2024-05-21 20:18:47] [INFO ] Flatten gal took : 105 ms
[2024-05-21 20:18:47] [INFO ] Flatten gal took : 43 ms
[2024-05-21 20:18:47] [INFO ] Input system was already deterministic with 355 transitions.
Support contains 102 out of 209 places (down from 103) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 110 to 107
RANDOM walk for 40000 steps (39 resets) in 3685 ms. (10 steps per ms) remains 30/107 properties
BEST_FIRST walk for 4004 steps (9 resets) in 82 ms. (48 steps per ms) remains 28/30 properties
BEST_FIRST walk for 4004 steps (11 resets) in 63 ms. (62 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (11 resets) in 62 ms. (63 steps per ms) remains 27/28 properties
BEST_FIRST walk for 4003 steps (10 resets) in 77 ms. (51 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (10 resets) in 48 ms. (81 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4001 steps (10 resets) in 23 ms. (166 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4001 steps (9 resets) in 24 ms. (160 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (9 resets) in 23 ms. (166 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (10 resets) in 22 ms. (174 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (9 resets) in 25 ms. (153 steps per ms) remains 26/27 properties
BEST_FIRST walk for 4004 steps (10 resets) in 18 ms. (210 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (11 resets) in 18 ms. (210 steps per ms) remains 25/26 properties
BEST_FIRST walk for 4004 steps (9 resets) in 20 ms. (190 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (9 resets) in 13 ms. (285 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4001 steps (10 resets) in 15 ms. (250 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (10 resets) in 18 ms. (210 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (9 resets) in 32 ms. (121 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (12 resets) in 19 ms. (200 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (12 resets) in 16 ms. (235 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (11 resets) in 14 ms. (266 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (12 resets) in 14 ms. (266 steps per ms) remains 24/25 properties
BEST_FIRST walk for 4004 steps (10 resets) in 16 ms. (235 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (9 resets) in 14 ms. (266 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (10 resets) in 16 ms. (235 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (11 resets) in 18 ms. (210 steps per ms) remains 24/24 properties
// Phase 1: matrix 355 rows 209 cols
[2024-05-21 20:18:49] [INFO ] Computed 9 invariants in 4 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp55 is UNSAT
Problem AtomicPropp95 is UNSAT
At refinement iteration 1 (OVERLAPS) 156/198 variables, 8/8 constraints. Problems are: Problem set: 5 solved, 19 unsolved
[2024-05-21 20:18:49] [INFO ] Deduced a trap composed of 37 places in 134 ms of which 4 ms to minimize.
Problem AtomicPropp66 is UNSAT
Problem AtomicPropp68 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/198 variables, 1/9 constraints. Problems are: Problem set: 7 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 0/9 constraints. Problems are: Problem set: 7 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 11/209 variables, 1/10 constraints. Problems are: Problem set: 7 solved, 17 unsolved
[2024-05-21 20:18:50] [INFO ] Deduced a trap composed of 22 places in 104 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 1/11 constraints. Problems are: Problem set: 7 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/209 variables, 0/11 constraints. Problems are: Problem set: 7 solved, 17 unsolved
Problem AtomicPropp93 is UNSAT
At refinement iteration 7 (OVERLAPS) 355/564 variables, 209/220 constraints. Problems are: Problem set: 8 solved, 16 unsolved
[2024-05-21 20:18:50] [INFO ] Deduced a trap composed of 33 places in 102 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/564 variables, 1/221 constraints. Problems are: Problem set: 8 solved, 16 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/564 variables, 0/221 constraints. Problems are: Problem set: 8 solved, 16 unsolved
At refinement iteration 10 (OVERLAPS) 0/564 variables, 0/221 constraints. Problems are: Problem set: 8 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 564/564 variables, and 221 constraints, problems are : Problem set: 8 solved, 16 unsolved in 1748 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 209/209 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 8 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 8 solved, 16 unsolved
Problem AtomicPropp73 is UNSAT
Problem AtomicPropp81 is UNSAT
At refinement iteration 1 (OVERLAPS) 175/198 variables, 8/8 constraints. Problems are: Problem set: 10 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/198 variables, 2/10 constraints. Problems are: Problem set: 10 solved, 14 unsolved
[2024-05-21 20:18:51] [INFO ] Deduced a trap composed of 46 places in 193 ms of which 3 ms to minimize.
[2024-05-21 20:18:51] [INFO ] Deduced a trap composed of 37 places in 154 ms of which 3 ms to minimize.
[2024-05-21 20:18:51] [INFO ] Deduced a trap composed of 35 places in 182 ms of which 3 ms to minimize.
[2024-05-21 20:18:51] [INFO ] Deduced a trap composed of 34 places in 142 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 4/14 constraints. Problems are: Problem set: 10 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/198 variables, 0/14 constraints. Problems are: Problem set: 10 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 11/209 variables, 1/15 constraints. Problems are: Problem set: 10 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/209 variables, 1/16 constraints. Problems are: Problem set: 10 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/209 variables, 0/16 constraints. Problems are: Problem set: 10 solved, 14 unsolved
At refinement iteration 8 (OVERLAPS) 355/564 variables, 209/225 constraints. Problems are: Problem set: 10 solved, 14 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/564 variables, 14/239 constraints. Problems are: Problem set: 10 solved, 14 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/564 variables, 0/239 constraints. Problems are: Problem set: 10 solved, 14 unsolved
At refinement iteration 11 (OVERLAPS) 0/564 variables, 0/239 constraints. Problems are: Problem set: 10 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Int declared 564/564 variables, and 239 constraints, problems are : Problem set: 10 solved, 14 unsolved in 2719 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 209/209 constraints, PredecessorRefiner: 14/24 constraints, Known Traps: 7/7 constraints]
After SMT, in 4607ms problems are : Problem set: 10 solved, 14 unsolved
Fused 14 Parikh solutions to 13 different solutions.
Parikh walk visited 1 properties in 12065 ms.
Support contains 19 out of 209 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 209/209 places, 355/355 transitions.
Graph (trivial) has 176 edges and 209 vertex of which 4 / 209 are part of one of the 2 SCC in 4 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 567 edges and 207 vertex of which 202 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.3 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 85 transitions
Trivial Post-agglo rules discarded 85 transitions
Performed 85 trivial Post agglomeration. Transition count delta: 85
Iterating post reduction 0 with 86 rules applied. Total rules applied 88 place count 202 transition count 262
Reduce places removed 85 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 1 with 109 rules applied. Total rules applied 197 place count 117 transition count 238
Reduce places removed 13 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 15 rules applied. Total rules applied 212 place count 104 transition count 236
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 216 place count 102 transition count 234
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 217 place count 101 transition count 234
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 7 Pre rules applied. Total rules applied 217 place count 101 transition count 227
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 231 place count 94 transition count 227
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 242 place count 83 transition count 216
Iterating global reduction 5 with 11 rules applied. Total rules applied 253 place count 83 transition count 216
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Iterating post reduction 5 with 64 rules applied. Total rules applied 317 place count 83 transition count 152
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 317 place count 83 transition count 151
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 319 place count 82 transition count 151
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 6 with 44 rules applied. Total rules applied 363 place count 60 transition count 129
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 366 place count 57 transition count 118
Iterating global reduction 6 with 3 rules applied. Total rules applied 369 place count 57 transition count 118
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 371 place count 56 transition count 131
Free-agglomeration rule applied 8 times.
Iterating global reduction 6 with 8 rules applied. Total rules applied 379 place count 56 transition count 123
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 387 place count 48 transition count 123
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 388 place count 48 transition count 122
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 389 place count 48 transition count 122
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 390 place count 47 transition count 121
Applied a total of 390 rules in 121 ms. Remains 47 /209 variables (removed 162) and now considering 121/355 (removed 234) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 121 ms. Remains : 47/209 places, 121/355 transitions.
RANDOM walk for 40000 steps (2283 resets) in 396 ms. (100 steps per ms) remains 3/13 properties
BEST_FIRST walk for 40004 steps (462 resets) in 184 ms. (216 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40003 steps (395 resets) in 90 ms. (439 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (422 resets) in 107 ms. (370 steps per ms) remains 1/2 properties
// Phase 1: matrix 121 rows 47 cols
[2024-05-21 20:19:06] [INFO ] Computed 8 invariants in 2 ms
[2024-05-21 20:19:06] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 17/22 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 103/125 variables, 22/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 41/166 variables, 23/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/166 variables, 3/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/166 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/166 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/167 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/167 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/167 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/168 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/168 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/168 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 168/168 variables, and 56 constraints, problems are : Problem set: 0 solved, 1 unsolved in 188 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 47/47 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 17/22 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 103/125 variables, 22/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 41/166 variables, 23/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/166 variables, 3/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/166 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/166 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/166 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/167 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/167 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/167 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/168 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/168 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/168 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 168/168 variables, and 57 constraints, problems are : Problem set: 0 solved, 1 unsolved in 224 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 47/47 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 428ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 13 ms.
Support contains 5 out of 47 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 47/47 places, 121/121 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 47 transition count 119
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 45 transition count 119
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 6 place count 43 transition count 110
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 43 transition count 110
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 9 place count 43 transition count 109
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 17 place count 39 transition count 105
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 18 place count 38 transition count 101
Iterating global reduction 3 with 1 rules applied. Total rules applied 19 place count 38 transition count 101
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 20 place count 38 transition count 100
Free-agglomeration rule applied 4 times.
Iterating global reduction 4 with 4 rules applied. Total rules applied 24 place count 38 transition count 96
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 36 place count 34 transition count 88
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 37 place count 33 transition count 87
Applied a total of 37 rules in 54 ms. Remains 33 /47 variables (removed 14) and now considering 87/121 (removed 34) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 33/47 places, 87/121 transitions.
RANDOM walk for 40000 steps (1248 resets) in 192 ms. (207 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (586 resets) in 87 ms. (454 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 36389 steps, run visited all 1 properties in 101 ms. (steps per millisecond=360 )
Probabilistic random walk after 36389 steps, saw 7435 distinct states, run finished after 106 ms. (steps per millisecond=343 ) properties seen :1
Successfully simplified 10 atomic propositions for a total of 16 simplifications.
[2024-05-21 20:19:07] [INFO ] Flatten gal took : 31 ms
[2024-05-21 20:19:07] [INFO ] Flatten gal took : 32 ms
[2024-05-21 20:19:07] [INFO ] Input system was already deterministic with 355 transitions.
Support contains 93 out of 209 places (down from 94) after GAL structural reductions.
Computed a total of 42 stabilizing places and 42 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 209/209 places, 355/355 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 184 transition count 330
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 184 transition count 330
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Iterating post reduction 0 with 64 rules applied. Total rules applied 114 place count 184 transition count 266
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 120 place count 178 transition count 260
Iterating global reduction 1 with 6 rules applied. Total rules applied 126 place count 178 transition count 260
Applied a total of 126 rules in 31 ms. Remains 178 /209 variables (removed 31) and now considering 260/355 (removed 95) transitions.
// Phase 1: matrix 260 rows 178 cols
[2024-05-21 20:19:07] [INFO ] Computed 9 invariants in 2 ms
[2024-05-21 20:19:07] [INFO ] Implicit Places using invariants in 105 ms returned []
[2024-05-21 20:19:07] [INFO ] Invariant cache hit.
[2024-05-21 20:19:07] [INFO ] Implicit Places using invariants and state equation in 250 ms returned []
Implicit Place search using SMT with State Equation took 360 ms to find 0 implicit places.
Running 259 sub problems to find dead transitions.
[2024-05-21 20:19:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/177 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 1 (OVERLAPS) 1/178 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-21 20:19:10] [INFO ] Deduced a trap composed of 16 places in 199 ms of which 4 ms to minimize.
[2024-05-21 20:19:10] [INFO ] Deduced a trap composed of 14 places in 182 ms of which 3 ms to minimize.
[2024-05-21 20:19:10] [INFO ] Deduced a trap composed of 39 places in 69 ms of which 2 ms to minimize.
[2024-05-21 20:19:11] [INFO ] Deduced a trap composed of 24 places in 177 ms of which 4 ms to minimize.
[2024-05-21 20:19:11] [INFO ] Deduced a trap composed of 22 places in 176 ms of which 3 ms to minimize.
[2024-05-21 20:19:11] [INFO ] Deduced a trap composed of 33 places in 168 ms of which 3 ms to minimize.
[2024-05-21 20:19:11] [INFO ] Deduced a trap composed of 29 places in 166 ms of which 4 ms to minimize.
[2024-05-21 20:19:11] [INFO ] Deduced a trap composed of 29 places in 144 ms of which 2 ms to minimize.
[2024-05-21 20:19:12] [INFO ] Deduced a trap composed of 31 places in 166 ms of which 3 ms to minimize.
[2024-05-21 20:19:12] [INFO ] Deduced a trap composed of 28 places in 158 ms of which 2 ms to minimize.
[2024-05-21 20:19:12] [INFO ] Deduced a trap composed of 32 places in 163 ms of which 3 ms to minimize.
[2024-05-21 20:19:12] [INFO ] Deduced a trap composed of 31 places in 164 ms of which 3 ms to minimize.
[2024-05-21 20:19:12] [INFO ] Deduced a trap composed of 31 places in 139 ms of which 3 ms to minimize.
[2024-05-21 20:19:13] [INFO ] Deduced a trap composed of 34 places in 173 ms of which 3 ms to minimize.
[2024-05-21 20:19:13] [INFO ] Deduced a trap composed of 38 places in 127 ms of which 3 ms to minimize.
[2024-05-21 20:19:13] [INFO ] Deduced a trap composed of 39 places in 116 ms of which 3 ms to minimize.
[2024-05-21 20:19:13] [INFO ] Deduced a trap composed of 38 places in 113 ms of which 2 ms to minimize.
[2024-05-21 20:19:13] [INFO ] Deduced a trap composed of 46 places in 127 ms of which 3 ms to minimize.
[2024-05-21 20:19:13] [INFO ] Deduced a trap composed of 38 places in 117 ms of which 3 ms to minimize.
[2024-05-21 20:19:14] [INFO ] Deduced a trap composed of 40 places in 154 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 20/29 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-21 20:19:14] [INFO ] Deduced a trap composed of 33 places in 164 ms of which 3 ms to minimize.
[2024-05-21 20:19:14] [INFO ] Deduced a trap composed of 36 places in 159 ms of which 3 ms to minimize.
[2024-05-21 20:19:14] [INFO ] Deduced a trap composed of 46 places in 160 ms of which 3 ms to minimize.
[2024-05-21 20:19:15] [INFO ] Deduced a trap composed of 35 places in 153 ms of which 3 ms to minimize.
[2024-05-21 20:19:15] [INFO ] Deduced a trap composed of 31 places in 156 ms of which 2 ms to minimize.
[2024-05-21 20:19:15] [INFO ] Deduced a trap composed of 31 places in 145 ms of which 3 ms to minimize.
[2024-05-21 20:19:15] [INFO ] Deduced a trap composed of 25 places in 151 ms of which 3 ms to minimize.
[2024-05-21 20:19:15] [INFO ] Deduced a trap composed of 32 places in 159 ms of which 3 ms to minimize.
[2024-05-21 20:19:16] [INFO ] Deduced a trap composed of 24 places in 168 ms of which 2 ms to minimize.
[2024-05-21 20:19:16] [INFO ] Deduced a trap composed of 32 places in 131 ms of which 3 ms to minimize.
[2024-05-21 20:19:16] [INFO ] Deduced a trap composed of 31 places in 165 ms of which 3 ms to minimize.
[2024-05-21 20:19:16] [INFO ] Deduced a trap composed of 40 places in 125 ms of which 3 ms to minimize.
[2024-05-21 20:19:16] [INFO ] Deduced a trap composed of 38 places in 114 ms of which 2 ms to minimize.
[2024-05-21 20:19:17] [INFO ] Deduced a trap composed of 33 places in 152 ms of which 3 ms to minimize.
[2024-05-21 20:19:17] [INFO ] Deduced a trap composed of 40 places in 117 ms of which 3 ms to minimize.
[2024-05-21 20:19:17] [INFO ] Deduced a trap composed of 19 places in 181 ms of which 3 ms to minimize.
[2024-05-21 20:19:18] [INFO ] Deduced a trap composed of 14 places in 154 ms of which 3 ms to minimize.
[2024-05-21 20:19:18] [INFO ] Deduced a trap composed of 5 places in 162 ms of which 2 ms to minimize.
[2024-05-21 20:19:18] [INFO ] Deduced a trap composed of 44 places in 141 ms of which 3 ms to minimize.
[2024-05-21 20:19:19] [INFO ] Deduced a trap composed of 19 places in 90 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/178 variables, 20/49 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-21 20:19:21] [INFO ] Deduced a trap composed of 51 places in 102 ms of which 3 ms to minimize.
[2024-05-21 20:19:21] [INFO ] Deduced a trap composed of 31 places in 157 ms of which 3 ms to minimize.
[2024-05-21 20:19:22] [INFO ] Deduced a trap composed of 40 places in 90 ms of which 2 ms to minimize.
[2024-05-21 20:19:22] [INFO ] Deduced a trap composed of 38 places in 152 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/178 variables, 4/53 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-21 20:19:24] [INFO ] Deduced a trap composed of 31 places in 162 ms of which 4 ms to minimize.
[2024-05-21 20:19:24] [INFO ] Deduced a trap composed of 31 places in 150 ms of which 3 ms to minimize.
[2024-05-21 20:19:25] [INFO ] Deduced a trap composed of 32 places in 155 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/178 variables, 3/56 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-21 20:19:26] [INFO ] Deduced a trap composed of 18 places in 132 ms of which 3 ms to minimize.
[2024-05-21 20:19:27] [INFO ] Deduced a trap composed of 42 places in 133 ms of which 3 ms to minimize.
[2024-05-21 20:19:27] [INFO ] Deduced a trap composed of 42 places in 142 ms of which 4 ms to minimize.
[2024-05-21 20:19:27] [INFO ] Deduced a trap composed of 38 places in 108 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/178 variables, 4/60 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/178 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 8 (OVERLAPS) 260/438 variables, 178/238 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-21 20:19:33] [INFO ] Deduced a trap composed of 23 places in 152 ms of which 2 ms to minimize.
[2024-05-21 20:19:33] [INFO ] Deduced a trap composed of 35 places in 143 ms of which 3 ms to minimize.
[2024-05-21 20:19:33] [INFO ] Deduced a trap composed of 36 places in 140 ms of which 3 ms to minimize.
[2024-05-21 20:19:33] [INFO ] Deduced a trap composed of 32 places in 140 ms of which 2 ms to minimize.
[2024-05-21 20:19:34] [INFO ] Deduced a trap composed of 44 places in 119 ms of which 3 ms to minimize.
[2024-05-21 20:19:34] [INFO ] Deduced a trap composed of 32 places in 132 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/438 variables, 6/244 constraints. Problems are: Problem set: 0 solved, 259 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 438/438 variables, and 244 constraints, problems are : Problem set: 0 solved, 259 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 178/178 constraints, PredecessorRefiner: 259/259 constraints, Known Traps: 57/57 constraints]
Escalating to Integer solving :Problem set: 0 solved, 259 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/177 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 1 (OVERLAPS) 1/178 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 57/66 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-21 20:19:40] [INFO ] Deduced a trap composed of 39 places in 69 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/178 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/178 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 5 (OVERLAPS) 260/438 variables, 178/245 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/438 variables, 259/504 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-21 20:19:48] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/438 variables, 1/505 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/438 variables, 0/505 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 9 (OVERLAPS) 0/438 variables, 0/505 constraints. Problems are: Problem set: 0 solved, 259 unsolved
No progress, stopping.
After SMT solving in domain Int declared 438/438 variables, and 505 constraints, problems are : Problem set: 0 solved, 259 unsolved in 30008 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 178/178 constraints, PredecessorRefiner: 259/259 constraints, Known Traps: 59/59 constraints]
After SMT, in 60210ms problems are : Problem set: 0 solved, 259 unsolved
Search for dead transitions found 0 dead transitions in 60214ms
Starting structural reductions in LTL mode, iteration 1 : 178/209 places, 260/355 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60606 ms. Remains : 178/209 places, 260/355 transitions.
[2024-05-21 20:20:07] [INFO ] Flatten gal took : 18 ms
[2024-05-21 20:20:07] [INFO ] Flatten gal took : 18 ms
[2024-05-21 20:20:07] [INFO ] Input system was already deterministic with 260 transitions.
[2024-05-21 20:20:07] [INFO ] Flatten gal took : 17 ms
[2024-05-21 20:20:07] [INFO ] Flatten gal took : 15 ms
[2024-05-21 20:20:07] [INFO ] Time to serialize gal into /tmp/CTLFireability13327174869634367938.gal : 15 ms
[2024-05-21 20:20:07] [INFO ] Time to serialize properties into /tmp/CTLFireability7092412784968182964.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/CTLFireability13327174869634367938.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7092412784968182964.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.39231e+09,10.4675,214756,2,14885,5,812872,6,0,974,1.05478e+06,0


Converting to forward existential form...Done !
original formula: AG(AF((((AX((((p6==0)||(p16==0))||((p49==0)||(p178==0)))) + (p6==0)) + ((p14==0)||(p45==0))) + (p178==0))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!((((!(EX(!((((p6==0)||(p16==0))||((p49==0)||(p178==0)))))) + (p6==0)) + ((p14==0)||(p45==...183
Reverse transition relation is NOT exact ! Due to transitions t10, t16, t17, t24, t32, t35, t36, t37, t61, t62, t65, t66, t68, t81, t87, t88, t91, t92, t94...449
Detected timeout of ITS tools.
[2024-05-21 20:20:38] [INFO ] Flatten gal took : 25 ms
[2024-05-21 20:20:38] [INFO ] Applying decomposition
[2024-05-21 20:20:38] [INFO ] Flatten gal took : 23 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/graph4143467022854943810.txt' '-o' '/tmp/graph4143467022854943810.bin' '-w' '/tmp/graph4143467022854943810.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4143467022854943810.bin' '-l' '-1' '-v' '-w' '/tmp/graph4143467022854943810.weights' '-q' '0' '-e' '0.001'
[2024-05-21 20:20:38] [INFO ] Decomposing Gal with order
[2024-05-21 20:20:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 20:20:38] [INFO ] Removed a total of 236 redundant transitions.
[2024-05-21 20:20:38] [INFO ] Flatten gal took : 120 ms
[2024-05-21 20:20:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 24 labels/synchronizations in 24 ms.
[2024-05-21 20:20:38] [INFO ] Time to serialize gal into /tmp/CTLFireability3469062343867335292.gal : 17 ms
[2024-05-21 20:20:38] [INFO ] Time to serialize properties into /tmp/CTLFireability15652700737756576026.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/CTLFireability3469062343867335292.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15652700737756576026.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,1.39231e+09,0.112937,5392,469,102,3067,517,448,3838,76,1309,0


Converting to forward existential form...Done !
original formula: AG(AF((((AX((((i11.u1.p6==0)||(i11.u1.p16==0))||((i3.u15.p49==0)||(i11.u1.p178==0)))) + (i11.u1.p6==0)) + ((i11.u1.p14==0)||(i2.i1.u14.p4...184
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!((((!(EX(!((((i11.u1.p6==0)||(i11.u1.p16==0))||((i3.u15.p49==0)||(i11.u1.p178==0)))))) + ...242
Reverse transition relation is NOT exact ! Due to transitions t167, t173, t185, t205, t229, t257, i0.u46.t32, i0.u46.t35, i0.u46.t36, i0.u46.t37, i3.t158, ...620
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
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 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
(forward)formula 0,1,2.42686,71128,1,0,180117,1236,2378,133479,390,5121,243287
FORMULA AutonomousCar-PT-04b-CTLFireability-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 209/209 places, 355/355 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 186 transition count 332
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 186 transition count 332
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Iterating post reduction 0 with 64 rules applied. Total rules applied 110 place count 186 transition count 268
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 113 place count 183 transition count 265
Iterating global reduction 1 with 3 rules applied. Total rules applied 116 place count 183 transition count 265
Applied a total of 116 rules in 13 ms. Remains 183 /209 variables (removed 26) and now considering 265/355 (removed 90) transitions.
// Phase 1: matrix 265 rows 183 cols
[2024-05-21 20:20:40] [INFO ] Computed 9 invariants in 3 ms
[2024-05-21 20:20:41] [INFO ] Implicit Places using invariants in 104 ms returned []
[2024-05-21 20:20:41] [INFO ] Invariant cache hit.
[2024-05-21 20:20:41] [INFO ] Implicit Places using invariants and state equation in 231 ms returned []
Implicit Place search using SMT with State Equation took 340 ms to find 0 implicit places.
Running 264 sub problems to find dead transitions.
[2024-05-21 20:20:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/182 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 1 (OVERLAPS) 1/183 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 264 unsolved
[2024-05-21 20:20:45] [INFO ] Deduced a trap composed of 24 places in 166 ms of which 4 ms to minimize.
[2024-05-21 20:20:45] [INFO ] Deduced a trap composed of 39 places in 172 ms of which 7 ms to minimize.
[2024-05-21 20:20:45] [INFO ] Deduced a trap composed of 24 places in 157 ms of which 3 ms to minimize.
[2024-05-21 20:20:46] [INFO ] Deduced a trap composed of 18 places in 157 ms of which 3 ms to minimize.
[2024-05-21 20:20:46] [INFO ] Deduced a trap composed of 25 places in 158 ms of which 3 ms to minimize.
[2024-05-21 20:20:46] [INFO ] Deduced a trap composed of 42 places in 157 ms of which 3 ms to minimize.
[2024-05-21 20:20:46] [INFO ] Deduced a trap composed of 40 places in 166 ms of which 3 ms to minimize.
[2024-05-21 20:20:46] [INFO ] Deduced a trap composed of 32 places in 157 ms of which 2 ms to minimize.
[2024-05-21 20:20:47] [INFO ] Deduced a trap composed of 22 places in 166 ms of which 3 ms to minimize.
[2024-05-21 20:20:47] [INFO ] Deduced a trap composed of 32 places in 141 ms of which 2 ms to minimize.
[2024-05-21 20:20:47] [INFO ] Deduced a trap composed of 40 places in 141 ms of which 2 ms to minimize.
[2024-05-21 20:20:47] [INFO ] Deduced a trap composed of 40 places in 142 ms of which 3 ms to minimize.
[2024-05-21 20:20:47] [INFO ] Deduced a trap composed of 38 places in 142 ms of which 3 ms to minimize.
[2024-05-21 20:20:47] [INFO ] Deduced a trap composed of 34 places in 157 ms of which 3 ms to minimize.
[2024-05-21 20:20:48] [INFO ] Deduced a trap composed of 41 places in 150 ms of which 3 ms to minimize.
[2024-05-21 20:20:48] [INFO ] Deduced a trap composed of 33 places in 158 ms of which 3 ms to minimize.
[2024-05-21 20:20:48] [INFO ] Deduced a trap composed of 34 places in 213 ms of which 3 ms to minimize.
[2024-05-21 20:20:49] [INFO ] Deduced a trap composed of 31 places in 163 ms of which 3 ms to minimize.
[2024-05-21 20:20:49] [INFO ] Deduced a trap composed of 45 places in 151 ms of which 2 ms to minimize.
[2024-05-21 20:20:49] [INFO ] Deduced a trap composed of 31 places in 141 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/183 variables, 20/29 constraints. Problems are: Problem set: 0 solved, 264 unsolved
[2024-05-21 20:20:49] [INFO ] Deduced a trap composed of 43 places in 171 ms of which 3 ms to minimize.
[2024-05-21 20:20:50] [INFO ] Deduced a trap composed of 29 places in 162 ms of which 3 ms to minimize.
[2024-05-21 20:20:50] [INFO ] Deduced a trap composed of 31 places in 155 ms of which 3 ms to minimize.
[2024-05-21 20:20:50] [INFO ] Deduced a trap composed of 40 places in 155 ms of which 3 ms to minimize.
[2024-05-21 20:20:50] [INFO ] Deduced a trap composed of 29 places in 151 ms of which 3 ms to minimize.
[2024-05-21 20:20:50] [INFO ] Deduced a trap composed of 36 places in 146 ms of which 3 ms to minimize.
[2024-05-21 20:20:50] [INFO ] Deduced a trap composed of 15 places in 159 ms of which 3 ms to minimize.
[2024-05-21 20:20:51] [INFO ] Deduced a trap composed of 32 places in 163 ms of which 3 ms to minimize.
[2024-05-21 20:20:51] [INFO ] Deduced a trap composed of 34 places in 165 ms of which 3 ms to minimize.
[2024-05-21 20:20:51] [INFO ] Deduced a trap composed of 19 places in 153 ms of which 2 ms to minimize.
[2024-05-21 20:20:51] [INFO ] Deduced a trap composed of 36 places in 131 ms of which 2 ms to minimize.
[2024-05-21 20:20:52] [INFO ] Deduced a trap composed of 39 places in 111 ms of which 2 ms to minimize.
[2024-05-21 20:20:52] [INFO ] Deduced a trap composed of 39 places in 85 ms of which 2 ms to minimize.
[2024-05-21 20:20:52] [INFO ] Deduced a trap composed of 5 places in 153 ms of which 3 ms to minimize.
[2024-05-21 20:20:53] [INFO ] Deduced a trap composed of 19 places in 152 ms of which 3 ms to minimize.
[2024-05-21 20:20:53] [INFO ] Deduced a trap composed of 14 places in 135 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/183 variables, 16/45 constraints. Problems are: Problem set: 0 solved, 264 unsolved
[2024-05-21 20:20:56] [INFO ] Deduced a trap composed of 46 places in 179 ms of which 3 ms to minimize.
[2024-05-21 20:20:56] [INFO ] Deduced a trap composed of 32 places in 155 ms of which 3 ms to minimize.
[2024-05-21 20:20:56] [INFO ] Deduced a trap composed of 25 places in 152 ms of which 2 ms to minimize.
[2024-05-21 20:20:57] [INFO ] Deduced a trap composed of 32 places in 143 ms of which 3 ms to minimize.
[2024-05-21 20:20:57] [INFO ] Deduced a trap composed of 38 places in 137 ms of which 2 ms to minimize.
[2024-05-21 20:20:57] [INFO ] Deduced a trap composed of 31 places in 139 ms of which 3 ms to minimize.
[2024-05-21 20:20:57] [INFO ] Deduced a trap composed of 53 places in 144 ms of which 3 ms to minimize.
[2024-05-21 20:20:57] [INFO ] Deduced a trap composed of 42 places in 140 ms of which 3 ms to minimize.
[2024-05-21 20:20:57] [INFO ] Deduced a trap composed of 37 places in 147 ms of which 3 ms to minimize.
[2024-05-21 20:20:58] [INFO ] Deduced a trap composed of 42 places in 127 ms of which 3 ms to minimize.
[2024-05-21 20:20:58] [INFO ] Deduced a trap composed of 37 places in 157 ms of which 3 ms to minimize.
[2024-05-21 20:20:58] [INFO ] Deduced a trap composed of 40 places in 85 ms of which 3 ms to minimize.
[2024-05-21 20:20:58] [INFO ] Deduced a trap composed of 39 places in 111 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/183 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 264 unsolved
[2024-05-21 20:21:00] [INFO ] Deduced a trap composed of 38 places in 108 ms of which 5 ms to minimize.
[2024-05-21 20:21:00] [INFO ] Deduced a trap composed of 42 places in 148 ms of which 3 ms to minimize.
[2024-05-21 20:21:01] [INFO ] Deduced a trap composed of 32 places in 160 ms of which 3 ms to minimize.
[2024-05-21 20:21:01] [INFO ] Deduced a trap composed of 34 places in 153 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/183 variables, 4/62 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/183 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 7 (OVERLAPS) 265/448 variables, 183/245 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/448 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 264 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 448/448 variables, and 245 constraints, problems are : Problem set: 0 solved, 264 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 183/183 constraints, PredecessorRefiner: 264/264 constraints, Known Traps: 53/53 constraints]
Escalating to Integer solving :Problem set: 0 solved, 264 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/182 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 1 (OVERLAPS) 1/183 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/183 variables, 53/62 constraints. Problems are: Problem set: 0 solved, 264 unsolved
[2024-05-21 20:21:14] [INFO ] Deduced a trap composed of 38 places in 102 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/183 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/183 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 5 (OVERLAPS) 265/448 variables, 183/246 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/448 variables, 264/510 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/448 variables, 0/510 constraints. Problems are: Problem set: 0 solved, 264 unsolved
[2024-05-21 20:21:26] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 2 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/448 variables, 1/511 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/448 variables, 0/511 constraints. Problems are: Problem set: 0 solved, 264 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 448/448 variables, and 511 constraints, problems are : Problem set: 0 solved, 264 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 183/183 constraints, PredecessorRefiner: 264/264 constraints, Known Traps: 55/55 constraints]
After SMT, in 60248ms problems are : Problem set: 0 solved, 264 unsolved
Search for dead transitions found 0 dead transitions in 60254ms
Starting structural reductions in LTL mode, iteration 1 : 183/209 places, 265/355 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60608 ms. Remains : 183/209 places, 265/355 transitions.
[2024-05-21 20:21:41] [INFO ] Flatten gal took : 13 ms
[2024-05-21 20:21:41] [INFO ] Flatten gal took : 12 ms
[2024-05-21 20:21:41] [INFO ] Input system was already deterministic with 265 transitions.
[2024-05-21 20:21:41] [INFO ] Flatten gal took : 11 ms
[2024-05-21 20:21:41] [INFO ] Flatten gal took : 11 ms
[2024-05-21 20:21:41] [INFO ] Time to serialize gal into /tmp/CTLFireability17408232509997520126.gal : 5 ms
[2024-05-21 20:21:41] [INFO ] Time to serialize properties into /tmp/CTLFireability11234370026634253295.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/CTLFireability17408232509997520126.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11234370026634253295.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.54826e+09,8.59856,189892,2,15578,5,710451,6,0,999,924688,0


Converting to forward existential form...Done !
original formula: AF((EG(A(((p172==1)||(p55==1)) U (p52!=1))) * (EF((((AF((p22==1)) * (p50==1)) * ((p81==1)&&(p118==1))) * ((p143==1)&&(p179==1)))) + (((p1...383
=> equivalent forward existential formula: [FwdG(Init,!((EG(!((E(!((p52!=1)) U (!(((p172==1)||(p55==1))) * !((p52!=1)))) + EG(!((p52!=1)))))) * (E(TRUE U (...491
Reverse transition relation is NOT exact ! Due to transitions t10, t16, t17, t24, t33, t38, t39, t64, t65, t68, t69, t71, t74, t85, t91, t92, t95, t96, t98...455
Detected timeout of ITS tools.
[2024-05-21 20:22:11] [INFO ] Flatten gal took : 11 ms
[2024-05-21 20:22:11] [INFO ] Applying decomposition
[2024-05-21 20:22:11] [INFO ] Flatten gal took : 10 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/graph9438650055750862769.txt' '-o' '/tmp/graph9438650055750862769.bin' '-w' '/tmp/graph9438650055750862769.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9438650055750862769.bin' '-l' '-1' '-v' '-w' '/tmp/graph9438650055750862769.weights' '-q' '0' '-e' '0.001'
[2024-05-21 20:22:11] [INFO ] Decomposing Gal with order
[2024-05-21 20:22:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 20:22:11] [INFO ] Removed a total of 241 redundant transitions.
[2024-05-21 20:22:11] [INFO ] Flatten gal took : 41 ms
[2024-05-21 20:22:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 22 labels/synchronizations in 6 ms.
[2024-05-21 20:22:11] [INFO ] Time to serialize gal into /tmp/CTLFireability8519387107988980199.gal : 5 ms
[2024-05-21 20:22:11] [INFO ] Time to serialize properties into /tmp/CTLFireability4187019938861917639.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/CTLFireability8519387107988980199.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4187019938861917639.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.54826e+09,0.071442,5468,447,98,3206,508,482,4812,78,1802,0


Converting to forward existential form...Done !
original formula: AF((EG(A(((i9.u55.p172==1)||(i2.i2.u18.p55==1)) U (i2.i1.u15.p52!=1))) * (EF((((AF((i0.i1.u5.p22==1)) * (i2.i1.u16.p50==1)) * ((i4.u25.p8...610
=> equivalent forward existential formula: [FwdG(Init,!((EG(!((E(!((i2.i1.u15.p52!=1)) U (!(((i9.u55.p172==1)||(i2.i2.u18.p55==1))) * !((i2.i1.u15.p52!=1))...738
Reverse transition relation is NOT exact ! Due to transitions t172, t177, t197, t209, t237, t262, i2.t163, i2.i0.t143, i2.i0.u10.t162, i2.i1.u15.t147, i2.i...630
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 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
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 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
(forward)formula 0,1,9.58165,290060,1,0,608238,2834,3282,786579,442,14777,624356
FORMULA AutonomousCar-PT-04b-CTLFireability-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 209/209 places, 355/355 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 186 transition count 332
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 186 transition count 332
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Iterating post reduction 0 with 64 rules applied. Total rules applied 110 place count 186 transition count 268
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 115 place count 181 transition count 263
Iterating global reduction 1 with 5 rules applied. Total rules applied 120 place count 181 transition count 263
Applied a total of 120 rules in 13 ms. Remains 181 /209 variables (removed 28) and now considering 263/355 (removed 92) transitions.
// Phase 1: matrix 263 rows 181 cols
[2024-05-21 20:22:21] [INFO ] Computed 9 invariants in 1 ms
[2024-05-21 20:22:21] [INFO ] Implicit Places using invariants in 113 ms returned []
[2024-05-21 20:22:21] [INFO ] Invariant cache hit.
[2024-05-21 20:22:21] [INFO ] Implicit Places using invariants and state equation in 273 ms returned []
Implicit Place search using SMT with State Equation took 388 ms to find 0 implicit places.
Running 262 sub problems to find dead transitions.
[2024-05-21 20:22:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (OVERLAPS) 1/181 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-21 20:22:26] [INFO ] Deduced a trap composed of 16 places in 168 ms of which 4 ms to minimize.
[2024-05-21 20:22:26] [INFO ] Deduced a trap composed of 14 places in 206 ms of which 3 ms to minimize.
[2024-05-21 20:22:26] [INFO ] Deduced a trap composed of 32 places in 179 ms of which 4 ms to minimize.
[2024-05-21 20:22:26] [INFO ] Deduced a trap composed of 40 places in 59 ms of which 1 ms to minimize.
[2024-05-21 20:22:26] [INFO ] Deduced a trap composed of 38 places in 173 ms of which 3 ms to minimize.
[2024-05-21 20:22:27] [INFO ] Deduced a trap composed of 23 places in 164 ms of which 3 ms to minimize.
[2024-05-21 20:22:27] [INFO ] Deduced a trap composed of 33 places in 163 ms of which 3 ms to minimize.
[2024-05-21 20:22:27] [INFO ] Deduced a trap composed of 30 places in 149 ms of which 3 ms to minimize.
[2024-05-21 20:22:27] [INFO ] Deduced a trap composed of 35 places in 147 ms of which 3 ms to minimize.
[2024-05-21 20:22:27] [INFO ] Deduced a trap composed of 31 places in 165 ms of which 4 ms to minimize.
[2024-05-21 20:22:28] [INFO ] Deduced a trap composed of 31 places in 146 ms of which 3 ms to minimize.
[2024-05-21 20:22:28] [INFO ] Deduced a trap composed of 32 places in 150 ms of which 3 ms to minimize.
[2024-05-21 20:22:28] [INFO ] Deduced a trap composed of 31 places in 141 ms of which 3 ms to minimize.
[2024-05-21 20:22:28] [INFO ] Deduced a trap composed of 31 places in 149 ms of which 3 ms to minimize.
[2024-05-21 20:22:28] [INFO ] Deduced a trap composed of 38 places in 93 ms of which 3 ms to minimize.
[2024-05-21 20:22:29] [INFO ] Deduced a trap composed of 40 places in 100 ms of which 3 ms to minimize.
[2024-05-21 20:22:29] [INFO ] Deduced a trap composed of 39 places in 101 ms of which 2 ms to minimize.
[2024-05-21 20:22:29] [INFO ] Deduced a trap composed of 38 places in 93 ms of which 2 ms to minimize.
[2024-05-21 20:22:29] [INFO ] Deduced a trap composed of 40 places in 96 ms of which 2 ms to minimize.
[2024-05-21 20:22:29] [INFO ] Deduced a trap composed of 39 places in 104 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/181 variables, 20/29 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-21 20:22:30] [INFO ] Deduced a trap composed of 34 places in 158 ms of which 3 ms to minimize.
[2024-05-21 20:22:30] [INFO ] Deduced a trap composed of 35 places in 149 ms of which 3 ms to minimize.
[2024-05-21 20:22:30] [INFO ] Deduced a trap composed of 34 places in 154 ms of which 3 ms to minimize.
[2024-05-21 20:22:31] [INFO ] Deduced a trap composed of 32 places in 142 ms of which 3 ms to minimize.
[2024-05-21 20:22:31] [INFO ] Deduced a trap composed of 38 places in 102 ms of which 3 ms to minimize.
[2024-05-21 20:22:31] [INFO ] Deduced a trap composed of 40 places in 116 ms of which 3 ms to minimize.
[2024-05-21 20:22:31] [INFO ] Deduced a trap composed of 38 places in 87 ms of which 2 ms to minimize.
[2024-05-21 20:22:31] [INFO ] Deduced a trap composed of 31 places in 155 ms of which 3 ms to minimize.
[2024-05-21 20:22:32] [INFO ] Deduced a trap composed of 31 places in 163 ms of which 3 ms to minimize.
[2024-05-21 20:22:32] [INFO ] Deduced a trap composed of 31 places in 159 ms of which 3 ms to minimize.
[2024-05-21 20:22:32] [INFO ] Deduced a trap composed of 42 places in 172 ms of which 3 ms to minimize.
[2024-05-21 20:22:32] [INFO ] Deduced a trap composed of 52 places in 158 ms of which 3 ms to minimize.
[2024-05-21 20:22:32] [INFO ] Deduced a trap composed of 40 places in 147 ms of which 3 ms to minimize.
[2024-05-21 20:22:32] [INFO ] Deduced a trap composed of 44 places in 140 ms of which 3 ms to minimize.
[2024-05-21 20:22:33] [INFO ] Deduced a trap composed of 43 places in 139 ms of which 3 ms to minimize.
[2024-05-21 20:22:33] [INFO ] Deduced a trap composed of 42 places in 145 ms of which 3 ms to minimize.
[2024-05-21 20:22:33] [INFO ] Deduced a trap composed of 44 places in 134 ms of which 3 ms to minimize.
[2024-05-21 20:22:33] [INFO ] Deduced a trap composed of 32 places in 143 ms of which 3 ms to minimize.
[2024-05-21 20:22:33] [INFO ] Deduced a trap composed of 45 places in 140 ms of which 3 ms to minimize.
[2024-05-21 20:22:33] [INFO ] Deduced a trap composed of 32 places in 126 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 20/49 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-21 20:22:36] [INFO ] Deduced a trap composed of 31 places in 176 ms of which 3 ms to minimize.
[2024-05-21 20:22:37] [INFO ] Deduced a trap composed of 32 places in 112 ms of which 2 ms to minimize.
[2024-05-21 20:22:37] [INFO ] Deduced a trap composed of 40 places in 109 ms of which 2 ms to minimize.
[2024-05-21 20:22:37] [INFO ] Deduced a trap composed of 31 places in 89 ms of which 2 ms to minimize.
[2024-05-21 20:22:37] [INFO ] Deduced a trap composed of 51 places in 80 ms of which 2 ms to minimize.
[2024-05-21 20:22:37] [INFO ] Deduced a trap composed of 20 places in 93 ms of which 2 ms to minimize.
[2024-05-21 20:22:37] [INFO ] Deduced a trap composed of 5 places in 131 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/181 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-21 20:22:39] [INFO ] Deduced a trap composed of 25 places in 130 ms of which 3 ms to minimize.
[2024-05-21 20:22:40] [INFO ] Deduced a trap composed of 19 places in 152 ms of which 2 ms to minimize.
[2024-05-21 20:22:40] [INFO ] Deduced a trap composed of 14 places in 148 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/181 variables, 3/59 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-21 20:22:42] [INFO ] Deduced a trap composed of 23 places in 132 ms of which 3 ms to minimize.
[2024-05-21 20:22:42] [INFO ] Deduced a trap composed of 32 places in 154 ms of which 3 ms to minimize.
[2024-05-21 20:22:43] [INFO ] Deduced a trap composed of 22 places in 132 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/181 variables, 3/62 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-21 20:22:46] [INFO ] Deduced a trap composed of 51 places in 97 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/181 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/181 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 9 (OVERLAPS) 263/444 variables, 181/244 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 444/444 variables, and 244 constraints, problems are : Problem set: 0 solved, 262 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 181/181 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 54/54 constraints]
Escalating to Integer solving :Problem set: 0 solved, 262 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (OVERLAPS) 1/181 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/181 variables, 54/63 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-21 20:22:54] [INFO ] Deduced a trap composed of 31 places in 75 ms of which 2 ms to minimize.
[2024-05-21 20:22:54] [INFO ] Deduced a trap composed of 38 places in 67 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-21 20:22:56] [INFO ] Deduced a trap composed of 51 places in 95 ms of which 2 ms to minimize.
[2024-05-21 20:22:56] [INFO ] Deduced a trap composed of 38 places in 78 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/181 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/181 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (OVERLAPS) 263/444 variables, 181/248 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/444 variables, 262/510 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-21 20:23:02] [INFO ] Deduced a trap composed of 46 places in 95 ms of which 3 ms to minimize.
[2024-05-21 20:23:05] [INFO ] Deduced a trap composed of 21 places in 130 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/444 variables, 2/512 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/444 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-21 20:23:19] [INFO ] Deduced a trap composed of 40 places in 77 ms of which 2 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/444 variables, 1/513 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 444/444 variables, and 513 constraints, problems are : Problem set: 0 solved, 262 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 181/181 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 61/61 constraints]
After SMT, in 60245ms problems are : Problem set: 0 solved, 262 unsolved
Search for dead transitions found 0 dead transitions in 60251ms
Starting structural reductions in LTL mode, iteration 1 : 181/209 places, 263/355 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60653 ms. Remains : 181/209 places, 263/355 transitions.
[2024-05-21 20:23:22] [INFO ] Flatten gal took : 9 ms
[2024-05-21 20:23:22] [INFO ] Flatten gal took : 9 ms
[2024-05-21 20:23:22] [INFO ] Input system was already deterministic with 263 transitions.
[2024-05-21 20:23:22] [INFO ] Flatten gal took : 9 ms
[2024-05-21 20:23:22] [INFO ] Flatten gal took : 9 ms
[2024-05-21 20:23:22] [INFO ] Time to serialize gal into /tmp/CTLFireability10525613277870996445.gal : 3 ms
[2024-05-21 20:23:22] [INFO ] Time to serialize properties into /tmp/CTLFireability1748404402008527850.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/CTLFireability10525613277870996445.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1748404402008527850.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.44469e+09,8.55895,193120,2,14760,5,726165,6,0,989,931826,0


Converting to forward existential form...Done !
original formula: AX((EX((((EF(((((p50==1)&&(p87==1))&&((p118==1)&&(p143==1)))&&(p179==1))) + E((p115==1) U (p88==1))) + ((p116==1)||(p40==1))) + (p132==1)...502
=> equivalent forward existential formula: ([(EY(Init) * !(EX((((E(TRUE U ((((p50==1)&&(p87==1))&&((p118==1)&&(p143==1)))&&(p179==1))) + E((p115==1) U (p88...1199
Reverse transition relation is NOT exact ! Due to transitions t10, t17, t18, t25, t33, t36, t37, t38, t62, t63, t66, t67, t69, t82, t88, t89, t92, t93, t95...449
Hit Full ! (commute/partial/dont) 261/0/2
Detected timeout of ITS tools.
[2024-05-21 20:23:52] [INFO ] Flatten gal took : 9 ms
[2024-05-21 20:23:52] [INFO ] Applying decomposition
[2024-05-21 20:23:52] [INFO ] Flatten gal took : 10 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/graph11026541132861610447.txt' '-o' '/tmp/graph11026541132861610447.bin' '-w' '/tmp/graph11026541132861610447.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11026541132861610447.bin' '-l' '-1' '-v' '-w' '/tmp/graph11026541132861610447.weights' '-q' '0' '-e' '0.001'
[2024-05-21 20:23:52] [INFO ] Decomposing Gal with order
[2024-05-21 20:23:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 20:23:52] [INFO ] Removed a total of 237 redundant transitions.
[2024-05-21 20:23:52] [INFO ] Flatten gal took : 38 ms
[2024-05-21 20:23:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 18 labels/synchronizations in 7 ms.
[2024-05-21 20:23:52] [INFO ] Time to serialize gal into /tmp/CTLFireability7768322685587176931.gal : 12 ms
[2024-05-21 20:23:52] [INFO ] Time to serialize properties into /tmp/CTLFireability7219958978828077814.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/CTLFireability7768322685587176931.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7219958978828077814.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.44469e+09,0.111279,6812,475,102,4960,815,463,10341,79,4002,0


Converting to forward existential form...Done !
original formula: AX((EX((((EF(((((i4.u14.p50==1)&&(i5.i2.u27.p87==1))&&((i7.i1.u37.p118==1)&&(i10.u44.p143==1)))&&(i0.u53.p179==1))) + E((i7.i1.u36.p115==...778
=> equivalent forward existential formula: ([(EY(Init) * !(EX((((E(TRUE U ((((i4.u14.p50==1)&&(i5.i2.u27.p87==1))&&((i7.i1.u37.p118==1)&&(i10.u44.p143==1))...1714
Reverse transition relation is NOT exact ! Due to transitions t170, t178, t190, t206, t234, t260, i0.u53.t33, i0.u53.t36, i0.u53.t37, i0.u53.t38, i1.t168, ...622
(forward)formula 0,1,0.74984,26084,1,0,44173,2300,3013,73612,418,13264,95357
FORMULA AutonomousCar-PT-04b-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 209/209 places, 355/355 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 185 transition count 331
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 185 transition count 331
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Iterating post reduction 0 with 64 rules applied. Total rules applied 112 place count 185 transition count 267
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 118 place count 179 transition count 261
Iterating global reduction 1 with 6 rules applied. Total rules applied 124 place count 179 transition count 261
Applied a total of 124 rules in 7 ms. Remains 179 /209 variables (removed 30) and now considering 261/355 (removed 94) transitions.
// Phase 1: matrix 261 rows 179 cols
[2024-05-21 20:23:53] [INFO ] Computed 9 invariants in 3 ms
[2024-05-21 20:23:53] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-05-21 20:23:53] [INFO ] Invariant cache hit.
[2024-05-21 20:23:53] [INFO ] Implicit Places using invariants and state equation in 245 ms returned []
Implicit Place search using SMT with State Equation took 348 ms to find 0 implicit places.
Running 260 sub problems to find dead transitions.
[2024-05-21 20:23:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/178 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (OVERLAPS) 1/179 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-21 20:23:57] [INFO ] Deduced a trap composed of 31 places in 200 ms of which 3 ms to minimize.
[2024-05-21 20:23:57] [INFO ] Deduced a trap composed of 17 places in 164 ms of which 3 ms to minimize.
[2024-05-21 20:23:58] [INFO ] Deduced a trap composed of 31 places in 197 ms of which 4 ms to minimize.
[2024-05-21 20:23:58] [INFO ] Deduced a trap composed of 19 places in 169 ms of which 3 ms to minimize.
[2024-05-21 20:23:58] [INFO ] Deduced a trap composed of 23 places in 165 ms of which 3 ms to minimize.
[2024-05-21 20:23:58] [INFO ] Deduced a trap composed of 34 places in 162 ms of which 3 ms to minimize.
[2024-05-21 20:23:59] [INFO ] Deduced a trap composed of 22 places in 176 ms of which 3 ms to minimize.
[2024-05-21 20:23:59] [INFO ] Deduced a trap composed of 24 places in 154 ms of which 3 ms to minimize.
[2024-05-21 20:23:59] [INFO ] Deduced a trap composed of 32 places in 159 ms of which 3 ms to minimize.
[2024-05-21 20:23:59] [INFO ] Deduced a trap composed of 36 places in 155 ms of which 3 ms to minimize.
[2024-05-21 20:23:59] [INFO ] Deduced a trap composed of 75 places in 159 ms of which 3 ms to minimize.
[2024-05-21 20:23:59] [INFO ] Deduced a trap composed of 44 places in 158 ms of which 3 ms to minimize.
[2024-05-21 20:24:00] [INFO ] Deduced a trap composed of 31 places in 136 ms of which 3 ms to minimize.
[2024-05-21 20:24:00] [INFO ] Deduced a trap composed of 40 places in 136 ms of which 3 ms to minimize.
[2024-05-21 20:24:00] [INFO ] Deduced a trap composed of 40 places in 130 ms of which 4 ms to minimize.
[2024-05-21 20:24:00] [INFO ] Deduced a trap composed of 39 places in 117 ms of which 2 ms to minimize.
[2024-05-21 20:24:00] [INFO ] Deduced a trap composed of 31 places in 135 ms of which 3 ms to minimize.
[2024-05-21 20:24:00] [INFO ] Deduced a trap composed of 46 places in 137 ms of which 2 ms to minimize.
[2024-05-21 20:24:01] [INFO ] Deduced a trap composed of 31 places in 160 ms of which 3 ms to minimize.
[2024-05-21 20:24:01] [INFO ] Deduced a trap composed of 40 places in 91 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 20/29 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-21 20:24:01] [INFO ] Deduced a trap composed of 14 places in 127 ms of which 2 ms to minimize.
[2024-05-21 20:24:02] [INFO ] Deduced a trap composed of 32 places in 124 ms of which 3 ms to minimize.
[2024-05-21 20:24:02] [INFO ] Deduced a trap composed of 51 places in 170 ms of which 4 ms to minimize.
[2024-05-21 20:24:02] [INFO ] Deduced a trap composed of 36 places in 152 ms of which 5 ms to minimize.
[2024-05-21 20:24:02] [INFO ] Deduced a trap composed of 33 places in 147 ms of which 3 ms to minimize.
[2024-05-21 20:24:03] [INFO ] Deduced a trap composed of 38 places in 155 ms of which 3 ms to minimize.
[2024-05-21 20:24:03] [INFO ] Deduced a trap composed of 31 places in 149 ms of which 3 ms to minimize.
[2024-05-21 20:24:03] [INFO ] Deduced a trap composed of 31 places in 143 ms of which 3 ms to minimize.
[2024-05-21 20:24:03] [INFO ] Deduced a trap composed of 45 places in 170 ms of which 3 ms to minimize.
[2024-05-21 20:24:03] [INFO ] Deduced a trap composed of 45 places in 139 ms of which 3 ms to minimize.
[2024-05-21 20:24:03] [INFO ] Deduced a trap composed of 42 places in 131 ms of which 3 ms to minimize.
[2024-05-21 20:24:04] [INFO ] Deduced a trap composed of 32 places in 140 ms of which 3 ms to minimize.
[2024-05-21 20:24:04] [INFO ] Deduced a trap composed of 53 places in 150 ms of which 3 ms to minimize.
[2024-05-21 20:24:04] [INFO ] Deduced a trap composed of 31 places in 138 ms of which 3 ms to minimize.
[2024-05-21 20:24:04] [INFO ] Deduced a trap composed of 39 places in 119 ms of which 3 ms to minimize.
[2024-05-21 20:24:04] [INFO ] Deduced a trap composed of 35 places in 128 ms of which 3 ms to minimize.
[2024-05-21 20:24:05] [INFO ] Deduced a trap composed of 25 places in 147 ms of which 3 ms to minimize.
[2024-05-21 20:24:05] [INFO ] Deduced a trap composed of 31 places in 141 ms of which 2 ms to minimize.
[2024-05-21 20:24:05] [INFO ] Deduced a trap composed of 44 places in 137 ms of which 3 ms to minimize.
[2024-05-21 20:24:05] [INFO ] Deduced a trap composed of 32 places in 119 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 20/49 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-21 20:24:07] [INFO ] Deduced a trap composed of 39 places in 59 ms of which 2 ms to minimize.
[2024-05-21 20:24:07] [INFO ] Deduced a trap composed of 32 places in 156 ms of which 3 ms to minimize.
[2024-05-21 20:24:08] [INFO ] Deduced a trap composed of 40 places in 94 ms of which 2 ms to minimize.
[2024-05-21 20:24:08] [INFO ] Deduced a trap composed of 38 places in 109 ms of which 2 ms to minimize.
[2024-05-21 20:24:08] [INFO ] Deduced a trap composed of 51 places in 94 ms of which 2 ms to minimize.
[2024-05-21 20:24:08] [INFO ] Deduced a trap composed of 38 places in 111 ms of which 3 ms to minimize.
[2024-05-21 20:24:09] [INFO ] Deduced a trap composed of 40 places in 101 ms of which 2 ms to minimize.
[2024-05-21 20:24:09] [INFO ] Deduced a trap composed of 51 places in 80 ms of which 1 ms to minimize.
[2024-05-21 20:24:09] [INFO ] Deduced a trap composed of 40 places in 70 ms of which 2 ms to minimize.
[2024-05-21 20:24:09] [INFO ] Deduced a trap composed of 14 places in 147 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 10/59 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-21 20:24:11] [INFO ] Deduced a trap composed of 24 places in 130 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/179 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/179 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (OVERLAPS) 261/440 variables, 179/239 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/440 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-21 20:24:22] [INFO ] Deduced a trap composed of 5 places in 154 ms of which 3 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/440 variables, 1/240 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 440/440 variables, and 240 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 179/179 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 52/52 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/178 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (OVERLAPS) 1/179 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 52/61 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-21 20:24:27] [INFO ] Deduced a trap composed of 39 places in 76 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (OVERLAPS) 261/440 variables, 179/241 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/440 variables, 260/501 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-21 20:24:37] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/440 variables, 1/502 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-21 20:24:40] [INFO ] Deduced a trap composed of 48 places in 102 ms of which 2 ms to minimize.
[2024-05-21 20:24:41] [INFO ] Deduced a trap composed of 27 places in 100 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/440 variables, 2/504 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/440 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 440/440 variables, and 504 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 179/179 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 56/56 constraints]
After SMT, in 60211ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 60215ms
Starting structural reductions in LTL mode, iteration 1 : 179/209 places, 261/355 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60572 ms. Remains : 179/209 places, 261/355 transitions.
[2024-05-21 20:24:53] [INFO ] Flatten gal took : 8 ms
[2024-05-21 20:24:53] [INFO ] Flatten gal took : 7 ms
[2024-05-21 20:24:53] [INFO ] Input system was already deterministic with 261 transitions.
[2024-05-21 20:24:53] [INFO ] Flatten gal took : 8 ms
[2024-05-21 20:24:53] [INFO ] Flatten gal took : 8 ms
[2024-05-21 20:24:53] [INFO ] Time to serialize gal into /tmp/CTLFireability7103567968060316903.gal : 3 ms
[2024-05-21 20:24:53] [INFO ] Time to serialize properties into /tmp/CTLFireability8503379001430877779.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/CTLFireability7103567968060316903.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8503379001430877779.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.39231e+09,9.90224,183228,2,14095,5,712618,6,0,979,899948,0


Converting to forward existential form...Done !
original formula: EX(AX((EG((((p6==0)||(p14==0))||((p145==0)||(p178==0)))) + A((AF((p94==1)) + (((p6==1)&&(p9==1))&&((p107==1)&&(p178==1)))) U (AX((p145==1...174
=> equivalent forward existential formula: [(EY(Init) * !(EX(!((EG((((p6==0)||(p14==0))||((p145==0)||(p178==0)))) + !((E(!((!(EX(!((p145==1)))) * (p212==1)...332
Reverse transition relation is NOT exact ! Due to transitions t10, t16, t17, t24, t32, t35, t36, t37, t61, t62, t65, t66, t68, t81, t88, t89, t92, t93, t95...455
Detected timeout of ITS tools.
[2024-05-21 20:25:23] [INFO ] Flatten gal took : 7 ms
[2024-05-21 20:25:23] [INFO ] Applying decomposition
[2024-05-21 20:25:23] [INFO ] Flatten gal took : 9 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/graph16722514997876567588.txt' '-o' '/tmp/graph16722514997876567588.bin' '-w' '/tmp/graph16722514997876567588.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16722514997876567588.bin' '-l' '-1' '-v' '-w' '/tmp/graph16722514997876567588.weights' '-q' '0' '-e' '0.001'
[2024-05-21 20:25:24] [INFO ] Decomposing Gal with order
[2024-05-21 20:25:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 20:25:24] [INFO ] Removed a total of 238 redundant transitions.
[2024-05-21 20:25:24] [INFO ] Flatten gal took : 19 ms
[2024-05-21 20:25:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 26 labels/synchronizations in 4 ms.
[2024-05-21 20:25:24] [INFO ] Time to serialize gal into /tmp/CTLFireability4155367854520932318.gal : 3 ms
[2024-05-21 20:25:24] [INFO ] Time to serialize properties into /tmp/CTLFireability15702271367132020249.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/CTLFireability4155367854520932318.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15702271367132020249.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,1.39231e+09,0.065951,5412,399,100,2787,519,435,3879,76,1464,0


Converting to forward existential form...Done !
original formula: EX(AX((EG((((i10.u2.p6==0)||(i10.u2.p14==0))||((i8.u44.p145==0)||(i10.u2.p178==0)))) + A((AF((i5.i0.u30.p94==1)) + (((i10.u2.p6==1)&&(i10...261
=> equivalent forward existential formula: [(EY(Init) * !(EX(!((EG((((i10.u2.p6==0)||(i10.u2.p14==0))||((i8.u44.p145==0)||(i10.u2.p178==0)))) + !((E(!((!(E...455
Reverse transition relation is NOT exact ! Due to transitions t168, t177, t189, t205, t229, t258, i2.i0.u15.t143, i2.i0.u15.t146, i2.i0.u16.t144, i2.i1.t15...636
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 an SCC at level 1
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
(forward)formula 0,1,6.35856,181764,1,0,374211,2713,2797,445390,413,12996,384505
FORMULA AutonomousCar-PT-04b-CTLFireability-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 209/209 places, 355/355 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 185 transition count 331
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 185 transition count 331
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Iterating post reduction 0 with 64 rules applied. Total rules applied 112 place count 185 transition count 267
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 118 place count 179 transition count 261
Iterating global reduction 1 with 6 rules applied. Total rules applied 124 place count 179 transition count 261
Applied a total of 124 rules in 8 ms. Remains 179 /209 variables (removed 30) and now considering 261/355 (removed 94) transitions.
// Phase 1: matrix 261 rows 179 cols
[2024-05-21 20:25:30] [INFO ] Computed 9 invariants in 1 ms
[2024-05-21 20:25:30] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-05-21 20:25:30] [INFO ] Invariant cache hit.
[2024-05-21 20:25:30] [INFO ] Implicit Places using invariants and state equation in 194 ms returned []
Implicit Place search using SMT with State Equation took 273 ms to find 0 implicit places.
Running 260 sub problems to find dead transitions.
[2024-05-21 20:25:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/178 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (OVERLAPS) 1/179 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-21 20:25:34] [INFO ] Deduced a trap composed of 23 places in 193 ms of which 4 ms to minimize.
[2024-05-21 20:25:34] [INFO ] Deduced a trap composed of 18 places in 198 ms of which 3 ms to minimize.
[2024-05-21 20:25:34] [INFO ] Deduced a trap composed of 46 places in 173 ms of which 3 ms to minimize.
[2024-05-21 20:25:35] [INFO ] Deduced a trap composed of 39 places in 155 ms of which 3 ms to minimize.
[2024-05-21 20:25:35] [INFO ] Deduced a trap composed of 32 places in 127 ms of which 2 ms to minimize.
[2024-05-21 20:25:35] [INFO ] Deduced a trap composed of 45 places in 164 ms of which 3 ms to minimize.
[2024-05-21 20:25:35] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 1 ms to minimize.
[2024-05-21 20:25:35] [INFO ] Deduced a trap composed of 32 places in 169 ms of which 3 ms to minimize.
[2024-05-21 20:25:36] [INFO ] Deduced a trap composed of 48 places in 159 ms of which 3 ms to minimize.
[2024-05-21 20:25:36] [INFO ] Deduced a trap composed of 34 places in 152 ms of which 2 ms to minimize.
[2024-05-21 20:25:36] [INFO ] Deduced a trap composed of 31 places in 142 ms of which 3 ms to minimize.
[2024-05-21 20:25:36] [INFO ] Deduced a trap composed of 39 places in 170 ms of which 3 ms to minimize.
[2024-05-21 20:25:36] [INFO ] Deduced a trap composed of 33 places in 170 ms of which 3 ms to minimize.
[2024-05-21 20:25:36] [INFO ] Deduced a trap composed of 39 places in 151 ms of which 3 ms to minimize.
[2024-05-21 20:25:37] [INFO ] Deduced a trap composed of 35 places in 166 ms of which 3 ms to minimize.
[2024-05-21 20:25:37] [INFO ] Deduced a trap composed of 25 places in 154 ms of which 3 ms to minimize.
[2024-05-21 20:25:37] [INFO ] Deduced a trap composed of 40 places in 163 ms of which 2 ms to minimize.
[2024-05-21 20:25:37] [INFO ] Deduced a trap composed of 35 places in 152 ms of which 3 ms to minimize.
[2024-05-21 20:25:37] [INFO ] Deduced a trap composed of 31 places in 160 ms of which 3 ms to minimize.
[2024-05-21 20:25:37] [INFO ] Deduced a trap composed of 53 places in 169 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 20/29 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-21 20:25:38] [INFO ] Deduced a trap composed of 46 places in 166 ms of which 2 ms to minimize.
[2024-05-21 20:25:38] [INFO ] Deduced a trap composed of 22 places in 156 ms of which 3 ms to minimize.
[2024-05-21 20:25:38] [INFO ] Deduced a trap composed of 40 places in 139 ms of which 3 ms to minimize.
[2024-05-21 20:25:39] [INFO ] Deduced a trap composed of 24 places in 140 ms of which 2 ms to minimize.
[2024-05-21 20:25:39] [INFO ] Deduced a trap composed of 19 places in 144 ms of which 3 ms to minimize.
[2024-05-21 20:25:39] [INFO ] Deduced a trap composed of 33 places in 130 ms of which 2 ms to minimize.
[2024-05-21 20:25:39] [INFO ] Deduced a trap composed of 39 places in 146 ms of which 3 ms to minimize.
[2024-05-21 20:25:39] [INFO ] Deduced a trap composed of 38 places in 177 ms of which 3 ms to minimize.
[2024-05-21 20:25:40] [INFO ] Deduced a trap composed of 38 places in 108 ms of which 2 ms to minimize.
[2024-05-21 20:25:40] [INFO ] Deduced a trap composed of 44 places in 133 ms of which 2 ms to minimize.
[2024-05-21 20:25:40] [INFO ] Deduced a trap composed of 40 places in 136 ms of which 2 ms to minimize.
[2024-05-21 20:25:40] [INFO ] Deduced a trap composed of 39 places in 134 ms of which 3 ms to minimize.
[2024-05-21 20:25:40] [INFO ] Deduced a trap composed of 33 places in 139 ms of which 3 ms to minimize.
[2024-05-21 20:25:41] [INFO ] Deduced a trap composed of 44 places in 153 ms of which 3 ms to minimize.
[2024-05-21 20:25:41] [INFO ] Deduced a trap composed of 5 places in 167 ms of which 3 ms to minimize.
[2024-05-21 20:25:41] [INFO ] Deduced a trap composed of 31 places in 153 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 16/45 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-21 20:25:44] [INFO ] Deduced a trap composed of 31 places in 137 ms of which 2 ms to minimize.
[2024-05-21 20:25:44] [INFO ] Deduced a trap composed of 14 places in 125 ms of which 2 ms to minimize.
[2024-05-21 20:25:44] [INFO ] Deduced a trap composed of 31 places in 121 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 3/48 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-21 20:25:47] [INFO ] Deduced a trap composed of 31 places in 169 ms of which 2 ms to minimize.
[2024-05-21 20:25:47] [INFO ] Deduced a trap composed of 31 places in 132 ms of which 3 ms to minimize.
[2024-05-21 20:25:48] [INFO ] Deduced a trap composed of 14 places in 174 ms of which 3 ms to minimize.
[2024-05-21 20:25:48] [INFO ] Deduced a trap composed of 32 places in 128 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/179 variables, 4/52 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/179 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (OVERLAPS) 261/440 variables, 179/231 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-21 20:25:54] [INFO ] Deduced a trap composed of 39 places in 60 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/440 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-21 20:25:57] [INFO ] Deduced a trap composed of 40 places in 124 ms of which 3 ms to minimize.
[2024-05-21 20:25:57] [INFO ] Deduced a trap composed of 39 places in 117 ms of which 3 ms to minimize.
[2024-05-21 20:25:57] [INFO ] Deduced a trap composed of 40 places in 96 ms of which 2 ms to minimize.
[2024-05-21 20:25:58] [INFO ] Deduced a trap composed of 31 places in 150 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/440 variables, 4/236 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 440/440 variables, and 236 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 179/179 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 48/48 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/178 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (OVERLAPS) 1/179 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 48/57 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-21 20:26:03] [INFO ] Deduced a trap composed of 32 places in 108 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (OVERLAPS) 261/440 variables, 179/237 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/440 variables, 260/497 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-21 20:26:08] [INFO ] Deduced a trap composed of 46 places in 75 ms of which 2 ms to minimize.
[2024-05-21 20:26:09] [INFO ] Deduced a trap composed of 40 places in 72 ms of which 2 ms to minimize.
[2024-05-21 20:26:10] [INFO ] Deduced a trap composed of 32 places in 176 ms of which 3 ms to minimize.
[2024-05-21 20:26:11] [INFO ] Deduced a trap composed of 51 places in 104 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/440 variables, 4/501 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-21 20:26:16] [INFO ] Deduced a trap composed of 51 places in 94 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/440 variables, 1/502 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/440 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-21 20:26:29] [INFO ] Deduced a trap composed of 52 places in 87 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 440/440 variables, and 503 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 179/179 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 55/55 constraints]
After SMT, in 60184ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 60187ms
Starting structural reductions in LTL mode, iteration 1 : 179/209 places, 261/355 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60469 ms. Remains : 179/209 places, 261/355 transitions.
[2024-05-21 20:26:30] [INFO ] Flatten gal took : 8 ms
[2024-05-21 20:26:30] [INFO ] Flatten gal took : 7 ms
[2024-05-21 20:26:30] [INFO ] Input system was already deterministic with 261 transitions.
[2024-05-21 20:26:30] [INFO ] Flatten gal took : 8 ms
[2024-05-21 20:26:30] [INFO ] Flatten gal took : 8 ms
[2024-05-21 20:26:30] [INFO ] Time to serialize gal into /tmp/CTLFireability1635515611130250140.gal : 3 ms
[2024-05-21 20:26:30] [INFO ] Time to serialize properties into /tmp/CTLFireability7253495004739865434.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/CTLFireability1635515611130250140.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7253495004739865434.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.45023e+09,8.82111,190488,2,13749,5,723209,6,0,979,937882,0


Converting to forward existential form...Done !
original formula: EG(((AG(!(A(((p38==1)||(((p6==1)&&(p16==1))&&((p107==1)&&(p178==1)))) U ((p60==1)||(p139==1))))) + EG((p85==0))) + EX((((EX((p212==0)) * ...204
=> equivalent forward existential formula: [FwdG(Init,((!(E(TRUE U !(!(!((E(!(((p60==1)||(p139==1))) U (!(((p38==1)||(((p6==1)&&(p16==1))&&((p107==1)&&(p17...330
Reverse transition relation is NOT exact ! Due to transitions t10, t16, t17, t24, t32, t35, t36, t37, t61, t62, t65, t66, t68, t81, t87, t88, t91, t92, t94...449
Detected timeout of ITS tools.
[2024-05-21 20:27:01] [INFO ] Flatten gal took : 8 ms
[2024-05-21 20:27:01] [INFO ] Applying decomposition
[2024-05-21 20:27:01] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph2576051159020387600.txt' '-o' '/tmp/graph2576051159020387600.bin' '-w' '/tmp/graph2576051159020387600.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2576051159020387600.bin' '-l' '-1' '-v' '-w' '/tmp/graph2576051159020387600.weights' '-q' '0' '-e' '0.001'
[2024-05-21 20:27:01] [INFO ] Decomposing Gal with order
[2024-05-21 20:27:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 20:27:01] [INFO ] Removed a total of 245 redundant transitions.
[2024-05-21 20:27:01] [INFO ] Flatten gal took : 17 ms
[2024-05-21 20:27:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 18 labels/synchronizations in 25 ms.
[2024-05-21 20:27:01] [INFO ] Time to serialize gal into /tmp/CTLFireability9240822589442564733.gal : 10 ms
[2024-05-21 20:27:01] [INFO ] Time to serialize properties into /tmp/CTLFireability5022119321354316027.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/CTLFireability9240822589442564733.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5022119321354316027.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.45023e+09,0.094283,6216,506,99,4977,484,444,6957,78,1376,0


Converting to forward existential form...Done !
original formula: EG(((AG(!(A(((i2.i0.u10.p38==1)||(((i0.u1.p6==1)&&(i0.u1.p16==1))&&((i6.i1.u27.p107==1)&&(i0.u1.p178==1)))) U ((i4.i1.u17.p60==1)||(i9.i1...311
=> equivalent forward existential formula: [FwdG(Init,((!(E(TRUE U !(!(!((E(!(((i4.i1.u17.p60==1)||(i9.i1.u42.p139==1))) U (!(((i2.i0.u10.p38==1)||(((i0.u1...477
Reverse transition relation is NOT exact ! Due to transitions t173, t189, t209, t233, t258, i0.t168, i0.t166, i3.t159, i3.u8.t139, i3.u14.t143, i3.u14.t144...656
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 4
Fast SCC detection found a local SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
(forward)formula 0,1,22.0562,623712,1,0,1.33015e+06,2844,2943,1.53255e+06,410,17088,1410773
FORMULA AutonomousCar-PT-04b-CTLFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 209/209 places, 355/355 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 186 transition count 332
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 186 transition count 332
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Iterating post reduction 0 with 64 rules applied. Total rules applied 110 place count 186 transition count 268
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 115 place count 181 transition count 263
Iterating global reduction 1 with 5 rules applied. Total rules applied 120 place count 181 transition count 263
Applied a total of 120 rules in 9 ms. Remains 181 /209 variables (removed 28) and now considering 263/355 (removed 92) transitions.
// Phase 1: matrix 263 rows 181 cols
[2024-05-21 20:27:23] [INFO ] Computed 9 invariants in 2 ms
[2024-05-21 20:27:23] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-21 20:27:23] [INFO ] Invariant cache hit.
[2024-05-21 20:27:23] [INFO ] Implicit Places using invariants and state equation in 185 ms returned []
Implicit Place search using SMT with State Equation took 266 ms to find 0 implicit places.
Running 262 sub problems to find dead transitions.
[2024-05-21 20:27:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (OVERLAPS) 1/181 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-21 20:27:27] [INFO ] Deduced a trap composed of 17 places in 196 ms of which 4 ms to minimize.
[2024-05-21 20:27:27] [INFO ] Deduced a trap composed of 14 places in 172 ms of which 3 ms to minimize.
[2024-05-21 20:27:27] [INFO ] Deduced a trap composed of 18 places in 155 ms of which 3 ms to minimize.
[2024-05-21 20:27:27] [INFO ] Deduced a trap composed of 44 places in 161 ms of which 3 ms to minimize.
[2024-05-21 20:27:28] [INFO ] Deduced a trap composed of 27 places in 170 ms of which 3 ms to minimize.
[2024-05-21 20:27:28] [INFO ] Deduced a trap composed of 32 places in 165 ms of which 3 ms to minimize.
[2024-05-21 20:27:28] [INFO ] Deduced a trap composed of 35 places in 159 ms of which 3 ms to minimize.
[2024-05-21 20:27:28] [INFO ] Deduced a trap composed of 36 places in 197 ms of which 3 ms to minimize.
[2024-05-21 20:27:28] [INFO ] Deduced a trap composed of 25 places in 172 ms of which 2 ms to minimize.
[2024-05-21 20:27:29] [INFO ] Deduced a trap composed of 26 places in 157 ms of which 3 ms to minimize.
[2024-05-21 20:27:29] [INFO ] Deduced a trap composed of 39 places in 164 ms of which 3 ms to minimize.
[2024-05-21 20:27:29] [INFO ] Deduced a trap composed of 34 places in 163 ms of which 3 ms to minimize.
[2024-05-21 20:27:29] [INFO ] Deduced a trap composed of 38 places in 157 ms of which 3 ms to minimize.
[2024-05-21 20:27:29] [INFO ] Deduced a trap composed of 22 places in 151 ms of which 3 ms to minimize.
[2024-05-21 20:27:30] [INFO ] Deduced a trap composed of 31 places in 176 ms of which 3 ms to minimize.
[2024-05-21 20:27:30] [INFO ] Deduced a trap composed of 33 places in 170 ms of which 3 ms to minimize.
[2024-05-21 20:27:30] [INFO ] Deduced a trap composed of 31 places in 122 ms of which 3 ms to minimize.
[2024-05-21 20:27:30] [INFO ] Deduced a trap composed of 31 places in 141 ms of which 3 ms to minimize.
[2024-05-21 20:27:30] [INFO ] Deduced a trap composed of 47 places in 130 ms of which 3 ms to minimize.
[2024-05-21 20:27:31] [INFO ] Deduced a trap composed of 39 places in 123 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/181 variables, 20/29 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-21 20:27:31] [INFO ] Deduced a trap composed of 41 places in 54 ms of which 1 ms to minimize.
[2024-05-21 20:27:31] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 2 ms to minimize.
[2024-05-21 20:27:31] [INFO ] Deduced a trap composed of 38 places in 88 ms of which 2 ms to minimize.
[2024-05-21 20:27:31] [INFO ] Deduced a trap composed of 40 places in 92 ms of which 2 ms to minimize.
[2024-05-21 20:27:32] [INFO ] Deduced a trap composed of 38 places in 87 ms of which 2 ms to minimize.
[2024-05-21 20:27:32] [INFO ] Deduced a trap composed of 32 places in 149 ms of which 3 ms to minimize.
[2024-05-21 20:27:32] [INFO ] Deduced a trap composed of 33 places in 145 ms of which 3 ms to minimize.
[2024-05-21 20:27:32] [INFO ] Deduced a trap composed of 32 places in 141 ms of which 3 ms to minimize.
[2024-05-21 20:27:33] [INFO ] Deduced a trap composed of 40 places in 123 ms of which 2 ms to minimize.
[2024-05-21 20:27:33] [INFO ] Deduced a trap composed of 38 places in 143 ms of which 3 ms to minimize.
[2024-05-21 20:27:33] [INFO ] Deduced a trap composed of 31 places in 129 ms of which 3 ms to minimize.
[2024-05-21 20:27:33] [INFO ] Deduced a trap composed of 32 places in 141 ms of which 3 ms to minimize.
[2024-05-21 20:27:34] [INFO ] Deduced a trap composed of 14 places in 170 ms of which 3 ms to minimize.
[2024-05-21 20:27:34] [INFO ] Deduced a trap composed of 5 places in 118 ms of which 2 ms to minimize.
[2024-05-21 20:27:34] [INFO ] Deduced a trap composed of 21 places in 104 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 15/44 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-21 20:27:37] [INFO ] Deduced a trap composed of 32 places in 54 ms of which 2 ms to minimize.
[2024-05-21 20:27:37] [INFO ] Deduced a trap composed of 39 places in 113 ms of which 3 ms to minimize.
[2024-05-21 20:27:38] [INFO ] Deduced a trap composed of 23 places in 133 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/181 variables, 3/47 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-21 20:27:40] [INFO ] Deduced a trap composed of 32 places in 138 ms of which 3 ms to minimize.
[2024-05-21 20:27:40] [INFO ] Deduced a trap composed of 34 places in 141 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/181 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-21 20:27:42] [INFO ] Deduced a trap composed of 38 places in 121 ms of which 2 ms to minimize.
[2024-05-21 20:27:42] [INFO ] Deduced a trap composed of 51 places in 113 ms of which 2 ms to minimize.
[2024-05-21 20:27:42] [INFO ] Deduced a trap composed of 51 places in 104 ms of which 2 ms to minimize.
[2024-05-21 20:27:43] [INFO ] Deduced a trap composed of 33 places in 142 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/181 variables, 4/53 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/181 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 8 (OVERLAPS) 263/444 variables, 181/234 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/444 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 444/444 variables, and 234 constraints, problems are : Problem set: 0 solved, 262 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 181/181 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 44/44 constraints]
Escalating to Integer solving :Problem set: 0 solved, 262 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (OVERLAPS) 1/181 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/181 variables, 44/53 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (OVERLAPS) 263/444 variables, 181/234 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/444 variables, 262/496 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/444 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (OVERLAPS) 0/444 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Int declared 444/444 variables, and 496 constraints, problems are : Problem set: 0 solved, 262 unsolved in 21918 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 181/181 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 44/44 constraints]
After SMT, in 52072ms problems are : Problem set: 0 solved, 262 unsolved
Search for dead transitions found 0 dead transitions in 52075ms
Starting structural reductions in LTL mode, iteration 1 : 181/209 places, 263/355 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52351 ms. Remains : 181/209 places, 263/355 transitions.
[2024-05-21 20:28:15] [INFO ] Flatten gal took : 7 ms
[2024-05-21 20:28:15] [INFO ] Flatten gal took : 13 ms
[2024-05-21 20:28:15] [INFO ] Input system was already deterministic with 263 transitions.
[2024-05-21 20:28:15] [INFO ] Flatten gal took : 11 ms
[2024-05-21 20:28:15] [INFO ] Flatten gal took : 11 ms
[2024-05-21 20:28:15] [INFO ] Time to serialize gal into /tmp/CTLFireability16388915197380523832.gal : 3 ms
[2024-05-21 20:28:15] [INFO ] Time to serialize properties into /tmp/CTLFireability11282852139541100334.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/CTLFireability16388915197380523832.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11282852139541100334.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.55925e+09,8.93049,189120,2,14788,5,719350,6,0,989,930499,0


Converting to forward existential form...Done !
original formula: AF((EF(((p80==1)||(((p6==1)&&(p9==1))&&((p126==1)&&(p178==1))))) + (E((p91==1) U EG(A((p111==1) U (p203==1)))) * ((p59==1) + (EX((((p6==1...248
=> equivalent forward existential formula: [FwdG(Init,!((E(TRUE U ((p80==1)||(((p6==1)&&(p9==1))&&((p126==1)&&(p178==1))))) + (E((p91==1) U EG(!((E(!((p203...358
Reverse transition relation is NOT exact ! Due to transitions t10, t16, t17, t25, t33, t36, t37, t38, t62, t63, t66, t67, t69, t82, t88, t89, t92, t93, t95...449
Detected timeout of ITS tools.
[2024-05-21 20:28:45] [INFO ] Flatten gal took : 7 ms
[2024-05-21 20:28:45] [INFO ] Applying decomposition
[2024-05-21 20:28:45] [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/graph11747624696918485572.txt' '-o' '/tmp/graph11747624696918485572.bin' '-w' '/tmp/graph11747624696918485572.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11747624696918485572.bin' '-l' '-1' '-v' '-w' '/tmp/graph11747624696918485572.weights' '-q' '0' '-e' '0.001'
[2024-05-21 20:28:45] [INFO ] Decomposing Gal with order
[2024-05-21 20:28:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 20:28:45] [INFO ] Removed a total of 240 redundant transitions.
[2024-05-21 20:28:45] [INFO ] Flatten gal took : 21 ms
[2024-05-21 20:28:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 18 labels/synchronizations in 5 ms.
[2024-05-21 20:28:45] [INFO ] Time to serialize gal into /tmp/CTLFireability14030761968160992282.gal : 9 ms
[2024-05-21 20:28:45] [INFO ] Time to serialize properties into /tmp/CTLFireability11358031539476328576.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/CTLFireability14030761968160992282.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11358031539476328576.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.55925e+09,0.095497,6288,531,102,4900,572,455,6945,76,1945,0


Converting to forward existential form...Done !
original formula: AF((EF(((i5.i0.u25.p80==1)||(((i0.u1.p6==1)&&(i0.u1.p9==1))&&((i10.i0.u41.p126==1)&&(i0.u1.p178==1))))) + (E((i7.i0.u29.p91==1) U EG(A((i...378
=> equivalent forward existential formula: [FwdG(Init,!((E(TRUE U ((i5.i0.u25.p80==1)||(((i0.u1.p6==1)&&(i0.u1.p9==1))&&((i10.i0.u41.p126==1)&&(i0.u1.p178=...510
Reverse transition relation is NOT exact ! Due to transitions t169, t177, t189, t209, t233, t260, i0.t167, i1.u55.t33, i1.u55.t36, i1.u55.t37, i1.u55.t38, ...641
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
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 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
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
(forward)formula 0,1,8.76796,260784,1,0,569753,2700,3242,650925,440,15116,731014
FORMULA AutonomousCar-PT-04b-CTLFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 209/209 places, 355/355 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 186 transition count 332
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 186 transition count 332
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 52 place count 180 transition count 326
Iterating global reduction 0 with 6 rules applied. Total rules applied 58 place count 180 transition count 326
Applied a total of 58 rules in 5 ms. Remains 180 /209 variables (removed 29) and now considering 326/355 (removed 29) transitions.
// Phase 1: matrix 326 rows 180 cols
[2024-05-21 20:28:54] [INFO ] Computed 9 invariants in 2 ms
[2024-05-21 20:28:54] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-21 20:28:54] [INFO ] Invariant cache hit.
[2024-05-21 20:28:54] [INFO ] Implicit Places using invariants and state equation in 188 ms returned []
Implicit Place search using SMT with State Equation took 269 ms to find 0 implicit places.
Running 325 sub problems to find dead transitions.
[2024-05-21 20:28:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 1 (OVERLAPS) 1/180 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 325 unsolved
[2024-05-21 20:29:00] [INFO ] Deduced a trap composed of 23 places in 218 ms of which 3 ms to minimize.
[2024-05-21 20:29:00] [INFO ] Deduced a trap composed of 18 places in 189 ms of which 2 ms to minimize.
[2024-05-21 20:29:00] [INFO ] Deduced a trap composed of 48 places in 185 ms of which 3 ms to minimize.
[2024-05-21 20:29:00] [INFO ] Deduced a trap composed of 28 places in 188 ms of which 3 ms to minimize.
[2024-05-21 20:29:01] [INFO ] Deduced a trap composed of 36 places in 181 ms of which 3 ms to minimize.
[2024-05-21 20:29:01] [INFO ] Deduced a trap composed of 40 places in 165 ms of which 2 ms to minimize.
[2024-05-21 20:29:01] [INFO ] Deduced a trap composed of 21 places in 114 ms of which 3 ms to minimize.
[2024-05-21 20:29:01] [INFO ] Deduced a trap composed of 32 places in 137 ms of which 2 ms to minimize.
[2024-05-21 20:29:01] [INFO ] Deduced a trap composed of 18 places in 180 ms of which 3 ms to minimize.
[2024-05-21 20:29:02] [INFO ] Deduced a trap composed of 22 places in 173 ms of which 3 ms to minimize.
[2024-05-21 20:29:02] [INFO ] Deduced a trap composed of 33 places in 153 ms of which 3 ms to minimize.
[2024-05-21 20:29:02] [INFO ] Deduced a trap composed of 33 places in 150 ms of which 3 ms to minimize.
[2024-05-21 20:29:02] [INFO ] Deduced a trap composed of 31 places in 171 ms of which 3 ms to minimize.
[2024-05-21 20:29:02] [INFO ] Deduced a trap composed of 35 places in 188 ms of which 2 ms to minimize.
[2024-05-21 20:29:03] [INFO ] Deduced a trap composed of 32 places in 198 ms of which 3 ms to minimize.
[2024-05-21 20:29:03] [INFO ] Deduced a trap composed of 32 places in 167 ms of which 3 ms to minimize.
[2024-05-21 20:29:03] [INFO ] Deduced a trap composed of 24 places in 158 ms of which 3 ms to minimize.
[2024-05-21 20:29:03] [INFO ] Deduced a trap composed of 49 places in 185 ms of which 3 ms to minimize.
[2024-05-21 20:29:03] [INFO ] Deduced a trap composed of 26 places in 177 ms of which 3 ms to minimize.
[2024-05-21 20:29:04] [INFO ] Deduced a trap composed of 33 places in 198 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 20/29 constraints. Problems are: Problem set: 0 solved, 325 unsolved
[2024-05-21 20:29:05] [INFO ] Deduced a trap composed of 38 places in 135 ms of which 2 ms to minimize.
[2024-05-21 20:29:05] [INFO ] Deduced a trap composed of 32 places in 155 ms of which 3 ms to minimize.
[2024-05-21 20:29:05] [INFO ] Deduced a trap composed of 39 places in 108 ms of which 2 ms to minimize.
[2024-05-21 20:29:05] [INFO ] Deduced a trap composed of 38 places in 104 ms of which 2 ms to minimize.
[2024-05-21 20:29:05] [INFO ] Deduced a trap composed of 42 places in 101 ms of which 2 ms to minimize.
[2024-05-21 20:29:05] [INFO ] Deduced a trap composed of 39 places in 90 ms of which 2 ms to minimize.
[2024-05-21 20:29:06] [INFO ] Deduced a trap composed of 31 places in 136 ms of which 2 ms to minimize.
[2024-05-21 20:29:06] [INFO ] Deduced a trap composed of 14 places in 186 ms of which 3 ms to minimize.
[2024-05-21 20:29:06] [INFO ] Deduced a trap composed of 38 places in 131 ms of which 2 ms to minimize.
[2024-05-21 20:29:06] [INFO ] Deduced a trap composed of 31 places in 128 ms of which 2 ms to minimize.
[2024-05-21 20:29:07] [INFO ] Deduced a trap composed of 40 places in 120 ms of which 2 ms to minimize.
[2024-05-21 20:29:07] [INFO ] Deduced a trap composed of 52 places in 95 ms of which 2 ms to minimize.
[2024-05-21 20:29:07] [INFO ] Deduced a trap composed of 20 places in 153 ms of which 2 ms to minimize.
[2024-05-21 20:29:07] [INFO ] Deduced a trap composed of 9 places in 149 ms of which 3 ms to minimize.
[2024-05-21 20:29:07] [INFO ] Deduced a trap composed of 15 places in 135 ms of which 2 ms to minimize.
[2024-05-21 20:29:07] [INFO ] Deduced a trap composed of 10 places in 119 ms of which 2 ms to minimize.
[2024-05-21 20:29:09] [INFO ] Deduced a trap composed of 19 places in 84 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/180 variables, 17/46 constraints. Problems are: Problem set: 0 solved, 325 unsolved
[2024-05-21 20:29:11] [INFO ] Deduced a trap composed of 35 places in 132 ms of which 2 ms to minimize.
[2024-05-21 20:29:12] [INFO ] Deduced a trap composed of 31 places in 146 ms of which 3 ms to minimize.
[2024-05-21 20:29:12] [INFO ] Deduced a trap composed of 38 places in 98 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/180 variables, 3/49 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/180 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 6 (OVERLAPS) 326/506 variables, 180/229 constraints. Problems are: Problem set: 0 solved, 325 unsolved
[2024-05-21 20:29:21] [INFO ] Deduced a trap composed of 40 places in 61 ms of which 1 ms to minimize.
[2024-05-21 20:29:22] [INFO ] Deduced a trap composed of 31 places in 93 ms of which 2 ms to minimize.
[2024-05-21 20:29:23] [INFO ] Deduced a trap composed of 6 places in 126 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 506/506 variables, and 232 constraints, problems are : Problem set: 0 solved, 325 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 180/180 constraints, PredecessorRefiner: 325/325 constraints, Known Traps: 43/43 constraints]
Escalating to Integer solving :Problem set: 0 solved, 325 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 1 (OVERLAPS) 1/180 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 43/52 constraints. Problems are: Problem set: 0 solved, 325 unsolved
[2024-05-21 20:29:28] [INFO ] Deduced a trap composed of 33 places in 50 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/180 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 325 unsolved
[2024-05-21 20:29:31] [INFO ] Deduced a trap composed of 40 places in 130 ms of which 2 ms to minimize.
[2024-05-21 20:29:31] [INFO ] Deduced a trap composed of 52 places in 104 ms of which 3 ms to minimize.
[2024-05-21 20:29:31] [INFO ] Deduced a trap composed of 52 places in 101 ms of which 2 ms to minimize.
[2024-05-21 20:29:32] [INFO ] Deduced a trap composed of 31 places in 114 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/180 variables, 4/57 constraints. Problems are: Problem set: 0 solved, 325 unsolved
[2024-05-21 20:29:34] [INFO ] Deduced a trap composed of 40 places in 80 ms of which 2 ms to minimize.
[2024-05-21 20:29:35] [INFO ] Deduced a trap composed of 40 places in 75 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/180 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/180 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 7 (OVERLAPS) 326/506 variables, 180/239 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/506 variables, 325/564 constraints. Problems are: Problem set: 0 solved, 325 unsolved
[2024-05-21 20:29:44] [INFO ] Deduced a trap composed of 47 places in 115 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/506 variables, 1/565 constraints. Problems are: Problem set: 0 solved, 325 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 506/506 variables, and 565 constraints, problems are : Problem set: 0 solved, 325 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 180/180 constraints, PredecessorRefiner: 325/325 constraints, Known Traps: 51/51 constraints]
After SMT, in 60584ms problems are : Problem set: 0 solved, 325 unsolved
Search for dead transitions found 0 dead transitions in 60588ms
Starting structural reductions in LTL mode, iteration 1 : 180/209 places, 326/355 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60863 ms. Remains : 180/209 places, 326/355 transitions.
[2024-05-21 20:29:55] [INFO ] Flatten gal took : 14 ms
[2024-05-21 20:29:55] [INFO ] Flatten gal took : 14 ms
[2024-05-21 20:29:55] [INFO ] Input system was already deterministic with 326 transitions.
[2024-05-21 20:29:55] [INFO ] Flatten gal took : 13 ms
[2024-05-21 20:29:55] [INFO ] Flatten gal took : 13 ms
[2024-05-21 20:29:55] [INFO ] Time to serialize gal into /tmp/CTLFireability13686506305978928748.gal : 3 ms
[2024-05-21 20:29:55] [INFO ] Time to serialize properties into /tmp/CTLFireability1652180747959083.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/CTLFireability13686506305978928748.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1652180747959083.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 -...281
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.86712e+09,10.8175,222248,2,15397,5,824134,6,0,1048,1.01459e+06,0


Converting to forward existential form...Done !
original formula: AX(EX((AG(((p4==0)&&(((p6==0)||(p14==0))||((p107==0)||(p178==0))))) * ((EG(((((p56==0)||(p81==0))||((p118==0)||(p143==0)))||(p179==0))) +...193
=> equivalent forward existential formula: [(EY(Init) * !(EX((!(E(TRUE U !(((p4==0)&&(((p6==0)||(p14==0))||((p107==0)||(p178==0))))))) * ((EG(((((p56==0)||...252
Reverse transition relation is NOT exact ! Due to transitions t10, t16, t17, t24, t32, t35, t36, t37, t62, t63, t66, t67, t69, t82, t88, t89, t92, t93, t95...551
Detected timeout of ITS tools.
[2024-05-21 20:30:25] [INFO ] Flatten gal took : 9 ms
[2024-05-21 20:30:25] [INFO ] Applying decomposition
[2024-05-21 20:30:25] [INFO ] Flatten gal took : 13 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/graph4530558576751178837.txt' '-o' '/tmp/graph4530558576751178837.bin' '-w' '/tmp/graph4530558576751178837.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4530558576751178837.bin' '-l' '-1' '-v' '-w' '/tmp/graph4530558576751178837.weights' '-q' '0' '-e' '0.001'
[2024-05-21 20:30:25] [INFO ] Decomposing Gal with order
[2024-05-21 20:30:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 20:30:25] [INFO ] Removed a total of 394 redundant transitions.
[2024-05-21 20:30:25] [INFO ] Flatten gal took : 37 ms
[2024-05-21 20:30:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 26 labels/synchronizations in 7 ms.
[2024-05-21 20:30:25] [INFO ] Time to serialize gal into /tmp/CTLFireability190496496026512615.gal : 4 ms
[2024-05-21 20:30:25] [INFO ] Time to serialize properties into /tmp/CTLFireability7237248448080041746.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/CTLFireability190496496026512615.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7237248448080041746.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.86712e+09,0.114953,5480,489,102,3013,1090,445,3571,86,2987,0


Converting to forward existential form...Done !
original formula: AX(EX((AG(((u54.p4==0)&&(((u54.p6==0)||(u54.p14==0))||((i6.i1.u27.p107==0)||(u54.p178==0))))) * ((EG(((((i3.u16.p56==0)||(i5.u23.p81==0))...285
=> equivalent forward existential formula: [(EY(Init) * !(EX((!(E(TRUE U !(((u54.p4==0)&&(((u54.p6==0)||(u54.p14==0))||((i6.i1.u27.p107==0)||(u54.p178==0))...344
Reverse transition relation is NOT exact ! Due to transitions t166, t168, t178, t210, t242, t290, t323, u54.t169, i3.t159, i3.u8.t139, i3.u14.t143, i3.u14....621
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
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 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
(forward)formula 0,0,7.00845,181040,1,0,380700,4929,2950,477138,508,43072,460965
FORMULA AutonomousCar-PT-04b-CTLFireability-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 209/209 places, 355/355 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 186 transition count 332
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 186 transition count 332
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Iterating post reduction 0 with 64 rules applied. Total rules applied 110 place count 186 transition count 268
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 115 place count 181 transition count 263
Iterating global reduction 1 with 5 rules applied. Total rules applied 120 place count 181 transition count 263
Applied a total of 120 rules in 13 ms. Remains 181 /209 variables (removed 28) and now considering 263/355 (removed 92) transitions.
// Phase 1: matrix 263 rows 181 cols
[2024-05-21 20:30:32] [INFO ] Computed 9 invariants in 2 ms
[2024-05-21 20:30:33] [INFO ] Implicit Places using invariants in 126 ms returned []
[2024-05-21 20:30:33] [INFO ] Invariant cache hit.
[2024-05-21 20:30:33] [INFO ] Implicit Places using invariants and state equation in 277 ms returned []
Implicit Place search using SMT with State Equation took 406 ms to find 0 implicit places.
Running 262 sub problems to find dead transitions.
[2024-05-21 20:30:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (OVERLAPS) 1/181 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-21 20:30:37] [INFO ] Deduced a trap composed of 17 places in 183 ms of which 4 ms to minimize.
[2024-05-21 20:30:37] [INFO ] Deduced a trap composed of 20 places in 152 ms of which 3 ms to minimize.
[2024-05-21 20:30:37] [INFO ] Deduced a trap composed of 39 places in 161 ms of which 3 ms to minimize.
[2024-05-21 20:30:37] [INFO ] Deduced a trap composed of 34 places in 147 ms of which 3 ms to minimize.
[2024-05-21 20:30:38] [INFO ] Deduced a trap composed of 24 places in 167 ms of which 3 ms to minimize.
[2024-05-21 20:30:38] [INFO ] Deduced a trap composed of 48 places in 154 ms of which 3 ms to minimize.
[2024-05-21 20:30:38] [INFO ] Deduced a trap composed of 31 places in 144 ms of which 3 ms to minimize.
[2024-05-21 20:30:38] [INFO ] Deduced a trap composed of 14 places in 160 ms of which 3 ms to minimize.
[2024-05-21 20:30:38] [INFO ] Deduced a trap composed of 48 places in 162 ms of which 3 ms to minimize.
[2024-05-21 20:30:38] [INFO ] Deduced a trap composed of 39 places in 160 ms of which 3 ms to minimize.
[2024-05-21 20:30:39] [INFO ] Deduced a trap composed of 28 places in 59 ms of which 2 ms to minimize.
[2024-05-21 20:30:39] [INFO ] Deduced a trap composed of 23 places in 174 ms of which 3 ms to minimize.
[2024-05-21 20:30:39] [INFO ] Deduced a trap composed of 36 places in 165 ms of which 3 ms to minimize.
[2024-05-21 20:30:39] [INFO ] Deduced a trap composed of 32 places in 190 ms of which 3 ms to minimize.
[2024-05-21 20:30:40] [INFO ] Deduced a trap composed of 31 places in 147 ms of which 2 ms to minimize.
[2024-05-21 20:30:40] [INFO ] Deduced a trap composed of 38 places in 131 ms of which 2 ms to minimize.
[2024-05-21 20:30:40] [INFO ] Deduced a trap composed of 34 places in 141 ms of which 3 ms to minimize.
[2024-05-21 20:30:40] [INFO ] Deduced a trap composed of 43 places in 118 ms of which 3 ms to minimize.
[2024-05-21 20:30:40] [INFO ] Deduced a trap composed of 43 places in 117 ms of which 2 ms to minimize.
[2024-05-21 20:30:40] [INFO ] Deduced a trap composed of 43 places in 96 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/181 variables, 20/29 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-21 20:30:41] [INFO ] Deduced a trap composed of 41 places in 125 ms of which 3 ms to minimize.
[2024-05-21 20:30:41] [INFO ] Deduced a trap composed of 33 places in 137 ms of which 3 ms to minimize.
[2024-05-21 20:30:41] [INFO ] Deduced a trap composed of 40 places in 141 ms of which 12 ms to minimize.
[2024-05-21 20:30:41] [INFO ] Deduced a trap composed of 33 places in 114 ms of which 2 ms to minimize.
[2024-05-21 20:30:42] [INFO ] Deduced a trap composed of 19 places in 159 ms of which 3 ms to minimize.
[2024-05-21 20:30:42] [INFO ] Deduced a trap composed of 39 places in 148 ms of which 3 ms to minimize.
[2024-05-21 20:30:42] [INFO ] Deduced a trap composed of 38 places in 119 ms of which 2 ms to minimize.
[2024-05-21 20:30:42] [INFO ] Deduced a trap composed of 40 places in 100 ms of which 2 ms to minimize.
[2024-05-21 20:30:43] [INFO ] Deduced a trap composed of 38 places in 102 ms of which 2 ms to minimize.
[2024-05-21 20:30:43] [INFO ] Deduced a trap composed of 39 places in 155 ms of which 2 ms to minimize.
[2024-05-21 20:30:43] [INFO ] Deduced a trap composed of 5 places in 139 ms of which 2 ms to minimize.
[2024-05-21 20:30:43] [INFO ] Deduced a trap composed of 19 places in 122 ms of which 2 ms to minimize.
[2024-05-21 20:30:44] [INFO ] Deduced a trap composed of 19 places in 132 ms of which 2 ms to minimize.
[2024-05-21 20:30:44] [INFO ] Deduced a trap composed of 14 places in 137 ms of which 2 ms to minimize.
[2024-05-21 20:30:44] [INFO ] Deduced a trap composed of 32 places in 59 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 15/44 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-21 20:30:47] [INFO ] Deduced a trap composed of 32 places in 171 ms of which 3 ms to minimize.
[2024-05-21 20:30:47] [INFO ] Deduced a trap composed of 39 places in 125 ms of which 3 ms to minimize.
[2024-05-21 20:30:47] [INFO ] Deduced a trap composed of 31 places in 87 ms of which 2 ms to minimize.
[2024-05-21 20:30:47] [INFO ] Deduced a trap composed of 40 places in 82 ms of which 2 ms to minimize.
[2024-05-21 20:30:47] [INFO ] Deduced a trap composed of 34 places in 144 ms of which 3 ms to minimize.
[2024-05-21 20:30:48] [INFO ] Deduced a trap composed of 40 places in 75 ms of which 2 ms to minimize.
[2024-05-21 20:30:48] [INFO ] Deduced a trap composed of 52 places in 132 ms of which 3 ms to minimize.
[2024-05-21 20:30:48] [INFO ] Deduced a trap composed of 31 places in 136 ms of which 3 ms to minimize.
[2024-05-21 20:30:48] [INFO ] Deduced a trap composed of 31 places in 109 ms of which 2 ms to minimize.
[2024-05-21 20:30:48] [INFO ] Deduced a trap composed of 31 places in 136 ms of which 3 ms to minimize.
[2024-05-21 20:30:49] [INFO ] Deduced a trap composed of 31 places in 135 ms of which 3 ms to minimize.
[2024-05-21 20:30:49] [INFO ] Deduced a trap composed of 39 places in 75 ms of which 2 ms to minimize.
[2024-05-21 20:30:49] [INFO ] Deduced a trap composed of 38 places in 159 ms of which 3 ms to minimize.
[2024-05-21 20:30:49] [INFO ] Deduced a trap composed of 51 places in 153 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/181 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-21 20:30:51] [INFO ] Deduced a trap composed of 34 places in 125 ms of which 3 ms to minimize.
[2024-05-21 20:30:52] [INFO ] Deduced a trap composed of 34 places in 129 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/181 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/181 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (OVERLAPS) 263/444 variables, 181/241 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/444 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-21 20:31:00] [INFO ] Deduced a trap composed of 32 places in 91 ms of which 2 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/444 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 444/444 variables, and 242 constraints, problems are : Problem set: 0 solved, 262 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 181/181 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 52/52 constraints]
Escalating to Integer solving :Problem set: 0 solved, 262 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (OVERLAPS) 1/181 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/181 variables, 52/61 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (OVERLAPS) 263/444 variables, 181/242 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/444 variables, 262/504 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-21 20:31:12] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/444 variables, 1/505 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-21 20:31:18] [INFO ] Deduced a trap composed of 43 places in 140 ms of which 3 ms to minimize.
[2024-05-21 20:31:18] [INFO ] Deduced a trap composed of 47 places in 106 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/444 variables, 2/507 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/444 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 444/444 variables, and 507 constraints, problems are : Problem set: 0 solved, 262 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 181/181 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 55/55 constraints]
After SMT, in 60258ms problems are : Problem set: 0 solved, 262 unsolved
Search for dead transitions found 0 dead transitions in 60263ms
Starting structural reductions in LTL mode, iteration 1 : 181/209 places, 263/355 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60684 ms. Remains : 181/209 places, 263/355 transitions.
[2024-05-21 20:31:33] [INFO ] Flatten gal took : 7 ms
[2024-05-21 20:31:33] [INFO ] Flatten gal took : 6 ms
[2024-05-21 20:31:33] [INFO ] Input system was already deterministic with 263 transitions.
[2024-05-21 20:31:33] [INFO ] Flatten gal took : 7 ms
[2024-05-21 20:31:33] [INFO ] Flatten gal took : 6 ms
[2024-05-21 20:31:33] [INFO ] Time to serialize gal into /tmp/CTLFireability16701888244594308613.gal : 2 ms
[2024-05-21 20:31:33] [INFO ] Time to serialize properties into /tmp/CTLFireability7005059083941477262.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/CTLFireability16701888244594308613.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7005059083941477262.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.43276e+09,8.9984,203000,2,15673,5,778045,6,0,989,975862,0


Converting to forward existential form...Done !
original formula: E(AF((((p6==1)&&(p9==1))&&((p80==1)&&(p178==1)))) U AX(((A((((p6==1)&&(p16==1))&&((p64==1)&&(p178==1))) U (p196==1)) * !(((p103==1)&&(p78...199
=> equivalent forward existential formula: [(FwdU(Init,!(EG(!((((p6==1)&&(p9==1))&&((p80==1)&&(p178==1))))))) * !(EX(!(((!((E(!((p196==1)) U (!((((p6==1)&&...310
Reverse transition relation is NOT exact ! Due to transitions t10, t16, t17, t25, t29, t35, t39, t40, t54, t64, t65, t68, t69, t71, t84, t90, t91, t94, t95...460
Detected timeout of ITS tools.
[2024-05-21 20:32:03] [INFO ] Flatten gal took : 7 ms
[2024-05-21 20:32:03] [INFO ] Applying decomposition
[2024-05-21 20:32:03] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph877768153307002535.txt' '-o' '/tmp/graph877768153307002535.bin' '-w' '/tmp/graph877768153307002535.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph877768153307002535.bin' '-l' '-1' '-v' '-w' '/tmp/graph877768153307002535.weights' '-q' '0' '-e' '0.001'
[2024-05-21 20:32:03] [INFO ] Decomposing Gal with order
[2024-05-21 20:32:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 20:32:03] [INFO ] Removed a total of 240 redundant transitions.
[2024-05-21 20:32:03] [INFO ] Flatten gal took : 24 ms
[2024-05-21 20:32:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 6 ms.
[2024-05-21 20:32:03] [INFO ] Time to serialize gal into /tmp/CTLFireability1824486654265381070.gal : 4 ms
[2024-05-21 20:32:03] [INFO ] Time to serialize properties into /tmp/CTLFireability128588931239513030.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/CTLFireability1824486654265381070.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability128588931239513030.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.43276e+09,0.125976,6036,542,97,3945,734,475,6352,81,2906,0


Converting to forward existential form...Done !
original formula: E(AF((((i11.u2.p6==1)&&(i11.u2.p9==1))&&((i5.u24.p80==1)&&(i11.u2.p178==1)))) U AX(((A((((i11.u2.p6==1)&&(i11.u2.p16==1))&&((i4.u21.p64==...297
=> equivalent forward existential formula: [(FwdU(Init,!(EG(!((((i11.u2.p6==1)&&(i11.u2.p9==1))&&((i5.u24.p80==1)&&(i11.u2.p178==1))))))) * !(EX(!(((!((E(!...424
Reverse transition relation is NOT exact ! Due to transitions t170, t172, t192, t204, t232, t237, t260, i0.t54, i0.u46.t35, i0.u53.t39, i0.u53.t40, i2.u15....644
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 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
(forward)formula 0,0,6.39055,180012,1,0,357473,3394,3010,539157,426,27941,376141
FORMULA AutonomousCar-PT-04b-CTLFireability-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 209/209 places, 355/355 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 190 transition count 336
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 190 transition count 336
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Iterating post reduction 0 with 64 rules applied. Total rules applied 102 place count 190 transition count 272
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 104 place count 188 transition count 270
Iterating global reduction 1 with 2 rules applied. Total rules applied 106 place count 188 transition count 270
Applied a total of 106 rules in 8 ms. Remains 188 /209 variables (removed 21) and now considering 270/355 (removed 85) transitions.
// Phase 1: matrix 270 rows 188 cols
[2024-05-21 20:32:10] [INFO ] Computed 9 invariants in 3 ms
[2024-05-21 20:32:10] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-21 20:32:10] [INFO ] Invariant cache hit.
[2024-05-21 20:32:10] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 249 ms to find 0 implicit places.
Running 269 sub problems to find dead transitions.
[2024-05-21 20:32:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/187 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 1 (OVERLAPS) 1/188 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 269 unsolved
[2024-05-21 20:32:14] [INFO ] Deduced a trap composed of 18 places in 161 ms of which 3 ms to minimize.
[2024-05-21 20:32:14] [INFO ] Deduced a trap composed of 18 places in 184 ms of which 3 ms to minimize.
[2024-05-21 20:32:14] [INFO ] Deduced a trap composed of 28 places in 159 ms of which 3 ms to minimize.
[2024-05-21 20:32:15] [INFO ] Deduced a trap composed of 27 places in 188 ms of which 3 ms to minimize.
[2024-05-21 20:32:15] [INFO ] Deduced a trap composed of 40 places in 172 ms of which 3 ms to minimize.
[2024-05-21 20:32:15] [INFO ] Deduced a trap composed of 29 places in 181 ms of which 4 ms to minimize.
[2024-05-21 20:32:15] [INFO ] Deduced a trap composed of 26 places in 174 ms of which 3 ms to minimize.
[2024-05-21 20:32:15] [INFO ] Deduced a trap composed of 34 places in 175 ms of which 3 ms to minimize.
[2024-05-21 20:32:16] [INFO ] Deduced a trap composed of 33 places in 160 ms of which 3 ms to minimize.
[2024-05-21 20:32:16] [INFO ] Deduced a trap composed of 35 places in 171 ms of which 3 ms to minimize.
[2024-05-21 20:32:16] [INFO ] Deduced a trap composed of 22 places in 164 ms of which 3 ms to minimize.
[2024-05-21 20:32:16] [INFO ] Deduced a trap composed of 32 places in 162 ms of which 3 ms to minimize.
[2024-05-21 20:32:17] [INFO ] Deduced a trap composed of 21 places in 160 ms of which 2 ms to minimize.
[2024-05-21 20:32:17] [INFO ] Deduced a trap composed of 35 places in 145 ms of which 3 ms to minimize.
[2024-05-21 20:32:17] [INFO ] Deduced a trap composed of 32 places in 154 ms of which 2 ms to minimize.
[2024-05-21 20:32:17] [INFO ] Deduced a trap composed of 31 places in 150 ms of which 3 ms to minimize.
[2024-05-21 20:32:17] [INFO ] Deduced a trap composed of 33 places in 160 ms of which 3 ms to minimize.
[2024-05-21 20:32:18] [INFO ] Deduced a trap composed of 39 places in 162 ms of which 3 ms to minimize.
[2024-05-21 20:32:18] [INFO ] Deduced a trap composed of 39 places in 173 ms of which 5 ms to minimize.
[2024-05-21 20:32:18] [INFO ] Deduced a trap composed of 31 places in 153 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/188 variables, 20/29 constraints. Problems are: Problem set: 0 solved, 269 unsolved
[2024-05-21 20:32:18] [INFO ] Deduced a trap composed of 32 places in 193 ms of which 3 ms to minimize.
[2024-05-21 20:32:19] [INFO ] Deduced a trap composed of 32 places in 171 ms of which 3 ms to minimize.
[2024-05-21 20:32:19] [INFO ] Deduced a trap composed of 15 places in 158 ms of which 3 ms to minimize.
[2024-05-21 20:32:19] [INFO ] Deduced a trap composed of 32 places in 145 ms of which 3 ms to minimize.
[2024-05-21 20:32:19] [INFO ] Deduced a trap composed of 39 places in 111 ms of which 3 ms to minimize.
[2024-05-21 20:32:19] [INFO ] Deduced a trap composed of 32 places in 151 ms of which 2 ms to minimize.
[2024-05-21 20:32:20] [INFO ] Deduced a trap composed of 33 places in 140 ms of which 3 ms to minimize.
[2024-05-21 20:32:20] [INFO ] Deduced a trap composed of 32 places in 126 ms of which 2 ms to minimize.
[2024-05-21 20:32:20] [INFO ] Deduced a trap composed of 51 places in 120 ms of which 3 ms to minimize.
[2024-05-21 20:32:20] [INFO ] Deduced a trap composed of 41 places in 114 ms of which 3 ms to minimize.
[2024-05-21 20:32:21] [INFO ] Deduced a trap composed of 41 places in 110 ms of which 2 ms to minimize.
[2024-05-21 20:32:21] [INFO ] Deduced a trap composed of 39 places in 84 ms of which 2 ms to minimize.
[2024-05-21 20:32:21] [INFO ] Deduced a trap composed of 52 places in 82 ms of which 2 ms to minimize.
[2024-05-21 20:32:21] [INFO ] Deduced a trap composed of 21 places in 132 ms of which 2 ms to minimize.
[2024-05-21 20:32:21] [INFO ] Deduced a trap composed of 34 places in 120 ms of which 2 ms to minimize.
[2024-05-21 20:32:21] [INFO ] Deduced a trap composed of 39 places in 94 ms of which 2 ms to minimize.
[2024-05-21 20:32:21] [INFO ] Deduced a trap composed of 40 places in 100 ms of which 3 ms to minimize.
[2024-05-21 20:32:21] [INFO ] Deduced a trap composed of 41 places in 92 ms of which 2 ms to minimize.
[2024-05-21 20:32:22] [INFO ] Deduced a trap composed of 52 places in 84 ms of which 2 ms to minimize.
[2024-05-21 20:32:22] [INFO ] Deduced a trap composed of 38 places in 167 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 20/49 constraints. Problems are: Problem set: 0 solved, 269 unsolved
[2024-05-21 20:32:24] [INFO ] Deduced a trap composed of 41 places in 130 ms of which 3 ms to minimize.
[2024-05-21 20:32:25] [INFO ] Deduced a trap composed of 40 places in 82 ms of which 2 ms to minimize.
[2024-05-21 20:32:25] [INFO ] Deduced a trap composed of 46 places in 156 ms of which 3 ms to minimize.
[2024-05-21 20:32:26] [INFO ] Deduced a trap composed of 5 places in 143 ms of which 2 ms to minimize.
[2024-05-21 20:32:26] [INFO ] Deduced a trap composed of 19 places in 146 ms of which 2 ms to minimize.
[2024-05-21 20:32:26] [INFO ] Deduced a trap composed of 14 places in 146 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 6/55 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 6 (OVERLAPS) 270/458 variables, 188/243 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/458 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 8 (OVERLAPS) 0/458 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 269 unsolved
No progress, stopping.
After SMT solving in domain Real declared 458/458 variables, and 243 constraints, problems are : Problem set: 0 solved, 269 unsolved in 29270 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 188/188 constraints, PredecessorRefiner: 269/269 constraints, Known Traps: 46/46 constraints]
Escalating to Integer solving :Problem set: 0 solved, 269 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/187 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 1 (OVERLAPS) 1/188 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/188 variables, 46/55 constraints. Problems are: Problem set: 0 solved, 269 unsolved
[2024-05-21 20:32:42] [INFO ] Deduced a trap composed of 47 places in 146 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 5 (OVERLAPS) 270/458 variables, 188/244 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/458 variables, 269/513 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/458 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 8 (OVERLAPS) 0/458 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 269 unsolved
No progress, stopping.
After SMT solving in domain Int declared 458/458 variables, and 513 constraints, problems are : Problem set: 0 solved, 269 unsolved in 23671 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 188/188 constraints, PredecessorRefiner: 269/269 constraints, Known Traps: 47/47 constraints]
After SMT, in 53073ms problems are : Problem set: 0 solved, 269 unsolved
Search for dead transitions found 0 dead transitions in 53077ms
Starting structural reductions in LTL mode, iteration 1 : 188/209 places, 270/355 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53334 ms. Remains : 188/209 places, 270/355 transitions.
[2024-05-21 20:33:03] [INFO ] Flatten gal took : 7 ms
[2024-05-21 20:33:03] [INFO ] Flatten gal took : 6 ms
[2024-05-21 20:33:03] [INFO ] Input system was already deterministic with 270 transitions.
[2024-05-21 20:33:03] [INFO ] Flatten gal took : 7 ms
[2024-05-21 20:33:03] [INFO ] Flatten gal took : 7 ms
[2024-05-21 20:33:03] [INFO ] Time to serialize gal into /tmp/CTLFireability17336970255169420396.gal : 2 ms
[2024-05-21 20:33:03] [INFO ] Time to serialize properties into /tmp/CTLFireability9021498252916587068.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/CTLFireability17336970255169420396.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9021498252916587068.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.73514e+09,9.09525,205832,2,15073,5,738243,6,0,1024,962424,0


Converting to forward existential form...Done !
original formula: E(!(((((p75==1) * E(((p57==1)||(p97==1)) U ((((p204==1)&&(p6==1))&&((p16==1)&&(p52==1)))&&(p178==1)))) * (((EF((((p6==1)&&(p14==1))&&((p5...432
=> equivalent forward existential formula: ([(EY((EY(FwdU(Init,!(((((p75==1) * E(((p57==1)||(p97==1)) U ((((p204==1)&&(p6==1))&&((p16==1)&&(p52==1)))&&(p17...1047
Reverse transition relation is NOT exact ! Due to transitions t10, t17, t18, t26, t34, t38, t39, t40, t65, t66, t69, t70, t72, t84, t85, t91, t92, t95, t96...460
Detected timeout of ITS tools.
[2024-05-21 20:33:33] [INFO ] Flatten gal took : 7 ms
[2024-05-21 20:33:33] [INFO ] Applying decomposition
[2024-05-21 20:33:33] [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/graph13097891960499826624.txt' '-o' '/tmp/graph13097891960499826624.bin' '-w' '/tmp/graph13097891960499826624.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13097891960499826624.bin' '-l' '-1' '-v' '-w' '/tmp/graph13097891960499826624.weights' '-q' '0' '-e' '0.001'
[2024-05-21 20:33:33] [INFO ] Decomposing Gal with order
[2024-05-21 20:33:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 20:33:33] [INFO ] Removed a total of 244 redundant transitions.
[2024-05-21 20:33:33] [INFO ] Flatten gal took : 22 ms
[2024-05-21 20:33:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 18 labels/synchronizations in 4 ms.
[2024-05-21 20:33:33] [INFO ] Time to serialize gal into /tmp/CTLFireability5425066170830300018.gal : 3 ms
[2024-05-21 20:33:33] [INFO ] Time to serialize properties into /tmp/CTLFireability13029784678678545000.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/CTLFireability5425066170830300018.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13029784678678545000.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,1.73514e+09,0.136226,7676,570,97,6643,919,483,11938,72,4807,0


Converting to forward existential form...Done !
original formula: E(!(((((i5.i2.u28.p75==1) * E(((i3.i1.u19.p57==1)||(i7.i1.u33.p97==1)) U ((((i13.i0.u66.p204==1)&&(i2.u2.p6==1))&&((i2.u2.p16==1)&&(i4.u1...670
=> equivalent forward existential formula: ([(EY((EY(FwdU(Init,!(((((i5.i2.u28.p75==1) * E(((i3.i1.u19.p57==1)||(i7.i1.u33.p97==1)) U ((((i13.i0.u66.p204==...1534
Reverse transition relation is NOT exact ! Due to transitions t177, t183, t195, t211, t239, t267, i0.t40, i0.t39, i0.t38, i0.u50.t34, i2.t175, i3.i1.t148, ...648
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 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found a local SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
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 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found a local SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
(forward)formula 0,1,22.6063,590852,1,0,1.06284e+06,6855,4030,1.50724e+06,439,69297,1164581
FORMULA AutonomousCar-PT-04b-CTLFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 209/209 places, 355/355 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 184 transition count 330
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 184 transition count 330
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Iterating post reduction 0 with 64 rules applied. Total rules applied 114 place count 184 transition count 266
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 120 place count 178 transition count 260
Iterating global reduction 1 with 6 rules applied. Total rules applied 126 place count 178 transition count 260
Applied a total of 126 rules in 5 ms. Remains 178 /209 variables (removed 31) and now considering 260/355 (removed 95) transitions.
// Phase 1: matrix 260 rows 178 cols
[2024-05-21 20:33:56] [INFO ] Computed 9 invariants in 2 ms
[2024-05-21 20:33:56] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-21 20:33:56] [INFO ] Invariant cache hit.
[2024-05-21 20:33:56] [INFO ] Implicit Places using invariants and state equation in 175 ms returned []
Implicit Place search using SMT with State Equation took 253 ms to find 0 implicit places.
Running 259 sub problems to find dead transitions.
[2024-05-21 20:33:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/177 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 1 (OVERLAPS) 1/178 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-21 20:34:00] [INFO ] Deduced a trap composed of 16 places in 185 ms of which 4 ms to minimize.
[2024-05-21 20:34:00] [INFO ] Deduced a trap composed of 14 places in 177 ms of which 3 ms to minimize.
[2024-05-21 20:34:01] [INFO ] Deduced a trap composed of 39 places in 63 ms of which 1 ms to minimize.
[2024-05-21 20:34:01] [INFO ] Deduced a trap composed of 24 places in 175 ms of which 3 ms to minimize.
[2024-05-21 20:34:01] [INFO ] Deduced a trap composed of 22 places in 167 ms of which 3 ms to minimize.
[2024-05-21 20:34:01] [INFO ] Deduced a trap composed of 33 places in 150 ms of which 3 ms to minimize.
[2024-05-21 20:34:01] [INFO ] Deduced a trap composed of 29 places in 176 ms of which 3 ms to minimize.
[2024-05-21 20:34:02] [INFO ] Deduced a trap composed of 29 places in 152 ms of which 3 ms to minimize.
[2024-05-21 20:34:02] [INFO ] Deduced a trap composed of 31 places in 157 ms of which 3 ms to minimize.
[2024-05-21 20:34:02] [INFO ] Deduced a trap composed of 28 places in 159 ms of which 3 ms to minimize.
[2024-05-21 20:34:02] [INFO ] Deduced a trap composed of 32 places in 151 ms of which 4 ms to minimize.
[2024-05-21 20:34:02] [INFO ] Deduced a trap composed of 31 places in 150 ms of which 3 ms to minimize.
[2024-05-21 20:34:03] [INFO ] Deduced a trap composed of 31 places in 151 ms of which 2 ms to minimize.
[2024-05-21 20:34:03] [INFO ] Deduced a trap composed of 34 places in 162 ms of which 3 ms to minimize.
[2024-05-21 20:34:03] [INFO ] Deduced a trap composed of 38 places in 145 ms of which 2 ms to minimize.
[2024-05-21 20:34:03] [INFO ] Deduced a trap composed of 39 places in 113 ms of which 3 ms to minimize.
[2024-05-21 20:34:03] [INFO ] Deduced a trap composed of 38 places in 108 ms of which 2 ms to minimize.
[2024-05-21 20:34:03] [INFO ] Deduced a trap composed of 46 places in 136 ms of which 3 ms to minimize.
[2024-05-21 20:34:04] [INFO ] Deduced a trap composed of 38 places in 94 ms of which 3 ms to minimize.
[2024-05-21 20:34:04] [INFO ] Deduced a trap composed of 40 places in 156 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 20/29 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-21 20:34:04] [INFO ] Deduced a trap composed of 33 places in 163 ms of which 2 ms to minimize.
[2024-05-21 20:34:04] [INFO ] Deduced a trap composed of 36 places in 160 ms of which 3 ms to minimize.
[2024-05-21 20:34:05] [INFO ] Deduced a trap composed of 46 places in 151 ms of which 3 ms to minimize.
[2024-05-21 20:34:05] [INFO ] Deduced a trap composed of 35 places in 150 ms of which 3 ms to minimize.
[2024-05-21 20:34:05] [INFO ] Deduced a trap composed of 31 places in 154 ms of which 3 ms to minimize.
[2024-05-21 20:34:05] [INFO ] Deduced a trap composed of 31 places in 151 ms of which 2 ms to minimize.
[2024-05-21 20:34:05] [INFO ] Deduced a trap composed of 25 places in 135 ms of which 2 ms to minimize.
[2024-05-21 20:34:05] [INFO ] Deduced a trap composed of 32 places in 160 ms of which 3 ms to minimize.
[2024-05-21 20:34:06] [INFO ] Deduced a trap composed of 24 places in 153 ms of which 3 ms to minimize.
[2024-05-21 20:34:06] [INFO ] Deduced a trap composed of 32 places in 140 ms of which 2 ms to minimize.
[2024-05-21 20:34:06] [INFO ] Deduced a trap composed of 31 places in 142 ms of which 3 ms to minimize.
[2024-05-21 20:34:06] [INFO ] Deduced a trap composed of 40 places in 107 ms of which 2 ms to minimize.
[2024-05-21 20:34:06] [INFO ] Deduced a trap composed of 38 places in 116 ms of which 2 ms to minimize.
[2024-05-21 20:34:07] [INFO ] Deduced a trap composed of 33 places in 146 ms of which 2 ms to minimize.
[2024-05-21 20:34:07] [INFO ] Deduced a trap composed of 40 places in 100 ms of which 2 ms to minimize.
[2024-05-21 20:34:07] [INFO ] Deduced a trap composed of 19 places in 151 ms of which 3 ms to minimize.
[2024-05-21 20:34:08] [INFO ] Deduced a trap composed of 14 places in 150 ms of which 2 ms to minimize.
[2024-05-21 20:34:08] [INFO ] Deduced a trap composed of 5 places in 151 ms of which 2 ms to minimize.
[2024-05-21 20:34:08] [INFO ] Deduced a trap composed of 44 places in 137 ms of which 2 ms to minimize.
[2024-05-21 20:34:09] [INFO ] Deduced a trap composed of 19 places in 85 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/178 variables, 20/49 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-21 20:34:11] [INFO ] Deduced a trap composed of 51 places in 110 ms of which 3 ms to minimize.
[2024-05-21 20:34:11] [INFO ] Deduced a trap composed of 31 places in 158 ms of which 3 ms to minimize.
[2024-05-21 20:34:11] [INFO ] Deduced a trap composed of 40 places in 80 ms of which 2 ms to minimize.
[2024-05-21 20:34:12] [INFO ] Deduced a trap composed of 38 places in 149 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/178 variables, 4/53 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-21 20:34:14] [INFO ] Deduced a trap composed of 31 places in 132 ms of which 3 ms to minimize.
[2024-05-21 20:34:14] [INFO ] Deduced a trap composed of 31 places in 150 ms of which 3 ms to minimize.
[2024-05-21 20:34:15] [INFO ] Deduced a trap composed of 32 places in 148 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/178 variables, 3/56 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-21 20:34:16] [INFO ] Deduced a trap composed of 18 places in 136 ms of which 3 ms to minimize.
[2024-05-21 20:34:17] [INFO ] Deduced a trap composed of 42 places in 137 ms of which 3 ms to minimize.
[2024-05-21 20:34:17] [INFO ] Deduced a trap composed of 42 places in 127 ms of which 2 ms to minimize.
[2024-05-21 20:34:17] [INFO ] Deduced a trap composed of 38 places in 117 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/178 variables, 4/60 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/178 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 8 (OVERLAPS) 260/438 variables, 178/238 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-21 20:34:23] [INFO ] Deduced a trap composed of 23 places in 133 ms of which 3 ms to minimize.
[2024-05-21 20:34:23] [INFO ] Deduced a trap composed of 35 places in 144 ms of which 3 ms to minimize.
[2024-05-21 20:34:23] [INFO ] Deduced a trap composed of 36 places in 138 ms of which 3 ms to minimize.
[2024-05-21 20:34:23] [INFO ] Deduced a trap composed of 32 places in 119 ms of which 3 ms to minimize.
[2024-05-21 20:34:24] [INFO ] Deduced a trap composed of 44 places in 151 ms of which 3 ms to minimize.
[2024-05-21 20:34:25] [INFO ] Deduced a trap composed of 32 places in 125 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/438 variables, 6/244 constraints. Problems are: Problem set: 0 solved, 259 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 438/438 variables, and 244 constraints, problems are : Problem set: 0 solved, 259 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 178/178 constraints, PredecessorRefiner: 259/259 constraints, Known Traps: 57/57 constraints]
Escalating to Integer solving :Problem set: 0 solved, 259 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/177 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 1 (OVERLAPS) 1/178 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 57/66 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-21 20:34:30] [INFO ] Deduced a trap composed of 39 places in 90 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/178 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/178 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 5 (OVERLAPS) 260/438 variables, 178/245 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/438 variables, 259/504 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-21 20:34:38] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/438 variables, 1/505 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/438 variables, 0/505 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 9 (OVERLAPS) 0/438 variables, 0/505 constraints. Problems are: Problem set: 0 solved, 259 unsolved
No progress, stopping.
After SMT solving in domain Int declared 438/438 variables, and 505 constraints, problems are : Problem set: 0 solved, 259 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 178/178 constraints, PredecessorRefiner: 259/259 constraints, Known Traps: 59/59 constraints]
After SMT, in 60196ms problems are : Problem set: 0 solved, 259 unsolved
Search for dead transitions found 0 dead transitions in 60200ms
Starting structural reductions in LTL mode, iteration 1 : 178/209 places, 260/355 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60459 ms. Remains : 178/209 places, 260/355 transitions.
[2024-05-21 20:34:56] [INFO ] Flatten gal took : 7 ms
[2024-05-21 20:34:56] [INFO ] Flatten gal took : 6 ms
[2024-05-21 20:34:57] [INFO ] Input system was already deterministic with 260 transitions.
[2024-05-21 20:34:57] [INFO ] Flatten gal took : 6 ms
[2024-05-21 20:34:57] [INFO ] Flatten gal took : 6 ms
[2024-05-21 20:34:57] [INFO ] Time to serialize gal into /tmp/CTLFireability8436463554156367153.gal : 2 ms
[2024-05-21 20:34:57] [INFO ] Time to serialize properties into /tmp/CTLFireability14731992778581296167.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/CTLFireability8436463554156367153.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14731992778581296167.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.39231e+09,9.62532,214744,2,14885,5,812872,6,0,974,1.05478e+06,0


Converting to forward existential form...Done !
original formula: (AX(AF((((p6==0)||(p14==0))||((p76==0)||(p178==0))))) * AX(((AX(EG((p27==0))) * EX(((((p50==0)||(p81==0))||((p112==0)||(p143==0)))||(p179...176
=> equivalent forward existential formula: ([FwdG(EY(Init),!((((p6==0)||(p14==0))||((p76==0)||(p178==0)))))] = FALSE * (([(EY(EY(Init)) * !(EG((p27==0))))]...295
Reverse transition relation is NOT exact ! Due to transitions t10, t16, t17, t24, t32, t35, t36, t37, t61, t62, t65, t66, t68, t81, t87, t88, t91, t92, t94...449
Detected timeout of ITS tools.
[2024-05-21 20:35:27] [INFO ] Flatten gal took : 7 ms
[2024-05-21 20:35:27] [INFO ] Applying decomposition
[2024-05-21 20:35:27] [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/graph15581199833775231337.txt' '-o' '/tmp/graph15581199833775231337.bin' '-w' '/tmp/graph15581199833775231337.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15581199833775231337.bin' '-l' '-1' '-v' '-w' '/tmp/graph15581199833775231337.weights' '-q' '0' '-e' '0.001'
[2024-05-21 20:35:27] [INFO ] Decomposing Gal with order
[2024-05-21 20:35:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 20:35:27] [INFO ] Removed a total of 236 redundant transitions.
[2024-05-21 20:35:27] [INFO ] Flatten gal took : 19 ms
[2024-05-21 20:35:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 22 labels/synchronizations in 2 ms.
[2024-05-21 20:35:27] [INFO ] Time to serialize gal into /tmp/CTLFireability16313589289671351003.gal : 4 ms
[2024-05-21 20:35:27] [INFO ] Time to serialize properties into /tmp/CTLFireability3054765324434600093.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/CTLFireability16313589289671351003.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3054765324434600093.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,1.39231e+09,0.099136,6456,489,103,5077,811,403,7167,80,1656,0


Converting to forward existential form...Done !
original formula: (AX(AF((((i0.u2.p6==0)||(i0.u2.p14==0))||((i4.i1.u22.p76==0)||(i0.u2.p178==0))))) * AX(((AX(EG((i1.u7.p27==0))) * EX(((((i3.u14.p50==0)||...255
=> equivalent forward existential formula: ([FwdG(EY(Init),!((((i0.u2.p6==0)||(i0.u2.p14==0))||((i4.i1.u22.p76==0)||(i0.u2.p178==0)))))] = FALSE * (([(EY(E...374
Reverse transition relation is NOT exact ! Due to transitions t172, t188, t208, t232, t257, i0.t167, i0.t165, i3.t158, i3.u8.t138, i3.u14.t142, i3.u14.t143...638
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 an SCC at level 1
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
(forward)formula 0,0,7.33899,225312,1,0,489457,3036,2550,553568,424,14731,541740
FORMULA AutonomousCar-PT-04b-CTLFireability-2024-09 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 : 209/209 places, 355/355 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 184 transition count 330
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 184 transition count 330
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Iterating post reduction 0 with 64 rules applied. Total rules applied 114 place count 184 transition count 266
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 120 place count 178 transition count 260
Iterating global reduction 1 with 6 rules applied. Total rules applied 126 place count 178 transition count 260
Applied a total of 126 rules in 5 ms. Remains 178 /209 variables (removed 31) and now considering 260/355 (removed 95) transitions.
[2024-05-21 20:35:34] [INFO ] Invariant cache hit.
[2024-05-21 20:35:34] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-05-21 20:35:34] [INFO ] Invariant cache hit.
[2024-05-21 20:35:34] [INFO ] Implicit Places using invariants and state equation in 193 ms returned []
Implicit Place search using SMT with State Equation took 264 ms to find 0 implicit places.
Running 259 sub problems to find dead transitions.
[2024-05-21 20:35:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/177 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 1 (OVERLAPS) 1/178 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-21 20:35:38] [INFO ] Deduced a trap composed of 16 places in 178 ms of which 4 ms to minimize.
[2024-05-21 20:35:38] [INFO ] Deduced a trap composed of 14 places in 176 ms of which 3 ms to minimize.
[2024-05-21 20:35:39] [INFO ] Deduced a trap composed of 39 places in 64 ms of which 2 ms to minimize.
[2024-05-21 20:35:39] [INFO ] Deduced a trap composed of 24 places in 143 ms of which 3 ms to minimize.
[2024-05-21 20:35:39] [INFO ] Deduced a trap composed of 22 places in 186 ms of which 4 ms to minimize.
[2024-05-21 20:35:39] [INFO ] Deduced a trap composed of 33 places in 150 ms of which 3 ms to minimize.
[2024-05-21 20:35:39] [INFO ] Deduced a trap composed of 29 places in 145 ms of which 2 ms to minimize.
[2024-05-21 20:35:40] [INFO ] Deduced a trap composed of 29 places in 128 ms of which 2 ms to minimize.
[2024-05-21 20:35:40] [INFO ] Deduced a trap composed of 31 places in 94 ms of which 1 ms to minimize.
[2024-05-21 20:35:40] [INFO ] Deduced a trap composed of 28 places in 91 ms of which 2 ms to minimize.
[2024-05-21 20:35:40] [INFO ] Deduced a trap composed of 32 places in 92 ms of which 2 ms to minimize.
[2024-05-21 20:35:40] [INFO ] Deduced a trap composed of 31 places in 93 ms of which 1 ms to minimize.
[2024-05-21 20:35:40] [INFO ] Deduced a trap composed of 31 places in 86 ms of which 2 ms to minimize.
[2024-05-21 20:35:40] [INFO ] Deduced a trap composed of 34 places in 95 ms of which 2 ms to minimize.
[2024-05-21 20:35:40] [INFO ] Deduced a trap composed of 38 places in 75 ms of which 1 ms to minimize.
[2024-05-21 20:35:40] [INFO ] Deduced a trap composed of 39 places in 67 ms of which 2 ms to minimize.
[2024-05-21 20:35:41] [INFO ] Deduced a trap composed of 38 places in 61 ms of which 2 ms to minimize.
[2024-05-21 20:35:41] [INFO ] Deduced a trap composed of 46 places in 72 ms of which 1 ms to minimize.
[2024-05-21 20:35:41] [INFO ] Deduced a trap composed of 38 places in 60 ms of which 1 ms to minimize.
[2024-05-21 20:35:41] [INFO ] Deduced a trap composed of 40 places in 88 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 20/29 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-21 20:35:41] [INFO ] Deduced a trap composed of 33 places in 96 ms of which 1 ms to minimize.
[2024-05-21 20:35:41] [INFO ] Deduced a trap composed of 36 places in 90 ms of which 2 ms to minimize.
[2024-05-21 20:35:41] [INFO ] Deduced a trap composed of 46 places in 128 ms of which 3 ms to minimize.
[2024-05-21 20:35:41] [INFO ] Deduced a trap composed of 35 places in 150 ms of which 3 ms to minimize.
[2024-05-21 20:35:42] [INFO ] Deduced a trap composed of 31 places in 151 ms of which 3 ms to minimize.
[2024-05-21 20:35:42] [INFO ] Deduced a trap composed of 31 places in 123 ms of which 3 ms to minimize.
[2024-05-21 20:35:42] [INFO ] Deduced a trap composed of 25 places in 142 ms of which 3 ms to minimize.
[2024-05-21 20:35:42] [INFO ] Deduced a trap composed of 32 places in 151 ms of which 3 ms to minimize.
[2024-05-21 20:35:42] [INFO ] Deduced a trap composed of 24 places in 146 ms of which 3 ms to minimize.
[2024-05-21 20:35:42] [INFO ] Deduced a trap composed of 32 places in 122 ms of which 2 ms to minimize.
[2024-05-21 20:35:43] [INFO ] Deduced a trap composed of 31 places in 138 ms of which 3 ms to minimize.
[2024-05-21 20:35:43] [INFO ] Deduced a trap composed of 40 places in 116 ms of which 3 ms to minimize.
[2024-05-21 20:35:43] [INFO ] Deduced a trap composed of 38 places in 105 ms of which 2 ms to minimize.
[2024-05-21 20:35:43] [INFO ] Deduced a trap composed of 33 places in 152 ms of which 3 ms to minimize.
[2024-05-21 20:35:44] [INFO ] Deduced a trap composed of 40 places in 110 ms of which 3 ms to minimize.
[2024-05-21 20:35:44] [INFO ] Deduced a trap composed of 19 places in 146 ms of which 2 ms to minimize.
[2024-05-21 20:35:44] [INFO ] Deduced a trap composed of 14 places in 148 ms of which 3 ms to minimize.
[2024-05-21 20:35:45] [INFO ] Deduced a trap composed of 5 places in 150 ms of which 3 ms to minimize.
[2024-05-21 20:35:45] [INFO ] Deduced a trap composed of 44 places in 139 ms of which 3 ms to minimize.
[2024-05-21 20:35:45] [INFO ] Deduced a trap composed of 19 places in 76 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/178 variables, 20/49 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-21 20:35:48] [INFO ] Deduced a trap composed of 51 places in 121 ms of which 3 ms to minimize.
[2024-05-21 20:35:48] [INFO ] Deduced a trap composed of 31 places in 149 ms of which 3 ms to minimize.
[2024-05-21 20:35:48] [INFO ] Deduced a trap composed of 40 places in 75 ms of which 2 ms to minimize.
[2024-05-21 20:35:49] [INFO ] Deduced a trap composed of 38 places in 119 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/178 variables, 4/53 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-21 20:35:50] [INFO ] Deduced a trap composed of 31 places in 125 ms of which 2 ms to minimize.
[2024-05-21 20:35:50] [INFO ] Deduced a trap composed of 31 places in 116 ms of which 2 ms to minimize.
[2024-05-21 20:35:51] [INFO ] Deduced a trap composed of 32 places in 118 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/178 variables, 3/56 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-21 20:35:52] [INFO ] Deduced a trap composed of 18 places in 136 ms of which 3 ms to minimize.
[2024-05-21 20:35:52] [INFO ] Deduced a trap composed of 42 places in 135 ms of which 2 ms to minimize.
[2024-05-21 20:35:53] [INFO ] Deduced a trap composed of 42 places in 123 ms of which 2 ms to minimize.
[2024-05-21 20:35:53] [INFO ] Deduced a trap composed of 38 places in 118 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/178 variables, 4/60 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/178 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 8 (OVERLAPS) 260/438 variables, 178/238 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-21 20:35:58] [INFO ] Deduced a trap composed of 23 places in 118 ms of which 3 ms to minimize.
[2024-05-21 20:35:59] [INFO ] Deduced a trap composed of 35 places in 140 ms of which 3 ms to minimize.
[2024-05-21 20:35:59] [INFO ] Deduced a trap composed of 36 places in 127 ms of which 3 ms to minimize.
[2024-05-21 20:35:59] [INFO ] Deduced a trap composed of 32 places in 119 ms of which 3 ms to minimize.
[2024-05-21 20:36:00] [INFO ] Deduced a trap composed of 44 places in 141 ms of which 3 ms to minimize.
[2024-05-21 20:36:00] [INFO ] Deduced a trap composed of 32 places in 131 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/438 variables, 6/244 constraints. Problems are: Problem set: 0 solved, 259 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 438/438 variables, and 244 constraints, problems are : Problem set: 0 solved, 259 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 178/178 constraints, PredecessorRefiner: 259/259 constraints, Known Traps: 57/57 constraints]
Escalating to Integer solving :Problem set: 0 solved, 259 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/177 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 1 (OVERLAPS) 1/178 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 57/66 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-21 20:36:08] [INFO ] Deduced a trap composed of 39 places in 83 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/178 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/178 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 5 (OVERLAPS) 260/438 variables, 178/245 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/438 variables, 259/504 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-21 20:36:16] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/438 variables, 1/505 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/438 variables, 0/505 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 9 (OVERLAPS) 0/438 variables, 0/505 constraints. Problems are: Problem set: 0 solved, 259 unsolved
No progress, stopping.
After SMT solving in domain Int declared 438/438 variables, and 505 constraints, problems are : Problem set: 0 solved, 259 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 178/178 constraints, PredecessorRefiner: 259/259 constraints, Known Traps: 59/59 constraints]
After SMT, in 60270ms problems are : Problem set: 0 solved, 259 unsolved
Search for dead transitions found 0 dead transitions in 60275ms
Starting structural reductions in LTL mode, iteration 1 : 178/209 places, 260/355 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60546 ms. Remains : 178/209 places, 260/355 transitions.
[2024-05-21 20:36:35] [INFO ] Flatten gal took : 6 ms
[2024-05-21 20:36:35] [INFO ] Flatten gal took : 7 ms
[2024-05-21 20:36:35] [INFO ] Input system was already deterministic with 260 transitions.
[2024-05-21 20:36:35] [INFO ] Flatten gal took : 6 ms
[2024-05-21 20:36:35] [INFO ] Flatten gal took : 6 ms
[2024-05-21 20:36:35] [INFO ] Time to serialize gal into /tmp/CTLFireability2060180941889425370.gal : 2 ms
[2024-05-21 20:36:35] [INFO ] Time to serialize properties into /tmp/CTLFireability3026022801640402479.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/CTLFireability2060180941889425370.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3026022801640402479.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.39231e+09,10.8315,215556,2,14885,5,812872,6,0,974,1.05478e+06,0


Converting to forward existential form...Done !
original formula: AF(((E(((((p6==1)&&(p9==1))&&((p83==1)&&(p178==1)))||(p160==1)) U AX(((((p56==1)&&(p81==1))&&((p112==1)&&(p143==1)))&&(p179==1)))) * AX(E...276
=> equivalent forward existential formula: [FwdG(Init,!(((E(((((p6==1)&&(p9==1))&&((p83==1)&&(p178==1)))||(p160==1)) U !(EX(!(((((p56==1)&&(p81==1))&&((p11...339
Reverse transition relation is NOT exact ! Due to transitions t10, t16, t17, t24, t32, t35, t36, t37, t61, t62, t65, t66, t68, t81, t87, t88, t91, t92, t94...449
Detected timeout of ITS tools.
[2024-05-21 20:37:05] [INFO ] Flatten gal took : 8 ms
[2024-05-21 20:37:05] [INFO ] Applying decomposition
[2024-05-21 20:37:05] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph4260738702834921242.txt' '-o' '/tmp/graph4260738702834921242.bin' '-w' '/tmp/graph4260738702834921242.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4260738702834921242.bin' '-l' '-1' '-v' '-w' '/tmp/graph4260738702834921242.weights' '-q' '0' '-e' '0.001'
[2024-05-21 20:37:05] [INFO ] Decomposing Gal with order
[2024-05-21 20:37:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 20:37:05] [INFO ] Removed a total of 238 redundant transitions.
[2024-05-21 20:37:05] [INFO ] Flatten gal took : 21 ms
[2024-05-21 20:37:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 18 labels/synchronizations in 3 ms.
[2024-05-21 20:37:05] [INFO ] Time to serialize gal into /tmp/CTLFireability2645230146363892906.gal : 3 ms
[2024-05-21 20:37:05] [INFO ] Time to serialize properties into /tmp/CTLFireability11160677570740340333.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/CTLFireability2645230146363892906.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11160677570740340333.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,1.39231e+09,0.071204,5192,385,102,2509,465,442,3209,78,1114,0


Converting to forward existential form...Done !
original formula: AF(((E(((((i11.u1.p6==1)&&(i11.u1.p9==1))&&((i5.i1.u24.p83==1)&&(i11.u1.p178==1)))||(i10.i0.u49.p160==1)) U AX(((((i3.u17.p56==1)&&(i5.i1...430
=> equivalent forward existential formula: [FwdG(Init,!(((E(((((i11.u1.p6==1)&&(i11.u1.p9==1))&&((i5.i1.u24.p83==1)&&(i11.u1.p178==1)))||(i10.i0.u49.p160==...493
Reverse transition relation is NOT exact ! Due to transitions t167, t169, t185, t205, t225, t257, i0.u54.t32, i0.u54.t35, i0.u54.t36, i0.u54.t37, i3.t158, ...625
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
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
(forward)formula 0,0,1.38624,47956,1,0,113568,1609,3456,110273,447,5409,158777
FORMULA AutonomousCar-PT-04b-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 209/209 places, 355/355 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 186 transition count 332
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 186 transition count 332
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Iterating post reduction 0 with 64 rules applied. Total rules applied 110 place count 186 transition count 268
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 116 place count 180 transition count 262
Iterating global reduction 1 with 6 rules applied. Total rules applied 122 place count 180 transition count 262
Applied a total of 122 rules in 5 ms. Remains 180 /209 variables (removed 29) and now considering 262/355 (removed 93) transitions.
// Phase 1: matrix 262 rows 180 cols
[2024-05-21 20:37:06] [INFO ] Computed 9 invariants in 1 ms
[2024-05-21 20:37:06] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-21 20:37:06] [INFO ] Invariant cache hit.
[2024-05-21 20:37:06] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 237 ms to find 0 implicit places.
Running 261 sub problems to find dead transitions.
[2024-05-21 20:37:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (OVERLAPS) 1/180 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-21 20:37:10] [INFO ] Deduced a trap composed of 16 places in 152 ms of which 3 ms to minimize.
[2024-05-21 20:37:10] [INFO ] Deduced a trap composed of 31 places in 187 ms of which 3 ms to minimize.
[2024-05-21 20:37:11] [INFO ] Deduced a trap composed of 32 places in 169 ms of which 3 ms to minimize.
[2024-05-21 20:37:11] [INFO ] Deduced a trap composed of 22 places in 169 ms of which 3 ms to minimize.
[2024-05-21 20:37:11] [INFO ] Deduced a trap composed of 14 places in 160 ms of which 3 ms to minimize.
[2024-05-21 20:37:11] [INFO ] Deduced a trap composed of 33 places in 147 ms of which 2 ms to minimize.
[2024-05-21 20:37:11] [INFO ] Deduced a trap composed of 33 places in 148 ms of which 3 ms to minimize.
[2024-05-21 20:37:12] [INFO ] Deduced a trap composed of 27 places in 143 ms of which 3 ms to minimize.
[2024-05-21 20:37:12] [INFO ] Deduced a trap composed of 18 places in 159 ms of which 3 ms to minimize.
[2024-05-21 20:37:12] [INFO ] Deduced a trap composed of 32 places in 120 ms of which 3 ms to minimize.
[2024-05-21 20:37:12] [INFO ] Deduced a trap composed of 32 places in 122 ms of which 2 ms to minimize.
[2024-05-21 20:37:12] [INFO ] Deduced a trap composed of 34 places in 157 ms of which 3 ms to minimize.
[2024-05-21 20:37:12] [INFO ] Deduced a trap composed of 38 places in 118 ms of which 3 ms to minimize.
[2024-05-21 20:37:13] [INFO ] Deduced a trap composed of 31 places in 107 ms of which 3 ms to minimize.
[2024-05-21 20:37:13] [INFO ] Deduced a trap composed of 31 places in 117 ms of which 3 ms to minimize.
[2024-05-21 20:37:13] [INFO ] Deduced a trap composed of 43 places in 118 ms of which 3 ms to minimize.
[2024-05-21 20:37:13] [INFO ] Deduced a trap composed of 38 places in 118 ms of which 2 ms to minimize.
[2024-05-21 20:37:13] [INFO ] Deduced a trap composed of 39 places in 106 ms of which 3 ms to minimize.
[2024-05-21 20:37:14] [INFO ] Deduced a trap composed of 42 places in 147 ms of which 3 ms to minimize.
[2024-05-21 20:37:14] [INFO ] Deduced a trap composed of 52 places in 147 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 20/29 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-21 20:37:14] [INFO ] Deduced a trap composed of 23 places in 132 ms of which 3 ms to minimize.
[2024-05-21 20:37:14] [INFO ] Deduced a trap composed of 19 places in 173 ms of which 3 ms to minimize.
[2024-05-21 20:37:14] [INFO ] Deduced a trap composed of 31 places in 123 ms of which 3 ms to minimize.
[2024-05-21 20:37:15] [INFO ] Deduced a trap composed of 40 places in 169 ms of which 3 ms to minimize.
[2024-05-21 20:37:15] [INFO ] Deduced a trap composed of 32 places in 159 ms of which 3 ms to minimize.
[2024-05-21 20:37:15] [INFO ] Deduced a trap composed of 47 places in 153 ms of which 3 ms to minimize.
[2024-05-21 20:37:15] [INFO ] Deduced a trap composed of 32 places in 147 ms of which 2 ms to minimize.
[2024-05-21 20:37:15] [INFO ] Deduced a trap composed of 25 places in 151 ms of which 2 ms to minimize.
[2024-05-21 20:37:16] [INFO ] Deduced a trap composed of 24 places in 165 ms of which 3 ms to minimize.
[2024-05-21 20:37:16] [INFO ] Deduced a trap composed of 38 places in 132 ms of which 3 ms to minimize.
[2024-05-21 20:37:16] [INFO ] Deduced a trap composed of 33 places in 151 ms of which 3 ms to minimize.
[2024-05-21 20:37:16] [INFO ] Deduced a trap composed of 30 places in 148 ms of which 3 ms to minimize.
[2024-05-21 20:37:16] [INFO ] Deduced a trap composed of 31 places in 131 ms of which 3 ms to minimize.
[2024-05-21 20:37:16] [INFO ] Deduced a trap composed of 41 places in 143 ms of which 3 ms to minimize.
[2024-05-21 20:37:17] [INFO ] Deduced a trap composed of 32 places in 148 ms of which 3 ms to minimize.
[2024-05-21 20:37:17] [INFO ] Deduced a trap composed of 45 places in 147 ms of which 3 ms to minimize.
[2024-05-21 20:37:17] [INFO ] Deduced a trap composed of 35 places in 142 ms of which 2 ms to minimize.
[2024-05-21 20:37:17] [INFO ] Deduced a trap composed of 18 places in 158 ms of which 3 ms to minimize.
[2024-05-21 20:37:18] [INFO ] Deduced a trap composed of 5 places in 171 ms of which 3 ms to minimize.
[2024-05-21 20:37:18] [INFO ] Deduced a trap composed of 14 places in 159 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/180 variables, 20/49 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-21 20:37:20] [INFO ] Deduced a trap composed of 40 places in 59 ms of which 2 ms to minimize.
[2024-05-21 20:37:21] [INFO ] Deduced a trap composed of 32 places in 152 ms of which 3 ms to minimize.
[2024-05-21 20:37:21] [INFO ] Deduced a trap composed of 33 places in 155 ms of which 3 ms to minimize.
[2024-05-21 20:37:21] [INFO ] Deduced a trap composed of 33 places in 146 ms of which 3 ms to minimize.
[2024-05-21 20:37:22] [INFO ] Deduced a trap composed of 47 places in 120 ms of which 2 ms to minimize.
[2024-05-21 20:37:22] [INFO ] Deduced a trap composed of 44 places in 96 ms of which 2 ms to minimize.
[2024-05-21 20:37:22] [INFO ] Deduced a trap composed of 40 places in 82 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/180 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-21 20:37:24] [INFO ] Deduced a trap composed of 31 places in 160 ms of which 3 ms to minimize.
[2024-05-21 20:37:24] [INFO ] Deduced a trap composed of 40 places in 95 ms of which 2 ms to minimize.
[2024-05-21 20:37:24] [INFO ] Deduced a trap composed of 39 places in 81 ms of which 2 ms to minimize.
[2024-05-21 20:37:24] [INFO ] Deduced a trap composed of 43 places in 164 ms of which 3 ms to minimize.
[2024-05-21 20:37:25] [INFO ] Deduced a trap composed of 23 places in 153 ms of which 2 ms to minimize.
[2024-05-21 20:37:25] [INFO ] Deduced a trap composed of 53 places in 170 ms of which 3 ms to minimize.
[2024-05-21 20:37:25] [INFO ] Deduced a trap composed of 57 places in 153 ms of which 2 ms to minimize.
[2024-05-21 20:37:25] [INFO ] Deduced a trap composed of 35 places in 147 ms of which 3 ms to minimize.
[2024-05-21 20:37:25] [INFO ] Deduced a trap composed of 32 places in 146 ms of which 9 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/180 variables, 9/65 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/180 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 7 (OVERLAPS) 262/442 variables, 180/245 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/442 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 261 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 442/442 variables, and 245 constraints, problems are : Problem set: 0 solved, 261 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 180/180 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 56/56 constraints]
Escalating to Integer solving :Problem set: 0 solved, 261 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (OVERLAPS) 1/180 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 56/65 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/180 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 4 (OVERLAPS) 262/442 variables, 180/245 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/442 variables, 261/506 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-21 20:37:42] [INFO ] Deduced a trap composed of 40 places in 67 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/442 variables, 1/507 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-21 20:37:51] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/442 variables, 1/508 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/442 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 261 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 442/442 variables, and 508 constraints, problems are : Problem set: 0 solved, 261 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 180/180 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 58/58 constraints]
After SMT, in 60169ms problems are : Problem set: 0 solved, 261 unsolved
Search for dead transitions found 0 dead transitions in 60172ms
Starting structural reductions in LTL mode, iteration 1 : 180/209 places, 262/355 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60415 ms. Remains : 180/209 places, 262/355 transitions.
[2024-05-21 20:38:07] [INFO ] Flatten gal took : 10 ms
[2024-05-21 20:38:07] [INFO ] Flatten gal took : 10 ms
[2024-05-21 20:38:07] [INFO ] Input system was already deterministic with 262 transitions.
[2024-05-21 20:38:07] [INFO ] Flatten gal took : 10 ms
[2024-05-21 20:38:07] [INFO ] Flatten gal took : 10 ms
[2024-05-21 20:38:07] [INFO ] Time to serialize gal into /tmp/CTLFireability10620668267778018244.gal : 2 ms
[2024-05-21 20:38:07] [INFO ] Time to serialize properties into /tmp/CTLFireability7255186812432587699.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/CTLFireability10620668267778018244.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7255186812432587699.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.50474e+09,9.28261,204508,2,14739,5,778010,6,0,984,999389,0


Converting to forward existential form...Done !
original formula: ((AX(((((AX((((p6==0)||(p15==0))||((p138==0)||(p178==0)))) * (p191==0)) * (((p6==0)||(p16==0))||((p45==0)||(p178==0)))) + AG((p21==1))) +...489
=> equivalent forward existential formula: (([(FwdU(((EY(Init) * !(((((p6==1)&&(p9==1))&&((p76==1)&&(p178==1))) + ((EX(((p122==1)&&(p109==1))) * (((p6==0)|...627
Reverse transition relation is NOT exact ! Due to transitions t10, t16, t17, t24, t33, t36, t37, t38, t62, t63, t66, t67, t69, t83, t89, t90, t93, t94, t96...449
Detected timeout of ITS tools.
[2024-05-21 20:38:37] [INFO ] Flatten gal took : 7 ms
[2024-05-21 20:38:37] [INFO ] Applying decomposition
[2024-05-21 20:38:37] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph1023936533351612146.txt' '-o' '/tmp/graph1023936533351612146.bin' '-w' '/tmp/graph1023936533351612146.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1023936533351612146.bin' '-l' '-1' '-v' '-w' '/tmp/graph1023936533351612146.weights' '-q' '0' '-e' '0.001'
[2024-05-21 20:38:37] [INFO ] Decomposing Gal with order
[2024-05-21 20:38:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 20:38:37] [INFO ] Removed a total of 246 redundant transitions.
[2024-05-21 20:38:37] [INFO ] Flatten gal took : 16 ms
[2024-05-21 20:38:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 3 ms.
[2024-05-21 20:38:37] [INFO ] Time to serialize gal into /tmp/CTLFireability10412431613153115917.gal : 2 ms
[2024-05-21 20:38:37] [INFO ] Time to serialize properties into /tmp/CTLFireability3236207976527174726.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/CTLFireability10412431613153115917.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3236207976527174726.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,1.50474e+09,0.087194,6540,441,99,4416,762,446,9116,73,3842,0


Converting to forward existential form...Done !
original formula: ((AX(((((AX((((i11.u1.p6==0)||(i11.u1.p15==0))||((i8.i1.u43.p138==0)||(i11.u1.p178==0)))) * (i12.i0.u58.p191==0)) * (((i11.u1.p6==0)||(i1...770
=> equivalent forward existential formula: (([(FwdU(((EY(Init) * !(((((i11.u1.p6==1)&&(i11.u1.p9==1))&&((i5.i1.u22.p76==1)&&(i11.u1.p178==1))) + ((EX(((i8....908
Reverse transition relation is NOT exact ! Due to transitions t169, t174, t190, t206, t234, t259, i0.u53.t33, i0.u53.t36, i0.u53.t37, i0.u53.t38, i2.i1.t16...623
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 2
Fast SCC detection found a local SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
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 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
(forward)formula 0,0,13.4432,387492,1,0,748892,4214,3630,1.12822e+06,441,36342,784650
FORMULA AutonomousCar-PT-04b-CTLFireability-2024-11 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 : 209/209 places, 355/355 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 185 transition count 331
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 185 transition count 331
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Iterating post reduction 0 with 64 rules applied. Total rules applied 112 place count 185 transition count 267
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 118 place count 179 transition count 261
Iterating global reduction 1 with 6 rules applied. Total rules applied 124 place count 179 transition count 261
Applied a total of 124 rules in 6 ms. Remains 179 /209 variables (removed 30) and now considering 261/355 (removed 94) transitions.
// Phase 1: matrix 261 rows 179 cols
[2024-05-21 20:38:50] [INFO ] Computed 9 invariants in 1 ms
[2024-05-21 20:38:50] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-21 20:38:50] [INFO ] Invariant cache hit.
[2024-05-21 20:38:51] [INFO ] Implicit Places using invariants and state equation in 184 ms returned []
Implicit Place search using SMT with State Equation took 260 ms to find 0 implicit places.
Running 260 sub problems to find dead transitions.
[2024-05-21 20:38:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/178 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (OVERLAPS) 1/179 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-21 20:38:54] [INFO ] Deduced a trap composed of 24 places in 190 ms of which 3 ms to minimize.
[2024-05-21 20:38:55] [INFO ] Deduced a trap composed of 18 places in 159 ms of which 3 ms to minimize.
[2024-05-21 20:38:55] [INFO ] Deduced a trap composed of 48 places in 166 ms of which 3 ms to minimize.
[2024-05-21 20:38:55] [INFO ] Deduced a trap composed of 54 places in 160 ms of which 2 ms to minimize.
[2024-05-21 20:38:55] [INFO ] Deduced a trap composed of 34 places in 144 ms of which 3 ms to minimize.
[2024-05-21 20:38:55] [INFO ] Deduced a trap composed of 39 places in 144 ms of which 2 ms to minimize.
[2024-05-21 20:38:55] [INFO ] Deduced a trap composed of 36 places in 138 ms of which 3 ms to minimize.
[2024-05-21 20:38:56] [INFO ] Deduced a trap composed of 28 places in 139 ms of which 2 ms to minimize.
[2024-05-21 20:38:56] [INFO ] Deduced a trap composed of 38 places in 131 ms of which 2 ms to minimize.
[2024-05-21 20:38:56] [INFO ] Deduced a trap composed of 21 places in 122 ms of which 2 ms to minimize.
[2024-05-21 20:38:56] [INFO ] Deduced a trap composed of 38 places in 120 ms of which 2 ms to minimize.
[2024-05-21 20:38:56] [INFO ] Deduced a trap composed of 25 places in 122 ms of which 2 ms to minimize.
[2024-05-21 20:38:56] [INFO ] Deduced a trap composed of 33 places in 91 ms of which 1 ms to minimize.
[2024-05-21 20:38:56] [INFO ] Deduced a trap composed of 25 places in 89 ms of which 2 ms to minimize.
[2024-05-21 20:38:57] [INFO ] Deduced a trap composed of 22 places in 86 ms of which 2 ms to minimize.
[2024-05-21 20:38:57] [INFO ] Deduced a trap composed of 33 places in 83 ms of which 1 ms to minimize.
[2024-05-21 20:38:57] [INFO ] Deduced a trap composed of 39 places in 104 ms of which 2 ms to minimize.
[2024-05-21 20:38:57] [INFO ] Deduced a trap composed of 32 places in 126 ms of which 3 ms to minimize.
[2024-05-21 20:38:57] [INFO ] Deduced a trap composed of 31 places in 141 ms of which 3 ms to minimize.
[2024-05-21 20:38:57] [INFO ] Deduced a trap composed of 31 places in 154 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 20/29 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-21 20:38:57] [INFO ] Deduced a trap composed of 33 places in 89 ms of which 1 ms to minimize.
[2024-05-21 20:38:58] [INFO ] Deduced a trap composed of 36 places in 88 ms of which 2 ms to minimize.
[2024-05-21 20:38:58] [INFO ] Deduced a trap composed of 32 places in 88 ms of which 2 ms to minimize.
[2024-05-21 20:38:58] [INFO ] Deduced a trap composed of 31 places in 79 ms of which 1 ms to minimize.
[2024-05-21 20:38:58] [INFO ] Deduced a trap composed of 44 places in 79 ms of which 1 ms to minimize.
[2024-05-21 20:38:58] [INFO ] Deduced a trap composed of 25 places in 80 ms of which 1 ms to minimize.
[2024-05-21 20:38:58] [INFO ] Deduced a trap composed of 38 places in 69 ms of which 2 ms to minimize.
[2024-05-21 20:38:58] [INFO ] Deduced a trap composed of 33 places in 89 ms of which 1 ms to minimize.
[2024-05-21 20:38:59] [INFO ] Deduced a trap composed of 40 places in 53 ms of which 2 ms to minimize.
[2024-05-21 20:38:59] [INFO ] Deduced a trap composed of 40 places in 50 ms of which 2 ms to minimize.
[2024-05-21 20:38:59] [INFO ] Deduced a trap composed of 52 places in 78 ms of which 2 ms to minimize.
[2024-05-21 20:38:59] [INFO ] Deduced a trap composed of 31 places in 61 ms of which 2 ms to minimize.
[2024-05-21 20:38:59] [INFO ] Deduced a trap composed of 40 places in 47 ms of which 2 ms to minimize.
[2024-05-21 20:38:59] [INFO ] Deduced a trap composed of 33 places in 82 ms of which 1 ms to minimize.
[2024-05-21 20:38:59] [INFO ] Deduced a trap composed of 31 places in 100 ms of which 2 ms to minimize.
[2024-05-21 20:38:59] [INFO ] Deduced a trap composed of 40 places in 78 ms of which 2 ms to minimize.
[2024-05-21 20:39:00] [INFO ] Deduced a trap composed of 14 places in 116 ms of which 2 ms to minimize.
[2024-05-21 20:39:00] [INFO ] Deduced a trap composed of 5 places in 112 ms of which 2 ms to minimize.
[2024-05-21 20:39:00] [INFO ] Deduced a trap composed of 19 places in 102 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 19/48 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-21 20:39:03] [INFO ] Deduced a trap composed of 32 places in 143 ms of which 3 ms to minimize.
[2024-05-21 20:39:03] [INFO ] Deduced a trap composed of 32 places in 160 ms of which 3 ms to minimize.
[2024-05-21 20:39:03] [INFO ] Deduced a trap composed of 38 places in 99 ms of which 2 ms to minimize.
[2024-05-21 20:39:04] [INFO ] Deduced a trap composed of 38 places in 85 ms of which 2 ms to minimize.
[2024-05-21 20:39:04] [INFO ] Deduced a trap composed of 39 places in 81 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 5/53 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-21 20:39:05] [INFO ] Deduced a trap composed of 40 places in 89 ms of which 3 ms to minimize.
[2024-05-21 20:39:05] [INFO ] Deduced a trap composed of 40 places in 81 ms of which 2 ms to minimize.
[2024-05-21 20:39:06] [INFO ] Deduced a trap composed of 51 places in 83 ms of which 2 ms to minimize.
[2024-05-21 20:39:06] [INFO ] Deduced a trap composed of 43 places in 104 ms of which 2 ms to minimize.
[2024-05-21 20:39:06] [INFO ] Deduced a trap composed of 38 places in 100 ms of which 2 ms to minimize.
[2024-05-21 20:39:06] [INFO ] Deduced a trap composed of 51 places in 96 ms of which 3 ms to minimize.
[2024-05-21 20:39:06] [INFO ] Deduced a trap composed of 38 places in 90 ms of which 2 ms to minimize.
[2024-05-21 20:39:06] [INFO ] Deduced a trap composed of 51 places in 85 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/179 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-21 20:39:09] [INFO ] Deduced a trap composed of 37 places in 164 ms of which 3 ms to minimize.
[2024-05-21 20:39:09] [INFO ] Deduced a trap composed of 53 places in 159 ms of which 3 ms to minimize.
[2024-05-21 20:39:09] [INFO ] Deduced a trap composed of 38 places in 145 ms of which 2 ms to minimize.
[2024-05-21 20:39:09] [INFO ] Deduced a trap composed of 36 places in 131 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/179 variables, 4/65 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-21 20:39:12] [INFO ] Deduced a trap composed of 15 places in 163 ms of which 3 ms to minimize.
[2024-05-21 20:39:13] [INFO ] Deduced a trap composed of 31 places in 180 ms of which 3 ms to minimize.
[2024-05-21 20:39:13] [INFO ] Deduced a trap composed of 39 places in 60 ms of which 1 ms to minimize.
[2024-05-21 20:39:13] [INFO ] Deduced a trap composed of 32 places in 55 ms of which 2 ms to minimize.
[2024-05-21 20:39:13] [INFO ] Deduced a trap composed of 46 places in 133 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/179 variables, 5/70 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/179 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 9 (OVERLAPS) 261/440 variables, 179/249 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 440/440 variables, and 249 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 179/179 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 61/61 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/178 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (OVERLAPS) 1/179 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 61/70 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (OVERLAPS) 261/440 variables, 179/249 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/440 variables, 260/509 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/440 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (OVERLAPS) 0/440 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Int declared 440/440 variables, and 509 constraints, problems are : Problem set: 0 solved, 260 unsolved in 25895 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 179/179 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 61/61 constraints]
After SMT, in 56040ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 56042ms
Starting structural reductions in LTL mode, iteration 1 : 179/209 places, 261/355 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56309 ms. Remains : 179/209 places, 261/355 transitions.
[2024-05-21 20:39:47] [INFO ] Flatten gal took : 7 ms
[2024-05-21 20:39:47] [INFO ] Flatten gal took : 6 ms
[2024-05-21 20:39:47] [INFO ] Input system was already deterministic with 261 transitions.
[2024-05-21 20:39:47] [INFO ] Flatten gal took : 7 ms
[2024-05-21 20:39:47] [INFO ] Flatten gal took : 6 ms
[2024-05-21 20:39:47] [INFO ] Time to serialize gal into /tmp/CTLFireability11907137097543135526.gal : 2 ms
[2024-05-21 20:39:47] [INFO ] Time to serialize properties into /tmp/CTLFireability12782526401837947313.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/CTLFireability11907137097543135526.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12782526401837947313.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.50619e+09,8.39729,179504,2,14842,5,700685,6,0,979,844223,0


Converting to forward existential form...Done !
original formula: AG((EX(EF((p171==1))) * (((p6==0)||(p9==0))||((p33==0)||(p178==0)))))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(EX(E(TRUE U (p171==1)))))] = FALSE * [(FwdU(Init,TRUE) * !((((p6==0)||(p9==0))||((p33==0)...180
(forward)formula 0,0,8.41541,179504,1,0,8,700685,9,2,1002,844223,1
FORMULA AutonomousCar-PT-04b-CTLFireability-2023-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 209/209 places, 355/355 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 184 transition count 330
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 184 transition count 330
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Iterating post reduction 0 with 64 rules applied. Total rules applied 114 place count 184 transition count 266
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 120 place count 178 transition count 260
Iterating global reduction 1 with 6 rules applied. Total rules applied 126 place count 178 transition count 260
Applied a total of 126 rules in 6 ms. Remains 178 /209 variables (removed 31) and now considering 260/355 (removed 95) transitions.
// Phase 1: matrix 260 rows 178 cols
[2024-05-21 20:39:55] [INFO ] Computed 9 invariants in 2 ms
[2024-05-21 20:39:55] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-05-21 20:39:55] [INFO ] Invariant cache hit.
[2024-05-21 20:39:55] [INFO ] Implicit Places using invariants and state equation in 181 ms returned []
Implicit Place search using SMT with State Equation took 290 ms to find 0 implicit places.
Running 259 sub problems to find dead transitions.
[2024-05-21 20:39:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/177 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 1 (OVERLAPS) 1/178 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-21 20:39:59] [INFO ] Deduced a trap composed of 16 places in 147 ms of which 3 ms to minimize.
[2024-05-21 20:39:59] [INFO ] Deduced a trap composed of 14 places in 179 ms of which 3 ms to minimize.
[2024-05-21 20:40:00] [INFO ] Deduced a trap composed of 39 places in 58 ms of which 1 ms to minimize.
[2024-05-21 20:40:00] [INFO ] Deduced a trap composed of 24 places in 163 ms of which 3 ms to minimize.
[2024-05-21 20:40:00] [INFO ] Deduced a trap composed of 22 places in 169 ms of which 3 ms to minimize.
[2024-05-21 20:40:00] [INFO ] Deduced a trap composed of 33 places in 145 ms of which 3 ms to minimize.
[2024-05-21 20:40:00] [INFO ] Deduced a trap composed of 29 places in 156 ms of which 3 ms to minimize.
[2024-05-21 20:40:00] [INFO ] Deduced a trap composed of 29 places in 153 ms of which 3 ms to minimize.
[2024-05-21 20:40:01] [INFO ] Deduced a trap composed of 31 places in 168 ms of which 9 ms to minimize.
[2024-05-21 20:40:01] [INFO ] Deduced a trap composed of 28 places in 151 ms of which 3 ms to minimize.
[2024-05-21 20:40:01] [INFO ] Deduced a trap composed of 32 places in 154 ms of which 3 ms to minimize.
[2024-05-21 20:40:01] [INFO ] Deduced a trap composed of 31 places in 152 ms of which 3 ms to minimize.
[2024-05-21 20:40:01] [INFO ] Deduced a trap composed of 31 places in 130 ms of which 3 ms to minimize.
[2024-05-21 20:40:02] [INFO ] Deduced a trap composed of 34 places in 148 ms of which 2 ms to minimize.
[2024-05-21 20:40:02] [INFO ] Deduced a trap composed of 38 places in 131 ms of which 3 ms to minimize.
[2024-05-21 20:40:02] [INFO ] Deduced a trap composed of 39 places in 108 ms of which 2 ms to minimize.
[2024-05-21 20:40:02] [INFO ] Deduced a trap composed of 38 places in 99 ms of which 2 ms to minimize.
[2024-05-21 20:40:02] [INFO ] Deduced a trap composed of 46 places in 123 ms of which 2 ms to minimize.
[2024-05-21 20:40:02] [INFO ] Deduced a trap composed of 38 places in 103 ms of which 3 ms to minimize.
[2024-05-21 20:40:03] [INFO ] Deduced a trap composed of 40 places in 162 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 20/29 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-21 20:40:03] [INFO ] Deduced a trap composed of 33 places in 164 ms of which 3 ms to minimize.
[2024-05-21 20:40:03] [INFO ] Deduced a trap composed of 36 places in 165 ms of which 2 ms to minimize.
[2024-05-21 20:40:03] [INFO ] Deduced a trap composed of 46 places in 152 ms of which 2 ms to minimize.
[2024-05-21 20:40:04] [INFO ] Deduced a trap composed of 35 places in 166 ms of which 3 ms to minimize.
[2024-05-21 20:40:04] [INFO ] Deduced a trap composed of 31 places in 160 ms of which 2 ms to minimize.
[2024-05-21 20:40:04] [INFO ] Deduced a trap composed of 31 places in 152 ms of which 3 ms to minimize.
[2024-05-21 20:40:04] [INFO ] Deduced a trap composed of 25 places in 154 ms of which 3 ms to minimize.
[2024-05-21 20:40:04] [INFO ] Deduced a trap composed of 32 places in 165 ms of which 3 ms to minimize.
[2024-05-21 20:40:04] [INFO ] Deduced a trap composed of 24 places in 148 ms of which 3 ms to minimize.
[2024-05-21 20:40:05] [INFO ] Deduced a trap composed of 32 places in 120 ms of which 3 ms to minimize.
[2024-05-21 20:40:05] [INFO ] Deduced a trap composed of 31 places in 146 ms of which 3 ms to minimize.
[2024-05-21 20:40:05] [INFO ] Deduced a trap composed of 40 places in 123 ms of which 3 ms to minimize.
[2024-05-21 20:40:05] [INFO ] Deduced a trap composed of 38 places in 110 ms of which 3 ms to minimize.
[2024-05-21 20:40:06] [INFO ] Deduced a trap composed of 33 places in 131 ms of which 2 ms to minimize.
[2024-05-21 20:40:06] [INFO ] Deduced a trap composed of 40 places in 114 ms of which 2 ms to minimize.
[2024-05-21 20:40:06] [INFO ] Deduced a trap composed of 19 places in 157 ms of which 3 ms to minimize.
[2024-05-21 20:40:07] [INFO ] Deduced a trap composed of 14 places in 157 ms of which 3 ms to minimize.
[2024-05-21 20:40:07] [INFO ] Deduced a trap composed of 5 places in 164 ms of which 3 ms to minimize.
[2024-05-21 20:40:07] [INFO ] Deduced a trap composed of 44 places in 138 ms of which 3 ms to minimize.
[2024-05-21 20:40:08] [INFO ] Deduced a trap composed of 19 places in 89 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/178 variables, 20/49 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-21 20:40:10] [INFO ] Deduced a trap composed of 51 places in 111 ms of which 2 ms to minimize.
[2024-05-21 20:40:10] [INFO ] Deduced a trap composed of 31 places in 151 ms of which 3 ms to minimize.
[2024-05-21 20:40:10] [INFO ] Deduced a trap composed of 40 places in 83 ms of which 2 ms to minimize.
[2024-05-21 20:40:11] [INFO ] Deduced a trap composed of 38 places in 136 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/178 variables, 4/53 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-21 20:40:13] [INFO ] Deduced a trap composed of 31 places in 166 ms of which 3 ms to minimize.
[2024-05-21 20:40:13] [INFO ] Deduced a trap composed of 31 places in 157 ms of which 3 ms to minimize.
[2024-05-21 20:40:13] [INFO ] Deduced a trap composed of 32 places in 149 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/178 variables, 3/56 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-21 20:40:15] [INFO ] Deduced a trap composed of 18 places in 104 ms of which 3 ms to minimize.
[2024-05-21 20:40:15] [INFO ] Deduced a trap composed of 42 places in 112 ms of which 2 ms to minimize.
[2024-05-21 20:40:16] [INFO ] Deduced a trap composed of 42 places in 107 ms of which 3 ms to minimize.
[2024-05-21 20:40:16] [INFO ] Deduced a trap composed of 38 places in 87 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/178 variables, 4/60 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/178 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 8 (OVERLAPS) 260/438 variables, 178/238 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-21 20:40:21] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 3 ms to minimize.
[2024-05-21 20:40:21] [INFO ] Deduced a trap composed of 35 places in 124 ms of which 3 ms to minimize.
[2024-05-21 20:40:21] [INFO ] Deduced a trap composed of 36 places in 124 ms of which 3 ms to minimize.
[2024-05-21 20:40:21] [INFO ] Deduced a trap composed of 32 places in 113 ms of which 2 ms to minimize.
[2024-05-21 20:40:22] [INFO ] Deduced a trap composed of 44 places in 116 ms of which 3 ms to minimize.
[2024-05-21 20:40:23] [INFO ] Deduced a trap composed of 32 places in 129 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/438 variables, 6/244 constraints. Problems are: Problem set: 0 solved, 259 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 438/438 variables, and 244 constraints, problems are : Problem set: 0 solved, 259 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 178/178 constraints, PredecessorRefiner: 259/259 constraints, Known Traps: 57/57 constraints]
Escalating to Integer solving :Problem set: 0 solved, 259 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/177 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 1 (OVERLAPS) 1/178 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 57/66 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-21 20:40:28] [INFO ] Deduced a trap composed of 39 places in 74 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/178 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/178 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 5 (OVERLAPS) 260/438 variables, 178/245 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/438 variables, 259/504 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-21 20:40:36] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/438 variables, 1/505 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/438 variables, 0/505 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 9 (OVERLAPS) 0/438 variables, 0/505 constraints. Problems are: Problem set: 0 solved, 259 unsolved
No progress, stopping.
After SMT solving in domain Int declared 438/438 variables, and 505 constraints, problems are : Problem set: 0 solved, 259 unsolved in 27313 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 178/178 constraints, PredecessorRefiner: 259/259 constraints, Known Traps: 59/59 constraints]
After SMT, in 57490ms problems are : Problem set: 0 solved, 259 unsolved
Search for dead transitions found 0 dead transitions in 57493ms
Starting structural reductions in LTL mode, iteration 1 : 178/209 places, 260/355 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57790 ms. Remains : 178/209 places, 260/355 transitions.
[2024-05-21 20:40:53] [INFO ] Flatten gal took : 6 ms
[2024-05-21 20:40:53] [INFO ] Flatten gal took : 7 ms
[2024-05-21 20:40:53] [INFO ] Input system was already deterministic with 260 transitions.
[2024-05-21 20:40:53] [INFO ] Flatten gal took : 6 ms
[2024-05-21 20:40:53] [INFO ] Flatten gal took : 6 ms
[2024-05-21 20:40:53] [INFO ] Time to serialize gal into /tmp/CTLFireability14680371378106022528.gal : 2 ms
[2024-05-21 20:40:53] [INFO ] Time to serialize properties into /tmp/CTLFireability1055897311189114123.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/CTLFireability14680371378106022528.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1055897311189114123.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.39231e+09,10.1349,215140,2,14885,5,812872,6,0,974,1.05478e+06,0


Converting to forward existential form...Done !
original formula: AF((AG(((p55==0)&&(p193==0))) * AX(FALSE)))
=> equivalent forward existential formula: [FwdG(Init,!((!(E(TRUE U !(((p55==0)&&(p193==0))))) * !(EX(!(FALSE))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t10, t16, t17, t24, t32, t35, t36, t37, t61, t62, t65, t66, t68, t81, t87, t88, t91, t92, t94...449
Detected timeout of ITS tools.
[2024-05-21 20:41:23] [INFO ] Flatten gal took : 7 ms
[2024-05-21 20:41:23] [INFO ] Applying decomposition
[2024-05-21 20:41:23] [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/graph10938561715740096334.txt' '-o' '/tmp/graph10938561715740096334.bin' '-w' '/tmp/graph10938561715740096334.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10938561715740096334.bin' '-l' '-1' '-v' '-w' '/tmp/graph10938561715740096334.weights' '-q' '0' '-e' '0.001'
[2024-05-21 20:41:23] [INFO ] Decomposing Gal with order
[2024-05-21 20:41:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 20:41:23] [INFO ] Removed a total of 239 redundant transitions.
[2024-05-21 20:41:23] [INFO ] Flatten gal took : 15 ms
[2024-05-21 20:41:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 18 labels/synchronizations in 2 ms.
[2024-05-21 20:41:23] [INFO ] Time to serialize gal into /tmp/CTLFireability11321365687743796026.gal : 3 ms
[2024-05-21 20:41:23] [INFO ] Time to serialize properties into /tmp/CTLFireability14641468609564096176.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/CTLFireability11321365687743796026.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14641468609564096176.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.39231e+09,0.072258,5476,442,100,2825,507,465,3672,76,1246,0


Converting to forward existential form...Done !
original formula: AF((AG(((i1.i1.u17.p55==0)&&(i12.u57.p193==0))) * AX(FALSE)))
=> equivalent forward existential formula: [FwdG(Init,!((!(E(TRUE U !(((i1.i1.u17.p55==0)&&(i12.u57.p193==0))))) * !(EX(!(FALSE))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t167, t169, t185, t201, t229, t257, i1.i1.t158, i1.i1.u9.t138, i1.i1.u17.t139, i2.u14.t142, i...633
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
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 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
(forward)formula 0,0,3.59522,103156,1,0,236171,1998,3059,239310,400,10297,347460
FORMULA AutonomousCar-PT-04b-CTLFireability-2023-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 209/209 places, 355/355 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 188 transition count 334
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 188 transition count 334
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Iterating post reduction 0 with 64 rules applied. Total rules applied 106 place count 188 transition count 270
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 110 place count 184 transition count 266
Iterating global reduction 1 with 4 rules applied. Total rules applied 114 place count 184 transition count 266
Applied a total of 114 rules in 7 ms. Remains 184 /209 variables (removed 25) and now considering 266/355 (removed 89) transitions.
// Phase 1: matrix 266 rows 184 cols
[2024-05-21 20:41:27] [INFO ] Computed 9 invariants in 1 ms
[2024-05-21 20:41:27] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-21 20:41:27] [INFO ] Invariant cache hit.
[2024-05-21 20:41:27] [INFO ] Implicit Places using invariants and state equation in 177 ms returned []
Implicit Place search using SMT with State Equation took 248 ms to find 0 implicit places.
Running 265 sub problems to find dead transitions.
[2024-05-21 20:41:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 1 (OVERLAPS) 1/184 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 265 unsolved
[2024-05-21 20:41:30] [INFO ] Deduced a trap composed of 17 places in 195 ms of which 4 ms to minimize.
[2024-05-21 20:41:30] [INFO ] Deduced a trap composed of 18 places in 120 ms of which 2 ms to minimize.
[2024-05-21 20:41:30] [INFO ] Deduced a trap composed of 19 places in 114 ms of which 3 ms to minimize.
[2024-05-21 20:41:30] [INFO ] Deduced a trap composed of 37 places in 139 ms of which 3 ms to minimize.
[2024-05-21 20:41:31] [INFO ] Deduced a trap composed of 29 places in 79 ms of which 2 ms to minimize.
[2024-05-21 20:41:31] [INFO ] Deduced a trap composed of 39 places in 182 ms of which 3 ms to minimize.
[2024-05-21 20:41:31] [INFO ] Deduced a trap composed of 31 places in 176 ms of which 3 ms to minimize.
[2024-05-21 20:41:31] [INFO ] Deduced a trap composed of 39 places in 172 ms of which 3 ms to minimize.
[2024-05-21 20:41:31] [INFO ] Deduced a trap composed of 32 places in 142 ms of which 3 ms to minimize.
[2024-05-21 20:41:31] [INFO ] Deduced a trap composed of 43 places in 169 ms of which 3 ms to minimize.
[2024-05-21 20:41:32] [INFO ] Deduced a trap composed of 31 places in 150 ms of which 3 ms to minimize.
[2024-05-21 20:41:32] [INFO ] Deduced a trap composed of 24 places in 167 ms of which 3 ms to minimize.
[2024-05-21 20:41:32] [INFO ] Deduced a trap composed of 31 places in 153 ms of which 3 ms to minimize.
[2024-05-21 20:41:32] [INFO ] Deduced a trap composed of 46 places in 171 ms of which 3 ms to minimize.
[2024-05-21 20:41:32] [INFO ] Deduced a trap composed of 30 places in 156 ms of which 3 ms to minimize.
[2024-05-21 20:41:33] [INFO ] Deduced a trap composed of 31 places in 144 ms of which 3 ms to minimize.
[2024-05-21 20:41:33] [INFO ] Deduced a trap composed of 25 places in 166 ms of which 3 ms to minimize.
[2024-05-21 20:41:33] [INFO ] Deduced a trap composed of 41 places in 100 ms of which 3 ms to minimize.
[2024-05-21 20:41:33] [INFO ] Deduced a trap composed of 43 places in 103 ms of which 2 ms to minimize.
[2024-05-21 20:41:33] [INFO ] Deduced a trap composed of 32 places in 153 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/184 variables, 20/29 constraints. Problems are: Problem set: 0 solved, 265 unsolved
[2024-05-21 20:41:34] [INFO ] Deduced a trap composed of 22 places in 110 ms of which 3 ms to minimize.
[2024-05-21 20:41:34] [INFO ] Deduced a trap composed of 42 places in 114 ms of which 2 ms to minimize.
[2024-05-21 20:41:34] [INFO ] Deduced a trap composed of 31 places in 170 ms of which 3 ms to minimize.
[2024-05-21 20:41:35] [INFO ] Deduced a trap composed of 23 places in 181 ms of which 3 ms to minimize.
[2024-05-21 20:41:35] [INFO ] Deduced a trap composed of 41 places in 161 ms of which 3 ms to minimize.
[2024-05-21 20:41:35] [INFO ] Deduced a trap composed of 37 places in 170 ms of which 3 ms to minimize.
[2024-05-21 20:41:35] [INFO ] Deduced a trap composed of 40 places in 167 ms of which 3 ms to minimize.
[2024-05-21 20:41:35] [INFO ] Deduced a trap composed of 33 places in 159 ms of which 3 ms to minimize.
[2024-05-21 20:41:35] [INFO ] Deduced a trap composed of 34 places in 152 ms of which 2 ms to minimize.
[2024-05-21 20:41:36] [INFO ] Deduced a trap composed of 33 places in 144 ms of which 3 ms to minimize.
[2024-05-21 20:41:36] [INFO ] Deduced a trap composed of 39 places in 141 ms of which 2 ms to minimize.
[2024-05-21 20:41:36] [INFO ] Deduced a trap composed of 32 places in 139 ms of which 3 ms to minimize.
[2024-05-21 20:41:36] [INFO ] Deduced a trap composed of 38 places in 166 ms of which 3 ms to minimize.
[2024-05-21 20:41:36] [INFO ] Deduced a trap composed of 39 places in 155 ms of which 3 ms to minimize.
[2024-05-21 20:41:37] [INFO ] Deduced a trap composed of 31 places in 159 ms of which 3 ms to minimize.
[2024-05-21 20:41:37] [INFO ] Deduced a trap composed of 52 places in 142 ms of which 2 ms to minimize.
[2024-05-21 20:41:37] [INFO ] Deduced a trap composed of 38 places in 86 ms of which 1 ms to minimize.
[2024-05-21 20:41:37] [INFO ] Deduced a trap composed of 44 places in 92 ms of which 2 ms to minimize.
[2024-05-21 20:41:37] [INFO ] Deduced a trap composed of 54 places in 84 ms of which 2 ms to minimize.
[2024-05-21 20:41:37] [INFO ] Deduced a trap composed of 44 places in 96 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 20/49 constraints. Problems are: Problem set: 0 solved, 265 unsolved
[2024-05-21 20:41:40] [INFO ] Deduced a trap composed of 32 places in 135 ms of which 3 ms to minimize.
[2024-05-21 20:41:40] [INFO ] Deduced a trap composed of 45 places in 129 ms of which 3 ms to minimize.
[2024-05-21 20:41:40] [INFO ] Deduced a trap composed of 44 places in 116 ms of which 2 ms to minimize.
[2024-05-21 20:41:41] [INFO ] Deduced a trap composed of 39 places in 76 ms of which 2 ms to minimize.
[2024-05-21 20:41:41] [INFO ] Deduced a trap composed of 52 places in 115 ms of which 3 ms to minimize.
[2024-05-21 20:41:41] [INFO ] Deduced a trap composed of 35 places in 95 ms of which 2 ms to minimize.
[2024-05-21 20:41:41] [INFO ] Deduced a trap composed of 5 places in 119 ms of which 2 ms to minimize.
[2024-05-21 20:41:41] [INFO ] Deduced a trap composed of 32 places in 108 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 8/57 constraints. Problems are: Problem set: 0 solved, 265 unsolved
[2024-05-21 20:41:42] [INFO ] Deduced a trap composed of 33 places in 88 ms of which 2 ms to minimize.
[2024-05-21 20:41:43] [INFO ] Deduced a trap composed of 35 places in 46 ms of which 1 ms to minimize.
[2024-05-21 20:41:43] [INFO ] Deduced a trap composed of 31 places in 75 ms of which 1 ms to minimize.
[2024-05-21 20:41:43] [INFO ] Deduced a trap composed of 40 places in 59 ms of which 7 ms to minimize.
[2024-05-21 20:41:43] [INFO ] Deduced a trap composed of 14 places in 75 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 5/62 constraints. Problems are: Problem set: 0 solved, 265 unsolved
[2024-05-21 20:41:45] [INFO ] Deduced a trap composed of 14 places in 161 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 8 (OVERLAPS) 266/450 variables, 184/247 constraints. Problems are: Problem set: 0 solved, 265 unsolved
[2024-05-21 20:41:50] [INFO ] Deduced a trap composed of 38 places in 78 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/450 variables, 1/248 constraints. Problems are: Problem set: 0 solved, 265 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 450/450 variables, and 248 constraints, problems are : Problem set: 0 solved, 265 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 184/184 constraints, PredecessorRefiner: 265/265 constraints, Known Traps: 55/55 constraints]
Escalating to Integer solving :Problem set: 0 solved, 265 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 1 (OVERLAPS) 1/184 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/184 variables, 55/64 constraints. Problems are: Problem set: 0 solved, 265 unsolved
[2024-05-21 20:42:00] [INFO ] Deduced a trap composed of 38 places in 109 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 5 (OVERLAPS) 266/450 variables, 184/249 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/450 variables, 265/514 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/450 variables, 0/514 constraints. Problems are: Problem set: 0 solved, 265 unsolved
[2024-05-21 20:42:15] [INFO ] Deduced a trap composed of 40 places in 57 ms of which 2 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/450 variables, 1/515 constraints. Problems are: Problem set: 0 solved, 265 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 450/450 variables, and 515 constraints, problems are : Problem set: 0 solved, 265 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 184/184 constraints, PredecessorRefiner: 265/265 constraints, Known Traps: 57/57 constraints]
After SMT, in 60158ms problems are : Problem set: 0 solved, 265 unsolved
Search for dead transitions found 0 dead transitions in 60162ms
Starting structural reductions in LTL mode, iteration 1 : 184/209 places, 266/355 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60418 ms. Remains : 184/209 places, 266/355 transitions.
[2024-05-21 20:42:27] [INFO ] Flatten gal took : 10 ms
[2024-05-21 20:42:27] [INFO ] Flatten gal took : 11 ms
[2024-05-21 20:42:27] [INFO ] Input system was already deterministic with 266 transitions.
[2024-05-21 20:42:27] [INFO ] Flatten gal took : 11 ms
[2024-05-21 20:42:27] [INFO ] Flatten gal took : 11 ms
[2024-05-21 20:42:27] [INFO ] Time to serialize gal into /tmp/CTLFireability12073291321400302336.gal : 2 ms
[2024-05-21 20:42:27] [INFO ] Time to serialize properties into /tmp/CTLFireability12727049231463276188.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/CTLFireability12073291321400302336.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12727049231463276188.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.59601e+09,8.29298,184332,2,14927,5,699464,6,0,1004,914568,0


Converting to forward existential form...Done !
original formula: E((!(((((p56==1)&&(p87==1))&&((p118==1)&&(p143==1)))&&(p179==1))) + AG(!((((p6==1)&&(p9==1))&&((p138==1)&&(p178==1)))))) U (A((((!((((p6=...623
=> equivalent forward existential formula: [(((FwdU(Init,(!(((((p56==1)&&(p87==1))&&((p118==1)&&(p143==1)))&&(p179==1))) + !(E(TRUE U !(!((((p6==1)&&(p9==1...1585
Reverse transition relation is NOT exact ! Due to transitions t10, t16, t17, t25, t30, t34, t37, t38, t39, t64, t65, t68, t69, t71, t84, t90, t91, t94, t95...466
Detected timeout of ITS tools.
[2024-05-21 20:42:57] [INFO ] Flatten gal took : 8 ms
[2024-05-21 20:42:57] [INFO ] Applying decomposition
[2024-05-21 20:42:57] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph15279164012913885382.txt' '-o' '/tmp/graph15279164012913885382.bin' '-w' '/tmp/graph15279164012913885382.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15279164012913885382.bin' '-l' '-1' '-v' '-w' '/tmp/graph15279164012913885382.weights' '-q' '0' '-e' '0.001'
[2024-05-21 20:42:57] [INFO ] Decomposing Gal with order
[2024-05-21 20:42:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 20:42:57] [INFO ] Removed a total of 238 redundant transitions.
[2024-05-21 20:42:57] [INFO ] Flatten gal took : 15 ms
[2024-05-21 20:42:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 24 labels/synchronizations in 2 ms.
[2024-05-21 20:42:57] [INFO ] Time to serialize gal into /tmp/CTLFireability16307610876180802511.gal : 2 ms
[2024-05-21 20:42:57] [INFO ] Time to serialize properties into /tmp/CTLFireability6468288246614043727.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/CTLFireability16307610876180802511.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6468288246614043727.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,1.59601e+09,0.135091,6240,480,102,4495,543,441,6075,75,1598,0


Converting to forward existential form...Done !
original formula: E((!(((((i2.i0.u17.p56==1)&&(i5.u27.p87==1))&&((i7.u38.p118==1)&&(i8.u46.p143==1)))&&(i11.u56.p179==1))) + AG(!((((i0.u1.p6==1)&&(i0.u1.p...976
=> equivalent forward existential formula: [(((FwdU(Init,(!(((((i2.i0.u17.p56==1)&&(i5.u27.p87==1))&&((i7.u38.p118==1)&&(i8.u46.p143==1)))&&(i11.u56.p179==...2378
Reverse transition relation is NOT exact ! Due to transitions t172, t177, t193, t213, t233, t239, t263, i0.t170, i2.i0.t143, i2.i0.t163, i2.i0.u10.t162, i2...643
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 an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found a local SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
(forward)formula 0,1,15.6654,435240,1,0,895438,3147,3775,1.08005e+06,454,17938,973755
FORMULA AutonomousCar-PT-04b-CTLFireability-2023-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 209/209 places, 355/355 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 184 transition count 330
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 184 transition count 330
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Iterating post reduction 0 with 64 rules applied. Total rules applied 114 place count 184 transition count 266
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 120 place count 178 transition count 260
Iterating global reduction 1 with 6 rules applied. Total rules applied 126 place count 178 transition count 260
Applied a total of 126 rules in 6 ms. Remains 178 /209 variables (removed 31) and now considering 260/355 (removed 95) transitions.
// Phase 1: matrix 260 rows 178 cols
[2024-05-21 20:43:13] [INFO ] Computed 9 invariants in 1 ms
[2024-05-21 20:43:13] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-21 20:43:13] [INFO ] Invariant cache hit.
[2024-05-21 20:43:13] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 254 ms to find 0 implicit places.
Running 259 sub problems to find dead transitions.
[2024-05-21 20:43:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/177 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 1 (OVERLAPS) 1/178 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-21 20:43:16] [INFO ] Deduced a trap composed of 16 places in 106 ms of which 2 ms to minimize.
[2024-05-21 20:43:16] [INFO ] Deduced a trap composed of 14 places in 155 ms of which 3 ms to minimize.
[2024-05-21 20:43:17] [INFO ] Deduced a trap composed of 39 places in 67 ms of which 2 ms to minimize.
[2024-05-21 20:43:17] [INFO ] Deduced a trap composed of 24 places in 167 ms of which 3 ms to minimize.
[2024-05-21 20:43:17] [INFO ] Deduced a trap composed of 22 places in 159 ms of which 2 ms to minimize.
[2024-05-21 20:43:17] [INFO ] Deduced a trap composed of 33 places in 154 ms of which 3 ms to minimize.
[2024-05-21 20:43:17] [INFO ] Deduced a trap composed of 29 places in 153 ms of which 3 ms to minimize.
[2024-05-21 20:43:17] [INFO ] Deduced a trap composed of 29 places in 150 ms of which 2 ms to minimize.
[2024-05-21 20:43:18] [INFO ] Deduced a trap composed of 31 places in 161 ms of which 3 ms to minimize.
[2024-05-21 20:43:18] [INFO ] Deduced a trap composed of 28 places in 154 ms of which 2 ms to minimize.
[2024-05-21 20:43:18] [INFO ] Deduced a trap composed of 32 places in 155 ms of which 3 ms to minimize.
[2024-05-21 20:43:18] [INFO ] Deduced a trap composed of 31 places in 154 ms of which 3 ms to minimize.
[2024-05-21 20:43:18] [INFO ] Deduced a trap composed of 31 places in 143 ms of which 2 ms to minimize.
[2024-05-21 20:43:19] [INFO ] Deduced a trap composed of 34 places in 164 ms of which 3 ms to minimize.
[2024-05-21 20:43:19] [INFO ] Deduced a trap composed of 38 places in 127 ms of which 2 ms to minimize.
[2024-05-21 20:43:19] [INFO ] Deduced a trap composed of 39 places in 110 ms of which 3 ms to minimize.
[2024-05-21 20:43:19] [INFO ] Deduced a trap composed of 38 places in 104 ms of which 2 ms to minimize.
[2024-05-21 20:43:19] [INFO ] Deduced a trap composed of 46 places in 118 ms of which 2 ms to minimize.
[2024-05-21 20:43:19] [INFO ] Deduced a trap composed of 38 places in 110 ms of which 3 ms to minimize.
[2024-05-21 20:43:20] [INFO ] Deduced a trap composed of 40 places in 143 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 20/29 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-21 20:43:20] [INFO ] Deduced a trap composed of 33 places in 149 ms of which 3 ms to minimize.
[2024-05-21 20:43:20] [INFO ] Deduced a trap composed of 36 places in 133 ms of which 2 ms to minimize.
[2024-05-21 20:43:20] [INFO ] Deduced a trap composed of 46 places in 91 ms of which 1 ms to minimize.
[2024-05-21 20:43:20] [INFO ] Deduced a trap composed of 35 places in 87 ms of which 2 ms to minimize.
[2024-05-21 20:43:21] [INFO ] Deduced a trap composed of 31 places in 91 ms of which 1 ms to minimize.
[2024-05-21 20:43:21] [INFO ] Deduced a trap composed of 31 places in 85 ms of which 2 ms to minimize.
[2024-05-21 20:43:21] [INFO ] Deduced a trap composed of 25 places in 80 ms of which 2 ms to minimize.
[2024-05-21 20:43:21] [INFO ] Deduced a trap composed of 32 places in 88 ms of which 2 ms to minimize.
[2024-05-21 20:43:21] [INFO ] Deduced a trap composed of 24 places in 85 ms of which 1 ms to minimize.
[2024-05-21 20:43:21] [INFO ] Deduced a trap composed of 32 places in 76 ms of which 1 ms to minimize.
[2024-05-21 20:43:21] [INFO ] Deduced a trap composed of 31 places in 89 ms of which 2 ms to minimize.
[2024-05-21 20:43:21] [INFO ] Deduced a trap composed of 40 places in 72 ms of which 2 ms to minimize.
[2024-05-21 20:43:21] [INFO ] Deduced a trap composed of 38 places in 66 ms of which 2 ms to minimize.
[2024-05-21 20:43:22] [INFO ] Deduced a trap composed of 33 places in 88 ms of which 2 ms to minimize.
[2024-05-21 20:43:22] [INFO ] Deduced a trap composed of 40 places in 107 ms of which 2 ms to minimize.
[2024-05-21 20:43:22] [INFO ] Deduced a trap composed of 19 places in 155 ms of which 2 ms to minimize.
[2024-05-21 20:43:22] [INFO ] Deduced a trap composed of 14 places in 154 ms of which 2 ms to minimize.
[2024-05-21 20:43:23] [INFO ] Deduced a trap composed of 5 places in 156 ms of which 2 ms to minimize.
[2024-05-21 20:43:23] [INFO ] Deduced a trap composed of 44 places in 150 ms of which 3 ms to minimize.
[2024-05-21 20:43:23] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/178 variables, 20/49 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-21 20:43:25] [INFO ] Deduced a trap composed of 51 places in 112 ms of which 2 ms to minimize.
[2024-05-21 20:43:25] [INFO ] Deduced a trap composed of 31 places in 152 ms of which 3 ms to minimize.
[2024-05-21 20:43:26] [INFO ] Deduced a trap composed of 40 places in 84 ms of which 2 ms to minimize.
[2024-05-21 20:43:26] [INFO ] Deduced a trap composed of 38 places in 117 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/178 variables, 4/53 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-21 20:43:28] [INFO ] Deduced a trap composed of 31 places in 120 ms of which 2 ms to minimize.
[2024-05-21 20:43:28] [INFO ] Deduced a trap composed of 31 places in 149 ms of which 3 ms to minimize.
[2024-05-21 20:43:29] [INFO ] Deduced a trap composed of 32 places in 135 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/178 variables, 3/56 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-21 20:43:30] [INFO ] Deduced a trap composed of 18 places in 99 ms of which 2 ms to minimize.
[2024-05-21 20:43:30] [INFO ] Deduced a trap composed of 42 places in 130 ms of which 2 ms to minimize.
[2024-05-21 20:43:31] [INFO ] Deduced a trap composed of 42 places in 126 ms of which 2 ms to minimize.
[2024-05-21 20:43:31] [INFO ] Deduced a trap composed of 38 places in 120 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/178 variables, 4/60 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/178 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 8 (OVERLAPS) 260/438 variables, 178/238 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-21 20:43:37] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 3 ms to minimize.
[2024-05-21 20:43:37] [INFO ] Deduced a trap composed of 35 places in 130 ms of which 3 ms to minimize.
[2024-05-21 20:43:37] [INFO ] Deduced a trap composed of 36 places in 138 ms of which 3 ms to minimize.
[2024-05-21 20:43:37] [INFO ] Deduced a trap composed of 32 places in 120 ms of which 3 ms to minimize.
[2024-05-21 20:43:38] [INFO ] Deduced a trap composed of 44 places in 115 ms of which 2 ms to minimize.
[2024-05-21 20:43:38] [INFO ] Deduced a trap composed of 32 places in 159 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/438 variables, 6/244 constraints. Problems are: Problem set: 0 solved, 259 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 438/438 variables, and 244 constraints, problems are : Problem set: 0 solved, 259 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 178/178 constraints, PredecessorRefiner: 259/259 constraints, Known Traps: 57/57 constraints]
Escalating to Integer solving :Problem set: 0 solved, 259 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/177 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 1 (OVERLAPS) 1/178 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 57/66 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-21 20:43:46] [INFO ] Deduced a trap composed of 39 places in 57 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/178 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/178 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 5 (OVERLAPS) 260/438 variables, 178/245 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/438 variables, 259/504 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-21 20:43:54] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/438 variables, 1/505 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/438 variables, 0/505 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 9 (OVERLAPS) 0/438 variables, 0/505 constraints. Problems are: Problem set: 0 solved, 259 unsolved
No progress, stopping.
After SMT solving in domain Int declared 438/438 variables, and 505 constraints, problems are : Problem set: 0 solved, 259 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 178/178 constraints, PredecessorRefiner: 259/259 constraints, Known Traps: 59/59 constraints]
After SMT, in 60264ms problems are : Problem set: 0 solved, 259 unsolved
Search for dead transitions found 0 dead transitions in 60271ms
Starting structural reductions in LTL mode, iteration 1 : 178/209 places, 260/355 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60533 ms. Remains : 178/209 places, 260/355 transitions.
[2024-05-21 20:44:14] [INFO ] Flatten gal took : 10 ms
[2024-05-21 20:44:14] [INFO ] Flatten gal took : 11 ms
[2024-05-21 20:44:14] [INFO ] Input system was already deterministic with 260 transitions.
[2024-05-21 20:44:14] [INFO ] Flatten gal took : 11 ms
[2024-05-21 20:44:14] [INFO ] Flatten gal took : 10 ms
[2024-05-21 20:44:14] [INFO ] Time to serialize gal into /tmp/CTLFireability6630994411469409752.gal : 3 ms
[2024-05-21 20:44:14] [INFO ] Time to serialize properties into /tmp/CTLFireability8023994391097965941.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/CTLFireability6630994411469409752.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8023994391097965941.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.39231e+09,9.88884,214456,2,14885,5,812872,6,0,974,1.05478e+06,0


Converting to forward existential form...Done !
original formula: A(EG(!((((p6==1)&&(p14==1))&&((p138==1)&&(p178==1))))) U E((AX((((((p6==1)&&(p9==1))&&((p33==1)&&(p178==1)))||(p158==1))&&(!((((p50==1)&&...288
=> equivalent forward existential formula: [((Init * !(EG(!(E((!(EX(!((((((p6==1)&&(p9==1))&&((p33==1)&&(p178==1)))||(p158==1))&&(!((((p50==1)&&(p81==1))&&...807
Reverse transition relation is NOT exact ! Due to transitions t10, t16, t17, t24, t32, t35, t36, t37, t61, t62, t65, t66, t68, t81, t87, t88, t91, t92, t94...449
Detected timeout of ITS tools.
[2024-05-21 20:44:44] [INFO ] Flatten gal took : 6 ms
[2024-05-21 20:44:44] [INFO ] Applying decomposition
[2024-05-21 20:44:44] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph3755165690808173862.txt' '-o' '/tmp/graph3755165690808173862.bin' '-w' '/tmp/graph3755165690808173862.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3755165690808173862.bin' '-l' '-1' '-v' '-w' '/tmp/graph3755165690808173862.weights' '-q' '0' '-e' '0.001'
[2024-05-21 20:44:44] [INFO ] Decomposing Gal with order
[2024-05-21 20:44:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 20:44:44] [INFO ] Removed a total of 240 redundant transitions.
[2024-05-21 20:44:44] [INFO ] Flatten gal took : 16 ms
[2024-05-21 20:44:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 18 labels/synchronizations in 3 ms.
[2024-05-21 20:44:44] [INFO ] Time to serialize gal into /tmp/CTLFireability8176194688665969885.gal : 2 ms
[2024-05-21 20:44:44] [INFO ] Time to serialize properties into /tmp/CTLFireability9324577662755037512.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/CTLFireability8176194688665969885.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9324577662755037512.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.39231e+09,0.092349,5448,458,100,3004,453,452,3770,76,1084,0


Converting to forward existential form...Done !
original formula: A(EG(!((((i11.u1.p6==1)&&(i11.u1.p14==1))&&((i8.i1.u41.p138==1)&&(i11.u1.p178==1))))) U E((AX((((((i11.u1.p6==1)&&(i11.u1.p9==1))&&((i2.i...447
=> equivalent forward existential formula: [((Init * !(EG(!(E((!(EX(!((((((i11.u1.p6==1)&&(i11.u1.p9==1))&&((i2.i0.u11.p33==1)&&(i11.u1.p178==1)))||(i10.i0...1222
Reverse transition relation is NOT exact ! Due to transitions t167, t169, t189, t201, t229, t257, i0.u53.t32, i0.u53.t35, i0.u53.t36, i0.u53.t37, i3.i0.u15...621
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
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 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
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 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
(forward)formula 0,1,9.42946,303216,1,0,685430,3071,3182,719754,431,17212,756019
FORMULA AutonomousCar-PT-04b-CTLFireability-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

[2024-05-21 20:44:53] [INFO ] Flatten gal took : 9 ms
[2024-05-21 20:44:53] [INFO ] Flatten gal took : 9 ms
Total runtime 1629638 ms.

BK_STOP 1716324293741

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

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