About the Execution of ITS-Tools for AutonomousCar-PT-01b
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
0.000 | 286212.00 | 0.00 | 0.00 | TTTFTFTTTTTTFFTF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r002-tall-174853729600610.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is AutonomousCar-PT-01b, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r002-tall-174853729600610
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 436K
-rw-r--r-- 1 mcc users 6.6K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.9K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 93K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 31K May 29 14:32 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME AutonomousCar-PT-01b-CTLFireability-2023-12
FORMULA_NAME AutonomousCar-PT-01b-CTLFireability-2023-13
FORMULA_NAME AutonomousCar-PT-01b-CTLFireability-2023-14
FORMULA_NAME AutonomousCar-PT-01b-CTLFireability-2023-15
FORMULA_NAME AutonomousCar-PT-01b-CTLFireability-2025-00
FORMULA_NAME AutonomousCar-PT-01b-CTLFireability-2025-01
FORMULA_NAME AutonomousCar-PT-01b-CTLFireability-2025-02
FORMULA_NAME AutonomousCar-PT-01b-CTLFireability-2025-03
FORMULA_NAME AutonomousCar-PT-01b-CTLFireability-2025-04
FORMULA_NAME AutonomousCar-PT-01b-CTLFireability-2025-05
FORMULA_NAME AutonomousCar-PT-01b-CTLFireability-2025-06
FORMULA_NAME AutonomousCar-PT-01b-CTLFireability-2025-07
FORMULA_NAME AutonomousCar-PT-01b-CTLFireability-2025-08
FORMULA_NAME AutonomousCar-PT-01b-CTLFireability-2025-09
FORMULA_NAME AutonomousCar-PT-01b-CTLFireability-2025-10
FORMULA_NAME AutonomousCar-PT-01b-CTLFireability-2025-11
=== Now, execution of the tool begins
BK_START 1748646775023
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-01b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202505121319
[2025-05-30 23:12:56] [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]
[2025-05-30 23:12:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 23:12:56] [INFO ] Load time of PNML (sax parser for PT used): 51 ms
[2025-05-30 23:12:56] [INFO ] Transformed 119 places.
[2025-05-30 23:12:56] [INFO ] Transformed 132 transitions.
[2025-05-30 23:12:56] [INFO ] Found NUPN structural information;
[2025-05-30 23:12:56] [INFO ] Parsed PT model containing 119 places and 132 transitions and 339 arcs in 149 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 14 ms.
Support contains 74 out of 119 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 119/119 places, 132/132 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 116 transition count 129
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 116 transition count 129
Applied a total of 6 rules in 21 ms. Remains 116 /119 variables (removed 3) and now considering 129/132 (removed 3) transitions.
// Phase 1: matrix 129 rows 116 cols
[2025-05-30 23:12:57] [INFO ] Computed 6 invariants in 13 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 23:12:57] [INFO ] Implicit Places using invariants in 238 ms returned []
[2025-05-30 23:12:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 23:12:57] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 399 ms to find 0 implicit places.
Running 128 sub problems to find dead transitions.
[2025-05-30 23:12:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (OVERLAPS) 1/116 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 128 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:12:58] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:12:58] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:12:58] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:12:58] [INFO ] Deduced a trap composed of 47 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:12:58] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:12:59] [INFO ] Deduced a trap composed of 20 places in 105 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:12:59] [INFO ] Deduced a trap composed of 31 places in 57 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:12:59] [INFO ] Deduced a trap composed of 21 places in 76 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:12:59] [INFO ] Deduced a trap composed of 17 places in 92 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:12:59] [INFO ] Deduced a trap composed of 25 places in 79 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:12:59] [INFO ] Deduced a trap composed of 34 places in 69 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:12:59] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:12:59] [INFO ] Deduced a trap composed of 30 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:12:59] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:12:59] [INFO ] Deduced a trap composed of 6 places in 58 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:12:59] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:13:00] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:13:00] [INFO ] Deduced a trap composed of 25 places in 120 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:13:00] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:13:00] [INFO ] Deduced a trap composed of 8 places in 84 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 20/26 constraints. Problems are: Problem set: 0 solved, 128 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:13:00] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:13:00] [INFO ] Deduced a trap composed of 34 places in 45 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:13:00] [INFO ] Deduced a trap composed of 24 places in 77 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:13:00] [INFO ] Deduced a trap composed of 37 places in 81 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:13:00] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:13:00] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 6/32 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 128 unsolved
Problem TDEAD10 is UNSAT
Problem TDEAD120 is UNSAT
At refinement iteration 5 (OVERLAPS) 129/245 variables, 116/148 constraints. Problems are: Problem set: 2 solved, 126 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:13:02] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:13:02] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/245 variables, 2/150 constraints. Problems are: Problem set: 2 solved, 126 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:13:03] [INFO ] Deduced a trap along path composed of 3 places in 34 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:13:04] [INFO ] Deduced a trap along path composed of 4 places in 51 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/245 variables, 2/152 constraints. Problems are: Problem set: 2 solved, 126 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/245 variables, 0/152 constraints. Problems are: Problem set: 2 solved, 126 unsolved
At refinement iteration 9 (OVERLAPS) 0/245 variables, 0/152 constraints. Problems are: Problem set: 2 solved, 126 unsolved
No progress, stopping.
After SMT solving in domain Real declared 245/245 variables, and 152 constraints, problems are : Problem set: 2 solved, 126 unsolved in 9641 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 116/116 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 28/28 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 2 solved, 126 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 126 unsolved
At refinement iteration 1 (OVERLAPS) 2/116 variables, 6/6 constraints. Problems are: Problem set: 2 solved, 126 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 28/34 constraints. Problems are: Problem set: 2 solved, 126 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:13:07] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 1/35 constraints. Problems are: Problem set: 2 solved, 126 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 0/35 constraints. Problems are: Problem set: 2 solved, 126 unsolved
At refinement iteration 5 (OVERLAPS) 129/245 variables, 116/151 constraints. Problems are: Problem set: 2 solved, 126 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/245 variables, 126/277 constraints. Problems are: Problem set: 2 solved, 126 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/245 variables, 2/279 constraints. Problems are: Problem set: 2 solved, 126 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:13:10] [INFO ] Deduced a trap along path composed of 2 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:13:10] [INFO ] Deduced a trap along path composed of 2 places in 20 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/245 variables, 2/281 constraints. Problems are: Problem set: 2 solved, 126 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/245 variables, 0/281 constraints. Problems are: Problem set: 2 solved, 126 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:13:17] [INFO ] Deduced a trap composed of 30 places in 54 ms of which 5 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/245 variables, 1/282 constraints. Problems are: Problem set: 2 solved, 126 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:13:23] [INFO ] Deduced a trap along path composed of 3 places in 27 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/245 variables, 1/283 constraints. Problems are: Problem set: 2 solved, 126 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/245 variables, 0/283 constraints. Problems are: Problem set: 2 solved, 126 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 245/245 variables, and 283 constraints, problems are : Problem set: 2 solved, 126 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 116/116 constraints, PredecessorRefiner: 126/128 constraints, Known Traps: 30/30 constraints, Known Traps Along Path: 5/5 constraints]
After SMT, in 39761ms problems are : Problem set: 2 solved, 126 unsolved
Search for dead transitions found 2 dead transitions in 39771ms
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 : 116/119 places, 127/132 transitions.
Deduced a syphon composed of 1 places in 1 ms
Applied a total of 0 rules in 2 ms. Remains 116 /116 variables (removed 0) and now considering 127/127 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 40211 ms. Remains : 116/119 places, 127/132 transitions.
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Support contains 73 out of 115 places after structural reductions.
[2025-05-30 23:13:37] [INFO ] Flatten gal took : 28 ms
[2025-05-30 23:13:37] [INFO ] Flatten gal took : 11 ms
[2025-05-30 23:13:37] [INFO ] Input system was already deterministic with 127 transitions.
RANDOM walk for 40000 steps (17 resets) in 1502 ms. (26 steps per ms) remains 9/64 properties
BEST_FIRST walk for 40000 steps (12 resets) in 329 ms. (121 steps per ms) remains 6/9 properties
BEST_FIRST walk for 40000 steps (12 resets) in 151 ms. (263 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (14 resets) in 168 ms. (236 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (15 resets) in 125 ms. (317 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (14 resets) in 93 ms. (425 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (13 resets) in 175 ms. (227 steps per ms) remains 5/6 properties
// Phase 1: matrix 127 rows 115 cols
[2025-05-30 23:13:38] [INFO ] Computed 6 invariants in 2 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp39 is UNSAT
At refinement iteration 1 (OVERLAPS) 93/102 variables, 4/4 constraints. Problems are: Problem set: 2 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:13:38] [INFO ] Deduced a trap composed of 33 places in 39 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:13:38] [INFO ] Deduced a trap composed of 37 places in 31 ms of which 3 ms to minimize.
Problem AtomicPropp31 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 2/6 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 0/6 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 13/115 variables, 2/8 constraints. Problems are: Problem set: 3 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:13:38] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:13:38] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:13:38] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:13:38] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/115 variables, 4/12 constraints. Problems are: Problem set: 3 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:13:38] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/115 variables, 1/13 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/115 variables, 0/13 constraints. Problems are: Problem set: 3 solved, 2 unsolved
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp41 is UNSAT
After SMT solving in domain Real declared 242/242 variables, and 128 constraints, problems are : Problem set: 5 solved, 0 unsolved in 430 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 115/115 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 441ms problems are : Problem set: 5 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 5 atomic propositions for a total of 16 simplifications.
[2025-05-30 23:13:38] [INFO ] Flatten gal took : 9 ms
[2025-05-30 23:13:38] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA AutonomousCar-PT-01b-CTLFireability-2025-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-05-30 23:13:38] [INFO ] Flatten gal took : 6 ms
[2025-05-30 23:13:38] [INFO ] Input system was already deterministic with 127 transitions.
Support contains 67 out of 115 places (down from 69) after GAL structural reductions.
Computed a total of 29 stabilizing places and 29 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 127/127 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 99 transition count 111
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 99 transition count 111
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 36 place count 99 transition count 107
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 40 place count 95 transition count 103
Iterating global reduction 1 with 4 rules applied. Total rules applied 44 place count 95 transition count 103
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 45 place count 94 transition count 102
Iterating global reduction 1 with 1 rules applied. Total rules applied 46 place count 94 transition count 102
Applied a total of 46 rules in 17 ms. Remains 94 /115 variables (removed 21) and now considering 102/127 (removed 25) transitions.
// Phase 1: matrix 102 rows 94 cols
[2025-05-30 23:13:38] [INFO ] Computed 6 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 23:13:38] [INFO ] Implicit Places using invariants in 34 ms returned []
[2025-05-30 23:13:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 23:13:38] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
Running 101 sub problems to find dead transitions.
[2025-05-30 23:13:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (OVERLAPS) 1/94 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 101 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:13:39] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:13:39] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:13:39] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:13:39] [INFO ] Deduced a trap composed of 27 places in 40 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:13:39] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:13:39] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:13:39] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:13:39] [INFO ] Deduced a trap composed of 31 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:13:40] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:13:40] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:13:40] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:13:40] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:13:40] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 13/19 constraints. Problems are: Problem set: 0 solved, 101 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:13:40] [INFO ] Deduced a trap composed of 39 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:13:40] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:13:40] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (OVERLAPS) 102/196 variables, 94/116 constraints. Problems are: Problem set: 0 solved, 101 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:13:41] [INFO ] Deduced a trap along path composed of 3 places in 23 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/196 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 8 (OVERLAPS) 0/196 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Real declared 196/196 variables, and 117 constraints, problems are : Problem set: 0 solved, 101 unsolved in 4649 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 94/94 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 101 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (OVERLAPS) 1/94 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 16/22 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (OVERLAPS) 102/196 variables, 94/116 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 101/217 constraints. Problems are: Problem set: 0 solved, 101 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:13:44] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:13:44] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:13:44] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 3/220 constraints. Problems are: Problem set: 0 solved, 101 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:13:44] [INFO ] Deduced a trap composed of 27 places in 32 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/196 variables, 1/221 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/196 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 101 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:13:46] [INFO ] Deduced a trap along path composed of 3 places in 38 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:13:46] [INFO ] Deduced a trap along path composed of 2 places in 19 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:13:46] [INFO ] Deduced a trap along path composed of 2 places in 23 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:13:46] [INFO ] Deduced a trap along path composed of 10 places in 33 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/196 variables, 4/226 constraints. Problems are: Problem set: 0 solved, 101 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:13:49] [INFO ] Deduced a trap along path composed of 7 places in 30 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/196 variables, 1/227 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/196 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 12 (OVERLAPS) 0/196 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Int declared 196/196 variables, and 227 constraints, problems are : Problem set: 0 solved, 101 unsolved in 16660 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 94/94 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 6/6 constraints]
After SMT, in 21317ms problems are : Problem set: 0 solved, 101 unsolved
Search for dead transitions found 0 dead transitions in 21318ms
Starting structural reductions in LTL mode, iteration 1 : 94/115 places, 102/127 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21435 ms. Remains : 94/115 places, 102/127 transitions.
[2025-05-30 23:14:00] [INFO ] Flatten gal took : 9 ms
[2025-05-30 23:14:00] [INFO ] Flatten gal took : 5 ms
[2025-05-30 23:14:00] [INFO ] Input system was already deterministic with 102 transitions.
[2025-05-30 23:14:00] [INFO ] Flatten gal took : 5 ms
[2025-05-30 23:14:00] [INFO ] Flatten gal took : 4 ms
[2025-05-30 23:14:00] [INFO ] Time to serialize gal into /tmp/CTLFireability596719982043080062.gal : 3 ms
[2025-05-30 23:14:00] [INFO ] Time to serialize properties into /tmp/CTLFireability13412272124929815025.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability596719982043080062.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13412272124929815025.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,65988,0.04514,4880,2,1074,5,4446,6,0,480,3733,0
Converting to forward existential form...Done !
original formula: EF(EX(E((p34==1) U !(EF((p90==1))))))
=> equivalent forward existential formula: [(FwdU(EY(FwdU(Init,TRUE)),(p34==1)) * !(E(TRUE U (p90==1))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t10, t16, t17, t24, t32, t35, t36, t37, t57, t58, t61, t62, t64, t77, t84, t86, t91, t99, In...251
Hit Full ! (commute/partial/dont) 98/0/4
(forward)formula 0,1,0.491571,25048,1,0,203,124809,232,115,2936,88956,261
FORMULA AutonomousCar-PT-01b-CTLFireability-2025-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 127/127 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 100 transition count 112
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 100 transition count 112
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 33 place count 97 transition count 109
Iterating global reduction 0 with 3 rules applied. Total rules applied 36 place count 97 transition count 109
Applied a total of 36 rules in 13 ms. Remains 97 /115 variables (removed 18) and now considering 109/127 (removed 18) transitions.
// Phase 1: matrix 109 rows 97 cols
[2025-05-30 23:14:00] [INFO ] Computed 6 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 23:14:00] [INFO ] Implicit Places using invariants in 39 ms returned []
[2025-05-30 23:14:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 23:14:00] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
Running 108 sub problems to find dead transitions.
[2025-05-30 23:14:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (OVERLAPS) 1/97 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 108 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:14:01] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:14:01] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:14:01] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:14:01] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:14:01] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:14:01] [INFO ] Deduced a trap composed of 33 places in 42 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:14:01] [INFO ] Deduced a trap composed of 31 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:14:01] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:14:02] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:14:02] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:14:02] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:14:02] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:14:02] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:14:02] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:14:02] [INFO ] Deduced a trap composed of 29 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:14:02] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:14:02] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 17/23 constraints. Problems are: Problem set: 0 solved, 108 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:14:02] [INFO ] Deduced a trap composed of 41 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:14:02] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (OVERLAPS) 109/206 variables, 97/122 constraints. Problems are: Problem set: 0 solved, 108 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:14:03] [INFO ] Deduced a trap along path composed of 3 places in 24 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/206 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/206 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (OVERLAPS) 0/206 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 206/206 variables, and 123 constraints, problems are : Problem set: 0 solved, 108 unsolved in 5125 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 97/97 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (OVERLAPS) 1/97 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 19/25 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 109/206 variables, 97/122 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/206 variables, 108/230 constraints. Problems are: Problem set: 0 solved, 108 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:14:06] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:14:06] [INFO ] Deduced a trap composed of 27 places in 30 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/206 variables, 2/232 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/206 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 108 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:14:09] [INFO ] Deduced a trap along path composed of 2 places in 35 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:14:09] [INFO ] Deduced a trap along path composed of 10 places in 30 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/206 variables, 2/235 constraints. Problems are: Problem set: 0 solved, 108 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:14:11] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/206 variables, 1/236 constraints. Problems are: Problem set: 0 solved, 108 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:14:13] [INFO ] Deduced a trap along path composed of 2 places in 24 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:14:13] [INFO ] Deduced a trap along path composed of 7 places in 29 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:14:14] [INFO ] Deduced a trap along path composed of 3 places in 21 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/206 variables, 3/239 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/206 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 12 (OVERLAPS) 0/206 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 206/206 variables, and 239 constraints, problems are : Problem set: 0 solved, 108 unsolved in 19480 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 97/97 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 6/6 constraints]
After SMT, in 24616ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 24617ms
Starting structural reductions in LTL mode, iteration 1 : 97/115 places, 109/127 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24744 ms. Remains : 97/115 places, 109/127 transitions.
[2025-05-30 23:14:25] [INFO ] Flatten gal took : 6 ms
[2025-05-30 23:14:25] [INFO ] Flatten gal took : 5 ms
[2025-05-30 23:14:25] [INFO ] Input system was already deterministic with 109 transitions.
[2025-05-30 23:14:25] [INFO ] Flatten gal took : 5 ms
[2025-05-30 23:14:25] [INFO ] Flatten gal took : 5 ms
[2025-05-30 23:14:25] [INFO ] Time to serialize gal into /tmp/CTLFireability3940501357500069938.gal : 1 ms
[2025-05-30 23:14:25] [INFO ] Time to serialize properties into /tmp/CTLFireability263826893406359799.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3940501357500069938.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability263826893406359799.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,74682,0.033191,5080,2,1122,5,4557,6,0,499,3886,0
Converting to forward existential form...Done !
original formula: (A(EF((!(EX((p4==1))) + (p40==1))) U AX(((((p60==1)&&(p81==1))&&(!((p88==1)&&(p112==1)))) + AF((p99==1))))) * EF((p107==1)))
=> equivalent forward existential formula: [(FwdU((Init * !((E(!(!(EX(!(((((p60==1)&&(p81==1))&&(!((p88==1)&&(p112==1)))) + !(EG(!((p99==1))))))))) U (!(E(...403
Reverse transition relation is NOT exact ! Due to transitions t10, t16, t17, t25, t33, t36, t37, t38, t58, t59, t62, t63, t65, t78, t85, t87, t88, t96, t97...262
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,3.5682,135812,1,0,958,885737,256,509,3209,765356,1176
FORMULA AutonomousCar-PT-01b-CTLFireability-2025-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 127/127 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 102 transition count 114
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 102 transition count 114
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 30 place count 102 transition count 110
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 32 place count 100 transition count 108
Iterating global reduction 1 with 2 rules applied. Total rules applied 34 place count 100 transition count 108
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 35 place count 99 transition count 107
Iterating global reduction 1 with 1 rules applied. Total rules applied 36 place count 99 transition count 107
Applied a total of 36 rules in 6 ms. Remains 99 /115 variables (removed 16) and now considering 107/127 (removed 20) transitions.
// Phase 1: matrix 107 rows 99 cols
[2025-05-30 23:14:29] [INFO ] Computed 6 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 23:14:29] [INFO ] Implicit Places using invariants in 47 ms returned []
[2025-05-30 23:14:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 23:14:29] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
Running 106 sub problems to find dead transitions.
[2025-05-30 23:14:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 106 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:14:29] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:14:29] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:14:30] [INFO ] Deduced a trap composed of 41 places in 33 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:14:30] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:14:30] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:14:30] [INFO ] Deduced a trap composed of 31 places in 44 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:14:30] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:14:30] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:14:30] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:14:30] [INFO ] Deduced a trap composed of 31 places in 39 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:14:30] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:14:30] [INFO ] Deduced a trap composed of 31 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:14:30] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:14:30] [INFO ] Deduced a trap composed of 34 places in 42 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:14:30] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:14:30] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:14:30] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 17/23 constraints. Problems are: Problem set: 0 solved, 106 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:14:31] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 106 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:14:31] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/99 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (OVERLAPS) 107/206 variables, 99/124 constraints. Problems are: Problem set: 0 solved, 106 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:14:32] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/206 variables, 1/125 constraints. Problems are: Problem set: 0 solved, 106 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:14:33] [INFO ] Deduced a trap along path composed of 3 places in 20 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/206 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/206 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 10 (OVERLAPS) 0/206 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Real declared 206/206 variables, and 126 constraints, problems are : Problem set: 0 solved, 106 unsolved in 5905 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 99/99 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 106 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 20/26 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (OVERLAPS) 107/206 variables, 99/125 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/206 variables, 106/231 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/206 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 106 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:14:36] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/206 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 106 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:14:37] [INFO ] Deduced a trap along path composed of 3 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:14:38] [INFO ] Deduced a trap along path composed of 2 places in 23 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:14:38] [INFO ] Deduced a trap along path composed of 2 places in 18 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:14:38] [INFO ] Deduced a trap along path composed of 10 places in 30 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/206 variables, 4/237 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/206 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 10 (OVERLAPS) 0/206 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Int declared 206/206 variables, and 237 constraints, problems are : Problem set: 0 solved, 106 unsolved in 9880 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 99/99 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 5/5 constraints]
After SMT, in 15793ms problems are : Problem set: 0 solved, 106 unsolved
Search for dead transitions found 0 dead transitions in 15794ms
Starting structural reductions in LTL mode, iteration 1 : 99/115 places, 107/127 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15918 ms. Remains : 99/115 places, 107/127 transitions.
[2025-05-30 23:14:45] [INFO ] Flatten gal took : 13 ms
[2025-05-30 23:14:45] [INFO ] Flatten gal took : 4 ms
[2025-05-30 23:14:45] [INFO ] Input system was already deterministic with 107 transitions.
[2025-05-30 23:14:45] [INFO ] Flatten gal took : 5 ms
[2025-05-30 23:14:45] [INFO ] Flatten gal took : 8 ms
[2025-05-30 23:14:45] [INFO ] Time to serialize gal into /tmp/CTLFireability2317773523521601041.gal : 1 ms
[2025-05-30 23:14:45] [INFO ] Time to serialize properties into /tmp/CTLFireability5650973726212298689.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2317773523521601041.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5650973726212298689.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,70356,0.04091,5068,2,1152,5,4840,6,0,505,3791,0
Converting to forward existential form...Done !
original formula: (EF(AG(AX(AX((p82==0))))) + (AF((p90==1)) * EX(E(((A((p91==1) U (p48==1)) * (p106==1)) * ((p52!=1)&&(p78!=1))) U (A((p40==1) U (p52==1)) ...174
=> equivalent forward existential formula: ([FwdG((Init * !(E(TRUE U !(E(TRUE U !(!(EX(!(!(EX(!((p82==0))))))))))))),!((p90==1)))] = FALSE * [((Init * !(E(...432
Reverse transition relation is NOT exact ! Due to transitions t10, t16, t17, t24, t34, t40, t55, t61, t62, t65, t66, t68, t81, t88, t90, t95, Intersection...241
(forward)formula 0,1,4.70186,164000,1,0,1700,1.11688e+06,277,812,2984,996203,2013
FORMULA AutonomousCar-PT-01b-CTLFireability-2025-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 127/127 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 102 transition count 114
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 102 transition count 114
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 30 place count 102 transition count 110
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 33 place count 99 transition count 107
Iterating global reduction 1 with 3 rules applied. Total rules applied 36 place count 99 transition count 107
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 37 place count 98 transition count 106
Iterating global reduction 1 with 1 rules applied. Total rules applied 38 place count 98 transition count 106
Applied a total of 38 rules in 13 ms. Remains 98 /115 variables (removed 17) and now considering 106/127 (removed 21) transitions.
// Phase 1: matrix 106 rows 98 cols
[2025-05-30 23:14:49] [INFO ] Computed 6 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 23:14:49] [INFO ] Implicit Places using invariants in 38 ms returned []
[2025-05-30 23:14:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 23:14:50] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
Running 105 sub problems to find dead transitions.
[2025-05-30 23:14:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 105 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:14:50] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:14:50] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:14:50] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:14:50] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:14:50] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:14:50] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:14:50] [INFO ] Deduced a trap composed of 31 places in 32 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:14:50] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:14:51] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:14:51] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:14:51] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:14:51] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:14:51] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:14:51] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:14:51] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 15/21 constraints. Problems are: Problem set: 0 solved, 105 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:14:51] [INFO ] Deduced a trap composed of 39 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:14:51] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:14:51] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 3/24 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (OVERLAPS) 106/204 variables, 98/122 constraints. Problems are: Problem set: 0 solved, 105 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:14:53] [INFO ] Deduced a trap along path composed of 3 places in 21 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:14:53] [INFO ] Deduced a trap along path composed of 2 places in 22 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/204 variables, 2/124 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/204 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 8 (OVERLAPS) 0/204 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Real declared 204/204 variables, and 124 constraints, problems are : Problem set: 0 solved, 105 unsolved in 5086 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 98/98 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 105 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 18/24 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (OVERLAPS) 106/204 variables, 98/122 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/204 variables, 105/227 constraints. Problems are: Problem set: 0 solved, 105 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:14:55] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/204 variables, 1/228 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/204 variables, 2/230 constraints. Problems are: Problem set: 0 solved, 105 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:14:58] [INFO ] Deduced a trap along path composed of 7 places in 25 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/204 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 105 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:15:01] [INFO ] Deduced a trap along path composed of 2 places in 18 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:15:01] [INFO ] Deduced a trap along path composed of 2 places in 17 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/204 variables, 2/233 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/204 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 11 (OVERLAPS) 0/204 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Int declared 204/204 variables, and 233 constraints, problems are : Problem set: 0 solved, 105 unsolved in 19417 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 98/98 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 5/5 constraints]
After SMT, in 24514ms problems are : Problem set: 0 solved, 105 unsolved
Search for dead transitions found 0 dead transitions in 24515ms
Starting structural reductions in LTL mode, iteration 1 : 98/115 places, 106/127 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24650 ms. Remains : 98/115 places, 106/127 transitions.
[2025-05-30 23:15:14] [INFO ] Flatten gal took : 4 ms
[2025-05-30 23:15:14] [INFO ] Flatten gal took : 4 ms
[2025-05-30 23:15:14] [INFO ] Input system was already deterministic with 106 transitions.
[2025-05-30 23:15:14] [INFO ] Flatten gal took : 4 ms
[2025-05-30 23:15:14] [INFO ] Flatten gal took : 4 ms
[2025-05-30 23:15:14] [INFO ] Time to serialize gal into /tmp/CTLFireability2025721205101739101.gal : 1 ms
[2025-05-30 23:15:14] [INFO ] Time to serialize properties into /tmp/CTLFireability107871034799352929.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2025721205101739101.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability107871034799352929.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,76768,0.035597,5060,2,1105,5,4798,6,0,500,3676,0
Converting to forward existential form...Done !
original formula: !(A(AF((EX(AX((p34==1))) * AF(((p19==1)||(p111==1))))) U ((AF((EF((p61==1)) * AG((p41==1)))) + (((p113!=1) + !(A((p93==1) U (p22==1)))) *...270
=> equivalent forward existential formula: (([((((((FwdU(Init,!(((!(EG(!((E(TRUE U (p61==1)) * !(E(TRUE U !((p41==1)))))))) + (((p113!=1) + !(!((E(!((p22==...1602
Reverse transition relation is NOT exact ! Due to transitions t10, t11, t18, t25, t33, t36, t37, t38, t59, t60, t63, t65, t66, t67, t70, t81, t88, t90, t10...257
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,7.40027,247696,1,0,1936,1.70519e+06,277,1033,3226,1.52995e+06,2192
FORMULA AutonomousCar-PT-01b-CTLFireability-2025-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 115/115 places, 127/127 transitions.
Graph (trivial) has 104 edges and 115 vertex of which 4 / 115 are part of one of the 2 SCC in 3 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 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 53 rules applied. Total rules applied 54 place count 112 transition count 71
Reduce places removed 53 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 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 1 with 62 rules applied. Total rules applied 116 place count 59 transition count 62
Reduce places removed 4 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 6 rules applied. Total rules applied 122 place count 55 transition count 60
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 124 place count 53 transition count 60
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 124 place count 53 transition count 55
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 134 place count 48 transition count 55
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 144 place count 38 transition count 45
Iterating global reduction 4 with 10 rules applied. Total rules applied 154 place count 38 transition count 45
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 158 place count 38 transition count 41
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 158 place count 38 transition count 39
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 162 place count 36 transition count 39
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 164 place count 34 transition count 37
Iterating global reduction 5 with 2 rules applied. Total rules applied 166 place count 34 transition count 37
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 2 rules applied. Total rules applied 168 place count 34 transition count 35
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 169 place count 33 transition count 35
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 7 with 16 rules applied. Total rules applied 185 place count 25 transition count 27
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 186 place count 24 transition count 25
Iterating global reduction 7 with 1 rules applied. Total rules applied 187 place count 24 transition count 25
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 189 place count 24 transition count 25
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 191 place count 22 transition count 23
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 192 place count 21 transition count 23
Applied a total of 192 rules in 31 ms. Remains 21 /115 variables (removed 94) and now considering 23/127 (removed 104) transitions.
// Phase 1: matrix 23 rows 21 cols
[2025-05-30 23:15:22] [INFO ] Computed 4 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 23:15:22] [INFO ] Implicit Places using invariants in 26 ms returned []
[2025-05-30 23:15:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 23:15:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-30 23:15:22] [INFO ] Implicit Places using invariants and state equation in 38 ms returned [14, 20]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 66 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 19/115 places, 23/127 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 19 transition count 22
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 18 transition count 22
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 17 transition count 21
Applied a total of 4 rules in 19 ms. Remains 17 /19 variables (removed 2) and now considering 21/23 (removed 2) transitions.
// Phase 1: matrix 21 rows 17 cols
[2025-05-30 23:15:22] [INFO ] Computed 2 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 23:15:22] [INFO ] Implicit Places using invariants in 18 ms returned []
[2025-05-30 23:15:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 23:15:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-30 23:15:22] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 17/115 places, 21/127 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 172 ms. Remains : 17/115 places, 21/127 transitions.
[2025-05-30 23:15:22] [INFO ] Flatten gal took : 1 ms
[2025-05-30 23:15:22] [INFO ] Flatten gal took : 2 ms
[2025-05-30 23:15:22] [INFO ] Input system was already deterministic with 21 transitions.
[2025-05-30 23:15:22] [INFO ] Flatten gal took : 1 ms
[2025-05-30 23:15:22] [INFO ] Flatten gal took : 1 ms
[2025-05-30 23:15:22] [INFO ] Time to serialize gal into /tmp/CTLFireability14911477166910312450.gal : 0 ms
[2025-05-30 23:15:22] [INFO ] Time to serialize properties into /tmp/CTLFireability14434637258772879074.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14911477166910312450.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14434637258772879074.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,122,0.003783,3820,2,51,5,252,6,0,88,215,0
Converting to forward existential form...Done !
original formula: E((p109!=1) U (p60==1))
=> equivalent forward existential formula: [(FwdU(Init,(p109!=1)) * (p60==1))] != FALSE
Hit Full ! (commute/partial/dont) 19/0/2
(forward)formula 0,1,0.004998,4076,1,0,7,255,15,1,169,222,4
FORMULA AutonomousCar-PT-01b-CTLFireability-2025-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 127/127 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 101 transition count 113
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 101 transition count 113
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 32 place count 101 transition count 109
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 35 place count 98 transition count 106
Iterating global reduction 1 with 3 rules applied. Total rules applied 38 place count 98 transition count 106
Applied a total of 38 rules in 10 ms. Remains 98 /115 variables (removed 17) and now considering 106/127 (removed 21) transitions.
// Phase 1: matrix 106 rows 98 cols
[2025-05-30 23:15:22] [INFO ] Computed 6 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 23:15:22] [INFO ] Implicit Places using invariants in 77 ms returned []
[2025-05-30 23:15:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 23:15:22] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
Running 105 sub problems to find dead transitions.
[2025-05-30 23:15:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 105 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:15:23] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:15:23] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:15:23] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:15:23] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:15:23] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:15:23] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:15:23] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:15:23] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:15:23] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:15:23] [INFO ] Deduced a trap composed of 32 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:15:23] [INFO ] Deduced a trap composed of 25 places in 27 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:15:23] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:15:23] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:15:23] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 14/20 constraints. Problems are: Problem set: 0 solved, 105 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:15:23] [INFO ] Deduced a trap composed of 40 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:15:23] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:15:24] [INFO ] Deduced a trap composed of 35 places in 48 ms of which 8 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (OVERLAPS) 106/204 variables, 98/121 constraints. Problems are: Problem set: 0 solved, 105 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:15:25] [INFO ] Deduced a trap along path composed of 3 places in 19 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/204 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/204 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 8 (OVERLAPS) 0/204 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Real declared 204/204 variables, and 122 constraints, problems are : Problem set: 0 solved, 105 unsolved in 4924 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 98/98 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 105 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 17/23 constraints. Problems are: Problem set: 0 solved, 105 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:15:27] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (OVERLAPS) 106/204 variables, 98/122 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/204 variables, 105/227 constraints. Problems are: Problem set: 0 solved, 105 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:15:28] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/204 variables, 1/228 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/204 variables, 1/229 constraints. Problems are: Problem set: 0 solved, 105 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:15:31] [INFO ] Deduced a trap along path composed of 3 places in 34 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/204 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 105 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:15:33] [INFO ] Deduced a trap along path composed of 2 places in 20 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:15:33] [INFO ] Deduced a trap along path composed of 2 places in 19 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:15:33] [INFO ] Deduced a trap along path composed of 7 places in 26 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/204 variables, 3/233 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/204 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 12 (OVERLAPS) 0/204 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Int declared 204/204 variables, and 233 constraints, problems are : Problem set: 0 solved, 105 unsolved in 15050 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 98/98 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 5/5 constraints]
After SMT, in 19987ms problems are : Problem set: 0 solved, 105 unsolved
Search for dead transitions found 0 dead transitions in 19987ms
Starting structural reductions in LTL mode, iteration 1 : 98/115 places, 106/127 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20177 ms. Remains : 98/115 places, 106/127 transitions.
[2025-05-30 23:15:42] [INFO ] Flatten gal took : 11 ms
[2025-05-30 23:15:42] [INFO ] Flatten gal took : 6 ms
[2025-05-30 23:15:42] [INFO ] Input system was already deterministic with 106 transitions.
[2025-05-30 23:15:42] [INFO ] Flatten gal took : 8 ms
[2025-05-30 23:15:42] [INFO ] Flatten gal took : 4 ms
[2025-05-30 23:15:42] [INFO ] Time to serialize gal into /tmp/CTLFireability14856270291456014369.gal : 1 ms
[2025-05-30 23:15:42] [INFO ] Time to serialize properties into /tmp/CTLFireability2540880022943523074.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14856270291456014369.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2540880022943523074.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,71510,0.033787,5064,2,1151,5,4886,6,0,500,4128,0
Converting to forward existential form...Done !
original formula: !(E((p117==1) U (AG(!(((AG((((p6==1)&&(p13==1))&&((p76==1)&&(p105==1)))) + (p102==1)) + (p70==1)))) + !(AX(((p117!=1)||((p71==1)&&(p30==1...163
=> equivalent forward existential formula: ([(FwdU(Init,(p117==1)) * !(E(TRUE U !(!(((!(E(TRUE U !((((p6==1)&&(p13==1))&&((p76==1)&&(p105==1)))))) + (p102=...264
Hit Full ! (commute/partial/dont) 104/0/2
Reverse transition relation is NOT exact ! Due to transitions t10, t16, t17, t25, t34, t39, t40, t60, t61, t64, t65, t67, t81, t88, t90, t95, t103, Inters...247
(forward)formula 0,1,0.513327,27660,1,0,193,139120,245,114,2906,96508,255
FORMULA AutonomousCar-PT-01b-CTLFireability-2025-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 127/127 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 100 transition count 112
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 100 transition count 112
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 34 place count 100 transition count 108
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 38 place count 96 transition count 104
Iterating global reduction 1 with 4 rules applied. Total rules applied 42 place count 96 transition count 104
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 43 place count 95 transition count 103
Iterating global reduction 1 with 1 rules applied. Total rules applied 44 place count 95 transition count 103
Applied a total of 44 rules in 8 ms. Remains 95 /115 variables (removed 20) and now considering 103/127 (removed 24) transitions.
// Phase 1: matrix 103 rows 95 cols
[2025-05-30 23:15:42] [INFO ] Computed 6 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 23:15:43] [INFO ] Implicit Places using invariants in 31 ms returned []
[2025-05-30 23:15:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 23:15:43] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
Running 102 sub problems to find dead transitions.
[2025-05-30 23:15:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (OVERLAPS) 1/95 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 102 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:15:43] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:15:43] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:15:43] [INFO ] Deduced a trap composed of 39 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:15:43] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:15:43] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:15:43] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:15:43] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:15:44] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:15:44] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:15:44] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:15:44] [INFO ] Deduced a trap composed of 31 places in 31 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:15:44] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:15:44] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:15:44] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 14/20 constraints. Problems are: Problem set: 0 solved, 102 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:15:44] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:15:44] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:15:44] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:15:44] [INFO ] Deduced a trap composed of 33 places in 38 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:15:44] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 5/25 constraints. Problems are: Problem set: 0 solved, 102 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:15:45] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/95 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (OVERLAPS) 103/198 variables, 95/121 constraints. Problems are: Problem set: 0 solved, 102 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:15:46] [INFO ] Deduced a trap along path composed of 3 places in 22 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/198 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/198 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 9 (OVERLAPS) 0/198 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Real declared 198/198 variables, and 122 constraints, problems are : Problem set: 0 solved, 102 unsolved in 5172 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 95/95 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 102 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (OVERLAPS) 1/95 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 20/26 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (OVERLAPS) 103/198 variables, 95/121 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 102/223 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 102 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:15:49] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/198 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 102 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:15:50] [INFO ] Deduced a trap along path composed of 4 places in 32 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:15:50] [INFO ] Deduced a trap along path composed of 2 places in 21 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:15:50] [INFO ] Deduced a trap along path composed of 2 places in 16 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:15:51] [INFO ] Deduced a trap along path composed of 8 places in 29 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/198 variables, 4/229 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/198 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 10 (OVERLAPS) 0/198 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Int declared 198/198 variables, and 229 constraints, problems are : Problem set: 0 solved, 102 unsolved in 9131 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 95/95 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 5/5 constraints]
After SMT, in 14309ms problems are : Problem set: 0 solved, 102 unsolved
Search for dead transitions found 0 dead transitions in 14310ms
Starting structural reductions in LTL mode, iteration 1 : 95/115 places, 103/127 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14403 ms. Remains : 95/115 places, 103/127 transitions.
[2025-05-30 23:15:57] [INFO ] Flatten gal took : 6 ms
[2025-05-30 23:15:57] [INFO ] Flatten gal took : 5 ms
[2025-05-30 23:15:57] [INFO ] Input system was already deterministic with 103 transitions.
[2025-05-30 23:15:57] [INFO ] Flatten gal took : 3 ms
[2025-05-30 23:15:57] [INFO ] Flatten gal took : 3 ms
[2025-05-30 23:15:57] [INFO ] Time to serialize gal into /tmp/CTLFireability13331177845531189236.gal : 1 ms
[2025-05-30 23:15:57] [INFO ] Time to serialize properties into /tmp/CTLFireability3363134700534364013.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13331177845531189236.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3363134700534364013.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,66852,0.030664,5048,2,1080,5,4597,6,0,485,3815,0
Converting to forward existential form...Done !
original formula: E((((p6==1)&&(p9==1))&&((p40==1)&&(p76==1))) U AG(((!(AX(FALSE)) + AX((p8==1))) + EG((p69==1)))))
=> equivalent forward existential formula: [(FwdU(Init,(((p6==1)&&(p9==1))&&((p40==1)&&(p76==1)))) * !(E(TRUE U !(((!(!(EX(!(FALSE)))) + !(EX(!((p8==1)))))...185
Reverse transition relation is NOT exact ! Due to transitions t10, t16, t17, t24, t32, t35, t36, t38, t58, t59, t62, t63, t65, t78, t85, t87, t92, t100, I...252
Hit Full ! (commute/partial/dont) 90/28/13
(forward)formula 0,1,0.559016,29768,1,0,341,129288,240,140,2758,128745,411
FORMULA AutonomousCar-PT-01b-CTLFireability-2025-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 115/115 places, 127/127 transitions.
Graph (trivial) has 105 edges and 115 vertex of which 4 / 115 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 55 transitions
Trivial Post-agglo rules discarded 55 transitions
Performed 55 trivial Post agglomeration. Transition count delta: 55
Iterating post reduction 0 with 55 rules applied. Total rules applied 56 place count 112 transition count 69
Reduce places removed 55 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 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 1 with 64 rules applied. Total rules applied 120 place count 57 transition count 60
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 125 place count 53 transition count 59
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 128 place count 52 transition count 57
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 129 place count 51 transition count 57
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 129 place count 51 transition count 53
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 137 place count 47 transition count 53
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 147 place count 37 transition count 43
Iterating global reduction 5 with 10 rules applied. Total rules applied 157 place count 37 transition count 43
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 161 place count 37 transition count 39
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 161 place count 37 transition count 37
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 165 place count 35 transition count 37
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 167 place count 33 transition count 35
Iterating global reduction 6 with 2 rules applied. Total rules applied 169 place count 33 transition count 35
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 2 rules applied. Total rules applied 171 place count 33 transition count 33
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 172 place count 32 transition count 33
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 8 with 16 rules applied. Total rules applied 188 place count 24 transition count 25
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 189 place count 23 transition count 23
Iterating global reduction 8 with 1 rules applied. Total rules applied 190 place count 23 transition count 23
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 191 place count 23 transition count 22
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 193 place count 21 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 194 place count 20 transition count 20
Applied a total of 194 rules in 18 ms. Remains 20 /115 variables (removed 95) and now considering 20/127 (removed 107) transitions.
// Phase 1: matrix 20 rows 20 cols
[2025-05-30 23:15:57] [INFO ] Computed 4 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 23:15:58] [INFO ] Implicit Places using invariants in 19 ms returned []
[2025-05-30 23:15:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 23:15:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-30 23:15:58] [INFO ] Implicit Places using invariants and state equation in 30 ms returned [14, 19]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 51 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 18/115 places, 20/127 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 18 transition count 19
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 17 transition count 19
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 17 transition count 18
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 16 transition count 18
Applied a total of 4 rules in 2 ms. Remains 16 /18 variables (removed 2) and now considering 18/20 (removed 2) transitions.
// Phase 1: matrix 18 rows 16 cols
[2025-05-30 23:15:58] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 23:15:58] [INFO ] Implicit Places using invariants in 17 ms returned []
[2025-05-30 23:15:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 23:15:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-30 23:15:58] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 16/115 places, 18/127 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 112 ms. Remains : 16/115 places, 18/127 transitions.
[2025-05-30 23:15:58] [INFO ] Flatten gal took : 1 ms
[2025-05-30 23:15:58] [INFO ] Flatten gal took : 1 ms
[2025-05-30 23:15:58] [INFO ] Input system was already deterministic with 18 transitions.
RANDOM walk for 89 steps (11 resets) in 5 ms. (14 steps per ms) remains 0/1 properties
FORMULA AutonomousCar-PT-01b-CTLFireability-2025-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2025-05-30 23:15:58] [INFO ] Flatten gal took : 1 ms
[2025-05-30 23:15:58] [INFO ] Flatten gal took : 1 ms
[2025-05-30 23:15:58] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14254866170882361055.gal : 1 ms
[2025-05-30 23:15:58] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5989986620969619603.prop : 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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14254866170882361055.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5989986620969619603.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 127/127 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 99 transition count 111
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 99 transition count 111
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 36 place count 99 transition count 107
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 40 place count 95 transition count 103
Iterating global reduction 1 with 4 rules applied. Total rules applied 44 place count 95 transition count 103
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 45 place count 94 transition count 102
Iterating global reduction 1 with 1 rules applied. Total rules applied 46 place count 94 transition count 102
Applied a total of 46 rules in 10 ms. Remains 94 /115 variables (removed 21) and now considering 102/127 (removed 25) transitions.
// Phase 1: matrix 102 rows 94 cols
[2025-05-30 23:15:58] [INFO ] Computed 6 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 23:15:58] [INFO ] Implicit Places using invariants in 38 ms returned []
[2025-05-30 23:15:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 23:15:58] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
Running 101 sub problems to find dead transitions.
[2025-05-30 23:15:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (OVERLAPS) 1/94 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 101 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:15:58] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:15:58] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:15:58] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:15:58] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:15:59] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:15:59] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:15:59] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:15:59] [INFO ] Deduced a trap composed of 31 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:15:59] [INFO ] Deduced a trap composed of 32 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:15:59] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:15:59] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:15:59] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:15:59] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 13/19 constraints. Problems are: Problem set: 0 solved, 101 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:15:59] [INFO ] Deduced a trap composed of 39 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:15:59] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:15:59] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (OVERLAPS) 102/196 variables, 94/116 constraints. Problems are: Problem set: 0 solved, 101 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:16:00] [INFO ] Deduced a trap along path composed of 3 places in 23 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/196 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 8 (OVERLAPS) 0/196 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Real declared 196/196 variables, and 117 constraints, problems are : Problem set: 0 solved, 101 unsolved in 4570 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 94/94 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 101 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (OVERLAPS) 1/94 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 16/22 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (OVERLAPS) 102/196 variables, 94/116 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 101/217 constraints. Problems are: Problem set: 0 solved, 101 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:16:03] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:16:03] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:16:03] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 3/220 constraints. Problems are: Problem set: 0 solved, 101 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:16:04] [INFO ] Deduced a trap composed of 27 places in 31 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/196 variables, 1/221 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/196 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 101 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:16:05] [INFO ] Deduced a trap along path composed of 3 places in 26 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:16:05] [INFO ] Deduced a trap along path composed of 2 places in 17 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:16:06] [INFO ] Deduced a trap along path composed of 2 places in 19 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:16:06] [INFO ] Deduced a trap along path composed of 10 places in 21 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/196 variables, 4/226 constraints. Problems are: Problem set: 0 solved, 101 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:16:08] [INFO ] Deduced a trap along path composed of 7 places in 21 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/196 variables, 1/227 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/196 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 12 (OVERLAPS) 0/196 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Int declared 196/196 variables, and 227 constraints, problems are : Problem set: 0 solved, 101 unsolved in 16740 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 94/94 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 6/6 constraints]
After SMT, in 21321ms problems are : Problem set: 0 solved, 101 unsolved
Search for dead transitions found 0 dead transitions in 21322ms
Starting structural reductions in LTL mode, iteration 1 : 94/115 places, 102/127 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21427 ms. Remains : 94/115 places, 102/127 transitions.
[2025-05-30 23:16:19] [INFO ] Flatten gal took : 7 ms
[2025-05-30 23:16:19] [INFO ] Flatten gal took : 4 ms
[2025-05-30 23:16:19] [INFO ] Input system was already deterministic with 102 transitions.
[2025-05-30 23:16:19] [INFO ] Flatten gal took : 3 ms
[2025-05-30 23:16:19] [INFO ] Flatten gal took : 3 ms
[2025-05-30 23:16:19] [INFO ] Time to serialize gal into /tmp/CTLFireability16881602005302790122.gal : 1 ms
[2025-05-30 23:16:19] [INFO ] Time to serialize properties into /tmp/CTLFireability16477820311464486528.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16881602005302790122.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16477820311464486528.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,65988,0.030264,5048,2,1074,5,4446,6,0,480,3733,0
Converting to forward existential form...Done !
original formula: EG(AG((((p34==1) + AX((p72==0))) + AX(FALSE))))
=> equivalent forward existential formula: [FwdG(Init,!(E(TRUE U !((((p34==1) + !(EX(!((p72==0))))) + !(EX(!(FALSE))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t10, t16, t17, t24, t32, t35, t36, t37, t57, t58, t61, t62, t64, t77, t84, t86, t91, t99, In...251
(forward)formula 0,0,0.900952,40568,1,0,287,210197,233,123,2816,179560,342
FORMULA AutonomousCar-PT-01b-CTLFireability-2025-09 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 : 115/115 places, 127/127 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 101 transition count 113
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 101 transition count 113
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 31 place count 98 transition count 110
Iterating global reduction 0 with 3 rules applied. Total rules applied 34 place count 98 transition count 110
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 97 transition count 109
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 97 transition count 109
Applied a total of 36 rules in 5 ms. Remains 97 /115 variables (removed 18) and now considering 109/127 (removed 18) transitions.
// Phase 1: matrix 109 rows 97 cols
[2025-05-30 23:16:20] [INFO ] Computed 6 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 23:16:20] [INFO ] Implicit Places using invariants in 41 ms returned []
[2025-05-30 23:16:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 23:16:20] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
Running 108 sub problems to find dead transitions.
[2025-05-30 23:16:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (OVERLAPS) 1/97 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 108 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:16:21] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:16:21] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:16:21] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:16:21] [INFO ] Deduced a trap composed of 31 places in 39 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:16:21] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:16:21] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:16:21] [INFO ] Deduced a trap composed of 31 places in 30 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:16:21] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:16:21] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:16:21] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:16:21] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:16:21] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:16:21] [INFO ] Deduced a trap composed of 32 places in 32 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:16:21] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:16:21] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:16:21] [INFO ] Deduced a trap composed of 33 places in 31 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:16:22] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:16:22] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 18/24 constraints. Problems are: Problem set: 0 solved, 108 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:16:22] [INFO ] Deduced a trap composed of 39 places in 32 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:16:22] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 108 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:16:22] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/97 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 109/206 variables, 97/124 constraints. Problems are: Problem set: 0 solved, 108 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:16:24] [INFO ] Deduced a trap along path composed of 3 places in 21 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/206 variables, 1/125 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/206 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 9 (OVERLAPS) 0/206 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 206/206 variables, and 125 constraints, problems are : Problem set: 0 solved, 108 unsolved in 5677 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 97/97 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (OVERLAPS) 1/97 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 21/27 constraints. Problems are: Problem set: 0 solved, 108 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:16:26] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (OVERLAPS) 109/206 variables, 97/125 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/206 variables, 108/233 constraints. Problems are: Problem set: 0 solved, 108 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:16:27] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/206 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/206 variables, 1/235 constraints. Problems are: Problem set: 0 solved, 108 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:16:28] [INFO ] Deduced a trap composed of 32 places in 43 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/206 variables, 1/236 constraints. Problems are: Problem set: 0 solved, 108 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:16:30] [INFO ] Deduced a trap along path composed of 4 places in 39 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:16:30] [INFO ] Deduced a trap along path composed of 2 places in 23 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:16:30] [INFO ] Deduced a trap along path composed of 2 places in 23 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/206 variables, 3/239 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/206 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 12 (OVERLAPS) 0/206 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 206/206 variables, and 239 constraints, problems are : Problem set: 0 solved, 108 unsolved in 10608 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 97/97 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 16293ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 16293ms
Starting structural reductions in LTL mode, iteration 1 : 97/115 places, 109/127 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16393 ms. Remains : 97/115 places, 109/127 transitions.
[2025-05-30 23:16:36] [INFO ] Flatten gal took : 9 ms
[2025-05-30 23:16:36] [INFO ] Flatten gal took : 3 ms
[2025-05-30 23:16:36] [INFO ] Input system was already deterministic with 109 transitions.
[2025-05-30 23:16:36] [INFO ] Flatten gal took : 4 ms
[2025-05-30 23:16:36] [INFO ] Flatten gal took : 10 ms
[2025-05-30 23:16:36] [INFO ] Time to serialize gal into /tmp/CTLFireability2924465742511921690.gal : 1 ms
[2025-05-30 23:16:36] [INFO ] Time to serialize properties into /tmp/CTLFireability852369669146099227.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2924465742511921690.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability852369669146099227.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,71406,0.031571,5084,2,1217,5,4712,6,0,499,4060,0
Converting to forward existential form...Done !
original formula: A((EX((((p16==1)||(p71==1))||(((!(((p6==1)&&(p9==1))&&((p33==1)&&(p76==1))))||(p95==1))&&(p3!=1)))) + (p43==1)) U EG(AF(E(((((p96==1)&&(p...209
=> equivalent forward existential formula: [((Init * !(EG(!(EG(!(EG(!(E(((((p96==1)&&(p6==1))&&((p9==1)&&(p40==1)))&&(p76==1)) U (p39!=1)))))))))) * !(E(!(...456
Reverse transition relation is NOT exact ! Due to transitions t10, t16, t17, t24, t33, t37, t38, t58, t59, t62, t64, t65, t66, t79, t86, t88, t90, t106, I...252
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,3.96745,144324,1,0,932,961414,254,542,3065,845784,945
FORMULA AutonomousCar-PT-01b-CTLFireability-2025-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 127/127 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 100 transition count 112
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 100 transition count 112
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 34 place count 100 transition count 108
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 37 place count 97 transition count 105
Iterating global reduction 1 with 3 rules applied. Total rules applied 40 place count 97 transition count 105
Applied a total of 40 rules in 9 ms. Remains 97 /115 variables (removed 18) and now considering 105/127 (removed 22) transitions.
// Phase 1: matrix 105 rows 97 cols
[2025-05-30 23:16:40] [INFO ] Computed 6 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 23:16:40] [INFO ] Implicit Places using invariants in 34 ms returned []
[2025-05-30 23:16:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 23:16:41] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
Running 104 sub problems to find dead transitions.
[2025-05-30 23:16:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 1 (OVERLAPS) 1/97 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 104 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:16:41] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:16:41] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:16:41] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:16:41] [INFO ] Deduced a trap composed of 42 places in 32 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:16:41] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:16:41] [INFO ] Deduced a trap composed of 31 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:16:41] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:16:42] [INFO ] Deduced a trap composed of 27 places in 32 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:16:42] [INFO ] Deduced a trap composed of 32 places in 31 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:16:42] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:16:42] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:16:42] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 12/18 constraints. Problems are: Problem set: 0 solved, 104 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:16:42] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:16:42] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:16:42] [INFO ] Deduced a trap composed of 32 places in 25 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 104 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:16:42] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/97 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 6 (OVERLAPS) 105/202 variables, 97/119 constraints. Problems are: Problem set: 0 solved, 104 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:16:44] [INFO ] Deduced a trap along path composed of 3 places in 24 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 9 (OVERLAPS) 0/202 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 104 unsolved
No progress, stopping.
After SMT solving in domain Real declared 202/202 variables, and 120 constraints, problems are : Problem set: 0 solved, 104 unsolved in 5055 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 97/97 constraints, PredecessorRefiner: 104/104 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 104 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 1 (OVERLAPS) 1/97 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 16/22 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 4 (OVERLAPS) 105/202 variables, 97/119 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/202 variables, 104/223 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/202 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 104 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:16:47] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 104 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:16:48] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 1/226 constraints. Problems are: Problem set: 0 solved, 104 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:16:49] [INFO ] Deduced a trap along path composed of 3 places in 28 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:16:49] [INFO ] Deduced a trap along path composed of 2 places in 21 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/202 variables, 2/228 constraints. Problems are: Problem set: 0 solved, 104 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:16:52] [INFO ] Deduced a trap along path composed of 2 places in 22 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/202 variables, 1/229 constraints. Problems are: Problem set: 0 solved, 104 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:16:55] [INFO ] Deduced a trap along path composed of 7 places in 25 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/202 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/202 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 13 (OVERLAPS) 0/202 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 104 unsolved
No progress, stopping.
After SMT solving in domain Int declared 202/202 variables, and 230 constraints, problems are : Problem set: 0 solved, 104 unsolved in 23445 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 97/97 constraints, PredecessorRefiner: 104/104 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 5/5 constraints]
After SMT, in 28506ms problems are : Problem set: 0 solved, 104 unsolved
Search for dead transitions found 0 dead transitions in 28506ms
Starting structural reductions in LTL mode, iteration 1 : 97/115 places, 105/127 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28612 ms. Remains : 97/115 places, 105/127 transitions.
[2025-05-30 23:17:09] [INFO ] Flatten gal took : 10 ms
[2025-05-30 23:17:09] [INFO ] Flatten gal took : 3 ms
[2025-05-30 23:17:09] [INFO ] Input system was already deterministic with 105 transitions.
[2025-05-30 23:17:09] [INFO ] Flatten gal took : 3 ms
[2025-05-30 23:17:09] [INFO ] Flatten gal took : 3 ms
[2025-05-30 23:17:09] [INFO ] Time to serialize gal into /tmp/CTLFireability2617446216571944500.gal : 1 ms
[2025-05-30 23:17:09] [INFO ] Time to serialize properties into /tmp/CTLFireability17484529764497955469.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2617446216571944500.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17484529764497955469.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,71658,0.029216,4928,2,989,5,4208,6,0,495,3203,0
Converting to forward existential form...Done !
original formula: AG((EF((p54==0)) * (!(A(((((p6==1)&&(p9==1))&&((p37==1)&&(p76==1)))&&(p98!=1)) U (p0!=1))) + EX(!(E((p35==1) U (p48==1)))))))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(E(TRUE U (p54==0))))] = FALSE * [(((FwdU(Init,TRUE) * !(EX(!(E((p35==1) U (p48==1)))))) *...279
Reverse transition relation is NOT exact ! Due to transitions t10, t16, t17, t26, t34, t37, t38, t39, t59, t60, t63, t64, t66, t79, t86, t88, t93, t102, I...252
(forward)formula 0,0,0.37136,22896,1,0,257,92941,242,107,2760,92711,315
FORMULA AutonomousCar-PT-01b-CTLFireability-2025-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 115/115 places, 127/127 transitions.
Graph (trivial) has 98 edges and 115 vertex of which 4 / 115 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 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 52 place count 112 transition count 73
Reduce places removed 51 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 1 with 60 rules applied. Total rules applied 112 place count 61 transition count 64
Reduce places removed 5 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 8 rules applied. Total rules applied 120 place count 56 transition count 61
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 5 rules applied. Total rules applied 125 place count 53 transition count 59
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 126 place count 52 transition count 59
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 126 place count 52 transition count 55
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 134 place count 48 transition count 55
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 144 place count 38 transition count 45
Iterating global reduction 5 with 10 rules applied. Total rules applied 154 place count 38 transition count 45
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 159 place count 38 transition count 40
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 3 Pre rules applied. Total rules applied 159 place count 38 transition count 37
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 165 place count 35 transition count 37
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 166 place count 34 transition count 36
Iterating global reduction 6 with 1 rules applied. Total rules applied 167 place count 34 transition count 36
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 6 with 14 rules applied. Total rules applied 181 place count 27 transition count 29
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 182 place count 26 transition count 27
Iterating global reduction 6 with 1 rules applied. Total rules applied 183 place count 26 transition count 27
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 184 place count 26 transition count 26
Partial Post-agglomeration rule applied 3 times.
Drop transitions (Partial Post agglomeration) removed 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 187 place count 26 transition count 26
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 188 place count 25 transition count 25
Iterating global reduction 6 with 1 rules applied. Total rules applied 189 place count 25 transition count 25
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 191 place count 23 transition count 23
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 192 place count 22 transition count 23
Applied a total of 192 rules in 21 ms. Remains 22 /115 variables (removed 93) and now considering 23/127 (removed 104) transitions.
// Phase 1: matrix 23 rows 22 cols
[2025-05-30 23:17:09] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 23:17:10] [INFO ] Implicit Places using invariants in 25 ms returned []
[2025-05-30 23:17:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 23:17:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-30 23:17:10] [INFO ] Implicit Places using invariants and state equation in 26 ms returned [15]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 59 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 21/115 places, 23/127 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 21 transition count 22
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 20 transition count 22
Applied a total of 2 rules in 1 ms. Remains 20 /21 variables (removed 1) and now considering 22/23 (removed 1) transitions.
// Phase 1: matrix 22 rows 20 cols
[2025-05-30 23:17:10] [INFO ] Computed 3 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 23:17:10] [INFO ] Implicit Places using invariants in 18 ms returned []
[2025-05-30 23:17:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 23:17:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-30 23:17:10] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 20/115 places, 22/127 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 129 ms. Remains : 20/115 places, 22/127 transitions.
[2025-05-30 23:17:10] [INFO ] Flatten gal took : 1 ms
[2025-05-30 23:17:10] [INFO ] Flatten gal took : 1 ms
[2025-05-30 23:17:10] [INFO ] Input system was already deterministic with 22 transitions.
[2025-05-30 23:17:10] [INFO ] Flatten gal took : 1 ms
[2025-05-30 23:17:10] [INFO ] Flatten gal took : 1 ms
[2025-05-30 23:17:10] [INFO ] Time to serialize gal into /tmp/CTLFireability3121199717987876892.gal : 0 ms
[2025-05-30 23:17:10] [INFO ] Time to serialize properties into /tmp/CTLFireability9171744412251479907.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3121199717987876892.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9171744412251479907.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,244,0.006135,3904,2,69,5,345,6,0,102,298,0
Converting to forward existential form...Done !
original formula: EF(((p20==1) + (AG(((p88==1)&&(p112==1))) * AF((p34==1)))))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * (p20==1))] != FALSE + [((FwdU(Init,TRUE) * !(E(TRUE U !(((p88==1)&&(p112==1)))))) * !(EG(!(...178
(forward)formula 0,1,0.007101,4032,1,0,7,345,8,1,105,298,1
FORMULA AutonomousCar-PT-01b-CTLFireability-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 115/115 places, 127/127 transitions.
Graph (trivial) has 101 edges and 115 vertex of which 4 / 115 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 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 52 rules applied. Total rules applied 53 place count 112 transition count 72
Reduce places removed 52 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 1 with 61 rules applied. Total rules applied 114 place count 60 transition count 63
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 6 rules applied. Total rules applied 120 place count 55 transition count 62
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 121 place count 54 transition count 62
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 121 place count 54 transition count 57
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 131 place count 49 transition count 57
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 141 place count 39 transition count 47
Iterating global reduction 4 with 10 rules applied. Total rules applied 151 place count 39 transition count 47
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 156 place count 39 transition count 42
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 156 place count 39 transition count 40
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 160 place count 37 transition count 40
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 162 place count 35 transition count 38
Iterating global reduction 5 with 2 rules applied. Total rules applied 164 place count 35 transition count 38
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 2 rules applied. Total rules applied 166 place count 35 transition count 36
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 167 place count 34 transition count 36
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 7 with 16 rules applied. Total rules applied 183 place count 26 transition count 28
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 184 place count 25 transition count 26
Iterating global reduction 7 with 1 rules applied. Total rules applied 185 place count 25 transition count 26
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 186 place count 25 transition count 25
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 187 place count 25 transition count 25
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 188 place count 24 transition count 24
Iterating global reduction 7 with 1 rules applied. Total rules applied 189 place count 24 transition count 24
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 191 place count 22 transition count 22
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 192 place count 21 transition count 22
Applied a total of 192 rules in 15 ms. Remains 21 /115 variables (removed 94) and now considering 22/127 (removed 105) transitions.
// Phase 1: matrix 22 rows 21 cols
[2025-05-30 23:17:10] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 23:17:10] [INFO ] Implicit Places using invariants in 26 ms returned []
[2025-05-30 23:17:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 23:17:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-30 23:17:10] [INFO ] Implicit Places using invariants and state equation in 31 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 59 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 20/115 places, 22/127 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 20 transition count 21
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 19 transition count 21
Applied a total of 2 rules in 2 ms. Remains 19 /20 variables (removed 1) and now considering 21/22 (removed 1) transitions.
// Phase 1: matrix 21 rows 19 cols
[2025-05-30 23:17:10] [INFO ] Computed 3 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 23:17:10] [INFO ] Implicit Places using invariants in 19 ms returned []
[2025-05-30 23:17:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 23:17:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-30 23:17:10] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 19/115 places, 21/127 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 120 ms. Remains : 19/115 places, 21/127 transitions.
[2025-05-30 23:17:10] [INFO ] Flatten gal took : 1 ms
[2025-05-30 23:17:10] [INFO ] Flatten gal took : 1 ms
[2025-05-30 23:17:10] [INFO ] Input system was already deterministic with 21 transitions.
[2025-05-30 23:17:10] [INFO ] Flatten gal took : 1 ms
RANDOM walk for 39 steps (3 resets) in 4 ms. (7 steps per ms) remains 0/1 properties
FORMULA AutonomousCar-PT-01b-CTLFireability-2023-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2025-05-30 23:17:10] [INFO ] Flatten gal took : 1 ms
[2025-05-30 23:17:10] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality500555719664316468.gal : 0 ms
[2025-05-30 23:17:10] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15210742374747790754.prop : 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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality500555719664316468.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15210742374747790754.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 127/127 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 103 transition count 115
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 103 transition count 115
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 28 place count 103 transition count 111
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 102 transition count 110
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 102 transition count 110
Applied a total of 30 rules in 2 ms. Remains 102 /115 variables (removed 13) and now considering 110/127 (removed 17) transitions.
// Phase 1: matrix 110 rows 102 cols
[2025-05-30 23:17:10] [INFO ] Computed 6 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 23:17:10] [INFO ] Implicit Places using invariants in 30 ms returned []
[2025-05-30 23:17:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 23:17:10] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
Running 109 sub problems to find dead transitions.
[2025-05-30 23:17:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (OVERLAPS) 1/102 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 109 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:17:10] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:17:11] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:17:11] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:17:11] [INFO ] Deduced a trap composed of 43 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:17:11] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:17:11] [INFO ] Deduced a trap composed of 31 places in 37 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:17:11] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:17:11] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:17:11] [INFO ] Deduced a trap composed of 32 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:17:11] [INFO ] Deduced a trap composed of 31 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:17:11] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:17:11] [INFO ] Deduced a trap composed of 33 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:17:11] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:17:11] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 14/20 constraints. Problems are: Problem set: 0 solved, 109 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:17:11] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (OVERLAPS) 110/212 variables, 102/123 constraints. Problems are: Problem set: 0 solved, 109 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:17:13] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/212 variables, 1/124 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/212 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 109 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:17:14] [INFO ] Deduced a trap along path composed of 3 places in 22 ms of which 0 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/212 variables, 1/125 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/212 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 10 (OVERLAPS) 0/212 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Real declared 212/212 variables, and 125 constraints, problems are : Problem set: 0 solved, 109 unsolved in 6807 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 102/102 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 109 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (OVERLAPS) 1/102 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 16/22 constraints. Problems are: Problem set: 0 solved, 109 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:17:17] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:17:17] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (OVERLAPS) 110/212 variables, 102/126 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/212 variables, 109/235 constraints. Problems are: Problem set: 0 solved, 109 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:17:18] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/212 variables, 1/236 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/212 variables, 1/237 constraints. Problems are: Problem set: 0 solved, 109 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:17:20] [INFO ] Deduced a trap along path composed of 10 places in 35 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:17:20] [INFO ] Deduced a trap along path composed of 2 places in 13 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:17:20] [INFO ] Deduced a trap along path composed of 5 places in 15 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:17:20] [INFO ] Deduced a trap along path composed of 7 places in 19 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/212 variables, 4/241 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/212 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 109 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:17:25] [INFO ] Deduced a trap along path composed of 2 places in 19 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/212 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/212 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 13 (OVERLAPS) 0/212 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Int declared 212/212 variables, and 242 constraints, problems are : Problem set: 0 solved, 109 unsolved in 19540 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 102/102 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 6/6 constraints]
After SMT, in 26357ms problems are : Problem set: 0 solved, 109 unsolved
Search for dead transitions found 0 dead transitions in 26358ms
Starting structural reductions in LTL mode, iteration 1 : 102/115 places, 110/127 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26458 ms. Remains : 102/115 places, 110/127 transitions.
[2025-05-30 23:17:36] [INFO ] Flatten gal took : 3 ms
[2025-05-30 23:17:36] [INFO ] Flatten gal took : 3 ms
[2025-05-30 23:17:36] [INFO ] Input system was already deterministic with 110 transitions.
[2025-05-30 23:17:36] [INFO ] Flatten gal took : 2 ms
[2025-05-30 23:17:36] [INFO ] Flatten gal took : 2 ms
[2025-05-30 23:17:36] [INFO ] Time to serialize gal into /tmp/CTLFireability9438937704457580592.gal : 1 ms
[2025-05-30 23:17:36] [INFO ] Time to serialize properties into /tmp/CTLFireability9818270998215746320.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9438937704457580592.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9818270998215746320.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,77154,0.034781,5116,2,1136,5,4869,6,0,520,4016,0
Converting to forward existential form...Done !
original formula: ((EX((((p6==1)&&(p9==1))&&((p40==1)&&(p76==1)))) + EG((((EX((p95==1)) + E((p101==1) U (p30==1))) + (AX((p109==1)) + EX(!(E((p45==1) U (p7...308
=> equivalent forward existential formula: [FwdG(EY((EY(FwdU((Init * !((EX((((p6==1)&&(p9==1))&&((p40==1)&&(p76==1)))) + EG((((EX((p95==1)) + E((p101==1) U...372
Reverse transition relation is NOT exact ! Due to transitions t10, t16, t17, t25, t33, t36, t37, t38, t61, t62, t65, t66, t68, t82, t89, t92, t93, t97, t10...257
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,4.18105,151344,1,0,1088,1.02779e+06,275,615,3047,874412,1116
FORMULA AutonomousCar-PT-01b-CTLFireability-2023-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 115/115 places, 127/127 transitions.
Graph (trivial) has 89 edges and 115 vertex of which 4 / 115 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.
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 43 place count 113 transition count 83
Reduce places removed 42 places and 0 transitions.
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 1 with 50 rules applied. Total rules applied 93 place count 71 transition count 75
Reduce places removed 4 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 8 rules applied. Total rules applied 101 place count 67 transition count 71
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 105 place count 63 transition count 71
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 105 place count 63 transition count 67
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 113 place count 59 transition count 67
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 122 place count 50 transition count 58
Iterating global reduction 4 with 9 rules applied. Total rules applied 131 place count 50 transition count 58
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 136 place count 50 transition count 53
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 136 place count 50 transition count 52
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 138 place count 49 transition count 52
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 140 place count 47 transition count 50
Iterating global reduction 5 with 2 rules applied. Total rules applied 142 place count 47 transition count 50
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 5 with 22 rules applied. Total rules applied 164 place count 36 transition count 39
Partial Post-agglomeration rule applied 4 times.
Drop transitions (Partial Post agglomeration) removed 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 168 place count 36 transition count 39
Applied a total of 168 rules in 14 ms. Remains 36 /115 variables (removed 79) and now considering 39/127 (removed 88) transitions.
// Phase 1: matrix 39 rows 36 cols
[2025-05-30 23:17:40] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 23:17:40] [INFO ] Implicit Places using invariants in 25 ms returned []
[2025-05-30 23:17:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 23:17:41] [INFO ] State equation strengthened by 6 read => feed constraints.
[2025-05-30 23:17:41] [INFO ] Implicit Places using invariants and state equation in 41 ms returned [27, 35]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 68 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 34/115 places, 39/127 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 34 transition count 38
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 33 transition count 38
Applied a total of 2 rules in 1 ms. Remains 33 /34 variables (removed 1) and now considering 38/39 (removed 1) transitions.
// Phase 1: matrix 38 rows 33 cols
[2025-05-30 23:17:41] [INFO ] Computed 3 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 23:17:41] [INFO ] Implicit Places using invariants in 22 ms returned []
[2025-05-30 23:17:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 23:17:41] [INFO ] State equation strengthened by 5 read => feed constraints.
[2025-05-30 23:17:41] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 33/115 places, 38/127 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 138 ms. Remains : 33/115 places, 38/127 transitions.
[2025-05-30 23:17:41] [INFO ] Flatten gal took : 1 ms
[2025-05-30 23:17:41] [INFO ] Flatten gal took : 2 ms
[2025-05-30 23:17:41] [INFO ] Input system was already deterministic with 38 transitions.
[2025-05-30 23:17:41] [INFO ] Flatten gal took : 1 ms
[2025-05-30 23:17:41] [INFO ] Flatten gal took : 1 ms
[2025-05-30 23:17:41] [INFO ] Time to serialize gal into /tmp/CTLFireability13491579824551382759.gal : 1 ms
[2025-05-30 23:17:41] [INFO ] Time to serialize properties into /tmp/CTLFireability4459012230699251422.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13491579824551382759.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4459012230699251422.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,605,0.007893,4072,2,191,5,893,6,0,168,962,0
Converting to forward existential form...Done !
original formula: AF(((EG(((((p0==0)&&(((p29==1)||(p5==1))||((p67==1)||(p66==1))))&&((p73==0)&&(p65==1)))&&(p37==1))) * (p49==0)) * (EF((p100==1)) + A((p42...174
=> equivalent forward existential formula: [FwdG(Init,!(((EG(((((p0==0)&&(((p29==1)||(p5==1))||((p67==1)||(p66==1))))&&((p73==0)&&(p65==1)))&&(p37==1))) * ...270
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t4, t7, t8, t10, t13, t17, t23, t28, t33, t37, Intersection with reachable at each s...215
(forward)formula 0,0,0.092549,8552,1,0,257,27206,116,129,1114,29694,302
FORMULA AutonomousCar-PT-01b-CTLFireability-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
[2025-05-30 23:17:41] [INFO ] Flatten gal took : 3 ms
[2025-05-30 23:17:41] [INFO ] Flatten gal took : 3 ms
Total runtime 284485 ms.
BK_STOP 1748647061235
--------------------
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
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /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-01b"
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-5832"
echo " Executing tool itstools"
echo " Input is AutonomousCar-PT-01b, 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 r002-tall-174853729600610"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/AutonomousCar-PT-01b.tgz
mv AutonomousCar-PT-01b 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.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 '
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 ;