Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r002-tall-174853729700641.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-03b, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r002-tall-174853729700641
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 7.7K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 70K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.2K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 68K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 109K 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 75K 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-03b-CTLCardinality-2023-12
FORMULA_NAME AutonomousCar-PT-03b-CTLCardinality-2023-13
FORMULA_NAME AutonomousCar-PT-03b-CTLCardinality-2023-14
FORMULA_NAME AutonomousCar-PT-03b-CTLCardinality-2023-15
FORMULA_NAME AutonomousCar-PT-03b-CTLCardinality-2025-00
FORMULA_NAME AutonomousCar-PT-03b-CTLCardinality-2025-01
FORMULA_NAME AutonomousCar-PT-03b-CTLCardinality-2025-02
FORMULA_NAME AutonomousCar-PT-03b-CTLCardinality-2025-03
FORMULA_NAME AutonomousCar-PT-03b-CTLCardinality-2025-04
FORMULA_NAME AutonomousCar-PT-03b-CTLCardinality-2025-05
FORMULA_NAME AutonomousCar-PT-03b-CTLCardinality-2025-06
FORMULA_NAME AutonomousCar-PT-03b-CTLCardinality-2025-07
FORMULA_NAME AutonomousCar-PT-03b-CTLCardinality-2025-08
FORMULA_NAME AutonomousCar-PT-03b-CTLCardinality-2025-09
FORMULA_NAME AutonomousCar-PT-03b-CTLCardinality-2025-10
FORMULA_NAME AutonomousCar-PT-03b-CTLCardinality-2025-11

=== Now, execution of the tool begins

BK_START 1748648151694

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-03b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202505121319
[2025-05-30 23:35:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-30 23:35:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 23:35:53] [INFO ] Load time of PNML (sax parser for PT used): 75 ms
[2025-05-30 23:35:53] [INFO ] Transformed 190 places.
[2025-05-30 23:35:53] [INFO ] Transformed 273 transitions.
[2025-05-30 23:35:53] [INFO ] Found NUPN structural information;
[2025-05-30 23:35:53] [INFO ] Parsed PT model containing 190 places and 273 transitions and 1051 arcs in 175 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 15 ms.
FORMULA AutonomousCar-PT-03b-CTLCardinality-2025-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 98 out of 190 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 190/190 places, 273/273 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 180 transition count 263
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 180 transition count 263
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 179 transition count 262
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 179 transition count 262
Applied a total of 22 rules in 32 ms. Remains 179 /190 variables (removed 11) and now considering 262/273 (removed 11) transitions.
// Phase 1: matrix 262 rows 179 cols
[2025-05-30 23:35:53] [INFO ] Computed 8 invariants in 13 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 23:35:53] [INFO ] Implicit Places using invariants in 241 ms returned []
[2025-05-30 23:35:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 23:35:53] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 423 ms to find 0 implicit places.
Running 261 sub problems to find dead transitions.
[2025-05-30 23:35:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/178 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (OVERLAPS) 1/179 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 261 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:35:56] [INFO ] Deduced a trap composed of 15 places in 116 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:35:56] [INFO ] Deduced a trap composed of 16 places in 91 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:35:56] [INFO ] Deduced a trap composed of 21 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:35:56] [INFO ] Deduced a trap composed of 35 places in 47 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:35:56] [INFO ] Deduced a trap composed of 22 places in 77 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:35:57] [INFO ] Deduced a trap composed of 35 places in 131 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:35:57] [INFO ] Deduced a trap composed of 36 places in 69 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:35:57] [INFO ] Deduced a trap composed of 37 places in 68 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:35:57] [INFO ] Deduced a trap composed of 37 places in 72 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:35:57] [INFO ] Deduced a trap composed of 27 places in 73 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:35:57] [INFO ] Deduced a trap composed of 30 places in 77 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:35:57] [INFO ] Deduced a trap composed of 33 places in 77 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:35:57] [INFO ] Deduced a trap composed of 42 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:35:57] [INFO ] Deduced a trap composed of 43 places in 68 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:35:58] [INFO ] Deduced a trap composed of 44 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:35:58] [INFO ] Deduced a trap composed of 43 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:35:58] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:35:58] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:35:58] [INFO ] Deduced a trap composed of 10 places in 81 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:35:58] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 261 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:35:59] [INFO ] Deduced a trap composed of 34 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:35:59] [INFO ] Deduced a trap composed of 36 places in 73 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:35:59] [INFO ] Deduced a trap composed of 34 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:35:59] [INFO ] Deduced a trap composed of 36 places in 63 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:36:00] [INFO ] Deduced a trap composed of 24 places in 68 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 5/33 constraints. Problems are: Problem set: 0 solved, 261 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:36:01] [INFO ] Deduced a trap composed of 36 places in 73 ms of which 11 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 261 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:36:03] [INFO ] Deduced a trap composed of 7 places in 72 ms of which 7 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/179 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/179 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 261 unsolved
Problem TDEAD10 is UNSAT
Problem TDEAD245 is UNSAT
At refinement iteration 7 (OVERLAPS) 262/441 variables, 179/214 constraints. Problems are: Problem set: 2 solved, 259 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:36:06] [INFO ] Deduced a trap composed of 47 places in 42 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/441 variables, 1/215 constraints. Problems are: Problem set: 2 solved, 259 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:36:09] [INFO ] Deduced a trap along path composed of 3 places in 45 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:36:10] [INFO ] Deduced a trap along path composed of 3 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:36:10] [INFO ] Deduced a trap along path composed of 3 places in 32 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/441 variables, 3/218 constraints. Problems are: Problem set: 2 solved, 259 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/441 variables, 0/218 constraints. Problems are: Problem set: 2 solved, 259 unsolved
At refinement iteration 11 (OVERLAPS) 0/441 variables, 0/218 constraints. Problems are: Problem set: 2 solved, 259 unsolved
No progress, stopping.
After SMT solving in domain Real declared 441/441 variables, and 218 constraints, problems are : Problem set: 2 solved, 259 unsolved in 27227 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 179/179 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 28/28 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 2 solved, 259 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/177 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 259 unsolved
At refinement iteration 1 (OVERLAPS) 2/179 variables, 8/8 constraints. Problems are: Problem set: 2 solved, 259 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 28/36 constraints. Problems are: Problem set: 2 solved, 259 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 0/36 constraints. Problems are: Problem set: 2 solved, 259 unsolved
At refinement iteration 4 (OVERLAPS) 262/441 variables, 179/215 constraints. Problems are: Problem set: 2 solved, 259 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/441 variables, 259/474 constraints. Problems are: Problem set: 2 solved, 259 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:36:24] [INFO ] Deduced a trap composed of 45 places in 76 ms of which 10 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/441 variables, 1/475 constraints. Problems are: Problem set: 2 solved, 259 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:36:30] [INFO ] Deduced a trap composed of 34 places in 77 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:36:30] [INFO ] Deduced a trap composed of 34 places in 106 ms of which 12 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/441 variables, 2/477 constraints. Problems are: Problem set: 2 solved, 259 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/441 variables, 3/480 constraints. Problems are: Problem set: 2 solved, 259 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 441/441 variables, and 480 constraints, problems are : Problem set: 2 solved, 259 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 179/179 constraints, PredecessorRefiner: 259/261 constraints, Known Traps: 31/31 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 57471ms problems are : Problem set: 2 solved, 259 unsolved
Search for dead transitions found 2 dead transitions in 57481ms
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 : 179/190 places, 260/273 transitions.
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 0 rules in 4 ms. Remains 179 /179 variables (removed 0) and now considering 260/260 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 57967 ms. Remains : 179/190 places, 260/273 transitions.
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Support contains 97 out of 178 places after structural reductions.
[2025-05-30 23:36:51] [INFO ] Flatten gal took : 40 ms
[2025-05-30 23:36:51] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA AutonomousCar-PT-03b-CTLCardinality-2023-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-05-30 23:36:51] [INFO ] Flatten gal took : 19 ms
[2025-05-30 23:36:51] [INFO ] Input system was already deterministic with 260 transitions.
Support contains 87 out of 178 places (down from 97) after GAL structural reductions.
RANDOM walk for 40000 steps (27 resets) in 1604 ms. (24 steps per ms) remains 8/68 properties
BEST_FIRST walk for 40001 steps (26 resets) in 185 ms. (215 steps per ms) remains 2/8 properties
BEST_FIRST walk for 40000 steps (28 resets) in 137 ms. (289 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40001 steps (33 resets) in 77 ms. (512 steps per ms) remains 1/1 properties
// Phase 1: matrix 260 rows 178 cols
[2025-05-30 23:36:52] [INFO ] Computed 8 invariants in 2 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 64/68 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 110/178 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:36:52] [INFO ] Deduced a trap composed of 8 places in 186 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:36:52] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:36:52] [INFO ] Deduced a trap composed of 44 places in 90 ms of which 9 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/178 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/178 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 260/438 variables, 178/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:36:52] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:36:52] [INFO ] Deduced a trap composed of 25 places in 76 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:36:52] [INFO ] Deduced a trap composed of 43 places in 88 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/438 variables, 3/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:36:52] [INFO ] Deduced a trap along path composed of 3 places in 18 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/438 variables, 1/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/438 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/438 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 438/438 variables, and 193 constraints, problems are : Problem set: 0 solved, 1 unsolved in 863 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 178/178 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 64/68 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 110/178 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/178 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/178 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 260/438 variables, 178/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/438 variables, 1/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/438 variables, 1/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/438 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/438 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 438/438 variables, and 194 constraints, problems are : Problem set: 0 solved, 1 unsolved in 228 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 178/178 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 1109ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 27 ms.
Support contains 4 out of 178 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 178/178 places, 260/260 transitions.
Graph (trivial) has 158 edges and 178 vertex of which 4 / 178 are part of one of the 2 SCC in 2 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 421 edges and 176 vertex of which 171 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 0 with 72 rules applied. Total rules applied 74 place count 171 transition count 181
Reduce places removed 71 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 92 rules applied. Total rules applied 166 place count 100 transition count 160
Reduce places removed 12 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 14 rules applied. Total rules applied 180 place count 88 transition count 158
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 182 place count 86 transition count 158
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 182 place count 86 transition count 152
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 194 place count 80 transition count 152
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 204 place count 70 transition count 142
Iterating global reduction 4 with 10 rules applied. Total rules applied 214 place count 70 transition count 142
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 4 with 36 rules applied. Total rules applied 250 place count 70 transition count 106
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 250 place count 70 transition count 105
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 252 place count 69 transition count 105
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 254 place count 67 transition count 99
Iterating global reduction 5 with 2 rules applied. Total rules applied 256 place count 67 transition count 99
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 3 rules applied. Total rules applied 259 place count 67 transition count 96
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 6 with 2 rules applied. Total rules applied 261 place count 66 transition count 95
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 262 place count 65 transition count 95
Performed 25 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 8 with 50 rules applied. Total rules applied 312 place count 40 transition count 69
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 313 place count 40 transition count 68
Discarding 4 places :
Symmetric choice reduction at 9 with 4 rule applications. Total rules 317 place count 36 transition count 56
Iterating global reduction 9 with 4 rules applied. Total rules applied 321 place count 36 transition count 56
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 322 place count 36 transition count 55
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 10 with 2 rules applied. Total rules applied 324 place count 35 transition count 54
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 4 rules applied. Total rules applied 328 place count 33 transition count 72
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 329 place count 32 transition count 71
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 330 place count 31 transition count 71
Applied a total of 330 rules in 45 ms. Remains 31 /178 variables (removed 147) and now considering 71/260 (removed 189) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 31/178 places, 71/260 transitions.
RANDOM walk for 20998 steps (1643 resets) in 91 ms. (228 steps per ms) remains 0/1 properties
[2025-05-30 23:36:53] [INFO ] Flatten gal took : 32 ms
[2025-05-30 23:36:53] [INFO ] Flatten gal took : 15 ms
[2025-05-30 23:36:53] [INFO ] Input system was already deterministic with 260 transitions.
Computed a total of 38 stabilizing places and 38 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 178/178 places, 260/260 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 160 transition count 242
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 160 transition count 242
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 0 with 36 rules applied. Total rules applied 72 place count 160 transition count 206
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 74 place count 158 transition count 204
Iterating global reduction 1 with 2 rules applied. Total rules applied 76 place count 158 transition count 204
Applied a total of 76 rules in 19 ms. Remains 158 /178 variables (removed 20) and now considering 204/260 (removed 56) transitions.
// Phase 1: matrix 204 rows 158 cols
[2025-05-30 23:36:53] [INFO ] Computed 8 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 23:36:53] [INFO ] Implicit Places using invariants in 60 ms returned []
[2025-05-30 23:36:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 23:36:53] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 179 ms to find 0 implicit places.
Running 203 sub problems to find dead transitions.
[2025-05-30 23:36:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (OVERLAPS) 1/158 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 203 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:36:55] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:36:55] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:36:55] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:36:55] [INFO ] Deduced a trap composed of 28 places in 69 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:36:55] [INFO ] Deduced a trap composed of 29 places in 65 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:36:55] [INFO ] Deduced a trap composed of 29 places in 58 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:36:55] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:36:55] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:36:55] [INFO ] Deduced a trap composed of 25 places in 70 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:36:56] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:36:56] [INFO ] Deduced a trap composed of 34 places in 57 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:36:56] [INFO ] Deduced a trap composed of 35 places in 59 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:36:56] [INFO ] Deduced a trap composed of 35 places in 60 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:36:56] [INFO ] Deduced a trap composed of 34 places in 71 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:36:56] [INFO ] Deduced a trap composed of 31 places in 60 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:36:56] [INFO ] Deduced a trap composed of 32 places in 61 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:36:56] [INFO ] Deduced a trap composed of 32 places in 66 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:36:56] [INFO ] Deduced a trap composed of 31 places in 61 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:36:56] [INFO ] Deduced a trap composed of 32 places in 63 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:36:57] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/158 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 203 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:36:57] [INFO ] Deduced a trap composed of 35 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:36:57] [INFO ] Deduced a trap composed of 40 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:36:57] [INFO ] Deduced a trap composed of 40 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:36:57] [INFO ] Deduced a trap composed of 41 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:36:57] [INFO ] Deduced a trap composed of 41 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:36:57] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 6/34 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 5 (OVERLAPS) 204/362 variables, 158/192 constraints. Problems are: Problem set: 0 solved, 203 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:37:00] [INFO ] Deduced a trap composed of 44 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:37:00] [INFO ] Deduced a trap composed of 5 places in 66 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/362 variables, 2/194 constraints. Problems are: Problem set: 0 solved, 203 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:37:03] [INFO ] Deduced a trap along path composed of 3 places in 22 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:37:03] [INFO ] Deduced a trap along path composed of 3 places in 21 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:37:03] [INFO ] Deduced a trap along path composed of 3 places in 21 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/362 variables, 3/197 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/362 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 9 (OVERLAPS) 0/362 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 203 unsolved
No progress, stopping.
After SMT solving in domain Real declared 362/362 variables, and 197 constraints, problems are : Problem set: 0 solved, 203 unsolved in 16997 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 28/28 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 203 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (OVERLAPS) 1/158 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/158 variables, 28/36 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 4 (OVERLAPS) 204/362 variables, 158/194 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/362 variables, 203/397 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/362 variables, 3/400 constraints. Problems are: Problem set: 0 solved, 203 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:37:15] [INFO ] Deduced a trap composed of 39 places in 62 ms of which 9 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/362 variables, 1/401 constraints. Problems are: Problem set: 0 solved, 203 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:37:21] [INFO ] Deduced a trap along path composed of 2 places in 40 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:37:21] [INFO ] Deduced a trap along path composed of 3 places in 46 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:37:22] [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:37:22] [INFO ] Deduced a trap along path composed of 7 places in 24 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/362 variables, 4/405 constraints. Problems are: Problem set: 0 solved, 203 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 362/362 variables, and 405 constraints, problems are : Problem set: 0 solved, 203 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 29/29 constraints, Known Traps Along Path: 7/7 constraints]
After SMT, in 47052ms problems are : Problem set: 0 solved, 203 unsolved
Search for dead transitions found 0 dead transitions in 47055ms
Starting structural reductions in LTL mode, iteration 1 : 158/178 places, 204/260 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47255 ms. Remains : 158/178 places, 204/260 transitions.
[2025-05-30 23:37:40] [INFO ] Flatten gal took : 11 ms
[2025-05-30 23:37:40] [INFO ] Flatten gal took : 9 ms
[2025-05-30 23:37:40] [INFO ] Input system was already deterministic with 204 transitions.
[2025-05-30 23:37:40] [INFO ] Flatten gal took : 9 ms
[2025-05-30 23:37:40] [INFO ] Flatten gal took : 9 ms
[2025-05-30 23:37:40] [INFO ] Time to serialize gal into /tmp/CTLCardinality16290040873684668264.gal : 4 ms
[2025-05-30 23:37:40] [INFO ] Time to serialize properties into /tmp/CTLCardinality8567533107555710656.ctl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality16290040873684668264.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8567533107555710656.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,5.55967e+07,1.36881,50640,2,6171,5,180790,6,0,838,245023,0


Converting to forward existential form...Done !
original formula: E(E(EG(((p100!=1) + A((p6==1) U ((p136==0)||(p55==1))))) U (!(EX(TRUE)) * EX(((p162==0)||(p122==1))))) U !((!(((EX((p25==0)) * AX((p78==1...229
=> equivalent forward existential formula: ([(((FwdU(Init,E(EG(((p100!=1) + !((E(!(((p136==0)||(p55==1))) U (!((p6==1)) * !(((p136==0)||(p55==1))))) + EG(!...597
Reverse transition relation is NOT exact ! Due to transitions t10, t16, t17, t25, t33, t36, t37, t38, t66, t67, t70, t71, t73, t86, t92, t93, t96, t97, t99...371
Detected timeout of ITS tools.
[2025-05-30 23:38:10] [INFO ] Flatten gal took : 12 ms
[2025-05-30 23:38:10] [INFO ] Applying decomposition
[2025-05-30 23:38:10] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph3698491136423215947.txt' '-o' '/tmp/graph3698491136423215947.bin' '-w' '/tmp/graph3698491136423215947.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3698491136423215947.bin' '-l' '-1' '-v' '-w' '/tmp/graph3698491136423215947.weights' '-q' '0' '-e' '0.001'
[2025-05-30 23:38:10] [INFO ] Decomposing Gal with order
[2025-05-30 23:38:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 23:38:10] [INFO ] Removed a total of 118 redundant transitions.
[2025-05-30 23:38:11] [INFO ] Flatten gal took : 46 ms
[2025-05-30 23:38:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 9 ms.
[2025-05-30 23:38:11] [INFO ] Time to serialize gal into /tmp/CTLCardinality7481521341919082611.gal : 6 ms
[2025-05-30 23:38:11] [INFO ] Time to serialize properties into /tmp/CTLCardinality13057358757421439292.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/CTLCardinality7481521341919082611.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13057358757421439292.ctl'

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 -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.55967e+07,0.04403,5576,434,79,2743,460,424,3708,76,1228,0


Converting to forward existential form...Done !
original formula: E(E(EG(((i9.i1.u31.p100!=1) + A((i0.u1.p6==1) U ((i10.i1.u43.p136==0)||(i4.i1.u17.p55==1))))) U (!(EX(TRUE)) * EX(((i11.u47.p162==0)||(i1...345
=> equivalent forward existential formula: ([(((FwdU(Init,E(EG(((i9.i1.u31.p100!=1) + !((E(!(((i10.i1.u43.p136==0)||(i4.i1.u17.p55==1))) U (!((i0.u1.p6==1)...873
Reverse transition relation is NOT exact ! Due to transitions t146, t151, t169, t181, t201, u36.t33, u36.t36, u36.t37, u36.t38, i0.t144, i4.i0.u14.t121, i4...536
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 2
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 2
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
(forward)formula 0,0,3.10626,134472,1,0,290231,1653,2844,350104,417,8668,354894
FORMULA AutonomousCar-PT-03b-CTLCardinality-2025-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 178/178 places, 260/260 transitions.
Graph (trivial) has 153 edges and 178 vertex of which 4 / 178 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 68 transitions
Trivial Post-agglo rules discarded 68 transitions
Performed 68 trivial Post agglomeration. Transition count delta: 68
Iterating post reduction 0 with 68 rules applied. Total rules applied 69 place count 175 transition count 189
Reduce places removed 68 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 85 rules applied. Total rules applied 154 place count 107 transition count 172
Reduce places removed 9 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 11 rules applied. Total rules applied 165 place count 98 transition count 170
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 167 place count 96 transition count 170
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 167 place count 96 transition count 163
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 181 place count 89 transition count 163
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 191 place count 79 transition count 153
Iterating global reduction 4 with 10 rules applied. Total rules applied 201 place count 79 transition count 153
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 4 with 36 rules applied. Total rules applied 237 place count 79 transition count 117
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 237 place count 79 transition count 116
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 239 place count 78 transition count 116
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 241 place count 76 transition count 110
Iterating global reduction 5 with 2 rules applied. Total rules applied 243 place count 76 transition count 110
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 245 place count 76 transition count 108
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 246 place count 75 transition count 108
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 7 with 40 rules applied. Total rules applied 286 place count 55 transition count 88
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 291 place count 50 transition count 72
Iterating global reduction 7 with 5 rules applied. Total rules applied 296 place count 50 transition count 72
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 2 rules applied. Total rules applied 298 place count 50 transition count 70
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 299 place count 49 transition count 70
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 300 place count 49 transition count 69
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 301 place count 49 transition count 69
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 302 place count 48 transition count 68
Applied a total of 302 rules in 39 ms. Remains 48 /178 variables (removed 130) and now considering 68/260 (removed 192) transitions.
// Phase 1: matrix 68 rows 48 cols
[2025-05-30 23:38:14] [INFO ] Computed 7 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 23:38:14] [INFO ] Implicit Places using invariants in 54 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 56 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 47/178 places, 68/260 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 46 transition count 67
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 46 transition count 67
Applied a total of 2 rules in 3 ms. Remains 46 /47 variables (removed 1) and now considering 67/68 (removed 1) transitions.
// Phase 1: matrix 67 rows 46 cols
[2025-05-30 23:38:14] [INFO ] Computed 6 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 23:38:14] [INFO ] Implicit Places using invariants in 31 ms returned []
[2025-05-30 23:38:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 23:38:14] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-30 23:38:14] [INFO ] Implicit Places using invariants and state equation in 57 ms returned [45]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 89 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 45/178 places, 67/260 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 44 transition count 66
Applied a total of 2 rules in 3 ms. Remains 44 /45 variables (removed 1) and now considering 66/67 (removed 1) transitions.
// Phase 1: matrix 66 rows 44 cols
[2025-05-30 23:38:14] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 23:38:14] [INFO ] Implicit Places using invariants in 32 ms returned []
[2025-05-30 23:38:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 23:38:14] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-30 23:38:14] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 3 : 44/178 places, 66/260 transitions.
Finished structural reductions in SI_CTL mode , in 3 iterations and 272 ms. Remains : 44/178 places, 66/260 transitions.
[2025-05-30 23:38:14] [INFO ] Flatten gal took : 10 ms
[2025-05-30 23:38:14] [INFO ] Flatten gal took : 4 ms
[2025-05-30 23:38:14] [INFO ] Input system was already deterministic with 66 transitions.
[2025-05-30 23:38:14] [INFO ] Flatten gal took : 3 ms
[2025-05-30 23:38:14] [INFO ] Flatten gal took : 3 ms
[2025-05-30 23:38:14] [INFO ] Time to serialize gal into /tmp/CTLCardinality5383338601936021682.gal : 1 ms
[2025-05-30 23:38:14] [INFO ] Time to serialize properties into /tmp/CTLCardinality9191906797288579122.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/CTLCardinality5383338601936021682.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9191906797288579122.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,75732,0.024923,4748,2,604,5,3739,6,0,240,3927,0


Converting to forward existential form...Done !
original formula: AG(((!(E(EG((p99==0)) U !(A(((p96==0)||(p9==1)) U (p92==1))))) + AG(EF(((p140==0)&&(p164==1))))) + (((p103==0)&&(p14==0))&&(p119==1))))
=> equivalent forward existential formula: [(FwdU(((FwdU(Init,TRUE) * !((((p103==0)&&(p14==0))&&(p119==1)))) * !(!(E(EG((p99==0)) U !(!((E(!((p92==1)) U (!...271
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t3, t5, t6, t8, t9, t11, t21, t23, t25, t27, t62, t65, Intersection with reachable a...223
(forward)formula 0,0,1.12325,49148,1,0,1184,264924,175,542,2025,289966,1352
FORMULA AutonomousCar-PT-03b-CTLCardinality-2025-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 178/178 places, 260/260 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 159 transition count 241
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 159 transition count 241
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 0 with 36 rules applied. Total rules applied 74 place count 159 transition count 205
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 78 place count 155 transition count 201
Iterating global reduction 1 with 4 rules applied. Total rules applied 82 place count 155 transition count 201
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 83 place count 154 transition count 200
Iterating global reduction 1 with 1 rules applied. Total rules applied 84 place count 154 transition count 200
Applied a total of 84 rules in 9 ms. Remains 154 /178 variables (removed 24) and now considering 200/260 (removed 60) transitions.
// Phase 1: matrix 200 rows 154 cols
[2025-05-30 23:38:15] [INFO ] Computed 8 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 23:38:15] [INFO ] Implicit Places using invariants in 59 ms returned []
[2025-05-30 23:38:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 23:38:15] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 173 ms to find 0 implicit places.
Running 199 sub problems to find dead transitions.
[2025-05-30 23:38:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 1 (OVERLAPS) 1/154 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 199 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:38:17] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:38:17] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:38:17] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:38:17] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:38:17] [INFO ] Deduced a trap composed of 31 places in 58 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:38:17] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:38:17] [INFO ] Deduced a trap composed of 29 places in 63 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:38:17] [INFO ] Deduced a trap composed of 29 places in 63 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:38:18] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:38:18] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:38:18] [INFO ] Deduced a trap composed of 30 places in 53 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:38:18] [INFO ] Deduced a trap composed of 31 places in 56 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:38:18] [INFO ] Deduced a trap composed of 31 places in 54 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:38:18] [INFO ] Deduced a trap composed of 31 places in 67 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:38:18] [INFO ] Deduced a trap composed of 32 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:38:18] [INFO ] Deduced a trap composed of 18 places in 66 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:38:18] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:38:18] [INFO ] Deduced a trap composed of 32 places in 60 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:38:18] [INFO ] Deduced a trap composed of 33 places in 59 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:38:19] [INFO ] Deduced a trap composed of 32 places in 57 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 199 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:38:19] [INFO ] Deduced a trap composed of 39 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:38:19] [INFO ] Deduced a trap composed of 32 places in 61 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:38:19] [INFO ] Deduced a trap composed of 40 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:38:19] [INFO ] Deduced a trap composed of 40 places in 56 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:38:19] [INFO ] Deduced a trap composed of 41 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:38:19] [INFO ] Deduced a trap composed of 42 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:38:19] [INFO ] Deduced a trap composed of 41 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:38:19] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:38:20] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:38:20] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:38:20] [INFO ] Deduced a trap composed of 33 places in 56 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:38:20] [INFO ] Deduced a trap composed of 33 places in 57 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 12/40 constraints. Problems are: Problem set: 0 solved, 199 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:38:21] [INFO ] Deduced a trap composed of 5 places in 66 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/154 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 6 (OVERLAPS) 200/354 variables, 154/195 constraints. Problems are: Problem set: 0 solved, 199 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:38:24] [INFO ] Deduced a trap composed of 25 places in 70 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:38:24] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/354 variables, 2/197 constraints. Problems are: Problem set: 0 solved, 199 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:38:26] [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:38:26] [INFO ] Deduced a trap along path composed of 3 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:38:27] [INFO ] Deduced a trap along path composed of 3 places in 25 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/354 variables, 3/200 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/354 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 10 (OVERLAPS) 0/354 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 199 unsolved
No progress, stopping.
After SMT solving in domain Real declared 354/354 variables, and 200 constraints, problems are : Problem set: 0 solved, 199 unsolved in 16371 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 199/199 constraints, Known Traps: 35/35 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 199 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 1 (OVERLAPS) 1/154 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 35/43 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 4 (OVERLAPS) 200/354 variables, 154/197 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/354 variables, 199/396 constraints. Problems are: Problem set: 0 solved, 199 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:38:33] [INFO ] Deduced a trap composed of 51 places in 54 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/354 variables, 1/397 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/354 variables, 3/400 constraints. Problems are: Problem set: 0 solved, 199 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:38:42] [INFO ] Deduced a trap along path composed of 3 places in 52 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:38:42] [INFO ] Deduced a trap along path composed of 2 places in 22 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:38:43] [INFO ] Deduced a trap along path composed of 7 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:38:45] [INFO ] Deduced a trap along path composed of 2 places in 39 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/354 variables, 4/404 constraints. Problems are: Problem set: 0 solved, 199 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:38:53] [INFO ] Deduced a trap composed of 41 places in 46 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/354 variables, 1/405 constraints. Problems are: Problem set: 0 solved, 199 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 354/354 variables, and 405 constraints, problems are : Problem set: 0 solved, 199 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 199/199 constraints, Known Traps: 37/37 constraints, Known Traps Along Path: 7/7 constraints]
After SMT, in 46424ms problems are : Problem set: 0 solved, 199 unsolved
Search for dead transitions found 0 dead transitions in 46425ms
Starting structural reductions in LTL mode, iteration 1 : 154/178 places, 200/260 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46608 ms. Remains : 154/178 places, 200/260 transitions.
[2025-05-30 23:39:02] [INFO ] Flatten gal took : 11 ms
[2025-05-30 23:39:02] [INFO ] Flatten gal took : 10 ms
[2025-05-30 23:39:02] [INFO ] Input system was already deterministic with 200 transitions.
[2025-05-30 23:39:02] [INFO ] Flatten gal took : 7 ms
[2025-05-30 23:39:02] [INFO ] Flatten gal took : 6 ms
[2025-05-30 23:39:02] [INFO ] Time to serialize gal into /tmp/CTLCardinality2318019632843968157.gal : 2 ms
[2025-05-30 23:39:02] [INFO ] Time to serialize properties into /tmp/CTLCardinality3928346043979426735.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/CTLCardinality2318019632843968157.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3928346043979426735.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,5.11971e+07,1.24819,45044,2,6377,5,160810,6,0,818,212741,0


Converting to forward existential form...Done !
original formula: AX(EG((((p18==1)||(p96==0))||((p60==0)&&((p2==0)||(p8==1))))))
=> equivalent forward existential formula: [(EY(Init) * !(EG((((p18==1)||(p96==0))||((p60==0)&&((p2==0)||(p8==1)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t10, t16, t17, t24, t32, t35, t36, t37, t63, t64, t67, t68, t70, t83, t89, t90, t93, t94, t96...371
Detected timeout of ITS tools.
[2025-05-30 23:39:32] [INFO ] Flatten gal took : 9 ms
[2025-05-30 23:39:32] [INFO ] Applying decomposition
[2025-05-30 23:39:32] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph17718095072589769437.txt' '-o' '/tmp/graph17718095072589769437.bin' '-w' '/tmp/graph17718095072589769437.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17718095072589769437.bin' '-l' '-1' '-v' '-w' '/tmp/graph17718095072589769437.weights' '-q' '0' '-e' '0.001'
[2025-05-30 23:39:32] [INFO ] Decomposing Gal with order
[2025-05-30 23:39:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 23:39:32] [INFO ] Removed a total of 123 redundant transitions.
[2025-05-30 23:39:32] [INFO ] Flatten gal took : 15 ms
[2025-05-30 23:39:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 3 ms.
[2025-05-30 23:39:32] [INFO ] Time to serialize gal into /tmp/CTLCardinality13805844638806884782.gal : 3 ms
[2025-05-30 23:39:32] [INFO ] Time to serialize properties into /tmp/CTLCardinality5439335774027513893.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/CTLCardinality13805844638806884782.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5439335774027513893.ctl'

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 -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.11971e+07,0.048138,5780,397,73,3236,609,375,4170,68,1194,0


Converting to forward existential form...Done !
original formula: AX(EG((((i1.u5.p18==1)||(i8.u32.p96==0))||((i7.i0.u19.p60==0)&&((i0.u1.p2==0)||(i0.u1.p8==1))))))
=> equivalent forward existential formula: [(EY(Init) * !(EG((((i1.u5.p18==1)||(i8.u32.p96==0))||((i7.i0.u19.p60==0)&&((i0.u1.p2==0)||(i0.u1.p8==1)))))))] ...162
Reverse transition relation is NOT exact ! Due to transitions t148, t169, t181, t197, i0.t144, i0.t142, i3.u15.t119, i3.u15.t122, i3.u16.t120, i4.i1.t135, ...531
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
(forward)formula 0,1,3.06716,131988,1,0,290820,1789,2296,368970,347,10032,386319
FORMULA AutonomousCar-PT-03b-CTLCardinality-2025-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 178/178 places, 260/260 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 163 transition count 245
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 163 transition count 245
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 32 place count 161 transition count 243
Iterating global reduction 0 with 2 rules applied. Total rules applied 34 place count 161 transition count 243
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 160 transition count 242
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 160 transition count 242
Applied a total of 36 rules in 10 ms. Remains 160 /178 variables (removed 18) and now considering 242/260 (removed 18) transitions.
// Phase 1: matrix 242 rows 160 cols
[2025-05-30 23:39:35] [INFO ] Computed 8 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 23:39:35] [INFO ] Implicit Places using invariants in 63 ms returned []
[2025-05-30 23:39:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 23:39:35] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
Running 241 sub problems to find dead transitions.
[2025-05-30 23:39:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (OVERLAPS) 1/160 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 241 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:39:37] [INFO ] Deduced a trap composed of 15 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:39:37] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:39:37] [INFO ] Deduced a trap composed of 26 places in 63 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:39:37] [INFO ] Deduced a trap composed of 42 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:39:38] [INFO ] Deduced a trap composed of 21 places in 72 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:39:38] [INFO ] Deduced a trap composed of 25 places in 71 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:39:38] [INFO ] Deduced a trap composed of 34 places in 67 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:39:38] [INFO ] Deduced a trap composed of 28 places in 67 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:39:38] [INFO ] Deduced a trap composed of 29 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:39:38] [INFO ] Deduced a trap composed of 29 places in 63 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:39:38] [INFO ] Deduced a trap composed of 17 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:39:38] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:39:38] [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:39:38] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:39:38] [INFO ] Deduced a trap composed of 30 places in 64 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:39:38] [INFO ] Deduced a trap composed of 31 places in 65 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:39:38] [INFO ] Deduced a trap composed of 31 places in 67 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:39:39] [INFO ] Deduced a trap composed of 31 places in 69 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:39:39] [INFO ] Deduced a trap composed of 31 places in 63 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:39:39] [INFO ] Deduced a trap composed of 33 places in 58 ms of which 7 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 241 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:39:39] [INFO ] Deduced a trap composed of 32 places in 70 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:39:39] [INFO ] Deduced a trap composed of 33 places in 63 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:39:39] [INFO ] Deduced a trap composed of 33 places in 69 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:39:39] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:39:40] [INFO ] Deduced a trap composed of 6 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:39:40] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:39:40] [INFO ] Deduced a trap composed of 31 places in 61 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:39:40] [INFO ] Deduced a trap composed of 32 places in 56 ms of which 9 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 8/36 constraints. Problems are: Problem set: 0 solved, 241 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:39:41] [INFO ] Deduced a trap composed of 33 places in 68 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:39:41] [INFO ] Deduced a trap composed of 33 places in 67 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:39:42] [INFO ] Deduced a trap composed of 8 places in 70 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:39:42] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/160 variables, 4/40 constraints. Problems are: Problem set: 0 solved, 241 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:39:42] [INFO ] Deduced a trap composed of 40 places in 60 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:39:42] [INFO ] Deduced a trap composed of 40 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:39:43] [INFO ] Deduced a trap composed of 40 places in 54 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:39:43] [INFO ] Deduced a trap composed of 41 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:39:43] [INFO ] Deduced a trap composed of 41 places in 53 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:39:43] [INFO ] Deduced a trap composed of 41 places in 59 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/160 variables, 6/46 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (OVERLAPS) 242/402 variables, 160/206 constraints. Problems are: Problem set: 0 solved, 241 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:39:47] [INFO ] Deduced a trap along path composed of 3 places in 24 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:39:47] [INFO ] Deduced a trap along path composed of 3 places in 21 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:39:47] [INFO ] Deduced a trap along path composed of 3 places in 22 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/402 variables, 3/209 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/402 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 10 (OVERLAPS) 0/402 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Real declared 402/402 variables, and 209 constraints, problems are : Problem set: 0 solved, 241 unsolved in 21576 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 160/160 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 38/38 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 241 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (OVERLAPS) 1/160 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 38/46 constraints. Problems are: Problem set: 0 solved, 241 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:39:57] [INFO ] Deduced a trap composed of 42 places in 50 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/160 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/402 variables, 160/207 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/402 variables, 241/448 constraints. Problems are: Problem set: 0 solved, 241 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:40:01] [INFO ] Deduced a trap composed of 41 places in 49 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/402 variables, 1/449 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/402 variables, 3/452 constraints. Problems are: Problem set: 0 solved, 241 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:40:15] [INFO ] Deduced a trap along path composed of 4 places in 44 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:40:15] [INFO ] Deduced a trap along path composed of 2 places in 23 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:40:15] [INFO ] Deduced a trap along path composed of 12 places in 45 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:40:17] [INFO ] Deduced a trap along path composed of 7 places in 39 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/402 variables, 4/456 constraints. Problems are: Problem set: 0 solved, 241 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 402/402 variables, and 456 constraints, problems are : Problem set: 0 solved, 241 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 160/160 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 40/40 constraints, Known Traps Along Path: 7/7 constraints]
After SMT, in 51701ms problems are : Problem set: 0 solved, 241 unsolved
Search for dead transitions found 0 dead transitions in 51702ms
Starting structural reductions in LTL mode, iteration 1 : 160/178 places, 242/260 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51893 ms. Remains : 160/178 places, 242/260 transitions.
[2025-05-30 23:40:27] [INFO ] Flatten gal took : 8 ms
[2025-05-30 23:40:27] [INFO ] Flatten gal took : 7 ms
[2025-05-30 23:40:27] [INFO ] Input system was already deterministic with 242 transitions.
[2025-05-30 23:40:27] [INFO ] Flatten gal took : 8 ms
[2025-05-30 23:40:27] [INFO ] Flatten gal took : 7 ms
[2025-05-30 23:40:27] [INFO ] Time to serialize gal into /tmp/CTLCardinality4542318904131842952.gal : 2 ms
[2025-05-30 23:40:27] [INFO ] Time to serialize properties into /tmp/CTLCardinality16277455314038570048.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/CTLCardinality4542318904131842952.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16277455314038570048.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,6.70768e+07,1.18475,45020,2,7294,5,153506,6,0,884,188713,0


Converting to forward existential form...Done !
original formula: EF(((E((E((((p62==1)||(p151==0))||(p6==1)) U ((p136==0)||(p8==1))) * !(EX((p126==1)))) U ((((p62!=1) * EF((p77==1))) * !(AG(((p3==0)||(p1...271
=> equivalent forward existential formula: [(((FwdU(Init,TRUE) * (E((E((((p62==1)||(p151==0))||(p6==1)) U ((p136==0)||(p8==1))) * !(EX((p126==1)))) U ((((p...359
Reverse transition relation is NOT exact ! Due to transitions t10, t16, t17, t24, t33, t37, t38, t66, t67, t70, t71, t73, t86, t93, t94, t97, t98, t100, t1...433
Detected timeout of ITS tools.
[2025-05-30 23:40:57] [INFO ] Flatten gal took : 13 ms
[2025-05-30 23:40:57] [INFO ] Applying decomposition
[2025-05-30 23:40:57] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph16129967997126582677.txt' '-o' '/tmp/graph16129967997126582677.bin' '-w' '/tmp/graph16129967997126582677.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16129967997126582677.bin' '-l' '-1' '-v' '-w' '/tmp/graph16129967997126582677.weights' '-q' '0' '-e' '0.001'
[2025-05-30 23:40:57] [INFO ] Decomposing Gal with order
[2025-05-30 23:40:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 23:40:57] [INFO ] Removed a total of 207 redundant transitions.
[2025-05-30 23:40:57] [INFO ] Flatten gal took : 14 ms
[2025-05-30 23:40:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 24 labels/synchronizations in 2 ms.
[2025-05-30 23:40:57] [INFO ] Time to serialize gal into /tmp/CTLCardinality17285675426131237284.gal : 2 ms
[2025-05-30 23:40:57] [INFO ] Time to serialize properties into /tmp/CTLCardinality7005542461667404134.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/CTLCardinality17285675426131237284.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7005542461667404134.ctl'

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 -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.70768e+07,0.080995,7860,473,99,5723,1038,398,17772,79,5292,0


Converting to forward existential form...Done !
original formula: EF(((E((E((((i4.u17.p62==1)||(i9.i1.u47.p151==0))||(i8.u1.p6==1)) U ((i7.i1.u44.p136==0)||(i9.i0.u2.p8==1))) * !(EX((i7.i0.u38.p126==1)))...414
=> equivalent forward existential formula: [(((FwdU(Init,TRUE) * (E((E((((i4.u17.p62==1)||(i9.i1.u47.p151==0))||(i8.u1.p6==1)) U ((i7.i1.u44.p136==0)||(i9....502
Reverse transition relation is NOT exact ! Due to transitions t148, t156, t216, t239, i0.t33, i0.u46.t37, i0.u46.t38, i2.i1.t139, i2.i1.u10.t119, i2.i1.u16...531
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 2
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
(forward)formula 0,1,7.97449,202720,1,0,327901,4042,2632,956962,446,36606,347276
FORMULA AutonomousCar-PT-03b-CTLCardinality-2025-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 178/178 places, 260/260 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 159 transition count 241
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 159 transition count 241
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 0 with 36 rules applied. Total rules applied 74 place count 159 transition count 205
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 78 place count 155 transition count 201
Iterating global reduction 1 with 4 rules applied. Total rules applied 82 place count 155 transition count 201
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 83 place count 154 transition count 200
Iterating global reduction 1 with 1 rules applied. Total rules applied 84 place count 154 transition count 200
Applied a total of 84 rules in 9 ms. Remains 154 /178 variables (removed 24) and now considering 200/260 (removed 60) transitions.
// Phase 1: matrix 200 rows 154 cols
[2025-05-30 23:41:05] [INFO ] Computed 8 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 23:41:05] [INFO ] Implicit Places using invariants in 53 ms returned []
[2025-05-30 23:41:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 23:41:05] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 149 ms to find 0 implicit places.
Running 199 sub problems to find dead transitions.
[2025-05-30 23:41:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 1 (OVERLAPS) 1/154 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 199 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:41:07] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:41:07] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:41:07] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:41:07] [INFO ] Deduced a trap composed of 40 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:41:07] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:41:07] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:41:07] [INFO ] Deduced a trap composed of 29 places in 62 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:41:07] [INFO ] Deduced a trap composed of 29 places in 65 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:41:07] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:41:07] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:41:08] [INFO ] Deduced a trap composed of 24 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:41:08] [INFO ] Deduced a trap composed of 31 places in 60 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:41:08] [INFO ] Deduced a trap composed of 40 places in 53 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:41:08] [INFO ] Deduced a trap composed of 40 places in 53 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:41:08] [INFO ] Deduced a trap composed of 41 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:41:08] [INFO ] Deduced a trap composed of 41 places in 54 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:41:08] [INFO ] Deduced a trap composed of 41 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:41:08] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:41:08] [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:41:08] [INFO ] Deduced a trap composed of 5 places in 45 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 199 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:41:09] [INFO ] Deduced a trap composed of 31 places in 68 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:41:09] [INFO ] Deduced a trap composed of 41 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:41:09] [INFO ] Deduced a trap composed of 32 places in 64 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:41:09] [INFO ] Deduced a trap composed of 31 places in 69 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:41:09] [INFO ] Deduced a trap composed of 32 places in 69 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:41:09] [INFO ] Deduced a trap composed of 32 places in 68 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:41:09] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 7/35 constraints. Problems are: Problem set: 0 solved, 199 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:41:10] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:41:10] [INFO ] Deduced a trap composed of 31 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:41:10] [INFO ] Deduced a trap composed of 33 places in 64 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:41:11] [INFO ] Deduced a trap composed of 31 places in 69 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:41:11] [INFO ] Deduced a trap composed of 34 places in 51 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:41:11] [INFO ] Deduced a trap composed of 31 places in 61 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:41:11] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:41:11] [INFO ] Deduced a trap composed of 26 places in 63 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:41:11] [INFO ] Deduced a trap composed of 32 places in 55 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 9/44 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/154 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 6 (OVERLAPS) 200/354 variables, 154/198 constraints. Problems are: Problem set: 0 solved, 199 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:41:14] [INFO ] Deduced a trap composed of 34 places in 58 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/354 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 199 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:41:16] [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:41:17] [INFO ] Deduced a trap along path composed of 3 places in 25 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:41:17] [INFO ] Deduced a trap along path composed of 3 places in 20 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/354 variables, 3/202 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/354 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 10 (OVERLAPS) 0/354 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 199 unsolved
No progress, stopping.
After SMT solving in domain Real declared 354/354 variables, and 202 constraints, problems are : Problem set: 0 solved, 199 unsolved in 17565 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 199/199 constraints, Known Traps: 37/37 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 199 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 1 (OVERLAPS) 1/154 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 37/45 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 4 (OVERLAPS) 200/354 variables, 154/199 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/354 variables, 199/398 constraints. Problems are: Problem set: 0 solved, 199 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:41:25] [INFO ] Deduced a trap composed of 39 places in 56 ms of which 8 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/354 variables, 1/399 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/354 variables, 3/402 constraints. Problems are: Problem set: 0 solved, 199 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:41:34] [INFO ] Deduced a trap along path composed of 2 places in 56 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:41:34] [INFO ] Deduced a trap along path composed of 3 places in 74 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:41:34] [INFO ] Deduced a trap along path composed of 2 places in 25 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/354 variables, 3/405 constraints. Problems are: Problem set: 0 solved, 199 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:41:47] [INFO ] Deduced a trap composed of 38 places in 69 ms of which 9 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/354 variables, 1/406 constraints. Problems are: Problem set: 0 solved, 199 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 354/354 variables, and 406 constraints, problems are : Problem set: 0 solved, 199 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 199/199 constraints, Known Traps: 39/39 constraints, Known Traps Along Path: 6/6 constraints]
After SMT, in 47627ms problems are : Problem set: 0 solved, 199 unsolved
Search for dead transitions found 0 dead transitions in 47628ms
Starting structural reductions in LTL mode, iteration 1 : 154/178 places, 200/260 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47786 ms. Remains : 154/178 places, 200/260 transitions.
[2025-05-30 23:41:53] [INFO ] Flatten gal took : 7 ms
[2025-05-30 23:41:53] [INFO ] Flatten gal took : 5 ms
[2025-05-30 23:41:53] [INFO ] Input system was already deterministic with 200 transitions.
[2025-05-30 23:41:53] [INFO ] Flatten gal took : 5 ms
[2025-05-30 23:41:53] [INFO ] Flatten gal took : 5 ms
[2025-05-30 23:41:53] [INFO ] Time to serialize gal into /tmp/CTLCardinality4636039714389674153.gal : 17 ms
[2025-05-30 23:41:53] [INFO ] Time to serialize properties into /tmp/CTLCardinality2577307712938294156.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/CTLCardinality4636039714389674153.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2577307712938294156.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,5.09416e+07,1.31015,42376,2,6438,5,150502,6,0,818,195603,0


Converting to forward existential form...Done !
original formula: AF((!(E(AG((p133==1)) U (((p10==0)||(p59==1)) * A((p189==1) U ((p85==0)||(p80==1)))))) + EG((EF(((p179==0)&&(p47==1))) * EX((p90==0))))))
=> equivalent forward existential formula: [FwdG(Init,!((!(E(!(E(TRUE U !((p133==1)))) U (((p10==0)||(p59==1)) * !((E(!(((p85==0)||(p80==1))) U (!((p189==1...287
Reverse transition relation is NOT exact ! Due to transitions t10, t17, t18, t25, t33, t36, t37, t38, t64, t65, t68, t69, t71, t84, t90, t91, t94, t95, t97...371
Using saturation style SCC detection
Detected timeout of ITS tools.
[2025-05-30 23:42:23] [INFO ] Flatten gal took : 5 ms
[2025-05-30 23:42:23] [INFO ] Applying decomposition
[2025-05-30 23:42:23] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph486245985613609974.txt' '-o' '/tmp/graph486245985613609974.bin' '-w' '/tmp/graph486245985613609974.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph486245985613609974.bin' '-l' '-1' '-v' '-w' '/tmp/graph486245985613609974.weights' '-q' '0' '-e' '0.001'
[2025-05-30 23:42:23] [INFO ] Decomposing Gal with order
[2025-05-30 23:42:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 23:42:23] [INFO ] Removed a total of 116 redundant transitions.
[2025-05-30 23:42:23] [INFO ] Flatten gal took : 10 ms
[2025-05-30 23:42:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 10 ms.
[2025-05-30 23:42:23] [INFO ] Time to serialize gal into /tmp/CTLCardinality11620238756634901866.gal : 2 ms
[2025-05-30 23:42:23] [INFO ] Time to serialize properties into /tmp/CTLCardinality11000275553018313749.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/CTLCardinality11620238756634901866.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11000275553018313749.ctl'

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 -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.09416e+07,0.084751,5488,353,77,2814,597,367,3612,72,1203,0


Converting to forward existential form...Done !
original formula: AF((!(E(AG((i9.i1.u40.p133==1)) U (((i10.u3.p10==0)||(i6.u19.p59==1)) * A((i13.u49.p189==1) U ((i5.u26.p85==0)||(i5.u25.p80==1)))))) + EG...226
=> equivalent forward existential formula: [FwdG(Init,!((!(E(!(E(TRUE U !((i9.i1.u40.p133==1)))) U (((i10.u3.p10==0)||(i6.u19.p59==1)) * !((E(!(((i5.u26.p8...386
Reverse transition relation is NOT exact ! Due to transitions t151, t169, t181, t197, i2.u14.t119, i2.u14.t122, i2.u15.t120, i3.t135, i3.u9.t115, i3.u17.t1...521
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local SCC at level 13
Fast SCC detection found an SCC at level 14
(forward)formula 0,1,1.29615,58992,1,0,126615,1648,2493,157682,396,7081,164716
FORMULA AutonomousCar-PT-03b-CTLCardinality-2025-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 178/178 places, 260/260 transitions.
Graph (trivial) has 168 edges and 178 vertex of which 4 / 178 are part of one of the 2 SCC in 7 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 80 transitions
Trivial Post-agglo rules discarded 80 transitions
Performed 80 trivial Post agglomeration. Transition count delta: 80
Iterating post reduction 0 with 80 rules applied. Total rules applied 81 place count 175 transition count 177
Reduce places removed 80 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 101 rules applied. Total rules applied 182 place count 95 transition count 156
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 194 place count 83 transition count 156
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 194 place count 83 transition count 150
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 206 place count 77 transition count 150
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 216 place count 67 transition count 140
Iterating global reduction 3 with 10 rules applied. Total rules applied 226 place count 67 transition count 140
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 3 with 36 rules applied. Total rules applied 262 place count 67 transition count 104
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 262 place count 67 transition count 103
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 264 place count 66 transition count 103
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 266 place count 64 transition count 97
Iterating global reduction 4 with 2 rules applied. Total rules applied 268 place count 64 transition count 97
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 4 rules applied. Total rules applied 272 place count 64 transition count 93
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 274 place count 62 transition count 93
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 6 with 42 rules applied. Total rules applied 316 place count 41 transition count 72
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 317 place count 41 transition count 71
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 321 place count 37 transition count 59
Iterating global reduction 7 with 4 rules applied. Total rules applied 325 place count 37 transition count 59
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 2 rules applied. Total rules applied 327 place count 37 transition count 57
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 328 place count 36 transition count 57
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 9 with 2 rules applied. Total rules applied 330 place count 35 transition count 56
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 331 place count 35 transition count 55
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 333 place count 33 transition count 53
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 334 place count 32 transition count 53
Applied a total of 334 rules in 54 ms. Remains 32 /178 variables (removed 146) and now considering 53/260 (removed 207) transitions.
// Phase 1: matrix 53 rows 32 cols
[2025-05-30 23:42:25] [INFO ] Computed 6 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 23:42:25] [INFO ] Implicit Places using invariants in 31 ms returned []
[2025-05-30 23:42:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 23:42:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-30 23:42:25] [INFO ] Implicit Places using invariants and state equation in 38 ms returned [26, 31]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 90 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 30/178 places, 53/260 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 30 transition count 52
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 29 transition count 52
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 29 transition count 51
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 28 transition count 51
Applied a total of 4 rules in 2 ms. Remains 28 /30 variables (removed 2) and now considering 51/53 (removed 2) transitions.
// Phase 1: matrix 51 rows 28 cols
[2025-05-30 23:42:25] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 23:42:25] [INFO ] Implicit Places using invariants in 24 ms returned []
[2025-05-30 23:42:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 23:42:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-30 23:42:25] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 28/178 places, 51/260 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 213 ms. Remains : 28/178 places, 51/260 transitions.
[2025-05-30 23:42:25] [INFO ] Flatten gal took : 3 ms
[2025-05-30 23:42:25] [INFO ] Flatten gal took : 2 ms
[2025-05-30 23:42:25] [INFO ] Input system was already deterministic with 51 transitions.
[2025-05-30 23:42:25] [INFO ] Flatten gal took : 2 ms
[2025-05-30 23:42:25] [INFO ] Flatten gal took : 1 ms
[2025-05-30 23:42:25] [INFO ] Time to serialize gal into /tmp/CTLCardinality14659245323002766711.gal : 0 ms
[2025-05-30 23:42:25] [INFO ] Time to serialize properties into /tmp/CTLCardinality8925997385049714548.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/CTLCardinality14659245323002766711.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8925997385049714548.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,6135,0.023109,4600,2,192,5,2744,6,0,162,3973,0


Converting to forward existential form...Done !
original formula: AF(EG((p48==0)))
=> equivalent forward existential formula: [FwdG(Init,!(EG((p48==0))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t6, t8, t10, t12, t14, t15, t26, t37, t38, t39, t40, t41, t42, t43, t44, t45,...274
(forward)formula 0,1,0.1847,12024,1,0,348,43423,127,151,1502,52619,359
FORMULA AutonomousCar-PT-03b-CTLCardinality-2025-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 178/178 places, 260/260 transitions.
Graph (trivial) has 158 edges and 178 vertex of which 4 / 178 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 76 transitions
Trivial Post-agglo rules discarded 76 transitions
Performed 76 trivial Post agglomeration. Transition count delta: 76
Iterating post reduction 0 with 76 rules applied. Total rules applied 77 place count 175 transition count 181
Reduce places removed 76 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 94 rules applied. Total rules applied 171 place count 99 transition count 163
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 181 place count 89 transition count 163
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 181 place count 89 transition count 155
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 197 place count 81 transition count 155
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 209 place count 69 transition count 143
Iterating global reduction 3 with 12 rules applied. Total rules applied 221 place count 69 transition count 143
Ensure Unique test removed 37 transitions
Reduce isomorphic transitions removed 37 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 38 rules applied. Total rules applied 259 place count 69 transition count 105
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 260 place count 68 transition count 105
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 262 place count 66 transition count 99
Iterating global reduction 5 with 2 rules applied. Total rules applied 264 place count 66 transition count 99
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 266 place count 66 transition count 97
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 267 place count 65 transition count 97
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 7 with 38 rules applied. Total rules applied 305 place count 46 transition count 78
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 306 place count 46 transition count 77
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 310 place count 42 transition count 65
Iterating global reduction 8 with 4 rules applied. Total rules applied 314 place count 42 transition count 65
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 8 with 2 rules applied. Total rules applied 316 place count 42 transition count 63
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 317 place count 41 transition count 63
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 10 with 2 rules applied. Total rules applied 319 place count 40 transition count 62
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 320 place count 40 transition count 61
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 321 place count 39 transition count 60
Applied a total of 321 rules in 20 ms. Remains 39 /178 variables (removed 139) and now considering 60/260 (removed 200) transitions.
// Phase 1: matrix 60 rows 39 cols
[2025-05-30 23:42:25] [INFO ] Computed 7 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 23:42:25] [INFO ] Implicit Places using invariants in 25 ms returned []
[2025-05-30 23:42:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 23:42:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-30 23:42:25] [INFO ] Implicit Places using invariants and state equation in 47 ms returned [33, 38]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 74 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 37/178 places, 60/260 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 37 transition count 59
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 36 transition count 59
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 36 transition count 58
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 35 transition count 58
Applied a total of 4 rules in 3 ms. Remains 35 /37 variables (removed 2) and now considering 58/60 (removed 2) transitions.
// Phase 1: matrix 58 rows 35 cols
[2025-05-30 23:42:25] [INFO ] Computed 5 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 23:42:25] [INFO ] Implicit Places using invariants in 25 ms returned []
[2025-05-30 23:42:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 23:42:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-30 23:42:25] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 35/178 places, 58/260 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 171 ms. Remains : 35/178 places, 58/260 transitions.
[2025-05-30 23:42:25] [INFO ] Flatten gal took : 2 ms
[2025-05-30 23:42:25] [INFO ] Flatten gal took : 2 ms
[2025-05-30 23:42:25] [INFO ] Input system was already deterministic with 58 transitions.
[2025-05-30 23:42:25] [INFO ] Flatten gal took : 2 ms
[2025-05-30 23:42:25] [INFO ] Flatten gal took : 2 ms
[2025-05-30 23:42:25] [INFO ] Time to serialize gal into /tmp/CTLCardinality9752063849419962243.gal : 1 ms
[2025-05-30 23:42:25] [INFO ] Time to serialize properties into /tmp/CTLCardinality4896047420346653476.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/CTLCardinality9752063849419962243.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4896047420346653476.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,28321,0.053242,5900,2,406,5,7379,6,0,196,9524,0


Converting to forward existential form...Done !
original formula: EF((EF(((p96==0)||(p6==1))) * AF(((p81!=0)&&(p9!=1)))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * E(TRUE U ((p96==0)||(p6==1)))) * !(EG(!(((p81!=0)&&(p9!=1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t6, t12, t14, t15, t18, t20, t22, t25, t29, t30, t56, Intersection with ...234
(forward)formula 0,1,0.929427,37056,1,0,453,179332,144,195,1883,203096,499
FORMULA AutonomousCar-PT-03b-CTLCardinality-2025-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 178/178 places, 260/260 transitions.
Graph (trivial) has 164 edges and 178 vertex of which 4 / 178 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 75 transitions
Trivial Post-agglo rules discarded 75 transitions
Performed 75 trivial Post agglomeration. Transition count delta: 75
Iterating post reduction 0 with 75 rules applied. Total rules applied 76 place count 175 transition count 182
Reduce places removed 75 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 1 with 94 rules applied. Total rules applied 170 place count 100 transition count 163
Reduce places removed 11 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 13 rules applied. Total rules applied 183 place count 89 transition count 161
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 185 place count 87 transition count 161
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 185 place count 87 transition count 155
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 197 place count 81 transition count 155
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 209 place count 69 transition count 143
Iterating global reduction 4 with 12 rules applied. Total rules applied 221 place count 69 transition count 143
Ensure Unique test removed 37 transitions
Reduce isomorphic transitions removed 37 transitions.
Iterating post reduction 4 with 37 rules applied. Total rules applied 258 place count 69 transition count 106
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 258 place count 69 transition count 105
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 260 place count 68 transition count 105
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 262 place count 66 transition count 99
Iterating global reduction 5 with 2 rules applied. Total rules applied 264 place count 66 transition count 99
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 266 place count 66 transition count 97
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 267 place count 65 transition count 97
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 7 with 42 rules applied. Total rules applied 309 place count 44 transition count 76
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 310 place count 44 transition count 75
Discarding 5 places :
Symmetric choice reduction at 8 with 5 rule applications. Total rules 315 place count 39 transition count 59
Iterating global reduction 8 with 5 rules applied. Total rules applied 320 place count 39 transition count 59
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 8 with 2 rules applied. Total rules applied 322 place count 39 transition count 57
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 323 place count 38 transition count 57
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 10 with 2 rules applied. Total rules applied 325 place count 37 transition count 56
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 326 place count 37 transition count 55
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 327 place count 37 transition count 55
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 329 place count 35 transition count 53
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 330 place count 34 transition count 53
Applied a total of 330 rules in 26 ms. Remains 34 /178 variables (removed 144) and now considering 53/260 (removed 207) transitions.
// Phase 1: matrix 53 rows 34 cols
[2025-05-30 23:42:26] [INFO ] Computed 6 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 23:42:26] [INFO ] Implicit Places using invariants in 34 ms returned []
[2025-05-30 23:42:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 23:42:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-30 23:42:26] [INFO ] Implicit Places using invariants and state equation in 43 ms returned [27, 33]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 80 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 32/178 places, 53/260 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 32 transition count 52
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 31 transition count 52
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 31 transition count 51
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 30 transition count 51
Applied a total of 4 rules in 3 ms. Remains 30 /32 variables (removed 2) and now considering 51/53 (removed 2) transitions.
// Phase 1: matrix 51 rows 30 cols
[2025-05-30 23:42:26] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 23:42:26] [INFO ] Implicit Places using invariants in 24 ms returned []
[2025-05-30 23:42:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 23:42:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-30 23:42:26] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 30/178 places, 51/260 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 173 ms. Remains : 30/178 places, 51/260 transitions.
[2025-05-30 23:42:26] [INFO ] Flatten gal took : 1 ms
[2025-05-30 23:42:26] [INFO ] Flatten gal took : 1 ms
[2025-05-30 23:42:26] [INFO ] Input system was already deterministic with 51 transitions.
[2025-05-30 23:42:26] [INFO ] Flatten gal took : 1 ms
[2025-05-30 23:42:26] [INFO ] Flatten gal took : 2 ms
[2025-05-30 23:42:26] [INFO ] Time to serialize gal into /tmp/CTLCardinality9252573000171463678.gal : 1 ms
[2025-05-30 23:42:26] [INFO ] Time to serialize properties into /tmp/CTLCardinality17680858277985838623.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/CTLCardinality9252573000171463678.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17680858277985838623.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,9028,0.024793,4436,2,172,5,2331,6,0,170,2808,0


Converting to forward existential form...Done !
original formula: AF(AG(((p72==0)&&(p173==1))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !(((p72==0)&&(p173==1)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t5, t7, t9, t14, t16, t28, t48, Intersection with reachable at each step enabled...204
(forward)formula 0,0,0.069573,6100,1,0,115,10296,127,55,1530,11179,119
FORMULA AutonomousCar-PT-03b-CTLCardinality-2025-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 178/178 places, 260/260 transitions.
Graph (trivial) has 161 edges and 178 vertex of which 2 / 178 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 75 transitions
Trivial Post-agglo rules discarded 75 transitions
Performed 75 trivial Post agglomeration. Transition count delta: 75
Iterating post reduction 0 with 75 rules applied. Total rules applied 76 place count 176 transition count 183
Reduce places removed 75 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 96 rules applied. Total rules applied 172 place count 101 transition count 162
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 184 place count 89 transition count 162
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 184 place count 89 transition count 156
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 196 place count 83 transition count 156
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 206 place count 73 transition count 146
Iterating global reduction 3 with 10 rules applied. Total rules applied 216 place count 73 transition count 146
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 3 with 36 rules applied. Total rules applied 252 place count 73 transition count 110
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 252 place count 73 transition count 109
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 254 place count 72 transition count 109
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 256 place count 70 transition count 103
Iterating global reduction 4 with 2 rules applied. Total rules applied 258 place count 70 transition count 103
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 4 rules applied. Total rules applied 262 place count 70 transition count 99
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 264 place count 68 transition count 99
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 6 with 40 rules applied. Total rules applied 304 place count 48 transition count 79
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 305 place count 48 transition count 78
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 310 place count 43 transition count 62
Iterating global reduction 7 with 5 rules applied. Total rules applied 315 place count 43 transition count 62
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 2 rules applied. Total rules applied 317 place count 43 transition count 60
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 318 place count 42 transition count 60
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 9 with 2 rules applied. Total rules applied 320 place count 41 transition count 59
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 321 place count 41 transition count 58
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 323 place count 39 transition count 56
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 324 place count 38 transition count 56
Applied a total of 324 rules in 22 ms. Remains 38 /178 variables (removed 140) and now considering 56/260 (removed 204) transitions.
// Phase 1: matrix 56 rows 38 cols
[2025-05-30 23:42:26] [INFO ] Computed 7 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 23:42:26] [INFO ] Implicit Places using invariants in 26 ms returned []
[2025-05-30 23:42:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 23:42:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-30 23:42:26] [INFO ] Implicit Places using invariants and state equation in 40 ms returned [30, 37]
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 : 36/178 places, 56/260 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 36 transition count 55
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 35 transition count 55
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 35 transition count 54
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 34 transition count 54
Applied a total of 4 rules in 3 ms. Remains 34 /36 variables (removed 2) and now considering 54/56 (removed 2) transitions.
// Phase 1: matrix 54 rows 34 cols
[2025-05-30 23:42:26] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 23:42:26] [INFO ] Implicit Places using invariants in 30 ms returned []
[2025-05-30 23:42:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 23:42:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-30 23:42:26] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 34/178 places, 54/260 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 165 ms. Remains : 34/178 places, 54/260 transitions.
[2025-05-30 23:42:26] [INFO ] Flatten gal took : 2 ms
[2025-05-30 23:42:26] [INFO ] Flatten gal took : 2 ms
[2025-05-30 23:42:26] [INFO ] Input system was already deterministic with 54 transitions.
[2025-05-30 23:42:26] [INFO ] Flatten gal took : 1 ms
[2025-05-30 23:42:26] [INFO ] Flatten gal took : 1 ms
[2025-05-30 23:42:26] [INFO ] Time to serialize gal into /tmp/CTLCardinality11700343181850850556.gal : 1 ms
[2025-05-30 23:42:26] [INFO ] Time to serialize properties into /tmp/CTLCardinality5166656255363224928.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/CTLCardinality11700343181850850556.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5166656255363224928.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,8292,0.021089,4348,2,178,5,2211,6,0,188,2291,0


Converting to forward existential form...Done !
original formula: A(!(EG(((p136==0)||(p169==1)))) U AG(!(EF(((p115==0)||(p150==1))))))
=> equivalent forward existential formula: [((Init * !(EG(!(!(E(TRUE U !(!(E(TRUE U ((p115==0)||(p150==1))))))))))) * !(E(!(!(E(TRUE U !(!(E(TRUE U ((p115=...283
Reverse transition relation is NOT exact ! Due to transitions t0, t6, t7, t10, t12, t14, t16, t18, t32, t52, Intersection with reachable at each step enab...207
(forward)formula 0,0,0.255003,13692,1,0,341,52818,135,165,1599,62949,401
FORMULA AutonomousCar-PT-03b-CTLCardinality-2025-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 178/178 places, 260/260 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 160 transition count 242
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 160 transition count 242
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 0 with 36 rules applied. Total rules applied 72 place count 160 transition count 206
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 75 place count 157 transition count 203
Iterating global reduction 1 with 3 rules applied. Total rules applied 78 place count 157 transition count 203
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 79 place count 156 transition count 202
Iterating global reduction 1 with 1 rules applied. Total rules applied 80 place count 156 transition count 202
Applied a total of 80 rules in 11 ms. Remains 156 /178 variables (removed 22) and now considering 202/260 (removed 58) transitions.
// Phase 1: matrix 202 rows 156 cols
[2025-05-30 23:42:27] [INFO ] Computed 8 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 23:42:27] [INFO ] Implicit Places using invariants in 57 ms returned []
[2025-05-30 23:42:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 23:42:27] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
Running 201 sub problems to find dead transitions.
[2025-05-30 23:42:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (OVERLAPS) 1/156 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 201 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:42:28] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:42:29] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:42:29] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:42:29] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:42:29] [INFO ] Deduced a trap composed of 35 places in 54 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:42:29] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:42:29] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:42:29] [INFO ] Deduced a trap composed of 32 places in 59 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:42:29] [INFO ] Deduced a trap composed of 33 places in 63 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:42:29] [INFO ] Deduced a trap composed of 33 places in 59 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:42:29] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:42:29] [INFO ] Deduced a trap composed of 26 places in 63 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:42:29] [INFO ] Deduced a trap composed of 31 places in 67 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:42:30] [INFO ] Deduced a trap composed of 32 places in 62 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:42:30] [INFO ] Deduced a trap composed of 31 places in 65 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:42:30] [INFO ] Deduced a trap composed of 32 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:42:30] [INFO ] Deduced a trap composed of 32 places in 63 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:42:30] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 18/26 constraints. Problems are: Problem set: 0 solved, 201 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:42:30] [INFO ] Deduced a trap composed of 41 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:42:31] [INFO ] Deduced a trap composed of 33 places in 66 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:42:31] [INFO ] Deduced a trap composed of 21 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:42:31] [INFO ] Deduced a trap composed of 40 places in 64 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:42:31] [INFO ] Deduced a trap composed of 42 places in 67 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:42:31] [INFO ] Deduced a trap composed of 28 places in 76 ms of which 7 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 6/32 constraints. Problems are: Problem set: 0 solved, 201 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:42:32] [INFO ] Deduced a trap composed of 41 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:42:32] [INFO ] Deduced a trap composed of 41 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:42:32] [INFO ] Deduced a trap composed of 41 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:42:32] [INFO ] Deduced a trap composed of 41 places in 44 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 4/36 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 6 (OVERLAPS) 202/358 variables, 156/192 constraints. Problems are: Problem set: 0 solved, 201 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:42:36] [INFO ] Deduced a trap composed of 32 places in 53 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/358 variables, 1/193 constraints. Problems are: Problem set: 0 solved, 201 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:42:37] [INFO ] Deduced a trap composed of 5 places in 62 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/358 variables, 1/194 constraints. Problems are: Problem set: 0 solved, 201 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:42:38] [INFO ] Deduced a trap along path composed of 3 places in 27 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:42:39] [INFO ] Deduced a trap along path composed of 3 places in 27 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:42:39] [INFO ] Deduced a trap along path composed of 3 places in 25 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/358 variables, 3/197 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/358 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 11 (OVERLAPS) 0/358 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 201 unsolved
No progress, stopping.
After SMT solving in domain Real declared 358/358 variables, and 197 constraints, problems are : Problem set: 0 solved, 201 unsolved in 18959 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 30/30 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 201 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (OVERLAPS) 1/156 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 30/38 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 4 (OVERLAPS) 202/358 variables, 156/194 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/358 variables, 201/395 constraints. Problems are: Problem set: 0 solved, 201 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:42:48] [INFO ] Deduced a trap composed of 40 places in 57 ms of which 9 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/358 variables, 1/396 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/358 variables, 3/399 constraints. Problems are: Problem set: 0 solved, 201 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:42:56] [INFO ] Deduced a trap along path composed of 3 places in 50 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:42:56] [INFO ] Deduced a trap along path composed of 2 places in 26 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:42:57] [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:42:57] [INFO ] Deduced a trap along path composed of 7 places in 32 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/358 variables, 4/403 constraints. Problems are: Problem set: 0 solved, 201 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 358/358 variables, and 403 constraints, problems are : Problem set: 0 solved, 201 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 31/31 constraints, Known Traps Along Path: 7/7 constraints]
After SMT, in 49003ms problems are : Problem set: 0 solved, 201 unsolved
Search for dead transitions found 0 dead transitions in 49004ms
Starting structural reductions in LTL mode, iteration 1 : 156/178 places, 202/260 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49178 ms. Remains : 156/178 places, 202/260 transitions.
[2025-05-30 23:43:16] [INFO ] Flatten gal took : 4 ms
[2025-05-30 23:43:16] [INFO ] Flatten gal took : 4 ms
[2025-05-30 23:43:16] [INFO ] Input system was already deterministic with 202 transitions.
[2025-05-30 23:43:16] [INFO ] Flatten gal took : 4 ms
[2025-05-30 23:43:16] [INFO ] Flatten gal took : 4 ms
[2025-05-30 23:43:16] [INFO ] Time to serialize gal into /tmp/CTLCardinality6816554127872946041.gal : 1 ms
[2025-05-30 23:43:16] [INFO ] Time to serialize properties into /tmp/CTLCardinality10047643068092211903.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/CTLCardinality6816554127872946041.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10047643068092211903.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,5.22507e+07,1.51631,54252,2,6553,5,191098,6,0,828,262311,0


Converting to forward existential form...Done !
original formula: ((EX((((AX((p71==1)) * E((p22==1) U (p176==1))) + AX(((p147==0)&&(p16==1)))) + ((p71==0)&&(p136==0)))) * AF(AG(((p17==0) * EG((p13==0))))...247
=> equivalent forward existential formula: (([(Init * !(EX((((!(EX(!((p71==1)))) * E((p22==1) U (p176==1))) + !(EX(!(((p147==0)&&(p16==1)))))) + ((p71==0)&...413
Reverse transition relation is NOT exact ! Due to transitions t10, t16, t17, t24, t32, t35, t36, t37, t64, t65, t68, t69, t71, t84, t90, t91, t94, t95, t97...359
Detected timeout of ITS tools.
[2025-05-30 23:43:46] [INFO ] Flatten gal took : 4 ms
[2025-05-30 23:43:46] [INFO ] Applying decomposition
[2025-05-30 23:43:46] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph15553939993500866852.txt' '-o' '/tmp/graph15553939993500866852.bin' '-w' '/tmp/graph15553939993500866852.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph15553939993500866852.bin' '-l' '-1' '-v' '-w' '/tmp/graph15553939993500866852.weights' '-q' '0' '-e' '0.001'
[2025-05-30 23:43:46] [INFO ] Decomposing Gal with order
[2025-05-30 23:43:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 23:43:46] [INFO ] Removed a total of 120 redundant transitions.
[2025-05-30 23:43:46] [INFO ] Flatten gal took : 10 ms
[2025-05-30 23:43:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 3 ms.
[2025-05-30 23:43:46] [INFO ] Time to serialize gal into /tmp/CTLCardinality3288164047218890853.gal : 2 ms
[2025-05-30 23:43:46] [INFO ] Time to serialize properties into /tmp/CTLCardinality18365133967401455575.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/CTLCardinality3288164047218890853.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18365133967401455575.ctl'

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 -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.22507e+07,0.037555,5304,373,75,1999,382,412,2247,71,733,0


Converting to forward existential form...Done !
original formula: ((EX((((AX((i6.i1.u22.p71==1)) * E((i0.u6.p22==1) U (i14.i0.u55.p176==1))) + AX(((i11.u2.p147==0)&&(i12.i0.u0.p16==1)))) + ((i6.i1.u22.p7...383
=> equivalent forward existential formula: (([(Init * !(EX((((!(EX(!((i6.i1.u22.p71==1)))) * E((i0.u6.p22==1) U (i14.i0.u55.p176==1))) + !(EX(!(((i11.u2.p1...560
Reverse transition relation is NOT exact ! Due to transitions t145, t147, t180, t199, u38.t32, u38.t35, u38.t36, u38.t37, i3.i0.u14.t119, i3.i0.u14.t123, i...547
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
(forward)formula 0,0,2.02291,86840,1,0,189599,1264,2482,242078,368,4663,259958
FORMULA AutonomousCar-PT-03b-CTLCardinality-2025-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 178/178 places, 260/260 transitions.
Graph (trivial) has 167 edges and 178 vertex of which 4 / 178 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 78 transitions
Trivial Post-agglo rules discarded 78 transitions
Performed 78 trivial Post agglomeration. Transition count delta: 78
Iterating post reduction 0 with 78 rules applied. Total rules applied 79 place count 175 transition count 179
Reduce places removed 78 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 1 with 97 rules applied. Total rules applied 176 place count 97 transition count 160
Reduce places removed 11 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 12 rules applied. Total rules applied 188 place count 86 transition count 159
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 189 place count 85 transition count 159
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 189 place count 85 transition count 152
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 203 place count 78 transition count 152
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 214 place count 67 transition count 141
Iterating global reduction 4 with 11 rules applied. Total rules applied 225 place count 67 transition count 141
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 4 with 36 rules applied. Total rules applied 261 place count 67 transition count 105
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 261 place count 67 transition count 104
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 263 place count 66 transition count 104
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 265 place count 64 transition count 98
Iterating global reduction 5 with 2 rules applied. Total rules applied 267 place count 64 transition count 98
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 3 rules applied. Total rules applied 270 place count 64 transition count 95
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 271 place count 63 transition count 95
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 7 with 42 rules applied. Total rules applied 313 place count 42 transition count 74
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 314 place count 42 transition count 73
Discarding 5 places :
Symmetric choice reduction at 8 with 5 rule applications. Total rules 319 place count 37 transition count 57
Iterating global reduction 8 with 5 rules applied. Total rules applied 324 place count 37 transition count 57
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 8 with 2 rules applied. Total rules applied 326 place count 37 transition count 55
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 327 place count 36 transition count 55
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 10 with 2 rules applied. Total rules applied 329 place count 35 transition count 54
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 330 place count 35 transition count 53
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 331 place count 35 transition count 53
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 333 place count 33 transition count 51
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 334 place count 32 transition count 51
Applied a total of 334 rules in 30 ms. Remains 32 /178 variables (removed 146) and now considering 51/260 (removed 209) transitions.
// Phase 1: matrix 51 rows 32 cols
[2025-05-30 23:43:48] [INFO ] Computed 6 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 23:43:48] [INFO ] Implicit Places using invariants in 37 ms returned []
[2025-05-30 23:43:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 23:43:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-30 23:43:48] [INFO ] Implicit Places using invariants and state equation in 42 ms returned [26, 31]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 81 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 30/178 places, 51/260 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 30 transition count 50
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 29 transition count 50
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 29 transition count 49
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 28 transition count 49
Applied a total of 4 rules in 2 ms. Remains 28 /30 variables (removed 2) and now considering 49/51 (removed 2) transitions.
// Phase 1: matrix 49 rows 28 cols
[2025-05-30 23:43:48] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 23:43:48] [INFO ] Implicit Places using invariants in 28 ms returned []
[2025-05-30 23:43:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 23:43:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-30 23:43:48] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 28/178 places, 49/260 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 182 ms. Remains : 28/178 places, 49/260 transitions.
[2025-05-30 23:43:48] [INFO ] Flatten gal took : 2 ms
[2025-05-30 23:43:48] [INFO ] Flatten gal took : 1 ms
[2025-05-30 23:43:48] [INFO ] Input system was already deterministic with 49 transitions.
[2025-05-30 23:43:48] [INFO ] Flatten gal took : 1 ms
[2025-05-30 23:43:48] [INFO ] Flatten gal took : 1 ms
[2025-05-30 23:43:48] [INFO ] Time to serialize gal into /tmp/CTLCardinality11491053701798269604.gal : 0 ms
[2025-05-30 23:43:48] [INFO ] Time to serialize properties into /tmp/CTLCardinality8829638286516698447.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/CTLCardinality11491053701798269604.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8829638286516698447.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,6675,0.022103,4396,2,161,5,2300,6,0,160,2624,0


Converting to forward existential form...Done !
original formula: AF(AG((p74!=0)))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !((p74!=0))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t6, t8, t10, t13, t15, t47, Intersection with reachable at each step enabled...204
(forward)formula 0,0,0.061576,5804,1,0,111,8954,123,52,1473,9629,112
FORMULA AutonomousCar-PT-03b-CTLCardinality-2025-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 178/178 places, 260/260 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 161 transition count 243
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 161 transition count 243
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 0 with 36 rules applied. Total rules applied 70 place count 161 transition count 207
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 72 place count 159 transition count 205
Iterating global reduction 1 with 2 rules applied. Total rules applied 74 place count 159 transition count 205
Applied a total of 74 rules in 8 ms. Remains 159 /178 variables (removed 19) and now considering 205/260 (removed 55) transitions.
// Phase 1: matrix 205 rows 159 cols
[2025-05-30 23:43:48] [INFO ] Computed 8 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 23:43:48] [INFO ] Implicit Places using invariants in 59 ms returned []
[2025-05-30 23:43:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 23:43:49] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
Running 204 sub problems to find dead transitions.
[2025-05-30 23:43:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 1 (OVERLAPS) 1/159 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 204 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:43:50] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:43:50] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:43:50] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:43:50] [INFO ] Deduced a trap composed of 27 places in 61 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:43:50] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:43:51] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:43:51] [INFO ] Deduced a trap composed of 36 places in 59 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:43:51] [INFO ] Deduced a trap composed of 21 places in 72 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:43:51] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:43:51] [INFO ] Deduced a trap composed of 35 places in 55 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:43:51] [INFO ] Deduced a trap composed of 36 places in 52 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:43:51] [INFO ] Deduced a trap composed of 36 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:43:51] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:43:51] [INFO ] Deduced a trap composed of 31 places in 64 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:43:51] [INFO ] Deduced a trap composed of 26 places in 63 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:43:51] [INFO ] Deduced a trap composed of 36 places in 60 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:43:51] [INFO ] Deduced a trap composed of 36 places in 51 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:43:52] [INFO ] Deduced a trap composed of 31 places in 60 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:43:52] [INFO ] Deduced a trap composed of 40 places in 46 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:43:52] [INFO ] Deduced a trap composed of 32 places in 62 ms of which 9 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 204 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:43:52] [INFO ] Deduced a trap composed of 42 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:43:52] [INFO ] Deduced a trap composed of 31 places in 82 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:43:52] [INFO ] Deduced a trap composed of 32 places in 57 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:43:52] [INFO ] Deduced a trap composed of 51 places in 51 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:43:52] [INFO ] Deduced a trap composed of 41 places in 54 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:43:52] [INFO ] Deduced a trap composed of 42 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:43:52] [INFO ] Deduced a trap composed of 52 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:43:53] [INFO ] Deduced a trap composed of 41 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:43:53] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:43:53] [INFO ] Deduced a trap composed of 32 places in 62 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 10/38 constraints. Problems are: Problem set: 0 solved, 204 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:43:54] [INFO ] Deduced a trap composed of 31 places in 64 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:43:54] [INFO ] Deduced a trap composed of 30 places in 69 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:43:54] [INFO ] Deduced a trap composed of 5 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:43:54] [INFO ] Deduced a trap composed of 32 places in 57 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:43:54] [INFO ] Deduced a trap composed of 32 places in 55 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 5/43 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/159 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 6 (OVERLAPS) 205/364 variables, 159/202 constraints. Problems are: Problem set: 0 solved, 204 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:43:58] [INFO ] Deduced a trap along path composed of 3 places in 23 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:43:59] [INFO ] Deduced a trap along path composed of 3 places in 22 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:43:59] [INFO ] Deduced a trap along path composed of 3 places in 23 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/364 variables, 3/205 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/364 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 9 (OVERLAPS) 0/364 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 204 unsolved
No progress, stopping.
After SMT solving in domain Real declared 364/364 variables, and 205 constraints, problems are : Problem set: 0 solved, 204 unsolved in 17236 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 159/159 constraints, PredecessorRefiner: 204/204 constraints, Known Traps: 35/35 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 204 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 1 (OVERLAPS) 1/159 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 35/43 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 4 (OVERLAPS) 205/364 variables, 159/202 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/364 variables, 204/406 constraints. Problems are: Problem set: 0 solved, 204 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:44:08] [INFO ] Deduced a trap composed of 41 places in 65 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:44:08] [INFO ] Deduced a trap composed of 42 places in 57 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:44:08] [INFO ] Deduced a trap composed of 32 places in 74 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/364 variables, 3/409 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/364 variables, 3/412 constraints. Problems are: Problem set: 0 solved, 204 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:44:18] [INFO ] Deduced a trap along path composed of 3 places in 47 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:44:18] [INFO ] Deduced a trap along path composed of 2 places in 23 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:44:19] [INFO ] Deduced a trap along path composed of 12 places in 34 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/364 variables, 3/415 constraints. Problems are: Problem set: 0 solved, 204 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 364/364 variables, and 415 constraints, problems are : Problem set: 0 solved, 204 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 159/159 constraints, PredecessorRefiner: 204/204 constraints, Known Traps: 38/38 constraints, Known Traps Along Path: 6/6 constraints]
After SMT, in 47277ms problems are : Problem set: 0 solved, 204 unsolved
Search for dead transitions found 0 dead transitions in 47278ms
Starting structural reductions in LTL mode, iteration 1 : 159/178 places, 205/260 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47456 ms. Remains : 159/178 places, 205/260 transitions.
[2025-05-30 23:44:36] [INFO ] Flatten gal took : 5 ms
[2025-05-30 23:44:36] [INFO ] Flatten gal took : 5 ms
[2025-05-30 23:44:36] [INFO ] Input system was already deterministic with 205 transitions.
[2025-05-30 23:44:36] [INFO ] Flatten gal took : 4 ms
[2025-05-30 23:44:36] [INFO ] Flatten gal took : 4 ms
[2025-05-30 23:44:36] [INFO ] Time to serialize gal into /tmp/CTLCardinality16651470750760969086.gal : 1 ms
[2025-05-30 23:44:36] [INFO ] Time to serialize properties into /tmp/CTLCardinality11879972664825095494.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/CTLCardinality16651470750760969086.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11879972664825095494.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,5.7103e+07,1.96353,63012,2,6827,5,218582,6,0,843,297293,0


Converting to forward existential form...Done !
original formula: (EG((AX(AX(((p116==0)||(p162==1)))) + EG(((p172==1)&&(((p82==0)&&(p86==1))||(p178==1)))))) + ((AG(((p177!=1)&&(p168!=1))) * AF(((p181==0)...292
=> equivalent forward existential formula: (([(FwdU((Init * !(EG((!(EX(!(!(EX(!(((p116==0)||(p162==1)))))))) + EG(((p172==1)&&(((p82==0)&&(p86==1))||(p178=...788
Reverse transition relation is NOT exact ! Due to transitions t10, t17, t18, t26, t34, t37, t38, t39, t65, t66, t69, t71, t72, t73, t86, t93, t94, t97, t99...353
Detected timeout of ITS tools.
[2025-05-30 23:45:06] [INFO ] Flatten gal took : 8 ms
[2025-05-30 23:45:06] [INFO ] Applying decomposition
[2025-05-30 23:45:06] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph2650581971600125497.txt' '-o' '/tmp/graph2650581971600125497.bin' '-w' '/tmp/graph2650581971600125497.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph2650581971600125497.bin' '-l' '-1' '-v' '-w' '/tmp/graph2650581971600125497.weights' '-q' '0' '-e' '0.001'
[2025-05-30 23:45:06] [INFO ] Decomposing Gal with order
[2025-05-30 23:45:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 23:45:06] [INFO ] Removed a total of 116 redundant transitions.
[2025-05-30 23:45:06] [INFO ] Flatten gal took : 10 ms
[2025-05-30 23:45:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 18 labels/synchronizations in 2 ms.
[2025-05-30 23:45:06] [INFO ] Time to serialize gal into /tmp/CTLCardinality9422549221023774729.gal : 2 ms
[2025-05-30 23:45:06] [INFO ] Time to serialize properties into /tmp/CTLCardinality13794506063139882315.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/CTLCardinality9422549221023774729.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13794506063139882315.ctl'

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 -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.7103e+07,0.075466,5520,367,77,2620,601,424,3399,74,1208,0


Converting to forward existential form...Done !
original formula: (EG((AX(AX(((i8.u37.p116==0)||(i11.u50.p162==1)))) + EG(((i12.i0.u55.p172==1)&&(((i5.i1.u25.p82==0)&&(i5.i2.u27.p86==1))||(i12.i2.u53.p17...455
=> equivalent forward existential formula: (([(FwdU((Init * !(EG((!(EX(!(!(EX(!(((i8.u37.p116==0)||(i11.u50.p162==1)))))))) + EG(((i12.i0.u55.p172==1)&&(((...1122
Reverse transition relation is NOT exact ! Due to transitions t172, t202, u46.t34, u46.t37, u46.t38, u46.t39, i0.t148, i0.t146, i4.t139, i4.u9.t119, i4.u15...547
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
(forward)formula 0,0,5.32516,220560,1,0,479313,2110,2742,617510,412,12287,642591
FORMULA AutonomousCar-PT-03b-CTLCardinality-2023-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 178/178 places, 260/260 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 164 transition count 246
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 164 transition count 246
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 30 place count 162 transition count 244
Iterating global reduction 0 with 2 rules applied. Total rules applied 32 place count 162 transition count 244
Applied a total of 32 rules in 4 ms. Remains 162 /178 variables (removed 16) and now considering 244/260 (removed 16) transitions.
// Phase 1: matrix 244 rows 162 cols
[2025-05-30 23:45:11] [INFO ] Computed 8 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 23:45:11] [INFO ] Implicit Places using invariants in 62 ms returned []
[2025-05-30 23:45:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 23:45:12] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 185 ms to find 0 implicit places.
Running 243 sub problems to find dead transitions.
[2025-05-30 23:45:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 1 (OVERLAPS) 1/162 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 243 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:45:14] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:45:14] [INFO ] Deduced a trap composed of 15 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:45:14] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:45:14] [INFO ] Deduced a trap composed of 28 places in 63 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:45:14] [INFO ] Deduced a trap composed of 29 places in 74 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:45:14] [INFO ] Deduced a trap composed of 29 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:45:14] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:45:14] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:45:14] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:45:14] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:45:14] [INFO ] Deduced a trap composed of 33 places in 68 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:45:14] [INFO ] Deduced a trap composed of 34 places in 66 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:45:15] [INFO ] Deduced a trap composed of 35 places in 64 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:45:15] [INFO ] Deduced a trap composed of 35 places in 83 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:45:15] [INFO ] Deduced a trap composed of 31 places in 82 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:45:15] [INFO ] Deduced a trap composed of 33 places in 65 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:45:15] [INFO ] Deduced a trap composed of 31 places in 89 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:45:15] [INFO ] Deduced a trap composed of 42 places in 67 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:45:15] [INFO ] Deduced a trap composed of 43 places in 57 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:45:15] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 9 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/162 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 243 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:45:16] [INFO ] Deduced a trap composed of 33 places in 66 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:45:16] [INFO ] Deduced a trap composed of 34 places in 65 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:45:16] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:45:16] [INFO ] Deduced a trap composed of 7 places in 62 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:45:16] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:45:16] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:45:17] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:45:17] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:45:17] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/162 variables, 9/37 constraints. Problems are: Problem set: 0 solved, 243 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:45:18] [INFO ] Deduced a trap composed of 34 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:45:18] [INFO ] Deduced a trap composed of 38 places in 60 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:45:18] [INFO ] Deduced a trap composed of 40 places in 55 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:45:18] [INFO ] Deduced a trap composed of 41 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:45:18] [INFO ] Deduced a trap composed of 8 places in 86 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 5/42 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 6 (OVERLAPS) 244/406 variables, 162/204 constraints. Problems are: Problem set: 0 solved, 243 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:45:22] [INFO ] Deduced a trap composed of 43 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:45:22] [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:45:23] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/406 variables, 3/207 constraints. Problems are: Problem set: 0 solved, 243 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:45:25] [INFO ] Deduced a trap along path composed of 3 places in 21 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:45:25] [INFO ] Deduced a trap along path composed of 3 places in 13 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/406 variables, 2/209 constraints. Problems are: Problem set: 0 solved, 243 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:45:28] [INFO ] Deduced a trap along path composed of 3 places in 20 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/406 variables, 1/210 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/406 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 11 (OVERLAPS) 0/406 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 243 unsolved
No progress, stopping.
After SMT solving in domain Real declared 406/406 variables, and 210 constraints, problems are : Problem set: 0 solved, 243 unsolved in 25723 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 162/162 constraints, PredecessorRefiner: 243/243 constraints, Known Traps: 37/37 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 243 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 1 (OVERLAPS) 1/162 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/162 variables, 37/45 constraints. Problems are: Problem set: 0 solved, 243 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:45:38] [INFO ] Deduced a trap composed of 41 places in 54 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/162 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 5 (OVERLAPS) 244/406 variables, 162/208 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/406 variables, 243/451 constraints. Problems are: Problem set: 0 solved, 243 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:45:41] [INFO ] Deduced a trap composed of 40 places in 66 ms of which 9 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/406 variables, 1/452 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/406 variables, 3/455 constraints. Problems are: Problem set: 0 solved, 243 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:45:56] [INFO ] Deduced a trap along path composed of 2 places in 39 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:45:56] [INFO ] Deduced a trap along path composed of 12 places in 50 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:45:57] [INFO ] Deduced a trap along path composed of 7 places in 50 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:45:57] [INFO ] Deduced a trap along path composed of 2 places in 14 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/406 variables, 4/459 constraints. Problems are: Problem set: 0 solved, 243 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 406/406 variables, and 459 constraints, problems are : Problem set: 0 solved, 243 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 162/162 constraints, PredecessorRefiner: 243/243 constraints, Known Traps: 39/39 constraints, Known Traps Along Path: 7/7 constraints]
After SMT, in 55819ms problems are : Problem set: 0 solved, 243 unsolved
Search for dead transitions found 0 dead transitions in 55820ms
Starting structural reductions in LTL mode, iteration 1 : 162/178 places, 244/260 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56009 ms. Remains : 162/178 places, 244/260 transitions.
[2025-05-30 23:46:07] [INFO ] Flatten gal took : 5 ms
[2025-05-30 23:46:07] [INFO ] Flatten gal took : 5 ms
[2025-05-30 23:46:07] [INFO ] Input system was already deterministic with 244 transitions.
[2025-05-30 23:46:07] [INFO ] Flatten gal took : 5 ms
[2025-05-30 23:46:07] [INFO ] Flatten gal took : 5 ms
[2025-05-30 23:46:07] [INFO ] Time to serialize gal into /tmp/CTLCardinality10352929168080266898.gal : 1 ms
[2025-05-30 23:46:07] [INFO ] Time to serialize properties into /tmp/CTLCardinality16244260210611823091.ctl : 4 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/CTLCardinality10352929168080266898.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16244260210611823091.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,7.89794e+07,1.26602,48872,2,7622,5,170113,6,0,894,214125,0


Converting to forward existential form...Done !
original formula: E(EG(AF(AX((p28!=1)))) U (EF(((p51==1) + !(((EX(((p30==0)||(p5==1))) + (p136==0)) + (p170==1))))) * (((p140==0)||(p4==1)) + EF(!(AX(((p13...176
=> equivalent forward existential formula: ([((FwdU(Init,EG(!(EG(!(!(EX(!((p28!=1))))))))) * E(TRUE U ((p51==1) + !(((EX(((p30==0)||(p5==1))) + (p136==0)) ...388
Reverse transition relation is NOT exact ! Due to transitions t10, t16, t17, t25, t33, t36, t37, t39, t66, t67, t70, t71, t73, t86, t92, t93, t96, t97, t99...413
Using saturation style SCC detection
Detected timeout of ITS tools.
[2025-05-30 23:46:37] [INFO ] Flatten gal took : 8 ms
[2025-05-30 23:46:37] [INFO ] Applying decomposition
[2025-05-30 23:46:37] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph3071345504168524726.txt' '-o' '/tmp/graph3071345504168524726.bin' '-w' '/tmp/graph3071345504168524726.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3071345504168524726.bin' '-l' '-1' '-v' '-w' '/tmp/graph3071345504168524726.weights' '-q' '0' '-e' '0.001'
[2025-05-30 23:46:37] [INFO ] Decomposing Gal with order
[2025-05-30 23:46:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 23:46:37] [INFO ] Removed a total of 205 redundant transitions.
[2025-05-30 23:46:38] [INFO ] Flatten gal took : 13 ms
[2025-05-30 23:46:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 20 labels/synchronizations in 3 ms.
[2025-05-30 23:46:38] [INFO ] Time to serialize gal into /tmp/CTLCardinality11647799833446808052.gal : 2 ms
[2025-05-30 23:46:38] [INFO ] Time to serialize properties into /tmp/CTLCardinality1882688314330696658.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/CTLCardinality11647799833446808052.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1882688314330696658.ctl'

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 -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.89794e+07,0.064999,6948,407,106,4531,662,416,12814,88,2269,0


Converting to forward existential form...Done !
original formula: E(EG(AF(AX((i1.i1.u7.p28!=1)))) U (EF(((i2.u14.p51==1) + !(((EX(((i1.i0.u11.p30==0)||(i8.u47.p5==1))) + (i6.i2.u42.p136==0)) + (i9.i1.u54...260
=> equivalent forward existential formula: ([((FwdU(Init,EG(!(EG(!(!(EX(!((i1.i1.u7.p28!=1))))))))) * E(TRUE U ((i2.u14.p51==1) + !(((EX(((i1.i0.u11.p30==0...525
Reverse transition relation is NOT exact ! Due to transitions t146, t148, t218, t241, i1.i1.t139, i1.i1.u7.t117, i1.i1.u16.t118, i2.u13.t123, i2.u13.t124, ...570
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local SCC at level 2
Fast SCC detection found a local SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,1,2.80896,103844,1,0,191859,3205,3115,425802,507,27303,242620
FORMULA AutonomousCar-PT-03b-CTLCardinality-2023-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 178/178 places, 260/260 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 160 transition count 242
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 160 transition count 242
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 0 with 36 rules applied. Total rules applied 72 place count 160 transition count 206
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 75 place count 157 transition count 203
Iterating global reduction 1 with 3 rules applied. Total rules applied 78 place count 157 transition count 203
Applied a total of 78 rules in 3 ms. Remains 157 /178 variables (removed 21) and now considering 203/260 (removed 57) transitions.
// Phase 1: matrix 203 rows 157 cols
[2025-05-30 23:46:40] [INFO ] Computed 8 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 23:46:40] [INFO ] Implicit Places using invariants in 57 ms returned []
[2025-05-30 23:46:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 23:46:41] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 174 ms to find 0 implicit places.
Running 202 sub problems to find dead transitions.
[2025-05-30 23:46: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/156 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 1 (OVERLAPS) 1/157 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 202 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:46:42] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:46:42] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:46:42] [INFO ] Deduced a trap composed of 42 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:46:42] [INFO ] Deduced a trap composed of 22 places in 73 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:46:42] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:46:43] [INFO ] Deduced a trap composed of 31 places in 67 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:46:43] [INFO ] Deduced a trap composed of 35 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:46:43] [INFO ] Deduced a trap composed of 36 places in 56 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:46:43] [INFO ] Deduced a trap composed of 31 places in 58 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:46:43] [INFO ] Deduced a trap composed of 36 places in 66 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:46:43] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:46:43] [INFO ] Deduced a trap composed of 26 places in 55 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:46:43] [INFO ] Deduced a trap composed of 31 places in 60 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:46:43] [INFO ] Deduced a trap composed of 31 places in 49 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:46:43] [INFO ] Deduced a trap composed of 32 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:46:44] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:46:44] [INFO ] Deduced a trap composed of 5 places in 47 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 17/25 constraints. Problems are: Problem set: 0 solved, 202 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:46:44] [INFO ] Deduced a trap composed of 40 places in 50 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:46:44] [INFO ] Deduced a trap composed of 40 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:46:44] [INFO ] Deduced a trap composed of 41 places in 48 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:46:44] [INFO ] Deduced a trap composed of 41 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:46:45] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 5/30 constraints. Problems are: Problem set: 0 solved, 202 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:46:46] [INFO ] Deduced a trap composed of 42 places in 51 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:46:46] [INFO ] Deduced a trap composed of 42 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:46:46] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 3/33 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/157 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 6 (OVERLAPS) 203/360 variables, 157/190 constraints. Problems are: Problem set: 0 solved, 202 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:46:49] [INFO ] Deduced a trap composed of 32 places in 58 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/360 variables, 1/191 constraints. Problems are: Problem set: 0 solved, 202 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:46:50] [INFO ] Deduced a trap composed of 31 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:46:51] [INFO ] Deduced a trap composed of 32 places in 66 ms of which 7 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/360 variables, 2/193 constraints. Problems are: Problem set: 0 solved, 202 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:46:52] [INFO ] Deduced a trap along path composed of 3 places in 25 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:46:52] [INFO ] Deduced a trap along path composed of 3 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:46:53] [INFO ] Deduced a trap along path composed of 3 places in 24 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/360 variables, 3/196 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/360 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 11 (OVERLAPS) 0/360 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 202 unsolved
No progress, stopping.
After SMT solving in domain Real declared 360/360 variables, and 196 constraints, problems are : Problem set: 0 solved, 202 unsolved in 18873 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 202/202 constraints, Known Traps: 28/28 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 202 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 1 (OVERLAPS) 1/157 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 28/36 constraints. Problems are: Problem set: 0 solved, 202 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:47:00] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:47:00] [INFO ] Deduced a trap composed of 26 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:47:00] [INFO ] Deduced a trap composed of 30 places in 62 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:47:00] [INFO ] Deduced a trap composed of 35 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:47:00] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 5/41 constraints. Problems are: Problem set: 0 solved, 202 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:47:01] [INFO ] Deduced a trap composed of 32 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:47:01] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/157 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 6 (OVERLAPS) 203/360 variables, 157/200 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/360 variables, 202/402 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/360 variables, 3/405 constraints. Problems are: Problem set: 0 solved, 202 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:47:06] [INFO ] Deduced a trap composed of 40 places in 63 ms of which 8 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/360 variables, 1/406 constraints. Problems are: Problem set: 0 solved, 202 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:47:12] [INFO ] Deduced a trap along path composed of 2 places in 57 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:47:12] [INFO ] Deduced a trap along path composed of 3 places in 72 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:47:12] [INFO ] Deduced a trap along path composed of 2 places in 20 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/360 variables, 3/409 constraints. Problems are: Problem set: 0 solved, 202 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:47:23] [INFO ] Deduced a trap composed of 38 places in 60 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:47:23] [INFO ] Deduced a trap composed of 51 places in 58 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/360 variables, 2/411 constraints. Problems are: Problem set: 0 solved, 202 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 360/360 variables, and 411 constraints, problems are : Problem set: 0 solved, 202 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 202/202 constraints, Known Traps: 38/38 constraints, Known Traps Along Path: 6/6 constraints]
After SMT, in 48913ms problems are : Problem set: 0 solved, 202 unsolved
Search for dead transitions found 0 dead transitions in 48914ms
Starting structural reductions in LTL mode, iteration 1 : 157/178 places, 203/260 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49091 ms. Remains : 157/178 places, 203/260 transitions.
[2025-05-30 23:47:29] [INFO ] Flatten gal took : 5 ms
[2025-05-30 23:47:29] [INFO ] Flatten gal took : 4 ms
[2025-05-30 23:47:29] [INFO ] Input system was already deterministic with 203 transitions.
[2025-05-30 23:47:29] [INFO ] Flatten gal took : 4 ms
[2025-05-30 23:47:29] [INFO ] Flatten gal took : 4 ms
[2025-05-30 23:47:29] [INFO ] Time to serialize gal into /tmp/CTLCardinality2805837150520354056.gal : 1 ms
[2025-05-30 23:47:29] [INFO ] Time to serialize properties into /tmp/CTLCardinality11600759980680941055.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/CTLCardinality2805837150520354056.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11600759980680941055.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,5.5956e+07,1.13051,43924,2,6504,5,156669,6,0,833,202544,0


Converting to forward existential form...Done !
original formula: (AG(EF((p77==0))) * (EG((p11==0)) + EX(AX(((p84==1)||(((p106==0)&&(p183==1))&&((p169==0)&&(p22==1))))))))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(E(TRUE U (p77==0))))] = FALSE * [((Init * !(EX(!(EX(!(((p84==1)||(((p106==0)&&(p183==1))&...214
Reverse transition relation is NOT exact ! Due to transitions t10, t16, t17, t26, t34, t37, t38, t39, t65, t66, t69, t70, t72, t75, t86, t92, t93, t96, t97...376
Detected timeout of ITS tools.
[2025-05-30 23:48:00] [INFO ] Flatten gal took : 12 ms
[2025-05-30 23:48:00] [INFO ] Applying decomposition
[2025-05-30 23:48:00] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph7083694775881722438.txt' '-o' '/tmp/graph7083694775881722438.bin' '-w' '/tmp/graph7083694775881722438.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7083694775881722438.bin' '-l' '-1' '-v' '-w' '/tmp/graph7083694775881722438.weights' '-q' '0' '-e' '0.001'
[2025-05-30 23:48:00] [INFO ] Decomposing Gal with order
[2025-05-30 23:48:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 23:48:00] [INFO ] Removed a total of 120 redundant transitions.
[2025-05-30 23:48:00] [INFO ] Flatten gal took : 21 ms
[2025-05-30 23:48:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 2 ms.
[2025-05-30 23:48:00] [INFO ] Time to serialize gal into /tmp/CTLCardinality8293284267194951234.gal : 1 ms
[2025-05-30 23:48:00] [INFO ] Time to serialize properties into /tmp/CTLCardinality1709171730463286275.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/CTLCardinality8293284267194951234.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1709171730463286275.ctl'

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 -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.5956e+07,0.058593,5640,410,80,3089,510,399,4422,71,1444,0


Converting to forward existential form...Done !
original formula: (AG(EF((i4.i0.u20.p77==0))) * (EG((i10.u3.p11==0)) + EX(AX(((i5.i1.u26.p84==1)||(((i8.u36.p106==0)&&(i13.i1.u57.p183==1))&&((i13.i0.u51.p...185
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(E(TRUE U (i4.i0.u20.p77==0))))] = FALSE * [((Init * !(EX(!(EX(!(((i5.i1.u26.p84==1)||(((i...276
Reverse transition relation is NOT exact ! Due to transitions t149, t170, t182, t200, i2.i1.t137, i2.i1.u10.t117, i2.i1.u18.t118, i3.u15.t121, i3.u15.t124,...561
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
(forward)formula 0,1,1.60665,78216,1,0,164094,1572,2547,219583,370,7048,205294
FORMULA AutonomousCar-PT-03b-CTLCardinality-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

[2025-05-30 23:48:01] [INFO ] Flatten gal took : 8 ms
[2025-05-30 23:48:01] [INFO ] Flatten gal took : 6 ms
Total runtime 728838 ms.

BK_STOP 1748648881809

--------------------
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
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLCardinality -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
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -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-03b"
export BK_EXAMINATION="CTLCardinality"
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-03b, examination is CTLCardinality"
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-174853729700641"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/AutonomousCar-PT-03b.tgz
mv AutonomousCar-PT-03b execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;