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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 608K
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 22 14:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 18:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K Apr 12 18:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 18:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 96K Apr 12 18:09 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 159K 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-05b-CTLFireability-2024-00
FORMULA_NAME AutonomousCar-PT-05b-CTLFireability-2024-01
FORMULA_NAME AutonomousCar-PT-05b-CTLFireability-2024-02
FORMULA_NAME AutonomousCar-PT-05b-CTLFireability-2024-03
FORMULA_NAME AutonomousCar-PT-05b-CTLFireability-2024-04
FORMULA_NAME AutonomousCar-PT-05b-CTLFireability-2024-05
FORMULA_NAME AutonomousCar-PT-05b-CTLFireability-2024-06
FORMULA_NAME AutonomousCar-PT-05b-CTLFireability-2024-07
FORMULA_NAME AutonomousCar-PT-05b-CTLFireability-2024-08
FORMULA_NAME AutonomousCar-PT-05b-CTLFireability-2024-09
FORMULA_NAME AutonomousCar-PT-05b-CTLFireability-2024-10
FORMULA_NAME AutonomousCar-PT-05b-CTLFireability-2024-11
FORMULA_NAME AutonomousCar-PT-05b-CTLFireability-2023-12
FORMULA_NAME AutonomousCar-PT-05b-CTLFireability-2023-13
FORMULA_NAME AutonomousCar-PT-05b-CTLFireability-2023-14
FORMULA_NAME AutonomousCar-PT-05b-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716324889145

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-05b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-21 20:54:51] [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:54:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 20:54:52] [INFO ] Load time of PNML (sax parser for PT used): 228 ms
[2024-05-21 20:54:52] [INFO ] Transformed 255 places.
[2024-05-21 20:54:52] [INFO ] Transformed 490 transitions.
[2024-05-21 20:54:52] [INFO ] Found NUPN structural information;
[2024-05-21 20:54:52] [INFO ] Parsed PT model containing 255 places and 490 transitions and 2527 arcs in 569 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 27 ms.
Support contains 77 out of 255 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 255/255 places, 490/490 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 228 transition count 463
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 228 transition count 463
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Iterating post reduction 0 with 100 rules applied. Total rules applied 154 place count 228 transition count 363
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 158 place count 224 transition count 359
Iterating global reduction 1 with 4 rules applied. Total rules applied 162 place count 224 transition count 359
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 163 place count 223 transition count 358
Iterating global reduction 1 with 1 rules applied. Total rules applied 164 place count 223 transition count 358
Applied a total of 164 rules in 185 ms. Remains 223 /255 variables (removed 32) and now considering 358/490 (removed 132) transitions.
// Phase 1: matrix 358 rows 223 cols
[2024-05-21 20:54:52] [INFO ] Computed 10 invariants in 36 ms
[2024-05-21 20:54:53] [INFO ] Implicit Places using invariants in 341 ms returned []
[2024-05-21 20:54:53] [INFO ] Invariant cache hit.
[2024-05-21 20:54:53] [INFO ] Implicit Places using invariants and state equation in 482 ms returned []
Implicit Place search using SMT with State Equation took 874 ms to find 0 implicit places.
Running 357 sub problems to find dead transitions.
[2024-05-21 20:54:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/222 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 1 (OVERLAPS) 1/223 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 357 unsolved
[2024-05-21 20:55:01] [INFO ] Deduced a trap composed of 21 places in 312 ms of which 45 ms to minimize.
[2024-05-21 20:55:01] [INFO ] Deduced a trap composed of 29 places in 232 ms of which 4 ms to minimize.
[2024-05-21 20:55:01] [INFO ] Deduced a trap composed of 16 places in 233 ms of which 4 ms to minimize.
[2024-05-21 20:55:01] [INFO ] Deduced a trap composed of 48 places in 180 ms of which 4 ms to minimize.
[2024-05-21 20:55:02] [INFO ] Deduced a trap composed of 42 places in 176 ms of which 3 ms to minimize.
[2024-05-21 20:55:02] [INFO ] Deduced a trap composed of 38 places in 152 ms of which 3 ms to minimize.
[2024-05-21 20:55:02] [INFO ] Deduced a trap composed of 39 places in 142 ms of which 3 ms to minimize.
[2024-05-21 20:55:02] [INFO ] Deduced a trap composed of 32 places in 157 ms of which 3 ms to minimize.
[2024-05-21 20:55:02] [INFO ] Deduced a trap composed of 33 places in 165 ms of which 2 ms to minimize.
[2024-05-21 20:55:03] [INFO ] Deduced a trap composed of 37 places in 170 ms of which 3 ms to minimize.
[2024-05-21 20:55:03] [INFO ] Deduced a trap composed of 21 places in 248 ms of which 4 ms to minimize.
[2024-05-21 20:55:03] [INFO ] Deduced a trap composed of 26 places in 194 ms of which 4 ms to minimize.
[2024-05-21 20:55:03] [INFO ] Deduced a trap composed of 43 places in 241 ms of which 4 ms to minimize.
[2024-05-21 20:55:03] [INFO ] Deduced a trap composed of 32 places in 179 ms of which 2 ms to minimize.
[2024-05-21 20:55:04] [INFO ] Deduced a trap composed of 29 places in 261 ms of which 4 ms to minimize.
[2024-05-21 20:55:04] [INFO ] Deduced a trap composed of 21 places in 165 ms of which 3 ms to minimize.
[2024-05-21 20:55:04] [INFO ] Deduced a trap composed of 40 places in 278 ms of which 3 ms to minimize.
[2024-05-21 20:55:05] [INFO ] Deduced a trap composed of 57 places in 182 ms of which 5 ms to minimize.
[2024-05-21 20:55:05] [INFO ] Deduced a trap composed of 40 places in 188 ms of which 4 ms to minimize.
[2024-05-21 20:55:05] [INFO ] Deduced a trap composed of 41 places in 168 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/223 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 357 unsolved
[2024-05-21 20:55:05] [INFO ] Deduced a trap composed of 36 places in 239 ms of which 5 ms to minimize.
[2024-05-21 20:55:06] [INFO ] Deduced a trap composed of 32 places in 180 ms of which 4 ms to minimize.
[2024-05-21 20:55:06] [INFO ] Deduced a trap composed of 35 places in 190 ms of which 3 ms to minimize.
[2024-05-21 20:55:06] [INFO ] Deduced a trap composed of 35 places in 127 ms of which 3 ms to minimize.
[2024-05-21 20:55:06] [INFO ] Deduced a trap composed of 37 places in 144 ms of which 3 ms to minimize.
[2024-05-21 20:55:06] [INFO ] Deduced a trap composed of 34 places in 184 ms of which 2 ms to minimize.
[2024-05-21 20:55:07] [INFO ] Deduced a trap composed of 42 places in 187 ms of which 3 ms to minimize.
[2024-05-21 20:55:07] [INFO ] Deduced a trap composed of 47 places in 171 ms of which 3 ms to minimize.
[2024-05-21 20:55:07] [INFO ] Deduced a trap composed of 47 places in 190 ms of which 3 ms to minimize.
[2024-05-21 20:55:08] [INFO ] Deduced a trap composed of 36 places in 103 ms of which 2 ms to minimize.
[2024-05-21 20:55:08] [INFO ] Deduced a trap composed of 50 places in 185 ms of which 3 ms to minimize.
[2024-05-21 20:55:08] [INFO ] Deduced a trap composed of 48 places in 169 ms of which 3 ms to minimize.
[2024-05-21 20:55:08] [INFO ] Deduced a trap composed of 36 places in 159 ms of which 2 ms to minimize.
[2024-05-21 20:55:09] [INFO ] Deduced a trap composed of 42 places in 153 ms of which 2 ms to minimize.
[2024-05-21 20:55:09] [INFO ] Deduced a trap composed of 47 places in 223 ms of which 3 ms to minimize.
[2024-05-21 20:55:09] [INFO ] Deduced a trap composed of 32 places in 128 ms of which 3 ms to minimize.
[2024-05-21 20:55:09] [INFO ] Deduced a trap composed of 43 places in 122 ms of which 2 ms to minimize.
[2024-05-21 20:55:10] [INFO ] Deduced a trap composed of 42 places in 115 ms of which 2 ms to minimize.
[2024-05-21 20:55:10] [INFO ] Deduced a trap composed of 15 places in 178 ms of which 2 ms to minimize.
[2024-05-21 20:55:10] [INFO ] Deduced a trap composed of 30 places in 137 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/223 variables, 20/50 constraints. Problems are: Problem set: 0 solved, 357 unsolved
[2024-05-21 20:55:13] [INFO ] Deduced a trap composed of 38 places in 171 ms of which 3 ms to minimize.
[2024-05-21 20:55:13] [INFO ] Deduced a trap composed of 24 places in 145 ms of which 3 ms to minimize.
[2024-05-21 20:55:14] [INFO ] Deduced a trap composed of 40 places in 112 ms of which 2 ms to minimize.
[2024-05-21 20:55:15] [INFO ] Deduced a trap composed of 41 places in 105 ms of which 2 ms to minimize.
[2024-05-21 20:55:15] [INFO ] Deduced a trap composed of 44 places in 95 ms of which 2 ms to minimize.
[2024-05-21 20:55:15] [INFO ] Deduced a trap composed of 42 places in 85 ms of which 2 ms to minimize.
[2024-05-21 20:55:15] [INFO ] Deduced a trap composed of 43 places in 88 ms of which 2 ms to minimize.
[2024-05-21 20:55:15] [INFO ] Deduced a trap composed of 24 places in 87 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/223 variables, 8/58 constraints. Problems are: Problem set: 0 solved, 357 unsolved
[2024-05-21 20:55:17] [INFO ] Deduced a trap composed of 5 places in 197 ms of which 3 ms to minimize.
[2024-05-21 20:55:18] [INFO ] Deduced a trap composed of 36 places in 170 ms of which 2 ms to minimize.
[2024-05-21 20:55:19] [INFO ] Deduced a trap composed of 41 places in 185 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/223 variables, 3/61 constraints. Problems are: Problem set: 0 solved, 357 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 223/581 variables, and 61 constraints, problems are : Problem set: 0 solved, 357 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/223 constraints, PredecessorRefiner: 357/357 constraints, Known Traps: 51/51 constraints]
Escalating to Integer solving :Problem set: 0 solved, 357 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/222 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 1 (OVERLAPS) 1/223 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/223 variables, 51/61 constraints. Problems are: Problem set: 0 solved, 357 unsolved
[2024-05-21 20:55:28] [INFO ] Deduced a trap composed of 54 places in 89 ms of which 2 ms to minimize.
[2024-05-21 20:55:28] [INFO ] Deduced a trap composed of 55 places in 101 ms of which 3 ms to minimize.
[2024-05-21 20:55:28] [INFO ] Deduced a trap composed of 56 places in 78 ms of which 2 ms to minimize.
[2024-05-21 20:55:29] [INFO ] Deduced a trap composed of 34 places in 108 ms of which 2 ms to minimize.
[2024-05-21 20:55:29] [INFO ] Deduced a trap composed of 33 places in 222 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/223 variables, 5/66 constraints. Problems are: Problem set: 0 solved, 357 unsolved
[2024-05-21 20:55:31] [INFO ] Deduced a trap composed of 36 places in 167 ms of which 4 ms to minimize.
[2024-05-21 20:55:32] [INFO ] Deduced a trap composed of 41 places in 211 ms of which 3 ms to minimize.
[2024-05-21 20:55:32] [INFO ] Deduced a trap composed of 36 places in 180 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/223 variables, 3/69 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/223 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 357 unsolved
Problem TDEAD10 is UNSAT
Problem TDEAD316 is UNSAT
At refinement iteration 6 (OVERLAPS) 358/581 variables, 223/292 constraints. Problems are: Problem set: 2 solved, 355 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/581 variables, 355/647 constraints. Problems are: Problem set: 2 solved, 355 unsolved
[2024-05-21 20:55:43] [INFO ] Deduced a trap composed of 54 places in 119 ms of which 2 ms to minimize.
[2024-05-21 20:55:45] [INFO ] Deduced a trap composed of 41 places in 98 ms of which 1 ms to minimize.
[2024-05-21 20:55:46] [INFO ] Deduced a trap composed of 55 places in 221 ms of which 3 ms to minimize.
[2024-05-21 20:55:46] [INFO ] Deduced a trap composed of 56 places in 164 ms of which 4 ms to minimize.
[2024-05-21 20:55:47] [INFO ] Deduced a trap composed of 35 places in 165 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/581 variables, 5/652 constraints. Problems are: Problem set: 2 solved, 355 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 581/581 variables, and 652 constraints, problems are : Problem set: 2 solved, 355 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 223/223 constraints, PredecessorRefiner: 355/357 constraints, Known Traps: 64/64 constraints]
After SMT, in 61112ms problems are : Problem set: 2 solved, 355 unsolved
Search for dead transitions found 2 dead transitions in 61164ms
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 : 223/255 places, 356/490 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 222 transition count 356
Applied a total of 1 rules in 14 ms. Remains 222 /223 variables (removed 1) and now considering 356/356 (removed 0) transitions.
// Phase 1: matrix 356 rows 222 cols
[2024-05-21 20:55:54] [INFO ] Computed 10 invariants in 5 ms
[2024-05-21 20:55:54] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-05-21 20:55:54] [INFO ] Invariant cache hit.
[2024-05-21 20:55:55] [INFO ] Implicit Places using invariants and state equation in 223 ms returned []
Implicit Place search using SMT with State Equation took 308 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 222/255 places, 356/490 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 62607 ms. Remains : 222/255 places, 356/490 transitions.
Support contains 77 out of 222 places after structural reductions.
[2024-05-21 20:55:55] [INFO ] Flatten gal took : 132 ms
[2024-05-21 20:55:55] [INFO ] Flatten gal took : 61 ms
[2024-05-21 20:55:55] [INFO ] Input system was already deterministic with 356 transitions.
RANDOM walk for 40000 steps (196 resets) in 4313 ms. (9 steps per ms) remains 19/71 properties
BEST_FIRST walk for 4003 steps (8 resets) in 79 ms. (50 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (9 resets) in 50 ms. (78 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 39 ms. (100 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (9 resets) in 25 ms. (153 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4001 steps (8 resets) in 30 ms. (129 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (9 resets) in 50 ms. (78 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (12 resets) in 24 ms. (160 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (10 resets) in 47 ms. (83 steps per ms) remains 17/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 52 ms. (75 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (9 resets) in 15 ms. (250 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4001 steps (12 resets) in 39 ms. (100 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (9 resets) in 36 ms. (108 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4001 steps (10 resets) in 18 ms. (210 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (9 resets) in 43 ms. (91 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (9 resets) in 45 ms. (87 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (10 resets) in 36 ms. (108 steps per ms) remains 17/17 properties
[2024-05-21 20:55:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp62 is UNSAT
At refinement iteration 1 (OVERLAPS) 186/222 variables, 10/10 constraints. Problems are: Problem set: 4 solved, 13 unsolved
[2024-05-21 20:55:58] [INFO ] Deduced a trap composed of 21 places in 156 ms of which 3 ms to minimize.
[2024-05-21 20:55:58] [INFO ] Deduced a trap composed of 16 places in 172 ms of which 4 ms to minimize.
[2024-05-21 20:55:58] [INFO ] Deduced a trap composed of 30 places in 148 ms of which 3 ms to minimize.
[2024-05-21 20:55:58] [INFO ] Deduced a trap composed of 23 places in 143 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/222 variables, 4/14 constraints. Problems are: Problem set: 4 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/222 variables, 0/14 constraints. Problems are: Problem set: 4 solved, 13 unsolved
Problem AtomicPropp35 is UNSAT
At refinement iteration 4 (OVERLAPS) 356/578 variables, 222/236 constraints. Problems are: Problem set: 5 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/578 variables, 0/236 constraints. Problems are: Problem set: 5 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 0/578 variables, 0/236 constraints. Problems are: Problem set: 5 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 578/578 variables, and 236 constraints, problems are : Problem set: 5 solved, 12 unsolved in 2168 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 222/222 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 5 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 5 solved, 12 unsolved
Problem AtomicPropp38 is UNSAT
At refinement iteration 1 (OVERLAPS) 167/190 variables, 8/8 constraints. Problems are: Problem set: 6 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/190 variables, 1/9 constraints. Problems are: Problem set: 6 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 0/9 constraints. Problems are: Problem set: 6 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 32/222 variables, 2/11 constraints. Problems are: Problem set: 6 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/222 variables, 3/14 constraints. Problems are: Problem set: 6 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/222 variables, 0/14 constraints. Problems are: Problem set: 6 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 356/578 variables, 222/236 constraints. Problems are: Problem set: 6 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/578 variables, 11/247 constraints. Problems are: Problem set: 6 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/578 variables, 0/247 constraints. Problems are: Problem set: 6 solved, 11 unsolved
[2024-05-21 20:56:01] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/578 variables, 1/248 constraints. Problems are: Problem set: 6 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/578 variables, 0/248 constraints. Problems are: Problem set: 6 solved, 11 unsolved
At refinement iteration 12 (OVERLAPS) 0/578 variables, 0/248 constraints. Problems are: Problem set: 6 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 578/578 variables, and 248 constraints, problems are : Problem set: 6 solved, 11 unsolved in 3076 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 222/222 constraints, PredecessorRefiner: 11/17 constraints, Known Traps: 5/5 constraints]
After SMT, in 5360ms problems are : Problem set: 6 solved, 11 unsolved
Fused 11 Parikh solutions to 10 different solutions.
Parikh walk visited 3 properties in 23282 ms.
Support contains 13 out of 222 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 222/222 places, 356/356 transitions.
Graph (trivial) has 197 edges and 222 vertex of which 2 / 222 are part of one of the 1 SCC in 7 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 696 edges and 221 vertex of which 220 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output 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 220 transition count 268
Reduce places removed 85 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 1 with 118 rules applied. Total rules applied 206 place count 135 transition count 235
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 2 with 19 rules applied. Total rules applied 225 place count 116 transition count 235
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 225 place count 116 transition count 230
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 235 place count 111 transition count 230
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 241 place count 105 transition count 224
Iterating global reduction 3 with 6 rules applied. Total rules applied 247 place count 105 transition count 224
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 248 place count 104 transition count 223
Iterating global reduction 3 with 1 rules applied. Total rules applied 249 place count 104 transition count 223
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 333 place count 62 transition count 181
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 334 place count 62 transition count 180
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 339 place count 57 transition count 152
Iterating global reduction 4 with 5 rules applied. Total rules applied 344 place count 57 transition count 152
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 346 place count 57 transition count 150
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 348 place count 56 transition count 149
Free-agglomeration rule applied 11 times.
Iterating global reduction 5 with 11 rules applied. Total rules applied 359 place count 56 transition count 138
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 5 with 11 rules applied. Total rules applied 370 place count 45 transition count 138
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 371 place count 44 transition count 137
Applied a total of 371 rules in 117 ms. Remains 44 /222 variables (removed 178) and now considering 137/356 (removed 219) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 117 ms. Remains : 44/222 places, 137/356 transitions.
RANDOM walk for 40000 steps (51 resets) in 388 ms. (102 steps per ms) remains 6/8 properties
BEST_FIRST walk for 40000 steps (88 resets) in 135 ms. (294 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40000 steps (43 resets) in 199 ms. (200 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40000 steps (38 resets) in 182 ms. (218 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40000 steps (32 resets) in 99 ms. (400 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40000 steps (62 resets) in 95 ms. (416 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (160 resets) in 201 ms. (198 steps per ms) remains 2/2 properties
// Phase 1: matrix 137 rows 44 cols
[2024-05-21 20:56:26] [INFO ] Computed 10 invariants in 2 ms
[2024-05-21 20:56:26] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 19/25 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 20:56:26] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 123/148 variables, 25/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/148 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 33/181 variables, 19/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/181 variables, 5/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/181 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/181 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/181 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 181/181 variables, and 56 constraints, problems are : Problem set: 0 solved, 2 unsolved in 245 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 44/44 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 19/25 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 123/148 variables, 25/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/148 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/148 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 33/181 variables, 19/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/181 variables, 5/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/181 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/181 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/181 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/181 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 181/181 variables, and 58 constraints, problems are : Problem set: 0 solved, 2 unsolved in 227 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 44/44 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 490ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 197 ms.
Support contains 6 out of 44 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 44/44 places, 137/137 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 42 transition count 126
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 42 transition count 126
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 42 transition count 125
Free-agglomeration rule applied 3 times.
Iterating global reduction 1 with 3 rules applied. Total rules applied 8 place count 42 transition count 122
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 21 place count 39 transition count 112
Applied a total of 21 rules in 26 ms. Remains 39 /44 variables (removed 5) and now considering 112/137 (removed 25) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 39/44 places, 112/137 transitions.
RANDOM walk for 40000 steps (16 resets) in 116 ms. (341 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40000 steps (14 resets) in 86 ms. (459 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (438 resets) in 39 ms. (1000 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 305172 steps, run visited all 2 properties in 727 ms. (steps per millisecond=419 )
Probabilistic random walk after 305172 steps, saw 49753 distinct states, run finished after 734 ms. (steps per millisecond=415 ) properties seen :2
Successfully simplified 6 atomic propositions for a total of 16 simplifications.
FORMULA AutonomousCar-PT-05b-CTLFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 20:56:28] [INFO ] Flatten gal took : 31 ms
[2024-05-21 20:56:28] [INFO ] Flatten gal took : 33 ms
[2024-05-21 20:56:28] [INFO ] Input system was already deterministic with 356 transitions.
Support contains 67 out of 222 places (down from 68) after GAL structural reductions.
Computed a total of 41 stabilizing places and 41 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 222/222 places, 356/356 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 209 transition count 343
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 209 transition count 343
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 29 place count 206 transition count 340
Iterating global reduction 0 with 3 rules applied. Total rules applied 32 place count 206 transition count 340
Applied a total of 32 rules in 15 ms. Remains 206 /222 variables (removed 16) and now considering 340/356 (removed 16) transitions.
// Phase 1: matrix 340 rows 206 cols
[2024-05-21 20:56:28] [INFO ] Computed 10 invariants in 7 ms
[2024-05-21 20:56:28] [INFO ] Implicit Places using invariants in 134 ms returned []
[2024-05-21 20:56:28] [INFO ] Invariant cache hit.
[2024-05-21 20:56:29] [INFO ] Implicit Places using invariants and state equation in 335 ms returned []
Implicit Place search using SMT with State Equation took 473 ms to find 0 implicit places.
Running 339 sub problems to find dead transitions.
[2024-05-21 20:56:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 1 (OVERLAPS) 1/206 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 339 unsolved
[2024-05-21 20:56:34] [INFO ] Deduced a trap composed of 51 places in 271 ms of which 5 ms to minimize.
[2024-05-21 20:56:34] [INFO ] Deduced a trap composed of 31 places in 145 ms of which 3 ms to minimize.
[2024-05-21 20:56:34] [INFO ] Deduced a trap composed of 17 places in 213 ms of which 3 ms to minimize.
[2024-05-21 20:56:34] [INFO ] Deduced a trap composed of 24 places in 132 ms of which 2 ms to minimize.
[2024-05-21 20:56:34] [INFO ] Deduced a trap composed of 38 places in 124 ms of which 2 ms to minimize.
[2024-05-21 20:56:35] [INFO ] Deduced a trap composed of 14 places in 130 ms of which 2 ms to minimize.
[2024-05-21 20:56:35] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 3 ms to minimize.
[2024-05-21 20:56:35] [INFO ] Deduced a trap composed of 33 places in 115 ms of which 2 ms to minimize.
[2024-05-21 20:56:35] [INFO ] Deduced a trap composed of 32 places in 116 ms of which 3 ms to minimize.
[2024-05-21 20:56:35] [INFO ] Deduced a trap composed of 36 places in 114 ms of which 2 ms to minimize.
[2024-05-21 20:56:35] [INFO ] Deduced a trap composed of 29 places in 114 ms of which 2 ms to minimize.
[2024-05-21 20:56:35] [INFO ] Deduced a trap composed of 32 places in 102 ms of which 2 ms to minimize.
[2024-05-21 20:56:36] [INFO ] Deduced a trap composed of 36 places in 191 ms of which 2 ms to minimize.
[2024-05-21 20:56:36] [INFO ] Deduced a trap composed of 31 places in 137 ms of which 3 ms to minimize.
[2024-05-21 20:56:36] [INFO ] Deduced a trap composed of 43 places in 141 ms of which 2 ms to minimize.
[2024-05-21 20:56:36] [INFO ] Deduced a trap composed of 39 places in 145 ms of which 3 ms to minimize.
[2024-05-21 20:56:36] [INFO ] Deduced a trap composed of 21 places in 138 ms of which 3 ms to minimize.
[2024-05-21 20:56:36] [INFO ] Deduced a trap composed of 39 places in 135 ms of which 3 ms to minimize.
[2024-05-21 20:56:37] [INFO ] Deduced a trap composed of 32 places in 149 ms of which 2 ms to minimize.
[2024-05-21 20:56:37] [INFO ] Deduced a trap composed of 37 places in 167 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 339 unsolved
[2024-05-21 20:56:37] [INFO ] Deduced a trap composed of 20 places in 122 ms of which 3 ms to minimize.
[2024-05-21 20:56:38] [INFO ] Deduced a trap composed of 35 places in 196 ms of which 4 ms to minimize.
[2024-05-21 20:56:38] [INFO ] Deduced a trap composed of 18 places in 180 ms of which 3 ms to minimize.
[2024-05-21 20:56:38] [INFO ] Deduced a trap composed of 25 places in 182 ms of which 3 ms to minimize.
[2024-05-21 20:56:38] [INFO ] Deduced a trap composed of 33 places in 164 ms of which 3 ms to minimize.
[2024-05-21 20:56:39] [INFO ] Deduced a trap composed of 42 places in 196 ms of which 3 ms to minimize.
[2024-05-21 20:56:39] [INFO ] Deduced a trap composed of 42 places in 129 ms of which 2 ms to minimize.
[2024-05-21 20:56:39] [INFO ] Deduced a trap composed of 40 places in 134 ms of which 3 ms to minimize.
[2024-05-21 20:56:40] [INFO ] Deduced a trap composed of 56 places in 188 ms of which 3 ms to minimize.
[2024-05-21 20:56:40] [INFO ] Deduced a trap composed of 41 places in 146 ms of which 3 ms to minimize.
[2024-05-21 20:56:40] [INFO ] Deduced a trap composed of 42 places in 125 ms of which 3 ms to minimize.
[2024-05-21 20:56:40] [INFO ] Deduced a trap composed of 41 places in 129 ms of which 3 ms to minimize.
[2024-05-21 20:56:41] [INFO ] Deduced a trap composed of 20 places in 205 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 13/43 constraints. Problems are: Problem set: 0 solved, 339 unsolved
[2024-05-21 20:56:45] [INFO ] Deduced a trap composed of 39 places in 54 ms of which 1 ms to minimize.
[2024-05-21 20:56:46] [INFO ] Deduced a trap composed of 56 places in 194 ms of which 3 ms to minimize.
[2024-05-21 20:56:46] [INFO ] Deduced a trap composed of 32 places in 211 ms of which 3 ms to minimize.
[2024-05-21 20:56:47] [INFO ] Deduced a trap composed of 36 places in 204 ms of which 4 ms to minimize.
[2024-05-21 20:56:47] [INFO ] Deduced a trap composed of 40 places in 124 ms of which 3 ms to minimize.
[2024-05-21 20:56:47] [INFO ] Deduced a trap composed of 39 places in 120 ms of which 2 ms to minimize.
[2024-05-21 20:56:47] [INFO ] Deduced a trap composed of 39 places in 178 ms of which 3 ms to minimize.
[2024-05-21 20:56:48] [INFO ] Deduced a trap composed of 38 places in 159 ms of which 2 ms to minimize.
[2024-05-21 20:56:48] [INFO ] Deduced a trap composed of 14 places in 156 ms of which 2 ms to minimize.
[2024-05-21 20:56:48] [INFO ] Deduced a trap composed of 53 places in 134 ms of which 3 ms to minimize.
[2024-05-21 20:56:48] [INFO ] Deduced a trap composed of 31 places in 109 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 11/54 constraints. Problems are: Problem set: 0 solved, 339 unsolved
[2024-05-21 20:56:51] [INFO ] Deduced a trap composed of 40 places in 79 ms of which 1 ms to minimize.
[2024-05-21 20:56:51] [INFO ] Deduced a trap composed of 42 places in 109 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/206 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 339 unsolved
[2024-05-21 20:56:53] [INFO ] Deduced a trap composed of 41 places in 93 ms of which 2 ms to minimize.
[2024-05-21 20:56:53] [INFO ] Deduced a trap composed of 42 places in 89 ms of which 2 ms to minimize.
[2024-05-21 20:56:53] [INFO ] Deduced a trap composed of 42 places in 79 ms of which 2 ms to minimize.
[2024-05-21 20:56:54] [INFO ] Deduced a trap composed of 39 places in 78 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/206 variables, 4/60 constraints. Problems are: Problem set: 0 solved, 339 unsolved
[2024-05-21 20:56:57] [INFO ] Deduced a trap composed of 51 places in 123 ms of which 3 ms to minimize.
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 Real declared 206/546 variables, and 61 constraints, problems are : Problem set: 0 solved, 339 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/206 constraints, PredecessorRefiner: 339/339 constraints, Known Traps: 51/51 constraints]
Escalating to Integer solving :Problem set: 0 solved, 339 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 1 (OVERLAPS) 1/206 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 51/61 constraints. Problems are: Problem set: 0 solved, 339 unsolved
[2024-05-21 20:57:01] [INFO ] Deduced a trap composed of 46 places in 161 ms of which 4 ms to minimize.
[2024-05-21 20:57:02] [INFO ] Deduced a trap composed of 37 places in 115 ms of which 2 ms to minimize.
[2024-05-21 20:57:02] [INFO ] Deduced a trap composed of 41 places in 129 ms of which 3 ms to minimize.
[2024-05-21 20:57:02] [INFO ] Deduced a trap composed of 32 places in 180 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 4/65 constraints. Problems are: Problem set: 0 solved, 339 unsolved
[2024-05-21 20:57:06] [INFO ] Deduced a trap composed of 32 places in 130 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 339 unsolved
[2024-05-21 20:57:09] [INFO ] Deduced a trap composed of 31 places in 111 ms of which 2 ms to minimize.
[2024-05-21 20:57:09] [INFO ] Deduced a trap composed of 5 places in 148 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/206 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/206 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 7 (OVERLAPS) 340/546 variables, 206/274 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/546 variables, 339/613 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/546 variables, 0/613 constraints. Problems are: Problem set: 0 solved, 339 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 546/546 variables, and 613 constraints, problems are : Problem set: 0 solved, 339 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 206/206 constraints, PredecessorRefiner: 339/339 constraints, Known Traps: 58/58 constraints]
After SMT, in 60631ms problems are : Problem set: 0 solved, 339 unsolved
Search for dead transitions found 0 dead transitions in 60639ms
Starting structural reductions in LTL mode, iteration 1 : 206/222 places, 340/356 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61130 ms. Remains : 206/222 places, 340/356 transitions.
[2024-05-21 20:57:29] [INFO ] Flatten gal took : 25 ms
[2024-05-21 20:57:29] [INFO ] Flatten gal took : 25 ms
[2024-05-21 20:57:29] [INFO ] Input system was already deterministic with 340 transitions.
[2024-05-21 20:57:29] [INFO ] Flatten gal took : 22 ms
[2024-05-21 20:57:29] [INFO ] Flatten gal took : 23 ms
[2024-05-21 20:57:29] [INFO ] Time to serialize gal into /tmp/CTLFireability5579810706924277272.gal : 14 ms
[2024-05-21 20:57:29] [INFO ] Time to serialize properties into /tmp/CTLFireability6195620853654351397.ctl : 5 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/CTLFireability5579810706924277272.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6195620853654351397.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.
Detected timeout of ITS tools.
[2024-05-21 20:57:59] [INFO ] Flatten gal took : 23 ms
[2024-05-21 20:57:59] [INFO ] Applying decomposition
[2024-05-21 20:58:00] [INFO ] Flatten gal took : 42 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/graph16691640313657313498.txt' '-o' '/tmp/graph16691640313657313498.bin' '-w' '/tmp/graph16691640313657313498.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16691640313657313498.bin' '-l' '-1' '-v' '-w' '/tmp/graph16691640313657313498.weights' '-q' '0' '-e' '0.001'
[2024-05-21 20:58:00] [INFO ] Decomposing Gal with order
[2024-05-21 20:58:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 20:58:00] [INFO ] Removed a total of 452 redundant transitions.
[2024-05-21 20:58:00] [INFO ] Flatten gal took : 178 ms
[2024-05-21 20:58:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 24 labels/synchronizations in 28 ms.
[2024-05-21 20:58:00] [INFO ] Time to serialize gal into /tmp/CTLFireability7844875951328459218.gal : 23 ms
[2024-05-21 20:58:00] [INFO ] Time to serialize properties into /tmp/CTLFireability6759137406680781030.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/CTLFireability7844875951328459218.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6759137406680781030.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,3.84316e+10,0.101838,5620,513,102,3467,614,482,4578,83,1941,0


Converting to forward existential form...Done !
original formula: EF((EX((EF((((i16.u1.p6==1)&&(i16.u1.p14==1))&&((i10.i0.u51.p160==1)&&(i16.u1.p212==1)))) * ((((i16.u1.p6==1)&&(i16.u1.p14==1))&&((i10.i1...453
=> equivalent forward existential formula: ([(FwdU(FwdU((FwdU(Init,TRUE) * EX((E(TRUE U (((i16.u1.p6==1)&&(i16.u1.p14==1))&&((i10.i0.u51.p160==1)&&(i16.u1....885
Reverse transition relation is NOT exact ! Due to transitions t194, t205, t220, t255, t270, t295, t337, i0.u65.t32, i0.u65.t35, i0.u65.t36, i0.u65.t37, i2....698
Using 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 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
(forward)formula 0,1,3.56226,105400,1,0,266879,2376,3707,238112,482,15042,349711
FORMULA AutonomousCar-PT-05b-CTLFireability-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 222/222 places, 356/356 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 209 transition count 343
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 209 transition count 343
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 29 place count 206 transition count 340
Iterating global reduction 0 with 3 rules applied. Total rules applied 32 place count 206 transition count 340
Applied a total of 32 rules in 11 ms. Remains 206 /222 variables (removed 16) and now considering 340/356 (removed 16) transitions.
[2024-05-21 20:58:04] [INFO ] Invariant cache hit.
[2024-05-21 20:58:04] [INFO ] Implicit Places using invariants in 145 ms returned []
[2024-05-21 20:58:04] [INFO ] Invariant cache hit.
[2024-05-21 20:58:04] [INFO ] Implicit Places using invariants and state equation in 295 ms returned []
Implicit Place search using SMT with State Equation took 442 ms to find 0 implicit places.
Running 339 sub problems to find dead transitions.
[2024-05-21 20:58:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 1 (OVERLAPS) 1/206 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 339 unsolved
[2024-05-21 20:58:10] [INFO ] Deduced a trap composed of 51 places in 268 ms of which 5 ms to minimize.
[2024-05-21 20:58:10] [INFO ] Deduced a trap composed of 31 places in 155 ms of which 2 ms to minimize.
[2024-05-21 20:58:10] [INFO ] Deduced a trap composed of 17 places in 151 ms of which 3 ms to minimize.
[2024-05-21 20:58:10] [INFO ] Deduced a trap composed of 24 places in 217 ms of which 4 ms to minimize.
[2024-05-21 20:58:11] [INFO ] Deduced a trap composed of 38 places in 170 ms of which 2 ms to minimize.
[2024-05-21 20:58:11] [INFO ] Deduced a trap composed of 14 places in 148 ms of which 3 ms to minimize.
[2024-05-21 20:58:11] [INFO ] Deduced a trap composed of 23 places in 146 ms of which 3 ms to minimize.
[2024-05-21 20:58:11] [INFO ] Deduced a trap composed of 33 places in 215 ms of which 3 ms to minimize.
[2024-05-21 20:58:11] [INFO ] Deduced a trap composed of 32 places in 202 ms of which 3 ms to minimize.
[2024-05-21 20:58:12] [INFO ] Deduced a trap composed of 36 places in 206 ms of which 3 ms to minimize.
[2024-05-21 20:58:12] [INFO ] Deduced a trap composed of 29 places in 175 ms of which 3 ms to minimize.
[2024-05-21 20:58:12] [INFO ] Deduced a trap composed of 32 places in 120 ms of which 3 ms to minimize.
[2024-05-21 20:58:12] [INFO ] Deduced a trap composed of 36 places in 188 ms of which 3 ms to minimize.
[2024-05-21 20:58:12] [INFO ] Deduced a trap composed of 31 places in 191 ms of which 4 ms to minimize.
[2024-05-21 20:58:13] [INFO ] Deduced a trap composed of 43 places in 128 ms of which 2 ms to minimize.
[2024-05-21 20:58:13] [INFO ] Deduced a trap composed of 39 places in 105 ms of which 2 ms to minimize.
[2024-05-21 20:58:13] [INFO ] Deduced a trap composed of 21 places in 137 ms of which 2 ms to minimize.
[2024-05-21 20:58:13] [INFO ] Deduced a trap composed of 39 places in 114 ms of which 2 ms to minimize.
[2024-05-21 20:58:13] [INFO ] Deduced a trap composed of 32 places in 167 ms of which 3 ms to minimize.
[2024-05-21 20:58:13] [INFO ] Deduced a trap composed of 37 places in 195 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 339 unsolved
[2024-05-21 20:58:14] [INFO ] Deduced a trap composed of 20 places in 127 ms of which 2 ms to minimize.
[2024-05-21 20:58:14] [INFO ] Deduced a trap composed of 35 places in 133 ms of which 2 ms to minimize.
[2024-05-21 20:58:14] [INFO ] Deduced a trap composed of 18 places in 181 ms of which 3 ms to minimize.
[2024-05-21 20:58:15] [INFO ] Deduced a trap composed of 25 places in 193 ms of which 3 ms to minimize.
[2024-05-21 20:58:15] [INFO ] Deduced a trap composed of 33 places in 154 ms of which 2 ms to minimize.
[2024-05-21 20:58:15] [INFO ] Deduced a trap composed of 42 places in 158 ms of which 3 ms to minimize.
[2024-05-21 20:58:15] [INFO ] Deduced a trap composed of 42 places in 103 ms of which 2 ms to minimize.
[2024-05-21 20:58:16] [INFO ] Deduced a trap composed of 40 places in 93 ms of which 2 ms to minimize.
[2024-05-21 20:58:16] [INFO ] Deduced a trap composed of 56 places in 208 ms of which 3 ms to minimize.
[2024-05-21 20:58:16] [INFO ] Deduced a trap composed of 41 places in 104 ms of which 2 ms to minimize.
[2024-05-21 20:58:16] [INFO ] Deduced a trap composed of 42 places in 148 ms of which 2 ms to minimize.
[2024-05-21 20:58:17] [INFO ] Deduced a trap composed of 41 places in 132 ms of which 2 ms to minimize.
[2024-05-21 20:58:17] [INFO ] Deduced a trap composed of 20 places in 215 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 13/43 constraints. Problems are: Problem set: 0 solved, 339 unsolved
[2024-05-21 20:58:20] [INFO ] Deduced a trap composed of 39 places in 53 ms of which 1 ms to minimize.
[2024-05-21 20:58:21] [INFO ] Deduced a trap composed of 56 places in 200 ms of which 3 ms to minimize.
[2024-05-21 20:58:22] [INFO ] Deduced a trap composed of 32 places in 212 ms of which 3 ms to minimize.
[2024-05-21 20:58:22] [INFO ] Deduced a trap composed of 36 places in 154 ms of which 3 ms to minimize.
[2024-05-21 20:58:22] [INFO ] Deduced a trap composed of 40 places in 129 ms of which 2 ms to minimize.
[2024-05-21 20:58:22] [INFO ] Deduced a trap composed of 39 places in 89 ms of which 2 ms to minimize.
[2024-05-21 20:58:22] [INFO ] Deduced a trap composed of 39 places in 180 ms of which 3 ms to minimize.
[2024-05-21 20:58:23] [INFO ] Deduced a trap composed of 38 places in 207 ms of which 3 ms to minimize.
[2024-05-21 20:58:23] [INFO ] Deduced a trap composed of 14 places in 120 ms of which 1 ms to minimize.
[2024-05-21 20:58:23] [INFO ] Deduced a trap composed of 53 places in 167 ms of which 3 ms to minimize.
[2024-05-21 20:58:23] [INFO ] Deduced a trap composed of 31 places in 134 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 11/54 constraints. Problems are: Problem set: 0 solved, 339 unsolved
[2024-05-21 20:58:26] [INFO ] Deduced a trap composed of 40 places in 73 ms of which 2 ms to minimize.
[2024-05-21 20:58:26] [INFO ] Deduced a trap composed of 42 places in 76 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/206 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 339 unsolved
[2024-05-21 20:58:28] [INFO ] Deduced a trap composed of 41 places in 94 ms of which 2 ms to minimize.
[2024-05-21 20:58:28] [INFO ] Deduced a trap composed of 42 places in 93 ms of which 3 ms to minimize.
[2024-05-21 20:58:28] [INFO ] Deduced a trap composed of 42 places in 73 ms of which 2 ms to minimize.
[2024-05-21 20:58:29] [INFO ] Deduced a trap composed of 39 places in 73 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/206 variables, 4/60 constraints. Problems are: Problem set: 0 solved, 339 unsolved
[2024-05-21 20:58:34] [INFO ] Deduced a trap composed of 51 places in 157 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 206/546 variables, and 61 constraints, problems are : Problem set: 0 solved, 339 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/206 constraints, PredecessorRefiner: 339/339 constraints, Known Traps: 51/51 constraints]
Escalating to Integer solving :Problem set: 0 solved, 339 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 1 (OVERLAPS) 1/206 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 51/61 constraints. Problems are: Problem set: 0 solved, 339 unsolved
[2024-05-21 20:58:39] [INFO ] Deduced a trap composed of 46 places in 243 ms of which 4 ms to minimize.
[2024-05-21 20:58:39] [INFO ] Deduced a trap composed of 37 places in 203 ms of which 3 ms to minimize.
[2024-05-21 20:58:40] [INFO ] Deduced a trap composed of 41 places in 225 ms of which 4 ms to minimize.
[2024-05-21 20:58:40] [INFO ] Deduced a trap composed of 32 places in 213 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 4/65 constraints. Problems are: Problem set: 0 solved, 339 unsolved
[2024-05-21 20:58:44] [INFO ] Deduced a trap composed of 32 places in 187 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 339 unsolved
[2024-05-21 20:58:48] [INFO ] Deduced a trap composed of 31 places in 105 ms of which 2 ms to minimize.
[2024-05-21 20:58:48] [INFO ] Deduced a trap composed of 5 places in 158 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/206 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/206 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 7 (OVERLAPS) 340/546 variables, 206/274 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/546 variables, 339/613 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/546 variables, 0/613 constraints. Problems are: Problem set: 0 solved, 339 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 546/546 variables, and 613 constraints, problems are : Problem set: 0 solved, 339 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 206/206 constraints, PredecessorRefiner: 339/339 constraints, Known Traps: 58/58 constraints]
After SMT, in 60553ms problems are : Problem set: 0 solved, 339 unsolved
Search for dead transitions found 0 dead transitions in 60560ms
Starting structural reductions in LTL mode, iteration 1 : 206/222 places, 340/356 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61017 ms. Remains : 206/222 places, 340/356 transitions.
[2024-05-21 20:59:05] [INFO ] Flatten gal took : 17 ms
[2024-05-21 20:59:05] [INFO ] Flatten gal took : 17 ms
[2024-05-21 20:59:05] [INFO ] Input system was already deterministic with 340 transitions.
[2024-05-21 20:59:05] [INFO ] Flatten gal took : 15 ms
[2024-05-21 20:59:05] [INFO ] Flatten gal took : 15 ms
[2024-05-21 20:59:05] [INFO ] Time to serialize gal into /tmp/CTLFireability6828067773966176610.gal : 5 ms
[2024-05-21 20:59:05] [INFO ] Time to serialize properties into /tmp/CTLFireability6026434241316479419.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/CTLFireability6828067773966176610.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6026434241316479419.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.
Detected timeout of ITS tools.
[2024-05-21 20:59:35] [INFO ] Flatten gal took : 14 ms
[2024-05-21 20:59:35] [INFO ] Applying decomposition
[2024-05-21 20:59:35] [INFO ] Flatten gal took : 14 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/graph8218692451144861491.txt' '-o' '/tmp/graph8218692451144861491.bin' '-w' '/tmp/graph8218692451144861491.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8218692451144861491.bin' '-l' '-1' '-v' '-w' '/tmp/graph8218692451144861491.weights' '-q' '0' '-e' '0.001'
[2024-05-21 20:59:35] [INFO ] Decomposing Gal with order
[2024-05-21 20:59:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 20:59:35] [INFO ] Removed a total of 456 redundant transitions.
[2024-05-21 20:59:35] [INFO ] Flatten gal took : 38 ms
[2024-05-21 20:59:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 24 labels/synchronizations in 8 ms.
[2024-05-21 20:59:35] [INFO ] Time to serialize gal into /tmp/CTLFireability16669117352081680983.gal : 6 ms
[2024-05-21 20:59:35] [INFO ] Time to serialize properties into /tmp/CTLFireability12383005478904570491.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/CTLFireability16669117352081680983.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12383005478904570491.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,3.84316e+10,0.173678,8828,710,105,10669,785,479,12105,85,2760,0


Converting to forward existential form...Done !
original formula: (EF((((i0.u2.p6==0)||(i0.u2.p16==0))||((i2.u15.p55==0)||(i0.u2.p212==0)))) * AF(AX(FALSE)))
=> equivalent forward existential formula: ([(Init * !(E(TRUE U (((i0.u2.p6==0)||(i0.u2.p16==0))||((i2.u15.p55==0)||(i0.u2.p212==0))))))] = FALSE * [FwdG(I...188
Reverse transition relation is NOT exact ! Due to transitions t194, t204, t219, t249, t274, t294, t337, i0.t192, i1.i1.t185, i1.i1.u10.t165, i1.i1.u17.t166...713
Using 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 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
(forward)formula 0,0,18.5996,430172,1,0,977689,2695,2858,888643,425,20228,1235940
FORMULA AutonomousCar-PT-05b-CTLFireability-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 222/222 places, 356/356 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 211 transition count 345
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 211 transition count 345
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 24 place count 209 transition count 343
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 209 transition count 343
Applied a total of 26 rules in 12 ms. Remains 209 /222 variables (removed 13) and now considering 343/356 (removed 13) transitions.
// Phase 1: matrix 343 rows 209 cols
[2024-05-21 20:59:54] [INFO ] Computed 10 invariants in 2 ms
[2024-05-21 20:59:54] [INFO ] Implicit Places using invariants in 115 ms returned []
[2024-05-21 20:59:54] [INFO ] Invariant cache hit.
[2024-05-21 20:59:54] [INFO ] Implicit Places using invariants and state equation in 282 ms returned []
Implicit Place search using SMT with State Equation took 400 ms to find 0 implicit places.
Running 342 sub problems to find dead transitions.
[2024-05-21 20:59:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 1 (OVERLAPS) 1/209 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 342 unsolved
[2024-05-21 21:00:01] [INFO ] Deduced a trap composed of 18 places in 241 ms of which 4 ms to minimize.
[2024-05-21 21:00:01] [INFO ] Deduced a trap composed of 31 places in 261 ms of which 4 ms to minimize.
[2024-05-21 21:00:01] [INFO ] Deduced a trap composed of 37 places in 202 ms of which 4 ms to minimize.
[2024-05-21 21:00:01] [INFO ] Deduced a trap composed of 44 places in 214 ms of which 3 ms to minimize.
[2024-05-21 21:00:02] [INFO ] Deduced a trap composed of 34 places in 213 ms of which 3 ms to minimize.
[2024-05-21 21:00:02] [INFO ] Deduced a trap composed of 33 places in 206 ms of which 3 ms to minimize.
[2024-05-21 21:00:02] [INFO ] Deduced a trap composed of 39 places in 186 ms of which 3 ms to minimize.
[2024-05-21 21:00:02] [INFO ] Deduced a trap composed of 35 places in 190 ms of which 3 ms to minimize.
[2024-05-21 21:00:02] [INFO ] Deduced a trap composed of 33 places in 196 ms of which 4 ms to minimize.
[2024-05-21 21:00:03] [INFO ] Deduced a trap composed of 36 places in 177 ms of which 3 ms to minimize.
[2024-05-21 21:00:03] [INFO ] Deduced a trap composed of 38 places in 238 ms of which 4 ms to minimize.
[2024-05-21 21:00:03] [INFO ] Deduced a trap composed of 25 places in 202 ms of which 3 ms to minimize.
[2024-05-21 21:00:04] [INFO ] Deduced a trap composed of 15 places in 214 ms of which 3 ms to minimize.
[2024-05-21 21:00:04] [INFO ] Deduced a trap composed of 34 places in 201 ms of which 3 ms to minimize.
[2024-05-21 21:00:04] [INFO ] Deduced a trap composed of 31 places in 219 ms of which 4 ms to minimize.
[2024-05-21 21:00:05] [INFO ] Deduced a trap composed of 26 places in 176 ms of which 3 ms to minimize.
[2024-05-21 21:00:05] [INFO ] Deduced a trap composed of 42 places in 207 ms of which 3 ms to minimize.
[2024-05-21 21:00:05] [INFO ] Deduced a trap composed of 32 places in 205 ms of which 3 ms to minimize.
[2024-05-21 21:00:05] [INFO ] Deduced a trap composed of 39 places in 164 ms of which 3 ms to minimize.
[2024-05-21 21:00:06] [INFO ] Deduced a trap composed of 39 places in 160 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/209 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 342 unsolved
[2024-05-21 21:00:06] [INFO ] Deduced a trap composed of 43 places in 206 ms of which 3 ms to minimize.
[2024-05-21 21:00:06] [INFO ] Deduced a trap composed of 23 places in 204 ms of which 4 ms to minimize.
[2024-05-21 21:00:07] [INFO ] Deduced a trap composed of 46 places in 218 ms of which 4 ms to minimize.
[2024-05-21 21:00:07] [INFO ] Deduced a trap composed of 43 places in 245 ms of which 4 ms to minimize.
[2024-05-21 21:00:08] [INFO ] Deduced a trap composed of 39 places in 219 ms of which 3 ms to minimize.
[2024-05-21 21:00:08] [INFO ] Deduced a trap composed of 39 places in 150 ms of which 3 ms to minimize.
[2024-05-21 21:00:08] [INFO ] Deduced a trap composed of 39 places in 220 ms of which 7 ms to minimize.
[2024-05-21 21:00:09] [INFO ] Deduced a trap composed of 32 places in 202 ms of which 3 ms to minimize.
[2024-05-21 21:00:09] [INFO ] Deduced a trap composed of 41 places in 159 ms of which 3 ms to minimize.
[2024-05-21 21:00:09] [INFO ] Deduced a trap composed of 40 places in 153 ms of which 3 ms to minimize.
[2024-05-21 21:00:09] [INFO ] Deduced a trap composed of 54 places in 210 ms of which 3 ms to minimize.
[2024-05-21 21:00:10] [INFO ] Deduced a trap composed of 40 places in 181 ms of which 3 ms to minimize.
[2024-05-21 21:00:10] [INFO ] Deduced a trap composed of 38 places in 217 ms of which 4 ms to minimize.
[2024-05-21 21:00:10] [INFO ] Deduced a trap composed of 18 places in 151 ms of which 3 ms to minimize.
[2024-05-21 21:00:11] [INFO ] Deduced a trap composed of 5 places in 242 ms of which 3 ms to minimize.
[2024-05-21 21:00:11] [INFO ] Deduced a trap composed of 10 places in 232 ms of which 4 ms to minimize.
[2024-05-21 21:00:11] [INFO ] Deduced a trap composed of 32 places in 223 ms of which 3 ms to minimize.
[2024-05-21 21:00:12] [INFO ] Deduced a trap composed of 20 places in 97 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/209 variables, 18/48 constraints. Problems are: Problem set: 0 solved, 342 unsolved
[2024-05-21 21:00:16] [INFO ] Deduced a trap composed of 31 places in 170 ms of which 3 ms to minimize.
[2024-05-21 21:00:17] [INFO ] Deduced a trap composed of 19 places in 218 ms of which 3 ms to minimize.
[2024-05-21 21:00:17] [INFO ] Deduced a trap composed of 42 places in 134 ms of which 2 ms to minimize.
[2024-05-21 21:00:17] [INFO ] Deduced a trap composed of 42 places in 115 ms of which 2 ms to minimize.
[2024-05-21 21:00:17] [INFO ] Deduced a trap composed of 40 places in 104 ms of which 2 ms to minimize.
[2024-05-21 21:00:18] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 6/54 constraints. Problems are: Problem set: 0 solved, 342 unsolved
[2024-05-21 21:00:20] [INFO ] Deduced a trap composed of 54 places in 206 ms of which 3 ms to minimize.
[2024-05-21 21:00:20] [INFO ] Deduced a trap composed of 25 places in 200 ms of which 4 ms to minimize.
[2024-05-21 21:00:21] [INFO ] Deduced a trap composed of 14 places in 217 ms of which 3 ms to minimize.
[2024-05-21 21:00:21] [INFO ] Deduced a trap composed of 37 places in 177 ms of which 3 ms to minimize.
[2024-05-21 21:00:21] [INFO ] Deduced a trap composed of 34 places in 164 ms of which 3 ms to minimize.
[2024-05-21 21:00:21] [INFO ] Deduced a trap composed of 41 places in 135 ms of which 3 ms to minimize.
[2024-05-21 21:00:21] [INFO ] Deduced a trap composed of 42 places in 123 ms of which 3 ms to minimize.
[2024-05-21 21:00:22] [INFO ] Deduced a trap composed of 42 places in 124 ms of which 2 ms to minimize.
[2024-05-21 21:00:22] [INFO ] Deduced a trap composed of 40 places in 90 ms of which 2 ms to minimize.
[2024-05-21 21:00:22] [INFO ] Deduced a trap composed of 42 places in 115 ms of which 2 ms to minimize.
[2024-05-21 21:00:22] [INFO ] Deduced a trap composed of 41 places in 111 ms of which 3 ms to minimize.
[2024-05-21 21:00:22] [INFO ] Deduced a trap composed of 42 places in 95 ms of which 2 ms to minimize.
[2024-05-21 21:00:23] [INFO ] Deduced a trap composed of 32 places in 202 ms of which 3 ms to minimize.
[2024-05-21 21:00:23] [INFO ] Deduced a trap composed of 34 places in 160 ms of which 3 ms to minimize.
[2024-05-21 21:00:23] [INFO ] Deduced a trap composed of 44 places in 199 ms of which 4 ms to minimize.
[2024-05-21 21:00:23] [INFO ] Deduced a trap composed of 34 places in 165 ms of which 3 ms to minimize.
[2024-05-21 21:00:24] [INFO ] Deduced a trap composed of 42 places in 118 ms of which 4 ms to minimize.
[2024-05-21 21:00:24] [INFO ] Deduced a trap composed of 43 places in 99 ms of which 3 ms to minimize.
[2024-05-21 21:00:24] [INFO ] Deduced a trap composed of 45 places in 196 ms of which 4 ms to minimize.
[2024-05-21 21:00:24] [INFO ] Deduced a trap composed of 35 places in 156 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 20/74 constraints. Problems are: Problem set: 0 solved, 342 unsolved
[2024-05-21 21:00:25] [INFO ] Deduced a trap composed of 39 places in 152 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 209/552 variables, and 75 constraints, problems are : Problem set: 0 solved, 342 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/209 constraints, PredecessorRefiner: 342/342 constraints, Known Traps: 65/65 constraints]
Escalating to Integer solving :Problem set: 0 solved, 342 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 1 (OVERLAPS) 1/209 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/209 variables, 65/75 constraints. Problems are: Problem set: 0 solved, 342 unsolved
[2024-05-21 21:00:29] [INFO ] Deduced a trap composed of 31 places in 110 ms of which 2 ms to minimize.
[2024-05-21 21:00:30] [INFO ] Deduced a trap composed of 40 places in 128 ms of which 3 ms to minimize.
[2024-05-21 21:00:30] [INFO ] Deduced a trap composed of 31 places in 148 ms of which 2 ms to minimize.
[2024-05-21 21:00:30] [INFO ] Deduced a trap composed of 42 places in 125 ms of which 3 ms to minimize.
[2024-05-21 21:00:30] [INFO ] Deduced a trap composed of 41 places in 109 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/209 variables, 5/80 constraints. Problems are: Problem set: 0 solved, 342 unsolved
[2024-05-21 21:00:32] [INFO ] Deduced a trap composed of 42 places in 236 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 6 (OVERLAPS) 343/552 variables, 209/290 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/552 variables, 342/632 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/552 variables, 0/632 constraints. Problems are: Problem set: 0 solved, 342 unsolved
[2024-05-21 21:00:55] [INFO ] Deduced a trap composed of 49 places in 120 ms of which 3 ms to minimize.
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 552/552 variables, and 633 constraints, problems are : Problem set: 0 solved, 342 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 209/209 constraints, PredecessorRefiner: 342/342 constraints, Known Traps: 72/72 constraints]
After SMT, in 60549ms problems are : Problem set: 0 solved, 342 unsolved
Search for dead transitions found 0 dead transitions in 60557ms
Starting structural reductions in LTL mode, iteration 1 : 209/222 places, 343/356 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60971 ms. Remains : 209/222 places, 343/356 transitions.
[2024-05-21 21:00:55] [INFO ] Flatten gal took : 14 ms
[2024-05-21 21:00:55] [INFO ] Flatten gal took : 13 ms
[2024-05-21 21:00:55] [INFO ] Input system was already deterministic with 343 transitions.
[2024-05-21 21:00:55] [INFO ] Flatten gal took : 13 ms
[2024-05-21 21:00:55] [INFO ] Flatten gal took : 21 ms
[2024-05-21 21:00:55] [INFO ] Time to serialize gal into /tmp/CTLFireability8136171577943897477.gal : 7 ms
[2024-05-21 21:00:55] [INFO ] Time to serialize properties into /tmp/CTLFireability747801353822769357.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/CTLFireability8136171577943897477.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability747801353822769357.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-21 21:01:25] [INFO ] Flatten gal took : 13 ms
[2024-05-21 21:01:25] [INFO ] Applying decomposition
[2024-05-21 21:01:25] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph11720967909104993656.txt' '-o' '/tmp/graph11720967909104993656.bin' '-w' '/tmp/graph11720967909104993656.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11720967909104993656.bin' '-l' '-1' '-v' '-w' '/tmp/graph11720967909104993656.weights' '-q' '0' '-e' '0.001'
[2024-05-21 21:01:25] [INFO ] Decomposing Gal with order
[2024-05-21 21:01:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 21:01:25] [INFO ] Removed a total of 451 redundant transitions.
[2024-05-21 21:01:25] [INFO ] Flatten gal took : 48 ms
[2024-05-21 21:01:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 24 labels/synchronizations in 11 ms.
[2024-05-21 21:01:25] [INFO ] Time to serialize gal into /tmp/CTLFireability734611139682642597.gal : 6 ms
[2024-05-21 21:01:25] [INFO ] Time to serialize properties into /tmp/CTLFireability15362333581255036069.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/CTLFireability734611139682642597.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15362333581255036069.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,4.38214e+10,0.146923,5772,485,100,3205,627,517,4462,83,2032,0


Converting to forward existential form...Done !
original formula: (EX(EF(EG((i4.i1.u24.p76==1)))) + EF((((EG((((E((i4.i2.u29.p89==1) U (((i15.u1.p6==1)&&(i15.u1.p15==1))&&((i7.u36.p114==1)&&(i15.u1.p212=...555
=> equivalent forward existential formula: ([FwdG(FwdU(EY(Init),TRUE),(i4.i1.u24.p76==1))] != FALSE + ([((FwdU(Init,TRUE) * ((EG((((E((i4.i2.u29.p89==1) U ...1065
Using 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 2
Fast SCC detection found a local SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
(forward)formula 0,1,1.17685,35340,1,0,81585,1543,2505,77234,380,6530,96803
FORMULA AutonomousCar-PT-05b-CTLFireability-2024-02 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 : 222/222 places, 356/356 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 211 transition count 345
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 211 transition count 345
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 25 place count 208 transition count 342
Iterating global reduction 0 with 3 rules applied. Total rules applied 28 place count 208 transition count 342
Applied a total of 28 rules in 13 ms. Remains 208 /222 variables (removed 14) and now considering 342/356 (removed 14) transitions.
// Phase 1: matrix 342 rows 208 cols
[2024-05-21 21:01:27] [INFO ] Computed 10 invariants in 2 ms
[2024-05-21 21:01:27] [INFO ] Implicit Places using invariants in 108 ms returned []
[2024-05-21 21:01:27] [INFO ] Invariant cache hit.
[2024-05-21 21:01:27] [INFO ] Implicit Places using invariants and state equation in 251 ms returned []
Implicit Place search using SMT with State Equation took 360 ms to find 0 implicit places.
Running 341 sub problems to find dead transitions.
[2024-05-21 21:01:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/207 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 1 (OVERLAPS) 1/208 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 341 unsolved
[2024-05-21 21:01:33] [INFO ] Deduced a trap composed of 20 places in 234 ms of which 4 ms to minimize.
[2024-05-21 21:01:33] [INFO ] Deduced a trap composed of 14 places in 227 ms of which 2 ms to minimize.
[2024-05-21 21:01:33] [INFO ] Deduced a trap composed of 39 places in 71 ms of which 2 ms to minimize.
[2024-05-21 21:01:33] [INFO ] Deduced a trap composed of 39 places in 169 ms of which 3 ms to minimize.
[2024-05-21 21:01:33] [INFO ] Deduced a trap composed of 33 places in 127 ms of which 2 ms to minimize.
[2024-05-21 21:01:34] [INFO ] Deduced a trap composed of 38 places in 154 ms of which 3 ms to minimize.
[2024-05-21 21:01:34] [INFO ] Deduced a trap composed of 36 places in 144 ms of which 2 ms to minimize.
[2024-05-21 21:01:34] [INFO ] Deduced a trap composed of 43 places in 183 ms of which 3 ms to minimize.
[2024-05-21 21:01:34] [INFO ] Deduced a trap composed of 32 places in 119 ms of which 2 ms to minimize.
[2024-05-21 21:01:34] [INFO ] Deduced a trap composed of 46 places in 122 ms of which 2 ms to minimize.
[2024-05-21 21:01:34] [INFO ] Deduced a trap composed of 40 places in 113 ms of which 3 ms to minimize.
[2024-05-21 21:01:34] [INFO ] Deduced a trap composed of 42 places in 120 ms of which 2 ms to minimize.
[2024-05-21 21:01:35] [INFO ] Deduced a trap composed of 43 places in 73 ms of which 2 ms to minimize.
[2024-05-21 21:01:35] [INFO ] Deduced a trap composed of 33 places in 193 ms of which 4 ms to minimize.
[2024-05-21 21:01:35] [INFO ] Deduced a trap composed of 40 places in 101 ms of which 2 ms to minimize.
[2024-05-21 21:01:35] [INFO ] Deduced a trap composed of 39 places in 121 ms of which 2 ms to minimize.
[2024-05-21 21:01:36] [INFO ] Deduced a trap composed of 51 places in 105 ms of which 1 ms to minimize.
[2024-05-21 21:01:36] [INFO ] Deduced a trap composed of 32 places in 126 ms of which 2 ms to minimize.
[2024-05-21 21:01:36] [INFO ] Deduced a trap composed of 33 places in 133 ms of which 2 ms to minimize.
[2024-05-21 21:01:36] [INFO ] Deduced a trap composed of 31 places in 119 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 341 unsolved
[2024-05-21 21:01:36] [INFO ] Deduced a trap composed of 37 places in 114 ms of which 2 ms to minimize.
[2024-05-21 21:01:37] [INFO ] Deduced a trap composed of 23 places in 159 ms of which 3 ms to minimize.
[2024-05-21 21:01:37] [INFO ] Deduced a trap composed of 40 places in 178 ms of which 3 ms to minimize.
[2024-05-21 21:01:37] [INFO ] Deduced a trap composed of 39 places in 126 ms of which 2 ms to minimize.
[2024-05-21 21:01:37] [INFO ] Deduced a trap composed of 36 places in 122 ms of which 2 ms to minimize.
[2024-05-21 21:01:37] [INFO ] Deduced a trap composed of 24 places in 124 ms of which 2 ms to minimize.
[2024-05-21 21:01:38] [INFO ] Deduced a trap composed of 41 places in 87 ms of which 2 ms to minimize.
[2024-05-21 21:01:38] [INFO ] Deduced a trap composed of 42 places in 80 ms of which 1 ms to minimize.
[2024-05-21 21:01:38] [INFO ] Deduced a trap composed of 39 places in 73 ms of which 1 ms to minimize.
[2024-05-21 21:01:38] [INFO ] Deduced a trap composed of 52 places in 158 ms of which 3 ms to minimize.
[2024-05-21 21:01:39] [INFO ] Deduced a trap composed of 41 places in 76 ms of which 2 ms to minimize.
[2024-05-21 21:01:39] [INFO ] Deduced a trap composed of 39 places in 87 ms of which 1 ms to minimize.
[2024-05-21 21:01:39] [INFO ] Deduced a trap composed of 42 places in 82 ms of which 1 ms to minimize.
[2024-05-21 21:01:39] [INFO ] Deduced a trap composed of 14 places in 112 ms of which 2 ms to minimize.
[2024-05-21 21:01:40] [INFO ] Deduced a trap composed of 21 places in 123 ms of which 2 ms to minimize.
[2024-05-21 21:01:40] [INFO ] Deduced a trap composed of 20 places in 176 ms of which 2 ms to minimize.
[2024-05-21 21:01:40] [INFO ] Deduced a trap composed of 32 places in 201 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/208 variables, 17/47 constraints. Problems are: Problem set: 0 solved, 341 unsolved
[2024-05-21 21:01:45] [INFO ] Deduced a trap composed of 31 places in 153 ms of which 3 ms to minimize.
[2024-05-21 21:01:45] [INFO ] Deduced a trap composed of 40 places in 156 ms of which 3 ms to minimize.
[2024-05-21 21:01:45] [INFO ] Deduced a trap composed of 40 places in 137 ms of which 3 ms to minimize.
[2024-05-21 21:01:46] [INFO ] Deduced a trap composed of 45 places in 157 ms of which 3 ms to minimize.
[2024-05-21 21:01:46] [INFO ] Deduced a trap composed of 42 places in 127 ms of which 3 ms to minimize.
[2024-05-21 21:01:46] [INFO ] Deduced a trap composed of 42 places in 114 ms of which 2 ms to minimize.
[2024-05-21 21:01:46] [INFO ] Deduced a trap composed of 31 places in 195 ms of which 3 ms to minimize.
[2024-05-21 21:01:47] [INFO ] Deduced a trap composed of 55 places in 185 ms of which 3 ms to minimize.
[2024-05-21 21:01:47] [INFO ] Deduced a trap composed of 32 places in 160 ms of which 3 ms to minimize.
[2024-05-21 21:01:47] [INFO ] Deduced a trap composed of 25 places in 206 ms of which 3 ms to minimize.
[2024-05-21 21:01:47] [INFO ] Deduced a trap composed of 38 places in 192 ms of which 3 ms to minimize.
[2024-05-21 21:01:47] [INFO ] Deduced a trap composed of 35 places in 181 ms of which 3 ms to minimize.
[2024-05-21 21:01:48] [INFO ] Deduced a trap composed of 54 places in 186 ms of which 2 ms to minimize.
[2024-05-21 21:01:48] [INFO ] Deduced a trap composed of 36 places in 195 ms of which 3 ms to minimize.
[2024-05-21 21:01:48] [INFO ] Deduced a trap composed of 46 places in 201 ms of which 4 ms to minimize.
[2024-05-21 21:01:49] [INFO ] Deduced a trap composed of 23 places in 155 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 16/63 constraints. Problems are: Problem set: 0 solved, 341 unsolved
[2024-05-21 21:01:51] [INFO ] Deduced a trap composed of 36 places in 185 ms of which 2 ms to minimize.
[2024-05-21 21:01:52] [INFO ] Deduced a trap composed of 5 places in 204 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/208 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 341 unsolved
SMT process timed out in 30467ms, After SMT, problems are : Problem set: 0 solved, 341 unsolved
Search for dead transitions found 0 dead transitions in 30472ms
Starting structural reductions in LTL mode, iteration 1 : 208/222 places, 342/356 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30847 ms. Remains : 208/222 places, 342/356 transitions.
[2024-05-21 21:01:57] [INFO ] Flatten gal took : 19 ms
[2024-05-21 21:01:58] [INFO ] Flatten gal took : 18 ms
[2024-05-21 21:01:58] [INFO ] Input system was already deterministic with 342 transitions.
[2024-05-21 21:01:58] [INFO ] Flatten gal took : 18 ms
[2024-05-21 21:01:58] [INFO ] Flatten gal took : 19 ms
[2024-05-21 21:01:58] [INFO ] Time to serialize gal into /tmp/CTLFireability5002087129216658582.gal : 5 ms
[2024-05-21 21:01:58] [INFO ] Time to serialize properties into /tmp/CTLFireability7163942732266760856.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/CTLFireability5002087129216658582.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7163942732266760856.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.
Detected timeout of ITS tools.
[2024-05-21 21:02:28] [INFO ] Flatten gal took : 11 ms
[2024-05-21 21:02:28] [INFO ] Applying decomposition
[2024-05-21 21:02:28] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph10174614305467095783.txt' '-o' '/tmp/graph10174614305467095783.bin' '-w' '/tmp/graph10174614305467095783.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10174614305467095783.bin' '-l' '-1' '-v' '-w' '/tmp/graph10174614305467095783.weights' '-q' '0' '-e' '0.001'
[2024-05-21 21:02:28] [INFO ] Decomposing Gal with order
[2024-05-21 21:02:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 21:02:28] [INFO ] Removed a total of 454 redundant transitions.
[2024-05-21 21:02:28] [INFO ] Flatten gal took : 31 ms
[2024-05-21 21:02:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 22 labels/synchronizations in 10 ms.
[2024-05-21 21:02:28] [INFO ] Time to serialize gal into /tmp/CTLFireability15343207520183328658.gal : 5 ms
[2024-05-21 21:02:28] [INFO ] Time to serialize properties into /tmp/CTLFireability18127141034858673111.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/CTLFireability15343207520183328658.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18127141034858673111.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,4.0054e+10,0.146645,6304,475,109,4645,635,490,7644,81,2913,0


Converting to forward existential form...Done !
original formula: AX((AG((AX((i14.i0.u2.p7==0)) + AG((((i12.u1.p6==0)||(i12.u1.p14==0))||((i7.u45.p145==0)||(i12.u1.p212==0)))))) * ((i8.i1.u41.p131==0) + ...356
=> equivalent forward existential formula: ([(FwdU((FwdU(EY(Init),TRUE) * !(!(EX(!((i14.i0.u2.p7==0)))))),TRUE) * !((((i12.u1.p6==0)||(i12.u1.p14==0))||((i...450
Reverse transition relation is NOT exact ! Due to transitions t196, t199, t219, t254, t274, t289, t339, i1.i0.t186, i1.i0.u9.t166, i1.i0.u18.t167, i2.u15.t...723
(forward)formula 0,0,0.562147,13960,1,0,22122,1368,3348,29491,438,5040,65986
FORMULA AutonomousCar-PT-05b-CTLFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 222/222 places, 356/356 transitions.
Graph (trivial) has 209 edges and 222 vertex of which 4 / 222 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 90 transitions
Trivial Post-agglo rules discarded 90 transitions
Performed 90 trivial Post agglomeration. Transition count delta: 90
Iterating post reduction 0 with 90 rules applied. Total rules applied 91 place count 219 transition count 263
Reduce places removed 90 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 1 with 121 rules applied. Total rules applied 212 place count 129 transition count 232
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 230 place count 111 transition count 232
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 230 place count 111 transition count 227
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 240 place count 106 transition count 227
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 247 place count 99 transition count 220
Iterating global reduction 3 with 7 rules applied. Total rules applied 254 place count 99 transition count 220
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 254 place count 99 transition count 219
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 256 place count 98 transition count 219
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 257 place count 97 transition count 218
Iterating global reduction 3 with 1 rules applied. Total rules applied 258 place count 97 transition count 218
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 3 with 68 rules applied. Total rules applied 326 place count 63 transition count 184
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 327 place count 63 transition count 183
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 337 place count 53 transition count 128
Iterating global reduction 4 with 10 rules applied. Total rules applied 347 place count 53 transition count 128
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 4 with 10 rules applied. Total rules applied 357 place count 53 transition count 118
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 362 place count 48 transition count 118
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 364 place count 47 transition count 117
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 365 place count 47 transition count 116
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 367 place count 45 transition count 114
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 368 place count 44 transition count 114
Applied a total of 368 rules in 100 ms. Remains 44 /222 variables (removed 178) and now considering 114/356 (removed 242) transitions.
// Phase 1: matrix 114 rows 44 cols
[2024-05-21 21:02:29] [INFO ] Computed 8 invariants in 2 ms
[2024-05-21 21:02:29] [INFO ] Implicit Places using invariants in 106 ms returned []
[2024-05-21 21:02:29] [INFO ] Invariant cache hit.
[2024-05-21 21:02:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 21:02:29] [INFO ] Implicit Places using invariants and state equation in 185 ms returned [36, 43]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 297 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 42/222 places, 114/356 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 42 transition count 113
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 41 transition count 113
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 41 transition count 112
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 40 transition count 112
Applied a total of 4 rules in 11 ms. Remains 40 /42 variables (removed 2) and now considering 112/114 (removed 2) transitions.
// Phase 1: matrix 112 rows 40 cols
[2024-05-21 21:02:29] [INFO ] Computed 6 invariants in 2 ms
[2024-05-21 21:02:29] [INFO ] Implicit Places using invariants in 161 ms returned []
[2024-05-21 21:02:29] [INFO ] Invariant cache hit.
[2024-05-21 21:02:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 21:02:29] [INFO ] Implicit Places using invariants and state equation in 158 ms returned []
Implicit Place search using SMT with State Equation took 323 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 40/222 places, 112/356 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 733 ms. Remains : 40/222 places, 112/356 transitions.
[2024-05-21 21:02:29] [INFO ] Flatten gal took : 8 ms
[2024-05-21 21:02:29] [INFO ] Flatten gal took : 9 ms
[2024-05-21 21:02:29] [INFO ] Input system was already deterministic with 112 transitions.
[2024-05-21 21:02:29] [INFO ] Flatten gal took : 10 ms
[2024-05-21 21:02:29] [INFO ] Flatten gal took : 9 ms
[2024-05-21 21:02:29] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16826017102401254041.gal : 2 ms
[2024-05-21 21:02:29] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2458066558883667710.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16826017102401254041.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2458066558883667710.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
RANDOM walk for 7192 steps (528 resets) in 121 ms. (58 steps per ms) remains 0/1 properties
FORMULA AutonomousCar-PT-05b-CTLFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 222/222 places, 356/356 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 209 transition count 343
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 209 transition count 343
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 29 place count 206 transition count 340
Iterating global reduction 0 with 3 rules applied. Total rules applied 32 place count 206 transition count 340
Applied a total of 32 rules in 26 ms. Remains 206 /222 variables (removed 16) and now considering 340/356 (removed 16) transitions.
// Phase 1: matrix 340 rows 206 cols
[2024-05-21 21:02:29] [INFO ] Computed 10 invariants in 3 ms
[2024-05-21 21:02:29] [INFO ] Implicit Places using invariants in 147 ms returned []
[2024-05-21 21:02:29] [INFO ] Invariant cache hit.
[2024-05-21 21:02:30] [INFO ] Implicit Places using invariants and state equation in 354 ms returned []
Implicit Place search using SMT with State Equation took 507 ms to find 0 implicit places.
Running 339 sub problems to find dead transitions.
[2024-05-21 21:02:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 1 (OVERLAPS) 1/206 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 339 unsolved
[2024-05-21 21:02:35] [INFO ] Deduced a trap composed of 51 places in 264 ms of which 4 ms to minimize.
[2024-05-21 21:02:36] [INFO ] Deduced a trap composed of 31 places in 265 ms of which 6 ms to minimize.
[2024-05-21 21:02:36] [INFO ] Deduced a trap composed of 17 places in 201 ms of which 3 ms to minimize.
[2024-05-21 21:02:36] [INFO ] Deduced a trap composed of 24 places in 217 ms of which 3 ms to minimize.
[2024-05-21 21:02:37] [INFO ] Deduced a trap composed of 38 places in 247 ms of which 4 ms to minimize.
[2024-05-21 21:02:37] [INFO ] Deduced a trap composed of 14 places in 218 ms of which 4 ms to minimize.
[2024-05-21 21:02:37] [INFO ] Deduced a trap composed of 23 places in 228 ms of which 3 ms to minimize.
[2024-05-21 21:02:37] [INFO ] Deduced a trap composed of 33 places in 199 ms of which 3 ms to minimize.
[2024-05-21 21:02:38] [INFO ] Deduced a trap composed of 32 places in 210 ms of which 3 ms to minimize.
[2024-05-21 21:02:38] [INFO ] Deduced a trap composed of 36 places in 221 ms of which 3 ms to minimize.
[2024-05-21 21:02:38] [INFO ] Deduced a trap composed of 29 places in 213 ms of which 3 ms to minimize.
[2024-05-21 21:02:38] [INFO ] Deduced a trap composed of 32 places in 188 ms of which 3 ms to minimize.
[2024-05-21 21:02:39] [INFO ] Deduced a trap composed of 36 places in 239 ms of which 4 ms to minimize.
[2024-05-21 21:02:39] [INFO ] Deduced a trap composed of 31 places in 174 ms of which 3 ms to minimize.
[2024-05-21 21:02:39] [INFO ] Deduced a trap composed of 43 places in 207 ms of which 3 ms to minimize.
[2024-05-21 21:02:39] [INFO ] Deduced a trap composed of 39 places in 204 ms of which 4 ms to minimize.
[2024-05-21 21:02:40] [INFO ] Deduced a trap composed of 21 places in 151 ms of which 2 ms to minimize.
[2024-05-21 21:02:40] [INFO ] Deduced a trap composed of 39 places in 156 ms of which 4 ms to minimize.
[2024-05-21 21:02:40] [INFO ] Deduced a trap composed of 32 places in 177 ms of which 3 ms to minimize.
[2024-05-21 21:02:40] [INFO ] Deduced a trap composed of 37 places in 193 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 339 unsolved
[2024-05-21 21:02:40] [INFO ] Deduced a trap composed of 20 places in 108 ms of which 2 ms to minimize.
[2024-05-21 21:02:41] [INFO ] Deduced a trap composed of 35 places in 203 ms of which 3 ms to minimize.
[2024-05-21 21:02:41] [INFO ] Deduced a trap composed of 18 places in 187 ms of which 3 ms to minimize.
[2024-05-21 21:02:41] [INFO ] Deduced a trap composed of 25 places in 193 ms of which 3 ms to minimize.
[2024-05-21 21:02:42] [INFO ] Deduced a trap composed of 33 places in 187 ms of which 3 ms to minimize.
[2024-05-21 21:02:42] [INFO ] Deduced a trap composed of 42 places in 199 ms of which 3 ms to minimize.
[2024-05-21 21:02:42] [INFO ] Deduced a trap composed of 42 places in 146 ms of which 2 ms to minimize.
[2024-05-21 21:02:43] [INFO ] Deduced a trap composed of 40 places in 120 ms of which 2 ms to minimize.
[2024-05-21 21:02:43] [INFO ] Deduced a trap composed of 56 places in 204 ms of which 2 ms to minimize.
[2024-05-21 21:02:43] [INFO ] Deduced a trap composed of 41 places in 151 ms of which 3 ms to minimize.
[2024-05-21 21:02:43] [INFO ] Deduced a trap composed of 42 places in 109 ms of which 2 ms to minimize.
[2024-05-21 21:02:44] [INFO ] Deduced a trap composed of 41 places in 96 ms of which 1 ms to minimize.
[2024-05-21 21:02:44] [INFO ] Deduced a trap composed of 20 places in 156 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 13/43 constraints. Problems are: Problem set: 0 solved, 339 unsolved
[2024-05-21 21:02:48] [INFO ] Deduced a trap composed of 39 places in 65 ms of which 1 ms to minimize.
[2024-05-21 21:02:49] [INFO ] Deduced a trap composed of 56 places in 186 ms of which 3 ms to minimize.
[2024-05-21 21:02:50] [INFO ] Deduced a trap composed of 32 places in 208 ms of which 4 ms to minimize.
[2024-05-21 21:02:50] [INFO ] Deduced a trap composed of 36 places in 205 ms of which 3 ms to minimize.
[2024-05-21 21:02:50] [INFO ] Deduced a trap composed of 40 places in 101 ms of which 1 ms to minimize.
[2024-05-21 21:02:50] [INFO ] Deduced a trap composed of 39 places in 96 ms of which 2 ms to minimize.
[2024-05-21 21:02:50] [INFO ] Deduced a trap composed of 39 places in 182 ms of which 3 ms to minimize.
[2024-05-21 21:02:51] [INFO ] Deduced a trap composed of 38 places in 220 ms of which 3 ms to minimize.
[2024-05-21 21:02:51] [INFO ] Deduced a trap composed of 14 places in 190 ms of which 3 ms to minimize.
[2024-05-21 21:02:51] [INFO ] Deduced a trap composed of 53 places in 168 ms of which 3 ms to minimize.
[2024-05-21 21:02:52] [INFO ] Deduced a trap composed of 31 places in 180 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 11/54 constraints. Problems are: Problem set: 0 solved, 339 unsolved
[2024-05-21 21:02:55] [INFO ] Deduced a trap composed of 40 places in 80 ms of which 2 ms to minimize.
[2024-05-21 21:02:55] [INFO ] Deduced a trap composed of 42 places in 103 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/206 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 339 unsolved
[2024-05-21 21:02:58] [INFO ] Deduced a trap composed of 41 places in 93 ms of which 2 ms to minimize.
[2024-05-21 21:02:58] [INFO ] Deduced a trap composed of 42 places in 109 ms of which 2 ms to minimize.
[2024-05-21 21:02:58] [INFO ] Deduced a trap composed of 42 places in 93 ms of which 2 ms to minimize.
[2024-05-21 21:02:59] [INFO ] Deduced a trap composed of 39 places in 76 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/206 variables, 4/60 constraints. Problems are: Problem set: 0 solved, 339 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 206/546 variables, and 60 constraints, problems are : Problem set: 0 solved, 339 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/206 constraints, PredecessorRefiner: 339/339 constraints, Known Traps: 50/50 constraints]
Escalating to Integer solving :Problem set: 0 solved, 339 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 1 (OVERLAPS) 1/206 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 50/60 constraints. Problems are: Problem set: 0 solved, 339 unsolved
[2024-05-21 21:03:04] [INFO ] Deduced a trap composed of 49 places in 247 ms of which 4 ms to minimize.
[2024-05-21 21:03:04] [INFO ] Deduced a trap composed of 37 places in 214 ms of which 3 ms to minimize.
[2024-05-21 21:03:05] [INFO ] Deduced a trap composed of 36 places in 150 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 3/63 constraints. Problems are: Problem set: 0 solved, 339 unsolved
[2024-05-21 21:03:08] [INFO ] Deduced a trap composed of 23 places in 141 ms of which 2 ms to minimize.
[2024-05-21 21:03:08] [INFO ] Deduced a trap composed of 31 places in 132 ms of which 2 ms to minimize.
[2024-05-21 21:03:08] [INFO ] Deduced a trap composed of 31 places in 118 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 3/66 constraints. Problems are: Problem set: 0 solved, 339 unsolved
[2024-05-21 21:03:12] [INFO ] Deduced a trap composed of 38 places in 129 ms of which 2 ms to minimize.
[2024-05-21 21:03:12] [INFO ] Deduced a trap composed of 51 places in 117 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/206 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 339 unsolved
[2024-05-21 21:03:15] [INFO ] Deduced a trap composed of 51 places in 147 ms of which 2 ms to minimize.
[2024-05-21 21:03:15] [INFO ] Deduced a trap composed of 51 places in 124 ms of which 2 ms to minimize.
[2024-05-21 21:03:16] [INFO ] Deduced a trap composed of 51 places in 118 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/206 variables, 3/71 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/206 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 8 (OVERLAPS) 340/546 variables, 206/277 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/546 variables, 339/616 constraints. Problems are: Problem set: 0 solved, 339 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 546/546 variables, and 616 constraints, problems are : Problem set: 0 solved, 339 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 206/206 constraints, PredecessorRefiner: 339/339 constraints, Known Traps: 61/61 constraints]
After SMT, in 60572ms problems are : Problem set: 0 solved, 339 unsolved
Search for dead transitions found 0 dead transitions in 60580ms
Starting structural reductions in LTL mode, iteration 1 : 206/222 places, 340/356 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61114 ms. Remains : 206/222 places, 340/356 transitions.
[2024-05-21 21:03:30] [INFO ] Flatten gal took : 16 ms
[2024-05-21 21:03:30] [INFO ] Flatten gal took : 16 ms
[2024-05-21 21:03:30] [INFO ] Input system was already deterministic with 340 transitions.
[2024-05-21 21:03:31] [INFO ] Flatten gal took : 16 ms
[2024-05-21 21:03:31] [INFO ] Flatten gal took : 16 ms
[2024-05-21 21:03:31] [INFO ] Time to serialize gal into /tmp/CTLFireability8870046277717425591.gal : 4 ms
[2024-05-21 21:03:31] [INFO ] Time to serialize properties into /tmp/CTLFireability6469873662655647828.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/CTLFireability8870046277717425591.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6469873662655647828.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.
Detected timeout of ITS tools.
[2024-05-21 21:04:01] [INFO ] Flatten gal took : 12 ms
[2024-05-21 21:04:01] [INFO ] Applying decomposition
[2024-05-21 21:04:01] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph3589190302139978564.txt' '-o' '/tmp/graph3589190302139978564.bin' '-w' '/tmp/graph3589190302139978564.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3589190302139978564.bin' '-l' '-1' '-v' '-w' '/tmp/graph3589190302139978564.weights' '-q' '0' '-e' '0.001'
[2024-05-21 21:04:01] [INFO ] Decomposing Gal with order
[2024-05-21 21:04:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 21:04:01] [INFO ] Removed a total of 449 redundant transitions.
[2024-05-21 21:04:01] [INFO ] Flatten gal took : 24 ms
[2024-05-21 21:04:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 28 labels/synchronizations in 4 ms.
[2024-05-21 21:04:01] [INFO ] Time to serialize gal into /tmp/CTLFireability989816487875635694.gal : 3 ms
[2024-05-21 21:04:01] [INFO ] Time to serialize properties into /tmp/CTLFireability15503146799647898319.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/CTLFireability989816487875635694.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15503146799647898319.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,3.84316e+10,0.11998,7244,582,103,6796,702,470,9595,81,2492,0


Converting to forward existential form...Done !
original formula: EX(EF((((i0.u2.p6==1)&&(i0.u2.p16==1))&&((i4.u16.p52==1)&&(i0.u2.p212==1)))))
=> equivalent forward existential formula: [(FwdU(EY(Init),TRUE) * (((i0.u2.p6==1)&&(i0.u2.p16==1))&&((i4.u16.p52==1)&&(i0.u2.p212==1))))] != FALSE
(forward)formula 0,1,0.181365,7508,1,0,6808,702,1101,9706,157,2492,18370
FORMULA AutonomousCar-PT-05b-CTLFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 222/222 places, 356/356 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 209 transition count 343
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 209 transition count 343
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 29 place count 206 transition count 340
Iterating global reduction 0 with 3 rules applied. Total rules applied 32 place count 206 transition count 340
Applied a total of 32 rules in 14 ms. Remains 206 /222 variables (removed 16) and now considering 340/356 (removed 16) transitions.
[2024-05-21 21:04:01] [INFO ] Invariant cache hit.
[2024-05-21 21:04:01] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-21 21:04:01] [INFO ] Invariant cache hit.
[2024-05-21 21:04:01] [INFO ] Implicit Places using invariants and state equation in 270 ms returned []
Implicit Place search using SMT with State Equation took 345 ms to find 0 implicit places.
Running 339 sub problems to find dead transitions.
[2024-05-21 21:04:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 1 (OVERLAPS) 1/206 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 339 unsolved
[2024-05-21 21:04:07] [INFO ] Deduced a trap composed of 51 places in 269 ms of which 4 ms to minimize.
[2024-05-21 21:04:08] [INFO ] Deduced a trap composed of 31 places in 216 ms of which 4 ms to minimize.
[2024-05-21 21:04:08] [INFO ] Deduced a trap composed of 17 places in 217 ms of which 3 ms to minimize.
[2024-05-21 21:04:08] [INFO ] Deduced a trap composed of 24 places in 217 ms of which 3 ms to minimize.
[2024-05-21 21:04:09] [INFO ] Deduced a trap composed of 38 places in 243 ms of which 3 ms to minimize.
[2024-05-21 21:04:09] [INFO ] Deduced a trap composed of 14 places in 211 ms of which 3 ms to minimize.
[2024-05-21 21:04:09] [INFO ] Deduced a trap composed of 23 places in 215 ms of which 3 ms to minimize.
[2024-05-21 21:04:09] [INFO ] Deduced a trap composed of 33 places in 207 ms of which 3 ms to minimize.
[2024-05-21 21:04:09] [INFO ] Deduced a trap composed of 32 places in 206 ms of which 3 ms to minimize.
[2024-05-21 21:04:10] [INFO ] Deduced a trap composed of 36 places in 210 ms of which 3 ms to minimize.
[2024-05-21 21:04:10] [INFO ] Deduced a trap composed of 29 places in 179 ms of which 3 ms to minimize.
[2024-05-21 21:04:10] [INFO ] Deduced a trap composed of 32 places in 176 ms of which 3 ms to minimize.
[2024-05-21 21:04:11] [INFO ] Deduced a trap composed of 36 places in 253 ms of which 3 ms to minimize.
[2024-05-21 21:04:11] [INFO ] Deduced a trap composed of 31 places in 172 ms of which 3 ms to minimize.
[2024-05-21 21:04:11] [INFO ] Deduced a trap composed of 43 places in 181 ms of which 4 ms to minimize.
[2024-05-21 21:04:11] [INFO ] Deduced a trap composed of 39 places in 183 ms of which 4 ms to minimize.
[2024-05-21 21:04:11] [INFO ] Deduced a trap composed of 21 places in 160 ms of which 2 ms to minimize.
[2024-05-21 21:04:11] [INFO ] Deduced a trap composed of 39 places in 153 ms of which 3 ms to minimize.
[2024-05-21 21:04:12] [INFO ] Deduced a trap composed of 32 places in 172 ms of which 3 ms to minimize.
[2024-05-21 21:04:12] [INFO ] Deduced a trap composed of 37 places in 209 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 339 unsolved
[2024-05-21 21:04:12] [INFO ] Deduced a trap composed of 20 places in 134 ms of which 2 ms to minimize.
[2024-05-21 21:04:13] [INFO ] Deduced a trap composed of 35 places in 191 ms of which 3 ms to minimize.
[2024-05-21 21:04:13] [INFO ] Deduced a trap composed of 18 places in 187 ms of which 3 ms to minimize.
[2024-05-21 21:04:13] [INFO ] Deduced a trap composed of 25 places in 185 ms of which 3 ms to minimize.
[2024-05-21 21:04:14] [INFO ] Deduced a trap composed of 33 places in 197 ms of which 3 ms to minimize.
[2024-05-21 21:04:14] [INFO ] Deduced a trap composed of 42 places in 203 ms of which 3 ms to minimize.
[2024-05-21 21:04:14] [INFO ] Deduced a trap composed of 42 places in 157 ms of which 3 ms to minimize.
[2024-05-21 21:04:14] [INFO ] Deduced a trap composed of 40 places in 137 ms of which 2 ms to minimize.
[2024-05-21 21:04:15] [INFO ] Deduced a trap composed of 56 places in 203 ms of which 3 ms to minimize.
[2024-05-21 21:04:15] [INFO ] Deduced a trap composed of 41 places in 140 ms of which 2 ms to minimize.
[2024-05-21 21:04:15] [INFO ] Deduced a trap composed of 42 places in 145 ms of which 2 ms to minimize.
[2024-05-21 21:04:16] [INFO ] Deduced a trap composed of 41 places in 134 ms of which 3 ms to minimize.
[2024-05-21 21:04:16] [INFO ] Deduced a trap composed of 20 places in 200 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 13/43 constraints. Problems are: Problem set: 0 solved, 339 unsolved
[2024-05-21 21:04:20] [INFO ] Deduced a trap composed of 39 places in 66 ms of which 1 ms to minimize.
[2024-05-21 21:04:22] [INFO ] Deduced a trap composed of 56 places in 192 ms of which 3 ms to minimize.
[2024-05-21 21:04:22] [INFO ] Deduced a trap composed of 32 places in 216 ms of which 4 ms to minimize.
[2024-05-21 21:04:22] [INFO ] Deduced a trap composed of 36 places in 187 ms of which 3 ms to minimize.
[2024-05-21 21:04:22] [INFO ] Deduced a trap composed of 40 places in 139 ms of which 2 ms to minimize.
[2024-05-21 21:04:22] [INFO ] Deduced a trap composed of 39 places in 118 ms of which 2 ms to minimize.
[2024-05-21 21:04:23] [INFO ] Deduced a trap composed of 39 places in 178 ms of which 3 ms to minimize.
[2024-05-21 21:04:23] [INFO ] Deduced a trap composed of 38 places in 196 ms of which 2 ms to minimize.
[2024-05-21 21:04:23] [INFO ] Deduced a trap composed of 14 places in 200 ms of which 3 ms to minimize.
[2024-05-21 21:04:24] [INFO ] Deduced a trap composed of 53 places in 199 ms of which 3 ms to minimize.
[2024-05-21 21:04:24] [INFO ] Deduced a trap composed of 31 places in 184 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 11/54 constraints. Problems are: Problem set: 0 solved, 339 unsolved
[2024-05-21 21:04:27] [INFO ] Deduced a trap composed of 40 places in 116 ms of which 2 ms to minimize.
[2024-05-21 21:04:27] [INFO ] Deduced a trap composed of 42 places in 107 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/206 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 339 unsolved
[2024-05-21 21:04:30] [INFO ] Deduced a trap composed of 41 places in 143 ms of which 2 ms to minimize.
[2024-05-21 21:04:30] [INFO ] Deduced a trap composed of 42 places in 124 ms of which 2 ms to minimize.
[2024-05-21 21:04:30] [INFO ] Deduced a trap composed of 42 places in 96 ms of which 2 ms to minimize.
[2024-05-21 21:04:31] [INFO ] Deduced a trap composed of 39 places in 106 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 206/546 variables, and 60 constraints, problems are : Problem set: 0 solved, 339 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/206 constraints, PredecessorRefiner: 339/339 constraints, Known Traps: 50/50 constraints]
Escalating to Integer solving :Problem set: 0 solved, 339 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 1 (OVERLAPS) 1/206 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 50/60 constraints. Problems are: Problem set: 0 solved, 339 unsolved
[2024-05-21 21:04:35] [INFO ] Deduced a trap composed of 49 places in 229 ms of which 3 ms to minimize.
[2024-05-21 21:04:36] [INFO ] Deduced a trap composed of 37 places in 175 ms of which 2 ms to minimize.
[2024-05-21 21:04:37] [INFO ] Deduced a trap composed of 36 places in 201 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 3/63 constraints. Problems are: Problem set: 0 solved, 339 unsolved
[2024-05-21 21:04:39] [INFO ] Deduced a trap composed of 23 places in 199 ms of which 3 ms to minimize.
[2024-05-21 21:04:40] [INFO ] Deduced a trap composed of 31 places in 150 ms of which 2 ms to minimize.
[2024-05-21 21:04:40] [INFO ] Deduced a trap composed of 31 places in 169 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 3/66 constraints. Problems are: Problem set: 0 solved, 339 unsolved
[2024-05-21 21:04:44] [INFO ] Deduced a trap composed of 38 places in 129 ms of which 2 ms to minimize.
[2024-05-21 21:04:44] [INFO ] Deduced a trap composed of 51 places in 102 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/206 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 339 unsolved
[2024-05-21 21:04:47] [INFO ] Deduced a trap composed of 51 places in 120 ms of which 2 ms to minimize.
[2024-05-21 21:04:48] [INFO ] Deduced a trap composed of 51 places in 119 ms of which 2 ms to minimize.
[2024-05-21 21:04:48] [INFO ] Deduced a trap composed of 51 places in 110 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/206 variables, 3/71 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/206 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 8 (OVERLAPS) 340/546 variables, 206/277 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/546 variables, 339/616 constraints. Problems are: Problem set: 0 solved, 339 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 546/546 variables, and 616 constraints, problems are : Problem set: 0 solved, 339 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 206/206 constraints, PredecessorRefiner: 339/339 constraints, Known Traps: 61/61 constraints]
After SMT, in 60595ms problems are : Problem set: 0 solved, 339 unsolved
Search for dead transitions found 0 dead transitions in 60603ms
Starting structural reductions in LTL mode, iteration 1 : 206/222 places, 340/356 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60970 ms. Remains : 206/222 places, 340/356 transitions.
[2024-05-21 21:05:02] [INFO ] Flatten gal took : 16 ms
[2024-05-21 21:05:02] [INFO ] Flatten gal took : 15 ms
[2024-05-21 21:05:02] [INFO ] Input system was already deterministic with 340 transitions.
[2024-05-21 21:05:02] [INFO ] Flatten gal took : 15 ms
[2024-05-21 21:05:02] [INFO ] Flatten gal took : 32 ms
[2024-05-21 21:05:02] [INFO ] Time to serialize gal into /tmp/CTLFireability14220298626927238096.gal : 17 ms
[2024-05-21 21:05:02] [INFO ] Time to serialize properties into /tmp/CTLFireability9999142820321562214.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/CTLFireability14220298626927238096.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9999142820321562214.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.
Detected timeout of ITS tools.
[2024-05-21 21:05:32] [INFO ] Flatten gal took : 10 ms
[2024-05-21 21:05:32] [INFO ] Applying decomposition
[2024-05-21 21:05:32] [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/graph12633202101956776114.txt' '-o' '/tmp/graph12633202101956776114.bin' '-w' '/tmp/graph12633202101956776114.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12633202101956776114.bin' '-l' '-1' '-v' '-w' '/tmp/graph12633202101956776114.weights' '-q' '0' '-e' '0.001'
[2024-05-21 21:05:32] [INFO ] Decomposing Gal with order
[2024-05-21 21:05:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 21:05:32] [INFO ] Removed a total of 453 redundant transitions.
[2024-05-21 21:05:32] [INFO ] Flatten gal took : 43 ms
[2024-05-21 21:05:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 24 labels/synchronizations in 4 ms.
[2024-05-21 21:05:32] [INFO ] Time to serialize gal into /tmp/CTLFireability3269194919748675523.gal : 16 ms
[2024-05-21 21:05:32] [INFO ] Time to serialize properties into /tmp/CTLFireability3260705815089665878.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/CTLFireability3269194919748675523.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3260705815089665878.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,3.84316e+10,0.109954,5940,506,102,3611,600,462,5126,81,2036,0


Converting to forward existential form...Done !
original formula: AG(E(A(AX((i2.u10.p37!=1)) U (!((((i13.u1.p6==1)&&(i13.u1.p14==1))&&((i2.u10.p36==1)&&(i13.u1.p212==1)))) * E((i9.u38.p124==1) U (((i13.u...353
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(!((E(!((!((((i13.u1.p6==1)&&(i13.u1.p14==1))&&((i2.u10.p36==1)&&(i13.u1.p212==1)))) * E(...804
Reverse transition relation is NOT exact ! Due to transitions t194, t196, t216, t251, t271, t291, t337, i1.u57.t32, i1.u57.t35, i1.u57.t36, i1.u57.t37, i3....709
Using 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 14
Fast SCC detection found an SCC at level 15
Using 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 14
Fast SCC detection found an SCC at level 15
(forward)formula 0,0,17.198,433620,1,0,857399,4364,3409,1.30403e+06,467,31960,821619
FORMULA AutonomousCar-PT-05b-CTLFireability-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 222/222 places, 356/356 transitions.
Graph (trivial) has 203 edges and 222 vertex of which 4 / 222 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 88 transitions
Trivial Post-agglo rules discarded 88 transitions
Performed 88 trivial Post agglomeration. Transition count delta: 88
Iterating post reduction 0 with 88 rules applied. Total rules applied 89 place count 219 transition count 265
Reduce places removed 88 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 1 with 116 rules applied. Total rules applied 205 place count 131 transition count 237
Reduce places removed 16 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 17 rules applied. Total rules applied 222 place count 115 transition count 236
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 223 place count 114 transition count 236
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 223 place count 114 transition count 229
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 237 place count 107 transition count 229
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 244 place count 100 transition count 222
Iterating global reduction 4 with 7 rules applied. Total rules applied 251 place count 100 transition count 222
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 252 place count 99 transition count 221
Iterating global reduction 4 with 1 rules applied. Total rules applied 253 place count 99 transition count 221
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 4 with 68 rules applied. Total rules applied 321 place count 65 transition count 187
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 322 place count 65 transition count 186
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 330 place count 57 transition count 142
Iterating global reduction 5 with 8 rules applied. Total rules applied 338 place count 57 transition count 142
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 5 with 8 rules applied. Total rules applied 346 place count 57 transition count 134
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 350 place count 53 transition count 134
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 352 place count 52 transition count 133
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 353 place count 52 transition count 132
Partial Post-agglomeration rule applied 3 times.
Drop transitions (Partial Post agglomeration) removed 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 356 place count 52 transition count 132
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 358 place count 50 transition count 130
Applied a total of 358 rules in 52 ms. Remains 50 /222 variables (removed 172) and now considering 130/356 (removed 226) transitions.
// Phase 1: matrix 130 rows 50 cols
[2024-05-21 21:05:50] [INFO ] Computed 9 invariants in 1 ms
[2024-05-21 21:05:50] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-21 21:05:50] [INFO ] Invariant cache hit.
[2024-05-21 21:05:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 21:05:50] [INFO ] Implicit Places using invariants and state equation in 126 ms returned [44, 49]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 206 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 48/222 places, 130/356 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 48 transition count 129
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 47 transition count 129
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 47 transition count 128
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 46 transition count 128
Applied a total of 4 rules in 12 ms. Remains 46 /48 variables (removed 2) and now considering 128/130 (removed 2) transitions.
// Phase 1: matrix 128 rows 46 cols
[2024-05-21 21:05:50] [INFO ] Computed 7 invariants in 1 ms
[2024-05-21 21:05:50] [INFO ] Implicit Places using invariants in 120 ms returned []
[2024-05-21 21:05:50] [INFO ] Invariant cache hit.
[2024-05-21 21:05:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 21:05:50] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 277 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 46/222 places, 128/356 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 547 ms. Remains : 46/222 places, 128/356 transitions.
[2024-05-21 21:05:50] [INFO ] Flatten gal took : 10 ms
[2024-05-21 21:05:50] [INFO ] Flatten gal took : 10 ms
[2024-05-21 21:05:50] [INFO ] Input system was already deterministic with 128 transitions.
[2024-05-21 21:05:50] [INFO ] Flatten gal took : 10 ms
[2024-05-21 21:05:50] [INFO ] Flatten gal took : 9 ms
[2024-05-21 21:05:50] [INFO ] Time to serialize gal into /tmp/CTLFireability4802342317823950885.gal : 2 ms
[2024-05-21 21:05:50] [INFO ] Time to serialize properties into /tmp/CTLFireability2726854502364873513.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/CTLFireability4802342317823950885.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2726854502364873513.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,929250,2.62215,55344,2,2881,5,177195,6,0,311,144738,0


Converting to forward existential form...Done !
original formula: !(A((AG(!(A((((p6==1)&&(p14==1))&&((p176==1)&&(p212==1))) U (p179==1)))) + (p72!=1)) U EF((((p6==1)&&(p15==1))&&((p79==1)&&(p212==1))))))
=> equivalent forward existential formula: ([((FwdU(Init,!(E(TRUE U (((p6==1)&&(p15==1))&&((p79==1)&&(p212==1)))))) * !((!(E(TRUE U !(!(!((E(!((p179==1)) U...415
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t6, t8, t10, t12, t14, t16, t18, t22, t24, t62, t126, Intersection with reac...232
(forward)formula 0,0,29.3225,490952,1,0,868,2.60511e+06,297,408,4719,1.8718e+06,990
FORMULA AutonomousCar-PT-05b-CTLFireability-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 222/222 places, 356/356 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 212 transition count 346
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 212 transition count 346
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 210 transition count 344
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 210 transition count 344
Applied a total of 24 rules in 18 ms. Remains 210 /222 variables (removed 12) and now considering 344/356 (removed 12) transitions.
// Phase 1: matrix 344 rows 210 cols
[2024-05-21 21:06:20] [INFO ] Computed 10 invariants in 3 ms
[2024-05-21 21:06:20] [INFO ] Implicit Places using invariants in 185 ms returned []
[2024-05-21 21:06:20] [INFO ] Invariant cache hit.
[2024-05-21 21:06:20] [INFO ] Implicit Places using invariants and state equation in 380 ms returned []
Implicit Place search using SMT with State Equation took 585 ms to find 0 implicit places.
Running 343 sub problems to find dead transitions.
[2024-05-21 21:06:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/209 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 1 (OVERLAPS) 1/210 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 343 unsolved
[2024-05-21 21:06:27] [INFO ] Deduced a trap composed of 18 places in 245 ms of which 4 ms to minimize.
[2024-05-21 21:06:27] [INFO ] Deduced a trap composed of 42 places in 271 ms of which 4 ms to minimize.
[2024-05-21 21:06:27] [INFO ] Deduced a trap composed of 31 places in 220 ms of which 4 ms to minimize.
[2024-05-21 21:06:27] [INFO ] Deduced a trap composed of 31 places in 210 ms of which 3 ms to minimize.
[2024-05-21 21:06:27] [INFO ] Deduced a trap composed of 20 places in 135 ms of which 3 ms to minimize.
[2024-05-21 21:06:28] [INFO ] Deduced a trap composed of 35 places in 136 ms of which 5 ms to minimize.
[2024-05-21 21:06:28] [INFO ] Deduced a trap composed of 38 places in 246 ms of which 4 ms to minimize.
[2024-05-21 21:06:28] [INFO ] Deduced a trap composed of 31 places in 169 ms of which 4 ms to minimize.
[2024-05-21 21:06:28] [INFO ] Deduced a trap composed of 31 places in 180 ms of which 3 ms to minimize.
[2024-05-21 21:06:29] [INFO ] Deduced a trap composed of 39 places in 169 ms of which 4 ms to minimize.
[2024-05-21 21:06:29] [INFO ] Deduced a trap composed of 41 places in 150 ms of which 3 ms to minimize.
[2024-05-21 21:06:29] [INFO ] Deduced a trap composed of 42 places in 139 ms of which 3 ms to minimize.
[2024-05-21 21:06:29] [INFO ] Deduced a trap composed of 32 places in 154 ms of which 3 ms to minimize.
[2024-05-21 21:06:29] [INFO ] Deduced a trap composed of 39 places in 233 ms of which 4 ms to minimize.
[2024-05-21 21:06:30] [INFO ] Deduced a trap composed of 24 places in 225 ms of which 3 ms to minimize.
[2024-05-21 21:06:30] [INFO ] Deduced a trap composed of 53 places in 185 ms of which 3 ms to minimize.
[2024-05-21 21:06:30] [INFO ] Deduced a trap composed of 32 places in 199 ms of which 3 ms to minimize.
[2024-05-21 21:06:31] [INFO ] Deduced a trap composed of 31 places in 178 ms of which 3 ms to minimize.
[2024-05-21 21:06:31] [INFO ] Deduced a trap composed of 39 places in 74 ms of which 2 ms to minimize.
[2024-05-21 21:06:31] [INFO ] Deduced a trap composed of 33 places in 175 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/210 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 343 unsolved
[2024-05-21 21:06:31] [INFO ] Deduced a trap composed of 23 places in 180 ms of which 3 ms to minimize.
[2024-05-21 21:06:32] [INFO ] Deduced a trap composed of 37 places in 223 ms of which 3 ms to minimize.
[2024-05-21 21:06:32] [INFO ] Deduced a trap composed of 14 places in 200 ms of which 3 ms to minimize.
[2024-05-21 21:06:32] [INFO ] Deduced a trap composed of 29 places in 213 ms of which 3 ms to minimize.
[2024-05-21 21:06:33] [INFO ] Deduced a trap composed of 32 places in 212 ms of which 3 ms to minimize.
[2024-05-21 21:06:33] [INFO ] Deduced a trap composed of 32 places in 215 ms of which 4 ms to minimize.
[2024-05-21 21:06:33] [INFO ] Deduced a trap composed of 21 places in 248 ms of which 4 ms to minimize.
[2024-05-21 21:06:34] [INFO ] Deduced a trap composed of 40 places in 181 ms of which 3 ms to minimize.
[2024-05-21 21:06:34] [INFO ] Deduced a trap composed of 45 places in 169 ms of which 3 ms to minimize.
[2024-05-21 21:06:35] [INFO ] Deduced a trap composed of 39 places in 170 ms of which 3 ms to minimize.
[2024-05-21 21:06:35] [INFO ] Deduced a trap composed of 40 places in 161 ms of which 3 ms to minimize.
[2024-05-21 21:06:35] [INFO ] Deduced a trap composed of 41 places in 164 ms of which 3 ms to minimize.
[2024-05-21 21:06:35] [INFO ] Deduced a trap composed of 39 places in 179 ms of which 4 ms to minimize.
[2024-05-21 21:06:35] [INFO ] Deduced a trap composed of 31 places in 177 ms of which 3 ms to minimize.
[2024-05-21 21:06:36] [INFO ] Deduced a trap composed of 31 places in 134 ms of which 3 ms to minimize.
[2024-05-21 21:06:36] [INFO ] Deduced a trap composed of 42 places in 137 ms of which 2 ms to minimize.
[2024-05-21 21:06:36] [INFO ] Deduced a trap composed of 30 places in 251 ms of which 4 ms to minimize.
[2024-05-21 21:06:37] [INFO ] Deduced a trap composed of 19 places in 228 ms of which 4 ms to minimize.
[2024-05-21 21:06:37] [INFO ] Deduced a trap composed of 30 places in 225 ms of which 4 ms to minimize.
[2024-05-21 21:06:37] [INFO ] Deduced a trap composed of 10 places in 224 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/210 variables, 20/50 constraints. Problems are: Problem set: 0 solved, 343 unsolved
[2024-05-21 21:06:40] [INFO ] Deduced a trap composed of 31 places in 219 ms of which 3 ms to minimize.
[2024-05-21 21:06:41] [INFO ] Deduced a trap composed of 23 places in 199 ms of which 3 ms to minimize.
[2024-05-21 21:06:41] [INFO ] Deduced a trap composed of 34 places in 193 ms of which 5 ms to minimize.
[2024-05-21 21:06:41] [INFO ] Deduced a trap composed of 24 places in 191 ms of which 2 ms to minimize.
[2024-05-21 21:06:42] [INFO ] Deduced a trap composed of 39 places in 117 ms of which 3 ms to minimize.
[2024-05-21 21:06:42] [INFO ] Deduced a trap composed of 42 places in 94 ms of which 1 ms to minimize.
[2024-05-21 21:06:42] [INFO ] Deduced a trap composed of 37 places in 218 ms of which 4 ms to minimize.
[2024-05-21 21:06:42] [INFO ] Deduced a trap composed of 31 places in 220 ms of which 3 ms to minimize.
[2024-05-21 21:06:42] [INFO ] Deduced a trap composed of 40 places in 212 ms of which 4 ms to minimize.
[2024-05-21 21:06:43] [INFO ] Deduced a trap composed of 32 places in 202 ms of which 3 ms to minimize.
[2024-05-21 21:06:43] [INFO ] Deduced a trap composed of 39 places in 213 ms of which 3 ms to minimize.
[2024-05-21 21:06:43] [INFO ] Deduced a trap composed of 27 places in 222 ms of which 4 ms to minimize.
[2024-05-21 21:06:43] [INFO ] Deduced a trap composed of 42 places in 117 ms of which 2 ms to minimize.
[2024-05-21 21:06:44] [INFO ] Deduced a trap composed of 42 places in 104 ms of which 2 ms to minimize.
[2024-05-21 21:06:44] [INFO ] Deduced a trap composed of 32 places in 209 ms of which 4 ms to minimize.
[2024-05-21 21:06:44] [INFO ] Deduced a trap composed of 41 places in 114 ms of which 2 ms to minimize.
[2024-05-21 21:06:44] [INFO ] Deduced a trap composed of 42 places in 122 ms of which 3 ms to minimize.
[2024-05-21 21:06:45] [INFO ] Deduced a trap composed of 41 places in 201 ms of which 3 ms to minimize.
[2024-05-21 21:06:45] [INFO ] Deduced a trap composed of 55 places in 198 ms of which 4 ms to minimize.
[2024-05-21 21:06:45] [INFO ] Deduced a trap composed of 40 places in 187 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/210 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 343 unsolved
[2024-05-21 21:06:47] [INFO ] Deduced a trap composed of 41 places in 113 ms of which 3 ms to minimize.
[2024-05-21 21:06:47] [INFO ] Deduced a trap composed of 5 places in 162 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/210 variables, 2/72 constraints. Problems are: Problem set: 0 solved, 343 unsolved
[2024-05-21 21:06:50] [INFO ] Deduced a trap composed of 38 places in 112 ms of which 3 ms to minimize.
[2024-05-21 21:06:51] [INFO ] Deduced a trap composed of 38 places in 126 ms of which 3 ms to minimize.
[2024-05-21 21:06:51] [INFO ] Deduced a trap composed of 38 places in 108 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 210/554 variables, and 75 constraints, problems are : Problem set: 0 solved, 343 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/210 constraints, PredecessorRefiner: 343/343 constraints, Known Traps: 65/65 constraints]
Escalating to Integer solving :Problem set: 0 solved, 343 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/209 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 1 (OVERLAPS) 1/210 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/210 variables, 65/75 constraints. Problems are: Problem set: 0 solved, 343 unsolved
[2024-05-21 21:06:54] [INFO ] Deduced a trap composed of 33 places in 209 ms of which 3 ms to minimize.
[2024-05-21 21:06:55] [INFO ] Deduced a trap composed of 36 places in 202 ms of which 3 ms to minimize.
[2024-05-21 21:06:55] [INFO ] Deduced a trap composed of 33 places in 190 ms of which 4 ms to minimize.
[2024-05-21 21:06:55] [INFO ] Deduced a trap composed of 35 places in 185 ms of which 3 ms to minimize.
[2024-05-21 21:06:55] [INFO ] Deduced a trap composed of 36 places in 156 ms of which 2 ms to minimize.
[2024-05-21 21:06:56] [INFO ] Deduced a trap composed of 45 places in 174 ms of which 3 ms to minimize.
[2024-05-21 21:06:57] [INFO ] Deduced a trap composed of 32 places in 160 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/210 variables, 7/82 constraints. Problems are: Problem set: 0 solved, 343 unsolved
[2024-05-21 21:07:00] [INFO ] Deduced a trap composed of 47 places in 187 ms of which 3 ms to minimize.
[2024-05-21 21:07:00] [INFO ] Deduced a trap composed of 32 places in 161 ms of which 3 ms to minimize.
[2024-05-21 21:07:01] [INFO ] Deduced a trap composed of 28 places in 148 ms of which 3 ms to minimize.
[2024-05-21 21:07:01] [INFO ] Deduced a trap composed of 14 places in 170 ms of which 3 ms to minimize.
[2024-05-21 21:07:01] [INFO ] Deduced a trap composed of 32 places in 158 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/210 variables, 5/87 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/210 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 6 (OVERLAPS) 344/554 variables, 210/297 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/554 variables, 343/640 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/554 variables, 0/640 constraints. Problems are: Problem set: 0 solved, 343 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 554/554 variables, and 640 constraints, problems are : Problem set: 0 solved, 343 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 210/210 constraints, PredecessorRefiner: 343/343 constraints, Known Traps: 77/77 constraints]
After SMT, in 60527ms problems are : Problem set: 0 solved, 343 unsolved
Search for dead transitions found 0 dead transitions in 60534ms
Starting structural reductions in LTL mode, iteration 1 : 210/222 places, 344/356 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61138 ms. Remains : 210/222 places, 344/356 transitions.
[2024-05-21 21:07:21] [INFO ] Flatten gal took : 16 ms
[2024-05-21 21:07:21] [INFO ] Flatten gal took : 16 ms
[2024-05-21 21:07:21] [INFO ] Input system was already deterministic with 344 transitions.
[2024-05-21 21:07:21] [INFO ] Flatten gal took : 24 ms
[2024-05-21 21:07:21] [INFO ] Flatten gal took : 16 ms
[2024-05-21 21:07:21] [INFO ] Time to serialize gal into /tmp/CTLFireability16576320377787973661.gal : 11 ms
[2024-05-21 21:07:21] [INFO ] Time to serialize properties into /tmp/CTLFireability6382633661582601549.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/CTLFireability16576320377787973661.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6382633661582601549.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.
Detected timeout of ITS tools.
[2024-05-21 21:07:51] [INFO ] Flatten gal took : 9 ms
[2024-05-21 21:07:51] [INFO ] Applying decomposition
[2024-05-21 21:07:51] [INFO ] Flatten gal took : 15 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph1380489113538702856.txt' '-o' '/tmp/graph1380489113538702856.bin' '-w' '/tmp/graph1380489113538702856.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1380489113538702856.bin' '-l' '-1' '-v' '-w' '/tmp/graph1380489113538702856.weights' '-q' '0' '-e' '0.001'
[2024-05-21 21:07:51] [INFO ] Decomposing Gal with order
[2024-05-21 21:07:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 21:07:51] [INFO ] Removed a total of 450 redundant transitions.
[2024-05-21 21:07:51] [INFO ] Flatten gal took : 24 ms
[2024-05-21 21:07:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 32 labels/synchronizations in 4 ms.
[2024-05-21 21:07:51] [INFO ] Time to serialize gal into /tmp/CTLFireability17706223708535706106.gal : 3 ms
[2024-05-21 21:07:51] [INFO ] Time to serialize properties into /tmp/CTLFireability407035029678177405.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/CTLFireability17706223708535706106.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability407035029678177405.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,4.0054e+10,0.108935,5928,443,97,3631,707,488,7021,80,3257,0


Converting to forward existential form...Done !
original formula: EX(A(((A(EX((i15.i2.u76.p245==1)) U EF((i8.i1.u52.p169==1))) + EG((((i12.u1.p6==1)&&(i12.u1.p9==1))&&((i5.u34.p117==1)&&(i12.u1.p212==1))...371
=> equivalent forward existential formula: [((EY(Init) * !(EG(!(!((E(!(E(TRUE U (((i12.u1.p6==1)&&(i12.u1.p16==1))&&((i0.u16.p52==1)&&(i12.u1.p212==1))))) ...1547
Reverse transition relation is NOT exact ! Due to transitions t198, t204, t229, t259, t274, t294, i0.u15.t173, i0.u15.t176, i0.u16.t174, i1.i1.t189, i1.i1....707
Using 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 4
Fast SCC detection found a local SCC at level 14
Fast SCC detection found an SCC at level 15
Using 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 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found a local SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found a local SCC at level 4
Fast SCC detection found a local SCC at level 14
Fast SCC detection found an SCC at level 15
(forward)formula 0,1,27.4871,701124,1,0,1.42721e+06,5199,3746,1.97443e+06,470,42387,1216254
FORMULA AutonomousCar-PT-05b-CTLFireability-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 222/222 places, 356/356 transitions.
Graph (trivial) has 196 edges and 222 vertex of which 4 / 222 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 80 transitions
Trivial Post-agglo rules discarded 80 transitions
Performed 80 trivial Post agglomeration. Transition count delta: 80
Iterating post reduction 0 with 80 rules applied. Total rules applied 81 place count 219 transition count 273
Reduce places removed 80 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 1 with 105 rules applied. Total rules applied 186 place count 139 transition count 248
Reduce places removed 14 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 16 rules applied. Total rules applied 202 place count 125 transition count 246
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 204 place count 123 transition count 246
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 204 place count 123 transition count 238
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 220 place count 115 transition count 238
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 227 place count 108 transition count 231
Iterating global reduction 4 with 7 rules applied. Total rules applied 234 place count 108 transition count 231
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 235 place count 107 transition count 230
Iterating global reduction 4 with 1 rules applied. Total rules applied 236 place count 107 transition count 230
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 4 with 64 rules applied. Total rules applied 300 place count 75 transition count 198
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 301 place count 75 transition count 197
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 308 place count 68 transition count 158
Iterating global reduction 5 with 7 rules applied. Total rules applied 315 place count 68 transition count 158
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 5 with 4 rules applied. Total rules applied 319 place count 68 transition count 154
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 321 place count 66 transition count 154
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 323 place count 65 transition count 153
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 325 place count 65 transition count 151
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 1 rules applied. Total rules applied 326 place count 65 transition count 150
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 327 place count 64 transition count 150
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 328 place count 64 transition count 150
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 329 place count 63 transition count 149
Applied a total of 329 rules in 49 ms. Remains 63 /222 variables (removed 159) and now considering 149/356 (removed 207) transitions.
// Phase 1: matrix 149 rows 63 cols
[2024-05-21 21:08:19] [INFO ] Computed 9 invariants in 1 ms
[2024-05-21 21:08:19] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-05-21 21:08:19] [INFO ] Invariant cache hit.
[2024-05-21 21:08:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 21:08:19] [INFO ] Implicit Places using invariants and state equation in 112 ms returned [57, 62]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 191 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 61/222 places, 149/356 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 61 transition count 148
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 60 transition count 148
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 60 transition count 147
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 59 transition count 147
Applied a total of 4 rules in 6 ms. Remains 59 /61 variables (removed 2) and now considering 147/149 (removed 2) transitions.
// Phase 1: matrix 147 rows 59 cols
[2024-05-21 21:08:19] [INFO ] Computed 7 invariants in 1 ms
[2024-05-21 21:08:19] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-21 21:08:19] [INFO ] Invariant cache hit.
[2024-05-21 21:08:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 21:08:19] [INFO ] Implicit Places using invariants and state equation in 203 ms returned []
Implicit Place search using SMT with State Equation took 272 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 59/222 places, 147/356 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 519 ms. Remains : 59/222 places, 147/356 transitions.
[2024-05-21 21:08:20] [INFO ] Flatten gal took : 7 ms
[2024-05-21 21:08:20] [INFO ] Flatten gal took : 6 ms
[2024-05-21 21:08:20] [INFO ] Input system was already deterministic with 147 transitions.
[2024-05-21 21:08:20] [INFO ] Flatten gal took : 6 ms
[2024-05-21 21:08:20] [INFO ] Flatten gal took : 6 ms
[2024-05-21 21:08:20] [INFO ] Time to serialize gal into /tmp/CTLFireability14685607649271345425.gal : 5 ms
[2024-05-21 21:08:20] [INFO ] Time to serialize properties into /tmp/CTLFireability10386175950840799697.ctl : 6 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/CTLFireability14685607649271345425.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10386175950840799697.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,2.80521e+06,2.98629,60492,2,4470,5,187613,6,0,380,175698,0


Converting to forward existential form...Done !
original formula: EF(((AF((EG((p25==0)) + ((((((p6==0)||(p17==0))||((p129==0)||(p212==0)))||(((p6==0)||(p9==0))||((p86==0)||(p212==0))))&&(p27==0))&&(((p6=...231
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * (!(EG(!((EG((p25==0)) + ((((((p6==0)||(p17==0))||((p129==0)||(p212==0)))||(((p6==0)||(p9==0...313
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t7, t9, t11, t13, t19, t21, t27, t29, t34, t36, t38, t41, t42, t45, t46, t49,...327
(forward)formula 0,0,6.41387,98000,1,0,327,423325,318,156,5223,344073,339
FORMULA AutonomousCar-PT-05b-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 222/222 places, 356/356 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 210 transition count 344
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 210 transition count 344
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 26 place count 208 transition count 342
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 208 transition count 342
Applied a total of 28 rules in 8 ms. Remains 208 /222 variables (removed 14) and now considering 342/356 (removed 14) transitions.
// Phase 1: matrix 342 rows 208 cols
[2024-05-21 21:08:26] [INFO ] Computed 10 invariants in 2 ms
[2024-05-21 21:08:26] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-21 21:08:26] [INFO ] Invariant cache hit.
[2024-05-21 21:08:26] [INFO ] Implicit Places using invariants and state equation in 271 ms returned []
Implicit Place search using SMT with State Equation took 377 ms to find 0 implicit places.
Running 341 sub problems to find dead transitions.
[2024-05-21 21:08:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/207 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 1 (OVERLAPS) 1/208 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 341 unsolved
[2024-05-21 21:08:32] [INFO ] Deduced a trap composed of 20 places in 255 ms of which 4 ms to minimize.
[2024-05-21 21:08:33] [INFO ] Deduced a trap composed of 44 places in 241 ms of which 4 ms to minimize.
[2024-05-21 21:08:33] [INFO ] Deduced a trap composed of 31 places in 233 ms of which 4 ms to minimize.
[2024-05-21 21:08:33] [INFO ] Deduced a trap composed of 19 places in 245 ms of which 3 ms to minimize.
[2024-05-21 21:08:33] [INFO ] Deduced a trap composed of 40 places in 235 ms of which 3 ms to minimize.
[2024-05-21 21:08:34] [INFO ] Deduced a trap composed of 36 places in 241 ms of which 3 ms to minimize.
[2024-05-21 21:08:34] [INFO ] Deduced a trap composed of 32 places in 226 ms of which 3 ms to minimize.
[2024-05-21 21:08:34] [INFO ] Deduced a trap composed of 42 places in 242 ms of which 4 ms to minimize.
[2024-05-21 21:08:34] [INFO ] Deduced a trap composed of 37 places in 223 ms of which 3 ms to minimize.
[2024-05-21 21:08:35] [INFO ] Deduced a trap composed of 35 places in 227 ms of which 4 ms to minimize.
[2024-05-21 21:08:35] [INFO ] Deduced a trap composed of 42 places in 256 ms of which 4 ms to minimize.
[2024-05-21 21:08:35] [INFO ] Deduced a trap composed of 25 places in 231 ms of which 3 ms to minimize.
[2024-05-21 21:08:36] [INFO ] Deduced a trap composed of 38 places in 233 ms of which 3 ms to minimize.
[2024-05-21 21:08:36] [INFO ] Deduced a trap composed of 39 places in 204 ms of which 3 ms to minimize.
[2024-05-21 21:08:36] [INFO ] Deduced a trap composed of 15 places in 238 ms of which 3 ms to minimize.
[2024-05-21 21:08:36] [INFO ] Deduced a trap composed of 31 places in 229 ms of which 4 ms to minimize.
[2024-05-21 21:08:37] [INFO ] Deduced a trap composed of 33 places in 212 ms of which 4 ms to minimize.
[2024-05-21 21:08:37] [INFO ] Deduced a trap composed of 39 places in 130 ms of which 2 ms to minimize.
[2024-05-21 21:08:37] [INFO ] Deduced a trap composed of 42 places in 169 ms of which 2 ms to minimize.
[2024-05-21 21:08:37] [INFO ] Deduced a trap composed of 39 places in 132 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 341 unsolved
[2024-05-21 21:08:38] [INFO ] Deduced a trap composed of 39 places in 151 ms of which 2 ms to minimize.
[2024-05-21 21:08:38] [INFO ] Deduced a trap composed of 40 places in 210 ms of which 3 ms to minimize.
[2024-05-21 21:08:38] [INFO ] Deduced a trap composed of 46 places in 219 ms of which 3 ms to minimize.
[2024-05-21 21:08:39] [INFO ] Deduced a trap composed of 38 places in 214 ms of which 3 ms to minimize.
[2024-05-21 21:08:39] [INFO ] Deduced a trap composed of 34 places in 200 ms of which 3 ms to minimize.
[2024-05-21 21:08:39] [INFO ] Deduced a trap composed of 33 places in 239 ms of which 3 ms to minimize.
[2024-05-21 21:08:39] [INFO ] Deduced a trap composed of 57 places in 249 ms of which 3 ms to minimize.
[2024-05-21 21:08:40] [INFO ] Deduced a trap composed of 33 places in 234 ms of which 4 ms to minimize.
[2024-05-21 21:08:40] [INFO ] Deduced a trap composed of 32 places in 211 ms of which 3 ms to minimize.
[2024-05-21 21:08:40] [INFO ] Deduced a trap composed of 33 places in 195 ms of which 3 ms to minimize.
[2024-05-21 21:08:40] [INFO ] Deduced a trap composed of 21 places in 82 ms of which 2 ms to minimize.
[2024-05-21 21:08:41] [INFO ] Deduced a trap composed of 39 places in 120 ms of which 2 ms to minimize.
[2024-05-21 21:08:41] [INFO ] Deduced a trap composed of 40 places in 119 ms of which 2 ms to minimize.
[2024-05-21 21:08:42] [INFO ] Deduced a trap composed of 41 places in 134 ms of which 2 ms to minimize.
[2024-05-21 21:08:42] [INFO ] Deduced a trap composed of 40 places in 113 ms of which 2 ms to minimize.
[2024-05-21 21:08:42] [INFO ] Deduced a trap composed of 41 places in 134 ms of which 2 ms to minimize.
[2024-05-21 21:08:42] [INFO ] Deduced a trap composed of 42 places in 106 ms of which 1 ms to minimize.
[2024-05-21 21:08:42] [INFO ] Deduced a trap composed of 42 places in 82 ms of which 1 ms to minimize.
[2024-05-21 21:08:43] [INFO ] Deduced a trap composed of 19 places in 165 ms of which 2 ms to minimize.
[2024-05-21 21:08:43] [INFO ] Deduced a trap composed of 14 places in 116 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/208 variables, 20/50 constraints. Problems are: Problem set: 0 solved, 341 unsolved
[2024-05-21 21:08:46] [INFO ] Deduced a trap composed of 34 places in 126 ms of which 2 ms to minimize.
[2024-05-21 21:08:46] [INFO ] Deduced a trap composed of 34 places in 119 ms of which 2 ms to minimize.
[2024-05-21 21:08:46] [INFO ] Deduced a trap composed of 57 places in 156 ms of which 2 ms to minimize.
[2024-05-21 21:08:46] [INFO ] Deduced a trap composed of 34 places in 154 ms of which 2 ms to minimize.
[2024-05-21 21:08:46] [INFO ] Deduced a trap composed of 34 places in 125 ms of which 2 ms to minimize.
[2024-05-21 21:08:48] [INFO ] Deduced a trap composed of 21 places in 195 ms of which 2 ms to minimize.
[2024-05-21 21:08:48] [INFO ] Deduced a trap composed of 21 places in 168 ms of which 3 ms to minimize.
[2024-05-21 21:08:48] [INFO ] Deduced a trap composed of 36 places in 162 ms of which 2 ms to minimize.
[2024-05-21 21:08:48] [INFO ] Deduced a trap composed of 36 places in 145 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 9/59 constraints. Problems are: Problem set: 0 solved, 341 unsolved
[2024-05-21 21:08:50] [INFO ] Deduced a trap composed of 45 places in 149 ms of which 3 ms to minimize.
[2024-05-21 21:08:50] [INFO ] Deduced a trap composed of 32 places in 143 ms of which 2 ms to minimize.
[2024-05-21 21:08:51] [INFO ] Deduced a trap composed of 34 places in 137 ms of which 2 ms to minimize.
[2024-05-21 21:08:51] [INFO ] Deduced a trap composed of 46 places in 150 ms of which 2 ms to minimize.
[2024-05-21 21:08:52] [INFO ] Deduced a trap composed of 5 places in 99 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 5/64 constraints. Problems are: Problem set: 0 solved, 341 unsolved
[2024-05-21 21:08:54] [INFO ] Deduced a trap composed of 32 places in 147 ms of which 2 ms to minimize.
[2024-05-21 21:08:54] [INFO ] Deduced a trap composed of 31 places in 113 ms of which 2 ms to minimize.
[2024-05-21 21:08:55] [INFO ] Deduced a trap composed of 41 places in 106 ms of which 2 ms to minimize.
[2024-05-21 21:08:55] [INFO ] Deduced a trap composed of 42 places in 119 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 208/550 variables, and 68 constraints, problems are : Problem set: 0 solved, 341 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/208 constraints, PredecessorRefiner: 341/341 constraints, Known Traps: 58/58 constraints]
Escalating to Integer solving :Problem set: 0 solved, 341 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/207 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 1 (OVERLAPS) 1/208 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 58/68 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/208 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 4 (OVERLAPS) 342/550 variables, 208/276 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/550 variables, 341/617 constraints. Problems are: Problem set: 0 solved, 341 unsolved
[2024-05-21 21:09:06] [INFO ] Deduced a trap composed of 54 places in 204 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/550 variables, 1/618 constraints. Problems are: Problem set: 0 solved, 341 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 550/550 variables, and 618 constraints, problems are : Problem set: 0 solved, 341 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 208/208 constraints, PredecessorRefiner: 341/341 constraints, Known Traps: 59/59 constraints]
After SMT, in 60462ms problems are : Problem set: 0 solved, 341 unsolved
Search for dead transitions found 0 dead transitions in 60466ms
Starting structural reductions in LTL mode, iteration 1 : 208/222 places, 342/356 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60853 ms. Remains : 208/222 places, 342/356 transitions.
[2024-05-21 21:09:27] [INFO ] Flatten gal took : 16 ms
[2024-05-21 21:09:27] [INFO ] Flatten gal took : 16 ms
[2024-05-21 21:09:27] [INFO ] Input system was already deterministic with 342 transitions.
[2024-05-21 21:09:27] [INFO ] Flatten gal took : 15 ms
[2024-05-21 21:09:27] [INFO ] Flatten gal took : 16 ms
[2024-05-21 21:09:27] [INFO ] Time to serialize gal into /tmp/CTLFireability17048787367764404316.gal : 4 ms
[2024-05-21 21:09:27] [INFO ] Time to serialize properties into /tmp/CTLFireability6769908156328947770.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/CTLFireability17048787367764404316.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6769908156328947770.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.
Detected timeout of ITS tools.
[2024-05-21 21:09:57] [INFO ] Flatten gal took : 10 ms
[2024-05-21 21:09:57] [INFO ] Applying decomposition
[2024-05-21 21:09:57] [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/graph14902098873055525200.txt' '-o' '/tmp/graph14902098873055525200.bin' '-w' '/tmp/graph14902098873055525200.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14902098873055525200.bin' '-l' '-1' '-v' '-w' '/tmp/graph14902098873055525200.weights' '-q' '0' '-e' '0.001'
[2024-05-21 21:09:57] [INFO ] Decomposing Gal with order
[2024-05-21 21:09:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 21:09:57] [INFO ] Removed a total of 445 redundant transitions.
[2024-05-21 21:09:57] [INFO ] Flatten gal took : 23 ms
[2024-05-21 21:09:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 32 labels/synchronizations in 4 ms.
[2024-05-21 21:09:57] [INFO ] Time to serialize gal into /tmp/CTLFireability17944203206536292326.gal : 3 ms
[2024-05-21 21:09:57] [INFO ] Time to serialize properties into /tmp/CTLFireability16874087658697757340.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/CTLFireability17944203206536292326.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16874087658697757340.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,4.20562e+10,0.190639,8832,515,102,9416,1048,477,16149,83,5772,0


Converting to forward existential form...Done !
original formula: (EG(AF((i1.u61.p206==0))) + (!(E(AX(((i7.i1.u28.p111==1)||(((i0.u2.p6==1)&&(i0.u2.p17==1))&&((i3.i0.u10.p36==1)&&(i0.u2.p212==1))))) U !(...539
=> equivalent forward existential formula: ([(FwdU((Init * !(EG(!(EG(!((i1.u61.p206==0))))))),!(EX(!(((i7.i1.u28.p111==1)||(((i0.u2.p6==1)&&(i0.u2.p17==1))...677
Reverse transition relation is NOT exact ! Due to transitions t196, t204, t219, t249, t274, t289, t339, i0.t194, i1.t39, i1.t38, i1.u63.t33, i4.t187, i4.u9...667
Using 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
Using 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 an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found a local SCC at level 15
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
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 222/222 places, 356/356 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 210 transition count 344
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 210 transition count 344
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 207 transition count 341
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 207 transition count 341
Applied a total of 30 rules in 7 ms. Remains 207 /222 variables (removed 15) and now considering 341/356 (removed 15) transitions.
// Phase 1: matrix 341 rows 207 cols
[2024-05-21 21:10:27] [INFO ] Computed 10 invariants in 11 ms
[2024-05-21 21:10:27] [INFO ] Implicit Places using invariants in 144 ms returned []
[2024-05-21 21:10:27] [INFO ] Invariant cache hit.
[2024-05-21 21:10:28] [INFO ] Implicit Places using invariants and state equation in 281 ms returned []
Implicit Place search using SMT with State Equation took 427 ms to find 0 implicit places.
Running 340 sub problems to find dead transitions.
[2024-05-21 21:10:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/206 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 1 (OVERLAPS) 1/207 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 340 unsolved
[2024-05-21 21:10:33] [INFO ] Deduced a trap composed of 18 places in 218 ms of which 4 ms to minimize.
[2024-05-21 21:10:33] [INFO ] Deduced a trap composed of 31 places in 216 ms of which 3 ms to minimize.
[2024-05-21 21:10:33] [INFO ] Deduced a trap composed of 37 places in 182 ms of which 3 ms to minimize.
[2024-05-21 21:10:33] [INFO ] Deduced a trap composed of 20 places in 263 ms of which 4 ms to minimize.
[2024-05-21 21:10:34] [INFO ] Deduced a trap composed of 39 places in 203 ms of which 3 ms to minimize.
[2024-05-21 21:10:34] [INFO ] Deduced a trap composed of 38 places in 142 ms of which 3 ms to minimize.
[2024-05-21 21:10:34] [INFO ] Deduced a trap composed of 14 places in 210 ms of which 4 ms to minimize.
[2024-05-21 21:10:34] [INFO ] Deduced a trap composed of 40 places in 204 ms of which 3 ms to minimize.
[2024-05-21 21:10:35] [INFO ] Deduced a trap composed of 31 places in 226 ms of which 3 ms to minimize.
[2024-05-21 21:10:35] [INFO ] Deduced a trap composed of 31 places in 215 ms of which 3 ms to minimize.
[2024-05-21 21:10:35] [INFO ] Deduced a trap composed of 24 places in 151 ms of which 3 ms to minimize.
[2024-05-21 21:10:35] [INFO ] Deduced a trap composed of 31 places in 132 ms of which 2 ms to minimize.
[2024-05-21 21:10:35] [INFO ] Deduced a trap composed of 31 places in 115 ms of which 2 ms to minimize.
[2024-05-21 21:10:35] [INFO ] Deduced a trap composed of 52 places in 162 ms of which 2 ms to minimize.
[2024-05-21 21:10:36] [INFO ] Deduced a trap composed of 33 places in 195 ms of which 3 ms to minimize.
[2024-05-21 21:10:36] [INFO ] Deduced a trap composed of 58 places in 199 ms of which 3 ms to minimize.
[2024-05-21 21:10:36] [INFO ] Deduced a trap composed of 35 places in 186 ms of which 3 ms to minimize.
[2024-05-21 21:10:36] [INFO ] Deduced a trap composed of 39 places in 189 ms of which 3 ms to minimize.
[2024-05-21 21:10:36] [INFO ] Deduced a trap composed of 39 places in 181 ms of which 3 ms to minimize.
[2024-05-21 21:10:37] [INFO ] Deduced a trap composed of 39 places in 185 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/207 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 340 unsolved
[2024-05-21 21:10:37] [INFO ] Deduced a trap composed of 23 places in 182 ms of which 3 ms to minimize.
[2024-05-21 21:10:37] [INFO ] Deduced a trap composed of 38 places in 182 ms of which 3 ms to minimize.
[2024-05-21 21:10:38] [INFO ] Deduced a trap composed of 41 places in 153 ms of which 3 ms to minimize.
[2024-05-21 21:10:38] [INFO ] Deduced a trap composed of 36 places in 177 ms of which 3 ms to minimize.
[2024-05-21 21:10:38] [INFO ] Deduced a trap composed of 38 places in 180 ms of which 3 ms to minimize.
[2024-05-21 21:10:38] [INFO ] Deduced a trap composed of 45 places in 174 ms of which 3 ms to minimize.
[2024-05-21 21:10:39] [INFO ] Deduced a trap composed of 40 places in 107 ms of which 2 ms to minimize.
[2024-05-21 21:10:39] [INFO ] Deduced a trap composed of 41 places in 122 ms of which 3 ms to minimize.
[2024-05-21 21:10:39] [INFO ] Deduced a trap composed of 42 places in 110 ms of which 2 ms to minimize.
[2024-05-21 21:10:40] [INFO ] Deduced a trap composed of 21 places in 184 ms of which 3 ms to minimize.
[2024-05-21 21:10:40] [INFO ] Deduced a trap composed of 21 places in 192 ms of which 3 ms to minimize.
[2024-05-21 21:10:40] [INFO ] Deduced a trap composed of 5 places in 176 ms of which 3 ms to minimize.
[2024-05-21 21:10:40] [INFO ] Deduced a trap composed of 14 places in 161 ms of which 2 ms to minimize.
[2024-05-21 21:10:40] [INFO ] Deduced a trap composed of 43 places in 171 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/207 variables, 14/44 constraints. Problems are: Problem set: 0 solved, 340 unsolved
[2024-05-21 21:10:43] [INFO ] Deduced a trap composed of 31 places in 165 ms of which 3 ms to minimize.
[2024-05-21 21:10:44] [INFO ] Deduced a trap composed of 35 places in 168 ms of which 2 ms to minimize.
[2024-05-21 21:10:44] [INFO ] Deduced a trap composed of 32 places in 227 ms of which 4 ms to minimize.
[2024-05-21 21:10:44] [INFO ] Deduced a trap composed of 18 places in 203 ms of which 3 ms to minimize.
[2024-05-21 21:10:44] [INFO ] Deduced a trap composed of 25 places in 149 ms of which 2 ms to minimize.
[2024-05-21 21:10:45] [INFO ] Deduced a trap composed of 30 places in 150 ms of which 2 ms to minimize.
[2024-05-21 21:10:45] [INFO ] Deduced a trap composed of 34 places in 154 ms of which 2 ms to minimize.
[2024-05-21 21:10:45] [INFO ] Deduced a trap composed of 36 places in 147 ms of which 2 ms to minimize.
[2024-05-21 21:10:45] [INFO ] Deduced a trap composed of 36 places in 141 ms of which 2 ms to minimize.
[2024-05-21 21:10:45] [INFO ] Deduced a trap composed of 33 places in 138 ms of which 2 ms to minimize.
[2024-05-21 21:10:45] [INFO ] Deduced a trap composed of 23 places in 144 ms of which 2 ms to minimize.
[2024-05-21 21:10:45] [INFO ] Deduced a trap composed of 36 places in 132 ms of which 2 ms to minimize.
[2024-05-21 21:10:46] [INFO ] Deduced a trap composed of 26 places in 159 ms of which 2 ms to minimize.
[2024-05-21 21:10:46] [INFO ] Deduced a trap composed of 33 places in 164 ms of which 2 ms to minimize.
[2024-05-21 21:10:46] [INFO ] Deduced a trap composed of 32 places in 168 ms of which 2 ms to minimize.
[2024-05-21 21:10:47] [INFO ] Deduced a trap composed of 32 places in 142 ms of which 2 ms to minimize.
[2024-05-21 21:10:47] [INFO ] Deduced a trap composed of 32 places in 137 ms of which 2 ms to minimize.
[2024-05-21 21:10:47] [INFO ] Deduced a trap composed of 39 places in 143 ms of which 3 ms to minimize.
[2024-05-21 21:10:47] [INFO ] Deduced a trap composed of 42 places in 90 ms of which 2 ms to minimize.
[2024-05-21 21:10:47] [INFO ] Deduced a trap composed of 42 places in 113 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/207 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/207 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 6 (OVERLAPS) 341/548 variables, 207/271 constraints. Problems are: Problem set: 0 solved, 340 unsolved
[2024-05-21 21:10:56] [INFO ] Deduced a trap composed of 51 places in 156 ms of which 12 ms to minimize.
[2024-05-21 21:10:56] [INFO ] Deduced a trap composed of 51 places in 154 ms of which 3 ms to minimize.
[2024-05-21 21:10:56] [INFO ] Deduced a trap composed of 41 places in 135 ms of which 2 ms to minimize.
[2024-05-21 21:10:56] [INFO ] Deduced a trap composed of 42 places in 120 ms of which 2 ms to minimize.
[2024-05-21 21:10:57] [INFO ] Deduced a trap composed of 42 places in 93 ms of which 2 ms to minimize.
[2024-05-21 21:10:57] [INFO ] Deduced a trap composed of 51 places in 103 ms of which 2 ms to minimize.
[2024-05-21 21:10:58] [INFO ] Deduced a trap composed of 42 places in 101 ms of which 2 ms to minimize.
[2024-05-21 21:10:58] [INFO ] Deduced a trap composed of 40 places in 92 ms of which 3 ms to minimize.
[2024-05-21 21:10:58] [INFO ] Deduced a trap composed of 38 places in 96 ms of which 2 ms to minimize.
SMT process timed out in 30411ms, After SMT, problems are : Problem set: 0 solved, 340 unsolved
Search for dead transitions found 0 dead transitions in 30417ms
Starting structural reductions in LTL mode, iteration 1 : 207/222 places, 341/356 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30854 ms. Remains : 207/222 places, 341/356 transitions.
[2024-05-21 21:10:58] [INFO ] Flatten gal took : 16 ms
[2024-05-21 21:10:58] [INFO ] Flatten gal took : 16 ms
[2024-05-21 21:10:58] [INFO ] Input system was already deterministic with 341 transitions.
[2024-05-21 21:10:58] [INFO ] Flatten gal took : 16 ms
[2024-05-21 21:10:58] [INFO ] Flatten gal took : 15 ms
[2024-05-21 21:10:58] [INFO ] Time to serialize gal into /tmp/CTLFireability115524387083740347.gal : 4 ms
[2024-05-21 21:10:58] [INFO ] Time to serialize properties into /tmp/CTLFireability10725397775073237919.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/CTLFireability115524387083740347.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10725397775073237919.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.
Detected timeout of ITS tools.
[2024-05-21 21:11:28] [INFO ] Flatten gal took : 18 ms
[2024-05-21 21:11:28] [INFO ] Applying decomposition
[2024-05-21 21:11:28] [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/graph10252228790176510876.txt' '-o' '/tmp/graph10252228790176510876.bin' '-w' '/tmp/graph10252228790176510876.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10252228790176510876.bin' '-l' '-1' '-v' '-w' '/tmp/graph10252228790176510876.weights' '-q' '0' '-e' '0.001'
[2024-05-21 21:11:28] [INFO ] Decomposing Gal with order
[2024-05-21 21:11:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 21:11:28] [INFO ] Removed a total of 452 redundant transitions.
[2024-05-21 21:11:28] [INFO ] Flatten gal took : 23 ms
[2024-05-21 21:11:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 22 labels/synchronizations in 6 ms.
[2024-05-21 21:11:28] [INFO ] Time to serialize gal into /tmp/CTLFireability13456962970135791270.gal : 4 ms
[2024-05-21 21:11:28] [INFO ] Time to serialize properties into /tmp/CTLFireability10163774151326058168.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/CTLFireability13456962970135791270.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10163774151326058168.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,3.84316e+10,0.113795,6832,612,103,5973,711,491,7751,83,2242,0


Converting to forward existential form...Done !
original formula: E((i5.i1.u21.p66==1) U A((((i0.u1.p6==1)&&(i0.u1.p16==1))&&((i6.u26.p86==1)&&(i0.u1.p212==1))) U ((EF((((i0.u1.p6==1)&&(i0.u1.p17==1))&&(...346
=> equivalent forward existential formula: [((FwdU(Init,(i5.i1.u21.p66==1)) * !(EG(!(((E(TRUE U (((i0.u1.p6==1)&&(i0.u1.p17==1))&&((i8.u36.p117==1)&&(i0.u1...900
Reverse transition relation is NOT exact ! Due to transitions t195, t206, t221, t256, t276, t296, t338, i0.t193, i1.u66.t32, i1.u66.t35, i1.u66.t36, i1.u66...721
Using 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 2
Fast SCC detection found a local SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Using 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 2
Fast SCC detection found a local SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 222/222 places, 356/356 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 210 transition count 344
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 210 transition count 344
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 26 place count 208 transition count 342
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 208 transition count 342
Applied a total of 28 rules in 7 ms. Remains 208 /222 variables (removed 14) and now considering 342/356 (removed 14) transitions.
// Phase 1: matrix 342 rows 208 cols
[2024-05-21 21:11:58] [INFO ] Computed 10 invariants in 2 ms
[2024-05-21 21:11:59] [INFO ] Implicit Places using invariants in 135 ms returned []
[2024-05-21 21:11:59] [INFO ] Invariant cache hit.
[2024-05-21 21:11:59] [INFO ] Implicit Places using invariants and state equation in 358 ms returned []
Implicit Place search using SMT with State Equation took 494 ms to find 0 implicit places.
Running 341 sub problems to find dead transitions.
[2024-05-21 21:11:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/207 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 1 (OVERLAPS) 1/208 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 341 unsolved
[2024-05-21 21:12:04] [INFO ] Deduced a trap composed of 17 places in 253 ms of which 4 ms to minimize.
[2024-05-21 21:12:04] [INFO ] Deduced a trap composed of 18 places in 207 ms of which 3 ms to minimize.
[2024-05-21 21:12:04] [INFO ] Deduced a trap composed of 44 places in 198 ms of which 3 ms to minimize.
[2024-05-21 21:12:04] [INFO ] Deduced a trap composed of 21 places in 99 ms of which 2 ms to minimize.
[2024-05-21 21:12:05] [INFO ] Deduced a trap composed of 17 places in 204 ms of which 3 ms to minimize.
[2024-05-21 21:12:05] [INFO ] Deduced a trap composed of 46 places in 214 ms of which 3 ms to minimize.
[2024-05-21 21:12:05] [INFO ] Deduced a trap composed of 31 places in 227 ms of which 4 ms to minimize.
[2024-05-21 21:12:06] [INFO ] Deduced a trap composed of 38 places in 230 ms of which 3 ms to minimize.
[2024-05-21 21:12:06] [INFO ] Deduced a trap composed of 35 places in 199 ms of which 3 ms to minimize.
[2024-05-21 21:12:06] [INFO ] Deduced a trap composed of 20 places in 238 ms of which 3 ms to minimize.
[2024-05-21 21:12:06] [INFO ] Deduced a trap composed of 31 places in 179 ms of which 3 ms to minimize.
[2024-05-21 21:12:06] [INFO ] Deduced a trap composed of 39 places in 176 ms of which 3 ms to minimize.
[2024-05-21 21:12:07] [INFO ] Deduced a trap composed of 31 places in 174 ms of which 3 ms to minimize.
[2024-05-21 21:12:07] [INFO ] Deduced a trap composed of 31 places in 164 ms of which 3 ms to minimize.
[2024-05-21 21:12:07] [INFO ] Deduced a trap composed of 27 places in 217 ms of which 3 ms to minimize.
[2024-05-21 21:12:07] [INFO ] Deduced a trap composed of 14 places in 212 ms of which 3 ms to minimize.
[2024-05-21 21:12:08] [INFO ] Deduced a trap composed of 20 places in 230 ms of which 3 ms to minimize.
[2024-05-21 21:12:08] [INFO ] Deduced a trap composed of 21 places in 224 ms of which 3 ms to minimize.
[2024-05-21 21:12:08] [INFO ] Deduced a trap composed of 10 places in 234 ms of which 4 ms to minimize.
[2024-05-21 21:12:08] [INFO ] Deduced a trap composed of 37 places in 204 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 341 unsolved
[2024-05-21 21:12:09] [INFO ] Deduced a trap composed of 32 places in 183 ms of which 4 ms to minimize.
[2024-05-21 21:12:09] [INFO ] Deduced a trap composed of 33 places in 242 ms of which 4 ms to minimize.
[2024-05-21 21:12:09] [INFO ] Deduced a trap composed of 19 places in 219 ms of which 3 ms to minimize.
[2024-05-21 21:12:09] [INFO ] Deduced a trap composed of 40 places in 228 ms of which 3 ms to minimize.
[2024-05-21 21:12:10] [INFO ] Deduced a trap composed of 39 places in 217 ms of which 4 ms to minimize.
[2024-05-21 21:12:10] [INFO ] Deduced a trap composed of 61 places in 242 ms of which 4 ms to minimize.
[2024-05-21 21:12:10] [INFO ] Deduced a trap composed of 45 places in 232 ms of which 3 ms to minimize.
[2024-05-21 21:12:10] [INFO ] Deduced a trap composed of 47 places in 228 ms of which 4 ms to minimize.
[2024-05-21 21:12:11] [INFO ] Deduced a trap composed of 36 places in 214 ms of which 4 ms to minimize.
[2024-05-21 21:12:11] [INFO ] Deduced a trap composed of 24 places in 192 ms of which 3 ms to minimize.
[2024-05-21 21:12:11] [INFO ] Deduced a trap composed of 42 places in 208 ms of which 3 ms to minimize.
[2024-05-21 21:12:11] [INFO ] Deduced a trap composed of 23 places in 210 ms of which 3 ms to minimize.
[2024-05-21 21:12:12] [INFO ] Deduced a trap composed of 25 places in 195 ms of which 4 ms to minimize.
[2024-05-21 21:12:12] [INFO ] Deduced a trap composed of 32 places in 200 ms of which 3 ms to minimize.
[2024-05-21 21:12:12] [INFO ] Deduced a trap composed of 41 places in 197 ms of which 2 ms to minimize.
[2024-05-21 21:12:12] [INFO ] Deduced a trap composed of 31 places in 174 ms of which 3 ms to minimize.
[2024-05-21 21:12:13] [INFO ] Deduced a trap composed of 39 places in 120 ms of which 2 ms to minimize.
[2024-05-21 21:12:13] [INFO ] Deduced a trap composed of 41 places in 112 ms of which 3 ms to minimize.
[2024-05-21 21:12:13] [INFO ] Deduced a trap composed of 42 places in 86 ms of which 2 ms to minimize.
[2024-05-21 21:12:13] [INFO ] Deduced a trap composed of 42 places in 79 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/208 variables, 20/50 constraints. Problems are: Problem set: 0 solved, 341 unsolved
[2024-05-21 21:12:16] [INFO ] Deduced a trap composed of 41 places in 153 ms of which 3 ms to minimize.
[2024-05-21 21:12:16] [INFO ] Deduced a trap composed of 42 places in 92 ms of which 1 ms to minimize.
[2024-05-21 21:12:16] [INFO ] Deduced a trap composed of 42 places in 77 ms of which 2 ms to minimize.
[2024-05-21 21:12:17] [INFO ] Deduced a trap composed of 40 places in 100 ms of which 2 ms to minimize.
[2024-05-21 21:12:17] [INFO ] Deduced a trap composed of 40 places in 86 ms of which 2 ms to minimize.
[2024-05-21 21:12:17] [INFO ] Deduced a trap composed of 42 places in 101 ms of which 2 ms to minimize.
[2024-05-21 21:12:18] [INFO ] Deduced a trap composed of 41 places in 109 ms of which 3 ms to minimize.
[2024-05-21 21:12:18] [INFO ] Deduced a trap composed of 24 places in 213 ms of which 3 ms to minimize.
[2024-05-21 21:12:18] [INFO ] Deduced a trap composed of 14 places in 244 ms of which 3 ms to minimize.
[2024-05-21 21:12:19] [INFO ] Deduced a trap composed of 35 places in 209 ms of which 2 ms to minimize.
[2024-05-21 21:12:19] [INFO ] Deduced a trap composed of 36 places in 204 ms of which 3 ms to minimize.
[2024-05-21 21:12:19] [INFO ] Deduced a trap composed of 39 places in 202 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 12/62 constraints. Problems are: Problem set: 0 solved, 341 unsolved
[2024-05-21 21:12:21] [INFO ] Deduced a trap composed of 32 places in 159 ms of which 3 ms to minimize.
[2024-05-21 21:12:21] [INFO ] Deduced a trap composed of 34 places in 183 ms of which 2 ms to minimize.
[2024-05-21 21:12:22] [INFO ] Deduced a trap composed of 36 places in 196 ms of which 4 ms to minimize.
[2024-05-21 21:12:22] [INFO ] Deduced a trap composed of 31 places in 198 ms of which 3 ms to minimize.
[2024-05-21 21:12:23] [INFO ] Deduced a trap composed of 32 places in 168 ms of which 3 ms to minimize.
[2024-05-21 21:12:23] [INFO ] Deduced a trap composed of 32 places in 151 ms of which 3 ms to minimize.
[2024-05-21 21:12:23] [INFO ] Deduced a trap composed of 31 places in 148 ms of which 2 ms to minimize.
[2024-05-21 21:12:24] [INFO ] Deduced a trap composed of 32 places in 175 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 8/70 constraints. Problems are: Problem set: 0 solved, 341 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (INCLUDED_ONLY) 0/208 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 341 unsolved
SMT process timed out in 30569ms, After SMT, problems are : Problem set: 0 solved, 341 unsolved
Search for dead transitions found 0 dead transitions in 30575ms
Starting structural reductions in LTL mode, iteration 1 : 208/222 places, 342/356 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31078 ms. Remains : 208/222 places, 342/356 transitions.
[2024-05-21 21:12:30] [INFO ] Flatten gal took : 23 ms
[2024-05-21 21:12:30] [INFO ] Flatten gal took : 16 ms
[2024-05-21 21:12:30] [INFO ] Input system was already deterministic with 342 transitions.
[2024-05-21 21:12:30] [INFO ] Flatten gal took : 15 ms
[2024-05-21 21:12:30] [INFO ] Flatten gal took : 15 ms
[2024-05-21 21:12:30] [INFO ] Time to serialize gal into /tmp/CTLFireability6194972306679117894.gal : 4 ms
[2024-05-21 21:12:30] [INFO ] Time to serialize properties into /tmp/CTLFireability10847030171639148649.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/CTLFireability6194972306679117894.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10847030171639148649.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.
Detected timeout of ITS tools.
[2024-05-21 21:13:00] [INFO ] Flatten gal took : 9 ms
[2024-05-21 21:13:00] [INFO ] Applying decomposition
[2024-05-21 21:13:00] [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/graph3913518764392726356.txt' '-o' '/tmp/graph3913518764392726356.bin' '-w' '/tmp/graph3913518764392726356.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3913518764392726356.bin' '-l' '-1' '-v' '-w' '/tmp/graph3913518764392726356.weights' '-q' '0' '-e' '0.001'
[2024-05-21 21:13:00] [INFO ] Decomposing Gal with order
[2024-05-21 21:13:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 21:13:00] [INFO ] Removed a total of 444 redundant transitions.
[2024-05-21 21:13:00] [INFO ] Flatten gal took : 30 ms
[2024-05-21 21:13:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 32 labels/synchronizations in 3 ms.
[2024-05-21 21:13:00] [INFO ] Time to serialize gal into /tmp/CTLFireability15598270389449279550.gal : 3 ms
[2024-05-21 21:13:00] [INFO ] Time to serialize properties into /tmp/CTLFireability4169778330162063743.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/CTLFireability15598270389449279550.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4169778330162063743.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.92811e+10,0.192009,7228,630,102,5805,1174,490,11392,84,6353,0


Converting to forward existential form...Done !
original formula: A(EX(E((i13.u3.p12!=1) U E(((i11.i1.u58.p199==1)&&(i5.u34.p118==1)) U ((((i2.u14.p53==1)&&(i4.u23.p84==1))&&((i5.u33.p115==1)&&(i8.u42.p1...233
=> equivalent forward existential formula: [((Init * !(EG(!(EG((i6.i1.u31.p111==1)))))) * !(E(!(EG((i6.i1.u31.p111==1))) U (!(EX(E((i13.u3.p12!=1) U E(((i1...356
Reverse transition relation is NOT exact ! Due to transitions t195, t201, t221, t256, t271, t291, t339, i1.i0.t186, i1.i0.u9.t166, i1.i0.u16.t167, i2.u14.t...689
Using 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 14
Fast SCC detection found an SCC at level 15
Using 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 14
Fast SCC detection found an SCC at level 15
(forward)formula 0,0,22.7251,601756,1,0,1.27798e+06,5631,3548,1.57426e+06,464,55465,1294091
FORMULA AutonomousCar-PT-05b-CTLFireability-2023-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 222/222 places, 356/356 transitions.
Graph (trivial) has 202 edges and 222 vertex of which 4 / 222 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 87 transitions
Trivial Post-agglo rules discarded 87 transitions
Performed 87 trivial Post agglomeration. Transition count delta: 87
Iterating post reduction 0 with 87 rules applied. Total rules applied 88 place count 219 transition count 266
Reduce places removed 87 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 1 with 116 rules applied. Total rules applied 204 place count 132 transition count 237
Reduce places removed 17 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 18 rules applied. Total rules applied 222 place count 115 transition count 236
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 223 place count 114 transition count 236
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 223 place count 114 transition count 229
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 237 place count 107 transition count 229
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 244 place count 100 transition count 222
Iterating global reduction 4 with 7 rules applied. Total rules applied 251 place count 100 transition count 222
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 252 place count 99 transition count 221
Iterating global reduction 4 with 1 rules applied. Total rules applied 253 place count 99 transition count 221
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 4 with 68 rules applied. Total rules applied 321 place count 65 transition count 187
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 322 place count 65 transition count 186
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 331 place count 56 transition count 137
Iterating global reduction 5 with 9 rules applied. Total rules applied 340 place count 56 transition count 137
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 5 with 8 rules applied. Total rules applied 348 place count 56 transition count 129
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 6 with 4 rules applied. Total rules applied 352 place count 53 transition count 128
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 353 place count 52 transition count 128
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 355 place count 51 transition count 127
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 356 place count 51 transition count 126
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 358 place count 49 transition count 124
Applied a total of 358 rules in 43 ms. Remains 49 /222 variables (removed 173) and now considering 124/356 (removed 232) transitions.
// Phase 1: matrix 124 rows 49 cols
[2024-05-21 21:13:23] [INFO ] Computed 9 invariants in 2 ms
[2024-05-21 21:13:23] [INFO ] Implicit Places using invariants in 99 ms returned []
[2024-05-21 21:13:23] [INFO ] Invariant cache hit.
[2024-05-21 21:13:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 21:13:23] [INFO ] Implicit Places using invariants and state equation in 147 ms returned [43, 48]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 250 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 47/222 places, 124/356 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 47 transition count 123
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 46 transition count 123
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 46 transition count 122
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 45 transition count 122
Applied a total of 4 rules in 8 ms. Remains 45 /47 variables (removed 2) and now considering 122/124 (removed 2) transitions.
// Phase 1: matrix 122 rows 45 cols
[2024-05-21 21:13:23] [INFO ] Computed 7 invariants in 2 ms
[2024-05-21 21:13:23] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-21 21:13:23] [INFO ] Invariant cache hit.
[2024-05-21 21:13:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 21:13:23] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 45/222 places, 122/356 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 514 ms. Remains : 45/222 places, 122/356 transitions.
[2024-05-21 21:13:23] [INFO ] Flatten gal took : 7 ms
[2024-05-21 21:13:23] [INFO ] Flatten gal took : 6 ms
[2024-05-21 21:13:23] [INFO ] Input system was already deterministic with 122 transitions.
[2024-05-21 21:13:23] [INFO ] Flatten gal took : 7 ms
[2024-05-21 21:13:23] [INFO ] Flatten gal took : 6 ms
[2024-05-21 21:13:23] [INFO ] Time to serialize gal into /tmp/CTLFireability8995071537528682158.gal : 2 ms
[2024-05-21 21:13:23] [INFO ] Time to serialize properties into /tmp/CTLFireability6485161441947232503.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/CTLFireability8995071537528682158.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6485161441947232503.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,742600,2.59063,54020,2,2784,5,154337,6,0,301,146237,0


Converting to forward existential form...Done !
original formula: AG(((p151==0) + (((EF(EG((p76==1))) * (p6==1)) * ((p14==1)&&(p86==1))) * (p212==1))))
=> equivalent forward existential formula: ((([((FwdU(Init,TRUE) * !((p151==0))) * !(E(TRUE U EG((p76==1)))))] = FALSE * [((FwdU(Init,TRUE) * !((p151==0)))...316
(forward)formula 0,0,2.59635,54020,1,0,11,154337,11,4,309,146237,2
FORMULA AutonomousCar-PT-05b-CTLFireability-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 222/222 places, 356/356 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 209 transition count 343
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 209 transition count 343
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 29 place count 206 transition count 340
Iterating global reduction 0 with 3 rules applied. Total rules applied 32 place count 206 transition count 340
Applied a total of 32 rules in 8 ms. Remains 206 /222 variables (removed 16) and now considering 340/356 (removed 16) transitions.
// Phase 1: matrix 340 rows 206 cols
[2024-05-21 21:13:26] [INFO ] Computed 10 invariants in 2 ms
[2024-05-21 21:13:26] [INFO ] Implicit Places using invariants in 129 ms returned []
[2024-05-21 21:13:26] [INFO ] Invariant cache hit.
[2024-05-21 21:13:26] [INFO ] Implicit Places using invariants and state equation in 338 ms returned []
Implicit Place search using SMT with State Equation took 480 ms to find 0 implicit places.
Running 339 sub problems to find dead transitions.
[2024-05-21 21:13:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 1 (OVERLAPS) 1/206 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 339 unsolved
[2024-05-21 21:13:31] [INFO ] Deduced a trap composed of 51 places in 266 ms of which 4 ms to minimize.
[2024-05-21 21:13:32] [INFO ] Deduced a trap composed of 31 places in 230 ms of which 3 ms to minimize.
[2024-05-21 21:13:32] [INFO ] Deduced a trap composed of 17 places in 219 ms of which 4 ms to minimize.
[2024-05-21 21:13:32] [INFO ] Deduced a trap composed of 24 places in 206 ms of which 4 ms to minimize.
[2024-05-21 21:13:33] [INFO ] Deduced a trap composed of 38 places in 234 ms of which 3 ms to minimize.
[2024-05-21 21:13:33] [INFO ] Deduced a trap composed of 14 places in 221 ms of which 3 ms to minimize.
[2024-05-21 21:13:33] [INFO ] Deduced a trap composed of 23 places in 212 ms of which 3 ms to minimize.
[2024-05-21 21:13:33] [INFO ] Deduced a trap composed of 33 places in 205 ms of which 4 ms to minimize.
[2024-05-21 21:13:33] [INFO ] Deduced a trap composed of 32 places in 220 ms of which 3 ms to minimize.
[2024-05-21 21:13:34] [INFO ] Deduced a trap composed of 36 places in 206 ms of which 3 ms to minimize.
[2024-05-21 21:13:34] [INFO ] Deduced a trap composed of 29 places in 198 ms of which 3 ms to minimize.
[2024-05-21 21:13:34] [INFO ] Deduced a trap composed of 32 places in 166 ms of which 3 ms to minimize.
[2024-05-21 21:13:35] [INFO ] Deduced a trap composed of 36 places in 248 ms of which 4 ms to minimize.
[2024-05-21 21:13:35] [INFO ] Deduced a trap composed of 31 places in 193 ms of which 3 ms to minimize.
[2024-05-21 21:13:35] [INFO ] Deduced a trap composed of 43 places in 178 ms of which 3 ms to minimize.
[2024-05-21 21:13:35] [INFO ] Deduced a trap composed of 39 places in 181 ms of which 3 ms to minimize.
[2024-05-21 21:13:35] [INFO ] Deduced a trap composed of 21 places in 154 ms of which 3 ms to minimize.
[2024-05-21 21:13:35] [INFO ] Deduced a trap composed of 39 places in 148 ms of which 3 ms to minimize.
[2024-05-21 21:13:36] [INFO ] Deduced a trap composed of 32 places in 170 ms of which 3 ms to minimize.
[2024-05-21 21:13:36] [INFO ] Deduced a trap composed of 37 places in 195 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 339 unsolved
[2024-05-21 21:13:36] [INFO ] Deduced a trap composed of 20 places in 113 ms of which 3 ms to minimize.
[2024-05-21 21:13:37] [INFO ] Deduced a trap composed of 35 places in 161 ms of which 3 ms to minimize.
[2024-05-21 21:13:37] [INFO ] Deduced a trap composed of 18 places in 175 ms of which 3 ms to minimize.
[2024-05-21 21:13:37] [INFO ] Deduced a trap composed of 25 places in 198 ms of which 3 ms to minimize.
[2024-05-21 21:13:38] [INFO ] Deduced a trap composed of 33 places in 210 ms of which 3 ms to minimize.
[2024-05-21 21:13:38] [INFO ] Deduced a trap composed of 42 places in 212 ms of which 3 ms to minimize.
[2024-05-21 21:13:38] [INFO ] Deduced a trap composed of 42 places in 136 ms of which 3 ms to minimize.
[2024-05-21 21:13:38] [INFO ] Deduced a trap composed of 40 places in 135 ms of which 2 ms to minimize.
[2024-05-21 21:13:39] [INFO ] Deduced a trap composed of 56 places in 189 ms of which 3 ms to minimize.
[2024-05-21 21:13:39] [INFO ] Deduced a trap composed of 41 places in 152 ms of which 3 ms to minimize.
[2024-05-21 21:13:39] [INFO ] Deduced a trap composed of 42 places in 127 ms of which 3 ms to minimize.
[2024-05-21 21:13:39] [INFO ] Deduced a trap composed of 41 places in 135 ms of which 2 ms to minimize.
[2024-05-21 21:13:40] [INFO ] Deduced a trap composed of 20 places in 201 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 13/43 constraints. Problems are: Problem set: 0 solved, 339 unsolved
[2024-05-21 21:13:44] [INFO ] Deduced a trap composed of 39 places in 48 ms of which 1 ms to minimize.
[2024-05-21 21:13:45] [INFO ] Deduced a trap composed of 56 places in 201 ms of which 3 ms to minimize.
[2024-05-21 21:13:46] [INFO ] Deduced a trap composed of 32 places in 207 ms of which 3 ms to minimize.
[2024-05-21 21:13:46] [INFO ] Deduced a trap composed of 36 places in 201 ms of which 3 ms to minimize.
[2024-05-21 21:13:46] [INFO ] Deduced a trap composed of 40 places in 129 ms of which 2 ms to minimize.
[2024-05-21 21:13:46] [INFO ] Deduced a trap composed of 39 places in 115 ms of which 3 ms to minimize.
[2024-05-21 21:13:46] [INFO ] Deduced a trap composed of 39 places in 182 ms of which 3 ms to minimize.
[2024-05-21 21:13:47] [INFO ] Deduced a trap composed of 38 places in 180 ms of which 3 ms to minimize.
[2024-05-21 21:13:47] [INFO ] Deduced a trap composed of 14 places in 195 ms of which 3 ms to minimize.
[2024-05-21 21:13:47] [INFO ] Deduced a trap composed of 53 places in 189 ms of which 4 ms to minimize.
[2024-05-21 21:13:48] [INFO ] Deduced a trap composed of 31 places in 192 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 11/54 constraints. Problems are: Problem set: 0 solved, 339 unsolved
[2024-05-21 21:13:51] [INFO ] Deduced a trap composed of 40 places in 100 ms of which 2 ms to minimize.
[2024-05-21 21:13:51] [INFO ] Deduced a trap composed of 42 places in 93 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/206 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 339 unsolved
[2024-05-21 21:13:54] [INFO ] Deduced a trap composed of 41 places in 126 ms of which 2 ms to minimize.
[2024-05-21 21:13:54] [INFO ] Deduced a trap composed of 42 places in 101 ms of which 2 ms to minimize.
[2024-05-21 21:13:54] [INFO ] Deduced a trap composed of 42 places in 63 ms of which 1 ms to minimize.
[2024-05-21 21:13:55] [INFO ] Deduced a trap composed of 39 places in 79 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/206 variables, 4/60 constraints. Problems are: Problem set: 0 solved, 339 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 206/546 variables, and 60 constraints, problems are : Problem set: 0 solved, 339 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/206 constraints, PredecessorRefiner: 339/339 constraints, Known Traps: 50/50 constraints]
Escalating to Integer solving :Problem set: 0 solved, 339 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 1 (OVERLAPS) 1/206 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 50/60 constraints. Problems are: Problem set: 0 solved, 339 unsolved
[2024-05-21 21:14:00] [INFO ] Deduced a trap composed of 49 places in 237 ms of which 3 ms to minimize.
[2024-05-21 21:14:01] [INFO ] Deduced a trap composed of 37 places in 192 ms of which 3 ms to minimize.
[2024-05-21 21:14:02] [INFO ] Deduced a trap composed of 36 places in 225 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 3/63 constraints. Problems are: Problem set: 0 solved, 339 unsolved
[2024-05-21 21:14:04] [INFO ] Deduced a trap composed of 23 places in 204 ms of which 3 ms to minimize.
[2024-05-21 21:14:05] [INFO ] Deduced a trap composed of 31 places in 145 ms of which 2 ms to minimize.
[2024-05-21 21:14:05] [INFO ] Deduced a trap composed of 31 places in 137 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 3/66 constraints. Problems are: Problem set: 0 solved, 339 unsolved
[2024-05-21 21:14:09] [INFO ] Deduced a trap composed of 38 places in 104 ms of which 2 ms to minimize.
[2024-05-21 21:14:09] [INFO ] Deduced a trap composed of 51 places in 104 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/206 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 339 unsolved
[2024-05-21 21:14:12] [INFO ] Deduced a trap composed of 51 places in 129 ms of which 3 ms to minimize.
[2024-05-21 21:14:12] [INFO ] Deduced a trap composed of 51 places in 99 ms of which 2 ms to minimize.
[2024-05-21 21:14:13] [INFO ] Deduced a trap composed of 51 places in 115 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/206 variables, 3/71 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/206 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 8 (OVERLAPS) 340/546 variables, 206/277 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/546 variables, 339/616 constraints. Problems are: Problem set: 0 solved, 339 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 546/546 variables, and 616 constraints, problems are : Problem set: 0 solved, 339 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 206/206 constraints, PredecessorRefiner: 339/339 constraints, Known Traps: 61/61 constraints]
After SMT, in 60433ms problems are : Problem set: 0 solved, 339 unsolved
Search for dead transitions found 0 dead transitions in 60437ms
Starting structural reductions in LTL mode, iteration 1 : 206/222 places, 340/356 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60926 ms. Remains : 206/222 places, 340/356 transitions.
[2024-05-21 21:14:27] [INFO ] Flatten gal took : 15 ms
[2024-05-21 21:14:27] [INFO ] Flatten gal took : 15 ms
[2024-05-21 21:14:27] [INFO ] Input system was already deterministic with 340 transitions.
[2024-05-21 21:14:27] [INFO ] Flatten gal took : 15 ms
[2024-05-21 21:14:27] [INFO ] Flatten gal took : 15 ms
[2024-05-21 21:14:27] [INFO ] Time to serialize gal into /tmp/CTLFireability15510876489471923147.gal : 4 ms
[2024-05-21 21:14:27] [INFO ] Time to serialize properties into /tmp/CTLFireability12791025140373431455.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/CTLFireability15510876489471923147.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12791025140373431455.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.
Detected timeout of ITS tools.
[2024-05-21 21:14:57] [INFO ] Flatten gal took : 10 ms
[2024-05-21 21:14:57] [INFO ] Applying decomposition
[2024-05-21 21:14:57] [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/graph1070663876045034252.txt' '-o' '/tmp/graph1070663876045034252.bin' '-w' '/tmp/graph1070663876045034252.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1070663876045034252.bin' '-l' '-1' '-v' '-w' '/tmp/graph1070663876045034252.weights' '-q' '0' '-e' '0.001'
[2024-05-21 21:14:57] [INFO ] Decomposing Gal with order
[2024-05-21 21:14:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 21:14:57] [INFO ] Removed a total of 456 redundant transitions.
[2024-05-21 21:14:57] [INFO ] Flatten gal took : 22 ms
[2024-05-21 21:14:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 22 labels/synchronizations in 3 ms.
[2024-05-21 21:14:57] [INFO ] Time to serialize gal into /tmp/CTLFireability4566165991202627224.gal : 3 ms
[2024-05-21 21:14:57] [INFO ] Time to serialize properties into /tmp/CTLFireability973926318129657588.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/CTLFireability4566165991202627224.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability973926318129657588.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,3.84316e+10,0.208635,9692,1063,105,13317,1026,490,13731,84,3092,0


Converting to forward existential form...Done !
original formula: (AF(((((i2.u13.p53==1)&&(i7.u23.p84==1))&&((i6.u33.p115==1)&&(i8.i1.u44.p152==1)))&&((i10.u51.p177==1)&&(i13.u60.p213==1)))) * AX((i5.i1....169
=> equivalent forward existential formula: ([FwdG(Init,!(((((i2.u13.p53==1)&&(i7.u23.p84==1))&&((i6.u33.p115==1)&&(i8.i1.u44.p152==1)))&&((i10.u51.p177==1)...236
Using 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 14
Fast SCC detection found an SCC at level 15
(forward)formula 0,0,19.3738,593856,1,0,1.56667e+06,4103,2293,1.09251e+06,376,30925,2216528
FORMULA AutonomousCar-PT-05b-CTLFireability-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-21 21:15:17] [INFO ] Flatten gal took : 10 ms
[2024-05-21 21:15:17] [INFO ] Flatten gal took : 9 ms
[2024-05-21 21:15:17] [INFO ] Applying decomposition
[2024-05-21 21:15:17] [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/graph16306197056955655721.txt' '-o' '/tmp/graph16306197056955655721.bin' '-w' '/tmp/graph16306197056955655721.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16306197056955655721.bin' '-l' '-1' '-v' '-w' '/tmp/graph16306197056955655721.weights' '-q' '0' '-e' '0.001'
[2024-05-21 21:15:17] [INFO ] Decomposing Gal with order
[2024-05-21 21:15:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 21:15:17] [INFO ] Removed a total of 461 redundant transitions.
[2024-05-21 21:15:17] [INFO ] Flatten gal took : 21 ms
[2024-05-21 21:15:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 22 labels/synchronizations in 3 ms.
[2024-05-21 21:15:17] [INFO ] Time to serialize gal into /tmp/CTLFireability4883688184741233652.gal : 17 ms
[2024-05-21 21:15:17] [INFO ] Time to serialize properties into /tmp/CTLFireability16428642908759774528.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/CTLFireability4883688184741233652.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16428642908759774528.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 2 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.08056e+10,0.119729,7004,604,110,6236,594,568,7780,82,1975,0


Converting to forward existential form...Done !
original formula: (EG(AF((i12.i0.u73.p206==0))) + (!(E(AX(((i5.i1.u37.p111==1)||(((i0.u2.p6==1)&&(i0.u2.p17==1))&&((i1.i0.u10.p36==1)&&(i0.u2.p212==1))))) ...553
=> equivalent forward existential formula: ([(FwdU((Init * !(EG(!(EG(!((i12.i0.u73.p206==0))))))),!(EX(!(((i5.i1.u37.p111==1)||(((i0.u2.p6==1)&&(i0.u2.p17=...695
Reverse transition relation is NOT exact ! Due to transitions t209, t214, t234, t269, t309, i0.t206, i0.u2.t210, i1.i1.t199, i1.i1.u9.t179, i1.i1.u17.t180,...760
Using 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 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
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 14
Fast SCC detection found an SCC at level 15
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 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
(forward)formula 0,1,17.3922,467684,1,0,975175,3882,4298,1.20512e+06,462,24188,980606
FORMULA AutonomousCar-PT-05b-CTLFireability-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: E((i3.i0.u20.p66==1) U A((((i0.u2.p6==1)&&(i0.u2.p16==1))&&((i3.i1.u28.p86==1)&&(i0.u2.p212==1))) U ((EF((((i0.u2.p6==1)&&(i0.u2.p17==1))...348
=> equivalent forward existential formula: [((FwdU(Init,(i3.i0.u20.p66==1)) * !(EG(!(((E(TRUE U (((i0.u2.p6==1)&&(i0.u2.p17==1))&&((i6.u38.p117==1)&&(i0.u2...900
Using saturation style SCC detection
Using saturation style SCC detection
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 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
(forward)formula 1,1,42.9807,1058364,1,0,2.05057e+06,5104,4352,2.6968e+06,467,36871,1909412
FORMULA AutonomousCar-PT-05b-CTLFireability-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Total runtime 1268732 ms.

BK_STOP 1716326160469

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

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