About the Execution of ITS-Tools for AutonomousCar-PT-02b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1062.132 | 648465.00 | 721930.00 | 2071.50 | TFTTTFFFTFFFFTFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2026-input.r018-smll-177946787900025.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-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-5973
Executing tool itstools
Input is AutonomousCar-PT-02b, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r018-smll-177946787900025
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 508K
-rw-r--r-- 1 mcc users 7.3K Mar 5 16:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Mar 5 16:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Mar 5 16:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Mar 5 16:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 15 07:18 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 07:18 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 07:18 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Mar 5 16:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K Mar 5 16:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Mar 5 16:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Mar 5 16:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 07:18 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 07:18 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 49K Mar 3 18:30 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-02b-CTLCardinality-2024-00
FORMULA_NAME AutonomousCar-PT-02b-CTLCardinality-2024-01
FORMULA_NAME AutonomousCar-PT-02b-CTLCardinality-2024-02
FORMULA_NAME AutonomousCar-PT-02b-CTLCardinality-2024-03
FORMULA_NAME AutonomousCar-PT-02b-CTLCardinality-2024-04
FORMULA_NAME AutonomousCar-PT-02b-CTLCardinality-2024-05
FORMULA_NAME AutonomousCar-PT-02b-CTLCardinality-2024-06
FORMULA_NAME AutonomousCar-PT-02b-CTLCardinality-2024-07
FORMULA_NAME AutonomousCar-PT-02b-CTLCardinality-2024-08
FORMULA_NAME AutonomousCar-PT-02b-CTLCardinality-2024-09
FORMULA_NAME AutonomousCar-PT-02b-CTLCardinality-2024-10
FORMULA_NAME AutonomousCar-PT-02b-CTLCardinality-2024-11
FORMULA_NAME AutonomousCar-PT-02b-CTLCardinality-2024-12
FORMULA_NAME AutonomousCar-PT-02b-CTLCardinality-2024-13
FORMULA_NAME AutonomousCar-PT-02b-CTLCardinality-2024-14
FORMULA_NAME AutonomousCar-PT-02b-CTLCardinality-2024-15
=== Now, execution of the tool begins
BK_START 1779473236611
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-02b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202604301425
[2026-05-22 18:07:19] [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]
[2026-05-22 18:07:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-22 18:07:20] [INFO ] Load time of PNML (sax parser for PT used): 137 ms
[2026-05-22 18:07:20] [INFO ] Transformed 155 places.
[2026-05-22 18:07:20] [INFO ] Transformed 194 transitions.
[2026-05-22 18:07:20] [INFO ] Found NUPN structural information;
[2026-05-22 18:07:20] [INFO ] Parsed PT model containing 155 places and 194 transitions and 620 arcs in 354 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 33 ms.
Initial state reduction rules removed 1 formulas.
FORMULA AutonomousCar-PT-02b-CTLCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-02b-CTLCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 83 out of 155 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 155/155 places, 194/194 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 151 transition count 190
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 151 transition count 190
Applied a total of 8 rules in 53 ms. Remains 151 /155 variables (removed 4) and now considering 190/194 (removed 4) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8084905574758072675.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14380076412821853953.kers'
[2026-05-22 18:07:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8084905574758072675.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14380076412821853953.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 190 rows 151 cols 612 entries
Finished phase 1 with 144 SingleSign rule and 0 generalized
[2026-05-22 18:07:20] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-14380076412821853953.kers
Total runtime 3 ms.
[2026-05-22 18:07:20] [INFO ] Implicit Places using invariants in 464 ms returned []
[2026-05-22 18:07:20] [INFO ] Invariant cache hit.
[2026-05-22 18:07:21] [INFO ] Implicit Places using invariants and state equation in 330 ms returned []
Implicit Place search using SMT with State Equation took 861 ms to find 0 implicit places.
Running 189 sub problems to find dead transitions.
[2026-05-22 18:07:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 1 (OVERLAPS) 1/151 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/151 variables, 6/33 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/151 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 189 unsolved
Problem TDEAD10 is UNSAT
Problem TDEAD178 is UNSAT
At refinement iteration 5 (OVERLAPS) 190/341 variables, 151/184 constraints. Problems are: Problem set: 2 solved, 187 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/341 variables, 2/186 constraints. Problems are: Problem set: 2 solved, 187 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/341 variables, 1/187 constraints. Problems are: Problem set: 2 solved, 187 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/341 variables, 1/188 constraints. Problems are: Problem set: 2 solved, 187 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/341 variables, 2/190 constraints. Problems are: Problem set: 2 solved, 187 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 341/341 variables, and 190 constraints, problems are : Problem set: 2 solved, 187 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 151/151 constraints, PredecessorRefiner: 189/189 constraints, Known Traps: 30/30 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 2 solved, 187 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 187 unsolved
At refinement iteration 1 (OVERLAPS) 2/151 variables, 7/7 constraints. Problems are: Problem set: 2 solved, 187 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 30/37 constraints. Problems are: Problem set: 2 solved, 187 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/151 variables, 1/38 constraints. Problems are: Problem set: 2 solved, 187 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/151 variables, 1/39 constraints. Problems are: Problem set: 2 solved, 187 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/151 variables, 1/40 constraints. Problems are: Problem set: 2 solved, 187 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/151 variables, 0/40 constraints. Problems are: Problem set: 2 solved, 187 unsolved
At refinement iteration 7 (OVERLAPS) 190/341 variables, 151/191 constraints. Problems are: Problem set: 2 solved, 187 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/341 variables, 187/378 constraints. Problems are: Problem set: 2 solved, 187 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/341 variables, 2/380 constraints. Problems are: Problem set: 2 solved, 187 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/341 variables, 3/383 constraints. Problems are: Problem set: 2 solved, 187 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 341/341 variables, and 383 constraints, problems are : Problem set: 2 solved, 187 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 151/151 constraints, PredecessorRefiner: 187/189 constraints, Known Traps: 33/33 constraints, Known Traps Along Path: 5/5 constraints]
After SMT, in 60297ms problems are : Problem set: 2 solved, 187 unsolved
Search for dead transitions found 2 dead transitions in 60325ms
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 : 151/155 places, 188/194 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 150 transition count 188
Applied a total of 1 rules in 11 ms. Remains 150 /151 variables (removed 1) and now considering 188/188 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2620225142684779534.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1268255036770755677.kers'
[2026-05-22 18:08:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2620225142684779534.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1268255036770755677.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 188 rows 150 cols 606 entries
Finished phase 1 with 143 SingleSign rule and 0 generalized
[2026-05-22 18:08:21] [INFO ] Computed 7 invariants in 4 ms
Computed 7 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-1268255036770755677.kers
Total runtime 7 ms.
[2026-05-22 18:08:21] [INFO ] Implicit Places using invariants in 112 ms returned []
[2026-05-22 18:08:21] [INFO ] Invariant cache hit.
[2026-05-22 18:08:21] [INFO ] Implicit Places using invariants and state equation in 189 ms returned []
Implicit Place search using SMT with State Equation took 304 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 150/155 places, 188/194 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61643 ms. Remains : 150/155 places, 188/194 transitions.
Starting structural reductions in LTL mode, iteration 0 : 150/150 places, 188/188 transitions.
Applied a total of 0 rules in 4 ms. Remains 150 /150 variables (removed 0) and now considering 188/188 (removed 0) transitions.
[2026-05-22 18:08:21] [INFO ] Invariant cache hit.
[2026-05-22 18:08:21] [INFO ] Implicit Places using invariants in 84 ms returned []
[2026-05-22 18:08:21] [INFO ] Invariant cache hit.
[2026-05-22 18:08:22] [INFO ] Implicit Places using invariants and state equation in 226 ms returned []
Implicit Place search using SMT with State Equation took 327 ms to find 0 implicit places.
Running 187 sub problems to find dead transitions.
[2026-05-22 18:08:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 1 (OVERLAPS) 1/150 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/150 variables, 7/34 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/150 variables, 4/38 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/150 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 6 (OVERLAPS) 188/338 variables, 150/188 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/338 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 8 (OVERLAPS) 0/338 variables, 1/189 constraints. Problems are: Problem set: 0 solved, 187 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 9 (INCLUDED_ONLY) 0/338 variables, 1/190 constraints. Problems are: Problem set: 0 solved, 187 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 338/338 variables, and 190 constraints, problems are : Problem set: 0 solved, 187 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 150/150 constraints, PredecessorRefiner: 187/187 constraints, Known Traps: 31/31 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 187 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 1 (OVERLAPS) 1/150 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 31/38 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/150 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 4 (OVERLAPS) 188/338 variables, 150/188 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/338 variables, 187/375 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/338 variables, 1/376 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/338 variables, 2/378 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/338 variables, 2/380 constraints. Problems are: Problem set: 0 solved, 187 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 338/338 variables, and 380 constraints, problems are : Problem set: 0 solved, 187 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 150/150 constraints, PredecessorRefiner: 187/187 constraints, Known Traps: 32/32 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 60108ms problems are : Problem set: 0 solved, 187 unsolved
Search for dead transitions found 0 dead transitions in 60111ms
Finished structural reductions in LTL mode , in 1 iterations and 60445 ms. Remains : 150/150 places, 188/188 transitions.
Support contains 83 out of 150 places after structural reductions.
[2026-05-22 18:09:22] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2026-05-22 18:09:22] [INFO ] Flatten gal took : 86 ms
FORMULA AutonomousCar-PT-02b-CTLCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-22 18:09:22] [INFO ] Flatten gal took : 34 ms
[2026-05-22 18:09:22] [INFO ] Input system was already deterministic with 188 transitions.
Support contains 63 out of 150 places (down from 83) after GAL structural reductions.
RANDOM walk for 40000 steps (16 resets) in 2426 ms. (16 steps per ms) remains 6/43 properties
BEST_FIRST walk for 40000 steps (12 resets) in 267 ms. (149 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (29 resets) in 165 ms. (240 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40000 steps (43 resets) in 162 ms. (245 steps per ms) remains 3/5 properties
BEST_FIRST walk for 40001 steps (20 resets) in 117 ms. (338 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (58 resets) in 68 ms. (579 steps per ms) remains 3/3 properties
[2026-05-22 18:09:23] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AtomicPropp23 is UNSAT
At refinement iteration 1 (OVERLAPS) 124/133 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 17/150 variables, 2/7 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/150 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 188/338 variables, 150/157 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/338 variables, 7/164 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/338 variables, 0/164 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/338 variables, 0/164 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 338/338 variables, and 164 constraints, problems are : Problem set: 1 solved, 2 unsolved in 1117 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 150/150 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 71/75 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 75/150 variables, 4/7 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/150 variables, 7/14 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/150 variables, 2/16 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/150 variables, 0/16 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 188/338 variables, 150/166 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/338 variables, 2/168 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/338 variables, 2/170 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/338 variables, 1/171 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/338 variables, 0/171 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/338 variables, 1/172 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/338 variables, 0/172 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/338 variables, 0/172 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 338/338 variables, and 172 constraints, problems are : Problem set: 1 solved, 2 unsolved in 1160 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 150/150 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 2283ms problems are : Problem set: 1 solved, 2 unsolved
Parikh walk visited 1 properties in 303 ms.
Support contains 2 out of 150 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 150/150 places, 188/188 transitions.
Graph (trivial) has 138 edges and 150 vertex of which 4 / 150 are part of one of the 2 SCC in 10 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 298 edges and 148 vertex of which 141 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.2 ms
Discarding 7 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 68 rules applied. Total rules applied 70 place count 141 transition count 111
Reduce places removed 66 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 80 rules applied. Total rules applied 150 place count 75 transition count 97
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 157 place count 68 transition count 97
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 157 place count 68 transition count 90
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 171 place count 61 transition count 90
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 182 place count 50 transition count 79
Iterating global reduction 3 with 11 rules applied. Total rules applied 193 place count 50 transition count 79
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 3 with 16 rules applied. Total rules applied 209 place count 50 transition count 63
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 209 place count 50 transition count 61
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 213 place count 48 transition count 61
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 215 place count 46 transition count 58
Iterating global reduction 4 with 2 rules applied. Total rules applied 217 place count 46 transition count 58
Performed 17 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 34 rules applied. Total rules applied 251 place count 29 transition count 40
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 254 place count 26 transition count 32
Iterating global reduction 4 with 3 rules applied. Total rules applied 257 place count 26 transition count 32
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 258 place count 26 transition count 31
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 262 place count 24 transition count 40
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 263 place count 24 transition count 39
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 264 place count 24 transition count 39
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 265 place count 23 transition count 38
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 266 place count 22 transition count 38
Applied a total of 266 rules in 87 ms. Remains 22 /150 variables (removed 128) and now considering 38/188 (removed 150) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 87 ms. Remains : 22/150 places, 38/188 transitions.
RANDOM walk for 3352 steps (230 resets) in 28 ms. (115 steps per ms) remains 0/1 properties
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
FORMULA AutonomousCar-PT-02b-CTLCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-22 18:09:26] [INFO ] Flatten gal took : 24 ms
[2026-05-22 18:09:26] [INFO ] Flatten gal took : 27 ms
[2026-05-22 18:09:26] [INFO ] Input system was already deterministic with 188 transitions.
Computed a total of 37 stabilizing places and 37 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 150/150 places, 188/188 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 134 transition count 172
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 134 transition count 172
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 35 place count 131 transition count 169
Iterating global reduction 0 with 3 rules applied. Total rules applied 38 place count 131 transition count 169
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 130 transition count 168
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 130 transition count 168
Applied a total of 40 rules in 54 ms. Remains 130 /150 variables (removed 20) and now considering 168/188 (removed 20) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14974188433736601447.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12125540443205134362.kers'
[2026-05-22 18:09:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14974188433736601447.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12125540443205134362.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 168 rows 130 cols 566 entries
Finished phase 1 with 123 SingleSign rule and 0 generalized
[2026-05-22 18:09:26] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-12125540443205134362.kers
Total runtime 6 ms.
[2026-05-22 18:09:26] [INFO ] Implicit Places using invariants in 104 ms returned []
[2026-05-22 18:09:26] [INFO ] Invariant cache hit.
[2026-05-22 18:09:27] [INFO ] Implicit Places using invariants and state equation in 202 ms returned []
Implicit Place search using SMT with State Equation took 309 ms to find 0 implicit places.
Running 167 sub problems to find dead transitions.
[2026-05-22 18:09:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 1 (OVERLAPS) 1/130 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 19/26 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 5/31 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 7 (OVERLAPS) 168/298 variables, 130/164 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/298 variables, 2/166 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/298 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 10 (OVERLAPS) 0/298 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 167 unsolved
No progress, stopping.
After SMT solving in domain Real declared 298/298 variables, and 166 constraints, problems are : Problem set: 0 solved, 167 unsolved in 23859 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 130/130 constraints, PredecessorRefiner: 167/167 constraints, Known Traps: 27/27 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 167 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 1 (OVERLAPS) 1/130 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 27/34 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 5 (OVERLAPS) 168/298 variables, 130/165 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/298 variables, 167/332 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/298 variables, 2/334 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/298 variables, 3/337 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/298 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 167 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 298/298 variables, and 337 constraints, problems are : Problem set: 0 solved, 167 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 130/130 constraints, PredecessorRefiner: 167/167 constraints, Known Traps: 28/28 constraints, Known Traps Along Path: 5/5 constraints]
After SMT, in 53937ms problems are : Problem set: 0 solved, 167 unsolved
Search for dead transitions found 0 dead transitions in 53940ms
Starting structural reductions in LTL mode, iteration 1 : 130/150 places, 168/188 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54306 ms. Remains : 130/150 places, 168/188 transitions.
[2026-05-22 18:10:21] [INFO ] Flatten gal took : 21 ms
[2026-05-22 18:10:21] [INFO ] Flatten gal took : 21 ms
[2026-05-22 18:10:21] [INFO ] Input system was already deterministic with 168 transitions.
[2026-05-22 18:10:21] [INFO ] Flatten gal took : 20 ms
[2026-05-22 18:10:21] [INFO ] Flatten gal took : 20 ms
[2026-05-22 18:10:21] [INFO ] Time to serialize gal into /tmp/CTLCardinality4906962654621090190.gal : 11 ms
[2026-05-22 18:10:21] [INFO ] Time to serialize properties into /tmp/CTLCardinality8127433233228361734.ctl : 9 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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality4906962654621090190.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8127433233228361734.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/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,2.34425e+06,0.380668,10548,2,2766,5,24734,6,0,690,28996,0
Converting to forward existential form...Done !
original formula: EF((AX(AF((p106==1))) + A((((p133!=1)||(p31!=1)) * EX((p3==1))) U ((EX(((p100==0)||(p144==1))) * (((p117==0)||(p43==1))||((p73==0)||(p20=...180
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(EX(!(!(EG(!((p106==1))))))))] != FALSE + [((FwdU(Init,TRUE) * !(EG(!(((EX(((p100==0)||(p1...493
Reverse transition relation is NOT exact ! Due to transitions t10, t17, t18, t25, t34, t39, t40, t64, t65, t68, t69, t71, t84, t89, t90, t93, t94, t96, t11...330
(forward)formula 0,1,16.9386,443028,1,0,1129,2.92945e+06,359,477,4595,2.64006e+06,1296
FORMULA AutonomousCar-PT-02b-CTLCardinality-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 150/150 places, 188/188 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 130 transition count 168
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 130 transition count 168
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 56 place count 130 transition count 152
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 61 place count 125 transition count 147
Iterating global reduction 1 with 5 rules applied. Total rules applied 66 place count 125 transition count 147
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 67 place count 124 transition count 146
Iterating global reduction 1 with 1 rules applied. Total rules applied 68 place count 124 transition count 146
Applied a total of 68 rules in 14 ms. Remains 124 /150 variables (removed 26) and now considering 146/188 (removed 42) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11858170759457870779.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12894362992865837703.kers'
[2026-05-22 18:10:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11858170759457870779.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12894362992865837703.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 146 rows 124 cols 426 entries
Finished phase 1 with 117 SingleSign rule and 0 generalized
[2026-05-22 18:10:38] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12894362992865837703.kers
Total runtime 2 ms.
[2026-05-22 18:10:38] [INFO ] Implicit Places using invariants in 65 ms returned []
[2026-05-22 18:10:38] [INFO ] Invariant cache hit.
[2026-05-22 18:10:38] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
Running 145 sub problems to find dead transitions.
[2026-05-22 18:10:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 17/24 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 6/30 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 5 (OVERLAPS) 146/270 variables, 124/154 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 2/156 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/270 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 8 (OVERLAPS) 0/270 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 145 unsolved
No progress, stopping.
After SMT solving in domain Real declared 270/270 variables, and 156 constraints, problems are : Problem set: 0 solved, 145 unsolved in 15223 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 145/145 constraints, Known Traps: 23/23 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 145 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 23/30 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 6 (OVERLAPS) 146/270 variables, 124/156 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/270 variables, 145/301 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/270 variables, 3/304 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/270 variables, 2/306 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/270 variables, 4/310 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/270 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 145 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 270/270 variables, and 310 constraints, problems are : Problem set: 0 solved, 145 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 145/145 constraints, Known Traps: 28/28 constraints, Known Traps Along Path: 6/6 constraints]
After SMT, in 45263ms problems are : Problem set: 0 solved, 145 unsolved
Search for dead transitions found 0 dead transitions in 45265ms
Starting structural reductions in LTL mode, iteration 1 : 124/150 places, 146/188 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45491 ms. Remains : 124/150 places, 146/188 transitions.
[2026-05-22 18:11:23] [INFO ] Flatten gal took : 17 ms
[2026-05-22 18:11:23] [INFO ] Flatten gal took : 16 ms
[2026-05-22 18:11:23] [INFO ] Input system was already deterministic with 146 transitions.
[2026-05-22 18:11:23] [INFO ] Flatten gal took : 12 ms
[2026-05-22 18:11:23] [INFO ] Flatten gal took : 13 ms
[2026-05-22 18:11:23] [INFO ] Time to serialize gal into /tmp/CTLCardinality9092217043416869584.gal : 5 ms
[2026-05-22 18:11:23] [INFO ] Time to serialize properties into /tmp/CTLCardinality15058834586503033965.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality9092217043416869584.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15058834586503033965.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.72657e+06,0.297143,10248,2,2580,5,24320,6,0,644,28437,0
Converting to forward existential form...Done !
original formula: EX((AG((p92==0)) + ((p52==1)&&(p9==1))))
=> equivalent forward existential formula: ([(EY(Init) * !(E(TRUE U !((p92==0)))))] != FALSE + [(EY(Init) * ((p52==1)&&(p9==1)))] != FALSE)
Reverse transition relation is NOT exact ! Due to transitions t10, t16, t17, t24, t32, t35, t36, t37, t61, t62, t65, t66, t68, t81, t86, t87, t90, t91, t93...305
(forward)formula 0,0,3.13921,76368,1,0,295,441391,315,164,4038,302201,368
FORMULA AutonomousCar-PT-02b-CTLCardinality-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 150/150 places, 188/188 transitions.
Graph (trivial) has 139 edges and 150 vertex of which 4 / 150 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 70 rules applied. Total rules applied 71 place count 147 transition count 115
Reduce places removed 70 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 84 rules applied. Total rules applied 155 place count 77 transition count 101
Reduce places removed 7 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 9 rules applied. Total rules applied 164 place count 70 transition count 99
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 4 rules applied. Total rules applied 168 place count 68 transition count 97
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 169 place count 67 transition count 97
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 5 Pre rules applied. Total rules applied 169 place count 67 transition count 92
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 179 place count 62 transition count 92
Discarding 12 places :
Symmetric choice reduction at 5 with 12 rule applications. Total rules 191 place count 50 transition count 80
Iterating global reduction 5 with 12 rules applied. Total rules applied 203 place count 50 transition count 80
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 5 with 16 rules applied. Total rules applied 219 place count 50 transition count 64
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 219 place count 50 transition count 62
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 223 place count 48 transition count 62
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 225 place count 46 transition count 59
Iterating global reduction 6 with 2 rules applied. Total rules applied 227 place count 46 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 6 with 2 rules applied. Total rules applied 229 place count 46 transition count 57
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 230 place count 45 transition count 57
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 8 with 24 rules applied. Total rules applied 254 place count 33 transition count 45
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 257 place count 30 transition count 37
Iterating global reduction 8 with 3 rules applied. Total rules applied 260 place count 30 transition count 37
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 261 place count 30 transition count 36
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 263 place count 28 transition count 34
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 264 place count 27 transition count 34
Applied a total of 264 rules in 32 ms. Remains 27 /150 variables (removed 123) and now considering 34/188 (removed 154) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-327803639504675559.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6828953432374777506.kers'
[2026-05-22 18:11:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-327803639504675559.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6828953432374777506.kers]
Normalized transition count is 33 out of 34 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 33 rows 26 cols 120 entries
Finished phase 1 with 22 SingleSign rule and 0 generalized
[2026-05-22 18:11:27] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-6828953432374777506.kers
Total runtime 1 ms.
[2026-05-22 18:11:27] [INFO ] Implicit Places using invariants in 46 ms returned []
[2026-05-22 18:11:27] [INFO ] Invariant cache hit.
[2026-05-22 18:11:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-22 18:11:27] [INFO ] Implicit Places using invariants and state equation in 53 ms returned [21, 26]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 102 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 25/150 places, 34/188 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 25 transition count 33
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 24 transition count 33
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 24 transition count 32
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 23 transition count 32
Applied a total of 4 rules in 4 ms. Remains 23 /25 variables (removed 2) and now considering 32/34 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10481689583746162726.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1006537696205123118.kers'
[2026-05-22 18:11:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10481689583746162726.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1006537696205123118.kers]
Normalized transition count is 31 out of 32 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 31 rows 23 cols 113 entries
Finished phase 1 with 20 SingleSign rule and 0 generalized
[2026-05-22 18:11:27] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-1006537696205123118.kers
Total runtime 0 ms.
[2026-05-22 18:11:27] [INFO ] Implicit Places using invariants in 42 ms returned []
[2026-05-22 18:11:27] [INFO ] Invariant cache hit.
[2026-05-22 18:11:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-22 18:11:27] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 23/150 places, 32/188 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 232 ms. Remains : 23/150 places, 32/188 transitions.
[2026-05-22 18:11:27] [INFO ] Flatten gal took : 7 ms
[2026-05-22 18:11:27] [INFO ] Flatten gal took : 4 ms
[2026-05-22 18:11:27] [INFO ] Input system was already deterministic with 32 transitions.
[2026-05-22 18:11:27] [INFO ] Flatten gal took : 3 ms
RANDOM walk for 120 steps (8 resets) in 5 ms. (20 steps per ms) remains 0/1 properties
FORMULA AutonomousCar-PT-02b-CTLCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2026-05-22 18:11:27] [INFO ] Flatten gal took : 2 ms
[2026-05-22 18:11:27] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1528109166671345880.gal : 1 ms
[2026-05-22 18:11:27] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1172019309561348445.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality1528109166671345880.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1172019309561348445.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 150/150 places, 188/188 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 132 transition count 170
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 132 transition count 170
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 52 place count 132 transition count 154
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 56 place count 128 transition count 150
Iterating global reduction 1 with 4 rules applied. Total rules applied 60 place count 128 transition count 150
Applied a total of 60 rules in 19 ms. Remains 128 /150 variables (removed 22) and now considering 150/188 (removed 38) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17137154370681329479.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4546878584313525468.kers'
[2026-05-22 18:11:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17137154370681329479.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4546878584313525468.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 150 rows 128 cols 434 entries
Finished phase 1 with 121 SingleSign rule and 0 generalized
[2026-05-22 18:11:27] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-4546878584313525468.kers
Total runtime 2 ms.
[2026-05-22 18:11:27] [INFO ] Implicit Places using invariants in 83 ms returned []
[2026-05-22 18:11:27] [INFO ] Invariant cache hit.
[2026-05-22 18:11:27] [INFO ] Implicit Places using invariants and state equation in 204 ms returned []
Implicit Place search using SMT with State Equation took 291 ms to find 0 implicit places.
Running 149 sub problems to find dead transitions.
[2026-05-22 18:11:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 1 (OVERLAPS) 1/128 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 17/24 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 7/31 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 5 (OVERLAPS) 150/278 variables, 128/159 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/278 variables, 2/161 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/278 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/278 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/278 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 10 (OVERLAPS) 0/278 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 149 unsolved
No progress, stopping.
After SMT solving in domain Real declared 278/278 variables, and 163 constraints, problems are : Problem set: 0 solved, 149 unsolved in 20990 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 149/149 constraints, Known Traps: 26/26 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 149 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 1 (OVERLAPS) 1/128 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 26/33 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 4 (OVERLAPS) 150/278 variables, 128/161 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/278 variables, 149/310 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/278 variables, 1/311 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/278 variables, 1/312 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/278 variables, 2/314 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/278 variables, 4/318 constraints. Problems are: Problem set: 0 solved, 149 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 278/278 variables, and 318 constraints, problems are : Problem set: 0 solved, 149 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 149/149 constraints, Known Traps: 28/28 constraints, Known Traps Along Path: 6/6 constraints]
After SMT, in 51029ms problems are : Problem set: 0 solved, 149 unsolved
Search for dead transitions found 0 dead transitions in 51030ms
Starting structural reductions in LTL mode, iteration 1 : 128/150 places, 150/188 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51344 ms. Remains : 128/150 places, 150/188 transitions.
[2026-05-22 18:12:18] [INFO ] Flatten gal took : 11 ms
[2026-05-22 18:12:18] [INFO ] Flatten gal took : 10 ms
[2026-05-22 18:12:18] [INFO ] Input system was already deterministic with 150 transitions.
[2026-05-22 18:12:18] [INFO ] Flatten gal took : 10 ms
[2026-05-22 18:12:18] [INFO ] Flatten gal took : 10 ms
[2026-05-22 18:12:18] [INFO ] Time to serialize gal into /tmp/CTLCardinality6202019999775789016.gal : 2 ms
[2026-05-22 18:12:18] [INFO ] Time to serialize properties into /tmp/CTLCardinality16570317999612897173.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality6202019999775789016.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16570317999612897173.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.97695e+06,0.207316,9092,2,2452,5,20313,6,0,664,22195,0
Converting to forward existential form...Done !
original formula: EX(((EG(AX(((p136==0)||(p89==1)))) * (p9==0)) * ((p104==0)||(p1==1))))
=> equivalent forward existential formula: [FwdG(((EY(Init) * ((p104==0)||(p1==1))) * (p9==0)),!(EX(!(((p136==0)||(p89==1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t10, t16, t17, t26, t34, t38, t39, t40, t64, t65, t68, t69, t71, t84, t89, t90, t93, t94, t96...305
(forward)formula 0,1,6.05406,157080,1,0,793,715011,325,475,3993,972145,767
FORMULA AutonomousCar-PT-02b-CTLCardinality-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 150/150 places, 188/188 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 131 transition count 169
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 131 transition count 169
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 54 place count 131 transition count 153
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 59 place count 126 transition count 148
Iterating global reduction 1 with 5 rules applied. Total rules applied 64 place count 126 transition count 148
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 65 place count 125 transition count 147
Iterating global reduction 1 with 1 rules applied. Total rules applied 66 place count 125 transition count 147
Applied a total of 66 rules in 8 ms. Remains 125 /150 variables (removed 25) and now considering 147/188 (removed 41) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8092929734925095708.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10747777613752899448.kers'
[2026-05-22 18:12:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8092929734925095708.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10747777613752899448.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 147 rows 125 cols 428 entries
Finished phase 1 with 118 SingleSign rule and 0 generalized
[2026-05-22 18:12:25] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10747777613752899448.kers
Total runtime 1 ms.
[2026-05-22 18:12:25] [INFO ] Implicit Places using invariants in 70 ms returned []
[2026-05-22 18:12:25] [INFO ] Invariant cache hit.
[2026-05-22 18:12:25] [INFO ] Implicit Places using invariants and state equation in 175 ms returned []
Implicit Place search using SMT with State Equation took 260 ms to find 0 implicit places.
Running 146 sub problems to find dead transitions.
[2026-05-22 18:12:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (OVERLAPS) 1/125 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 15/22 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 5/27 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 6 (OVERLAPS) 147/272 variables, 125/154 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/272 variables, 2/156 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/272 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 9 (OVERLAPS) 0/272 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Real declared 272/272 variables, and 156 constraints, problems are : Problem set: 0 solved, 146 unsolved in 18976 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 125/125 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 146 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (OVERLAPS) 1/125 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 22/29 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 4 (OVERLAPS) 147/272 variables, 125/154 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/272 variables, 146/300 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/272 variables, 1/301 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/272 variables, 2/303 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/272 variables, 4/307 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/272 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 10 (OVERLAPS) 0/272 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Int declared 272/272 variables, and 307 constraints, problems are : Problem set: 0 solved, 146 unsolved in 29879 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 125/125 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 23/23 constraints, Known Traps Along Path: 6/6 constraints]
After SMT, in 48879ms problems are : Problem set: 0 solved, 146 unsolved
Search for dead transitions found 0 dead transitions in 48880ms
Starting structural reductions in LTL mode, iteration 1 : 125/150 places, 147/188 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49164 ms. Remains : 125/150 places, 147/188 transitions.
[2026-05-22 18:13:14] [INFO ] Flatten gal took : 7 ms
[2026-05-22 18:13:14] [INFO ] Flatten gal took : 8 ms
[2026-05-22 18:13:14] [INFO ] Input system was already deterministic with 147 transitions.
[2026-05-22 18:13:14] [INFO ] Flatten gal took : 7 ms
[2026-05-22 18:13:14] [INFO ] Flatten gal took : 17 ms
[2026-05-22 18:13:14] [INFO ] Time to serialize gal into /tmp/CTLCardinality15890779677347667543.gal : 2 ms
[2026-05-22 18:13:14] [INFO ] Time to serialize properties into /tmp/CTLCardinality11299456625348269892.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality15890779677347667543.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11299456625348269892.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.79584e+06,0.191974,9636,2,2580,5,22027,6,0,649,25455,0
Converting to forward existential form...Done !
original formula: EG(AF(AX((p105==0))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(!(!(EX(!((p105==0))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t10, t16, t17, t24, t32, t35, t36, t38, t62, t63, t66, t67, t69, t82, t87, t88, t91, t92, t94...305
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,7.6391,177020,1,0,878,886846,323,526,4131,1.04794e+06,873
FORMULA AutonomousCar-PT-02b-CTLCardinality-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 150/150 places, 188/188 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 131 transition count 169
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 131 transition count 169
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 54 place count 131 transition count 153
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 57 place count 128 transition count 150
Iterating global reduction 1 with 3 rules applied. Total rules applied 60 place count 128 transition count 150
Applied a total of 60 rules in 8 ms. Remains 128 /150 variables (removed 22) and now considering 150/188 (removed 38) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13264785199897956689.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10909795091470225690.kers'
[2026-05-22 18:13:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13264785199897956689.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10909795091470225690.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 150 rows 128 cols 434 entries
Finished phase 1 with 121 SingleSign rule and 0 generalized
[2026-05-22 18:13:21] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10909795091470225690.kers
Total runtime 2 ms.
[2026-05-22 18:13:22] [INFO ] Implicit Places using invariants in 106 ms returned []
[2026-05-22 18:13:22] [INFO ] Invariant cache hit.
[2026-05-22 18:13:22] [INFO ] Implicit Places using invariants and state equation in 206 ms returned []
Implicit Place search using SMT with State Equation took 320 ms to find 0 implicit places.
Running 149 sub problems to find dead transitions.
[2026-05-22 18:13:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 1 (OVERLAPS) 1/128 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 19/26 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 7 (OVERLAPS) 150/278 variables, 128/158 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/278 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/278 variables, 2/161 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/278 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 11 (OVERLAPS) 0/278 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 149 unsolved
No progress, stopping.
After SMT solving in domain Real declared 278/278 variables, and 161 constraints, problems are : Problem set: 0 solved, 149 unsolved in 21936 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 149/149 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 149 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 1 (OVERLAPS) 1/128 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 5 (OVERLAPS) 150/278 variables, 128/160 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/278 variables, 149/309 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/278 variables, 2/311 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/278 variables, 2/313 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/278 variables, 2/315 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/278 variables, 1/316 constraints. Problems are: Problem set: 0 solved, 149 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 278/278 variables, and 316 constraints, problems are : Problem set: 0 solved, 149 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 149/149 constraints, Known Traps: 27/27 constraints, Known Traps Along Path: 5/5 constraints]
After SMT, in 51962ms problems are : Problem set: 0 solved, 149 unsolved
Search for dead transitions found 0 dead transitions in 51963ms
Starting structural reductions in LTL mode, iteration 1 : 128/150 places, 150/188 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52293 ms. Remains : 128/150 places, 150/188 transitions.
[2026-05-22 18:14:14] [INFO ] Flatten gal took : 8 ms
[2026-05-22 18:14:14] [INFO ] Flatten gal took : 8 ms
[2026-05-22 18:14:14] [INFO ] Input system was already deterministic with 150 transitions.
[2026-05-22 18:14:14] [INFO ] Flatten gal took : 7 ms
[2026-05-22 18:14:14] [INFO ] Flatten gal took : 7 ms
[2026-05-22 18:14:14] [INFO ] Time to serialize gal into /tmp/CTLCardinality18012264276997641328.gal : 2 ms
[2026-05-22 18:14:14] [INFO ] Time to serialize properties into /tmp/CTLCardinality14763653525656719360.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality18012264276997641328.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14763653525656719360.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.93321e+06,0.240608,10180,2,2607,5,24330,6,0,664,27665,0
Converting to forward existential form...Done !
original formula: EF((EG((p89==1)) + A(EG(!(((p24==1)&&(p118==1)))) U (AG((p19==1)) * AX(((p135==0)&&((p60==0)||(p99==1))))))))
=> equivalent forward existential formula: ([FwdG(FwdU(Init,TRUE),(p89==1))] != FALSE + [((FwdU(Init,TRUE) * !(EG(!((!(E(TRUE U !((p19==1)))) * !(EX(!(((p1...402
Hit Full ! (commute/partial/dont) 148/0/2
Reverse transition relation is NOT exact ! Due to transitions t10, t16, t17, t25, t33, t36, t37, t38, t63, t64, t67, t68, t70, t83, t88, t89, t92, t93, t95...305
(forward)formula 0,0,19.8629,518752,1,0,1325,3.45952e+06,341,678,4470,2.98095e+06,1687
FORMULA AutonomousCar-PT-02b-CTLCardinality-2024-05 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 : 150/150 places, 188/188 transitions.
Graph (trivial) has 139 edges and 150 vertex of which 4 / 150 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 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 70 rules applied. Total rules applied 71 place count 147 transition count 115
Reduce places removed 70 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 87 rules applied. Total rules applied 158 place count 77 transition count 98
Reduce places removed 9 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 10 rules applied. Total rules applied 168 place count 68 transition count 97
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 169 place count 67 transition count 97
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 169 place count 67 transition count 92
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 179 place count 62 transition count 92
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 191 place count 50 transition count 80
Iterating global reduction 4 with 12 rules applied. Total rules applied 203 place count 50 transition count 80
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 4 with 16 rules applied. Total rules applied 219 place count 50 transition count 64
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 219 place count 50 transition count 62
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 223 place count 48 transition count 62
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 225 place count 46 transition count 59
Iterating global reduction 5 with 2 rules applied. Total rules applied 227 place count 46 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 5 with 2 rules applied. Total rules applied 229 place count 46 transition count 57
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 230 place count 45 transition count 57
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 7 with 24 rules applied. Total rules applied 254 place count 33 transition count 45
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 256 place count 31 transition count 40
Iterating global reduction 7 with 2 rules applied. Total rules applied 258 place count 31 transition count 40
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 2 rules applied. Total rules applied 260 place count 31 transition count 38
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 261 place count 30 transition count 38
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 262 place count 30 transition count 37
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 264 place count 28 transition count 35
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 265 place count 27 transition count 35
Applied a total of 265 rules in 23 ms. Remains 27 /150 variables (removed 123) and now considering 35/188 (removed 153) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3707691658628126027.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9308565587091741082.kers'
[2026-05-22 18:14:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3707691658628126027.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9308565587091741082.kers]
Normalized transition count is 34 out of 35 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 34 rows 26 cols 130 entries
Finished phase 1 with 22 SingleSign rule and 0 generalized
[2026-05-22 18:14:34] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-9308565587091741082.kers
Total runtime 0 ms.
[2026-05-22 18:14:34] [INFO ] Implicit Places using invariants in 41 ms returned []
[2026-05-22 18:14:34] [INFO ] Invariant cache hit.
[2026-05-22 18:14:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-22 18:14:34] [INFO ] Implicit Places using invariants and state equation in 49 ms returned [19, 26]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 91 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 25/150 places, 35/188 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 25 transition count 34
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 24 transition count 34
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 24 transition count 33
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 23 transition count 33
Applied a total of 4 rules in 3 ms. Remains 23 /25 variables (removed 2) and now considering 33/35 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13410122019265192178.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14840069436917369406.kers'
[2026-05-22 18:14:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13410122019265192178.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14840069436917369406.kers]
Normalized transition count is 32 out of 33 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 32 rows 23 cols 123 entries
Finished phase 1 with 20 SingleSign rule and 0 generalized
[2026-05-22 18:14:34] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-14840069436917369406.kers
Total runtime 0 ms.
[2026-05-22 18:14:34] [INFO ] Implicit Places using invariants in 28 ms returned []
[2026-05-22 18:14:34] [INFO ] Invariant cache hit.
[2026-05-22 18:14:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-22 18:14:34] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 23/150 places, 33/188 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 192 ms. Remains : 23/150 places, 33/188 transitions.
[2026-05-22 18:14:34] [INFO ] Flatten gal took : 2 ms
[2026-05-22 18:14:34] [INFO ] Flatten gal took : 2 ms
[2026-05-22 18:14:34] [INFO ] Input system was already deterministic with 33 transitions.
[2026-05-22 18:14:34] [INFO ] Flatten gal took : 2 ms
[2026-05-22 18:14:34] [INFO ] Flatten gal took : 1 ms
[2026-05-22 18:14:34] [INFO ] Time to serialize gal into /tmp/CTLCardinality4757597582564066579.gal : 0 ms
[2026-05-22 18:14:34] [INFO ] Time to serialize properties into /tmp/CTLCardinality5958420761502259980.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality4757597582564066579.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5958420761502259980.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/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,1152,0.012706,4156,2,103,5,927,6,0,124,1089,0
Converting to forward existential form...Done !
original formula: AF(AG(((p45==0)||(p137==1))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !(((p45==0)||(p137==1)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t5, t7, t9, t11, t14, t21, t31, Intersection with reachable at each step enabled. (d...199
(forward)formula 0,0,0.116071,6852,1,0,155,13411,93,95,946,20136,149
FORMULA AutonomousCar-PT-02b-CTLCardinality-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 150/150 places, 188/188 transitions.
Graph (trivial) has 130 edges and 150 vertex of which 4 / 150 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 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 0 with 63 rules applied. Total rules applied 64 place count 147 transition count 122
Reduce places removed 63 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 71 rules applied. Total rules applied 135 place count 84 transition count 114
Reduce places removed 4 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 6 rules applied. Total rules applied 141 place count 80 transition count 112
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 143 place count 78 transition count 112
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 143 place count 78 transition count 104
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 159 place count 70 transition count 104
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 171 place count 58 transition count 92
Iterating global reduction 4 with 12 rules applied. Total rules applied 183 place count 58 transition count 92
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 184 place count 58 transition count 91
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 186 place count 56 transition count 86
Iterating global reduction 5 with 2 rules applied. Total rules applied 188 place count 56 transition count 86
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 5 with 26 rules applied. Total rules applied 214 place count 43 transition count 73
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 217 place count 40 transition count 59
Iterating global reduction 5 with 3 rules applied. Total rules applied 220 place count 40 transition count 59
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 223 place count 40 transition count 56
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 5 with 2 rules applied. Total rules applied 225 place count 40 transition count 54
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 227 place count 38 transition count 54
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 228 place count 38 transition count 54
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 229 place count 37 transition count 53
Applied a total of 229 rules in 54 ms. Remains 37 /150 variables (removed 113) and now considering 53/188 (removed 135) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5274514653719893707.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3801941901729102887.kers'
[2026-05-22 18:14:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5274514653719893707.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3801941901729102887.kers]
Normalized transition count is 52 out of 53 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 52 rows 36 cols 203 entries
Finished phase 1 with 31 SingleSign rule and 0 generalized
[2026-05-22 18:14:34] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-3801941901729102887.kers
Total runtime 1 ms.
[2026-05-22 18:14:34] [INFO ] Implicit Places using invariants in 61 ms returned []
[2026-05-22 18:14:34] [INFO ] Invariant cache hit.
[2026-05-22 18:14:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-22 18:14:34] [INFO ] Implicit Places using invariants and state equation in 99 ms returned [28, 36]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 182 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 35/150 places, 53/188 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 35 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 34 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 34 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 33 transition count 51
Applied a total of 4 rules in 5 ms. Remains 33 /35 variables (removed 2) and now considering 51/53 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16821897395593968856.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-684702538835858091.kers'
[2026-05-22 18:14:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16821897395593968856.kers, --Pflows, --basisKERS=/tmp/petrispot-output-684702538835858091.kers]
Normalized transition count is 50 out of 51 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 50 rows 32 cols 193 entries
Finished phase 1 with 29 SingleSign rule and 0 generalized
[2026-05-22 18:14:34] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-684702538835858091.kers
Total runtime 1 ms.
[2026-05-22 18:14:34] [INFO ] Implicit Places using invariants in 55 ms returned []
[2026-05-22 18:14:34] [INFO ] Invariant cache hit.
[2026-05-22 18:14:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-22 18:14:34] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 33/150 places, 51/188 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 373 ms. Remains : 33/150 places, 51/188 transitions.
[2026-05-22 18:14:34] [INFO ] Flatten gal took : 4 ms
[2026-05-22 18:14:34] [INFO ] Flatten gal took : 4 ms
[2026-05-22 18:14:34] [INFO ] Input system was already deterministic with 51 transitions.
[2026-05-22 18:14:35] [INFO ] Flatten gal took : 4 ms
[2026-05-22 18:14:35] [INFO ] Flatten gal took : 4 ms
[2026-05-22 18:14:35] [INFO ] Time to serialize gal into /tmp/CTLCardinality5768995569062285094.gal : 1 ms
[2026-05-22 18:14:35] [INFO ] Time to serialize properties into /tmp/CTLCardinality2763107818854453326.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality5768995569062285094.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2763107818854453326.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/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,5403,0.041185,4540,2,296,5,2581,6,0,181,2627,0
Converting to forward existential form...Done !
original formula: A(((p3==0)||((p116==0)&&((p62==0)||(p34==1)))) U !(A((p125==0) U EG((p113==1)))))
=> equivalent forward existential formula: [((Init * !(EG(!(!(!((E(!(EG((p113==1))) U (!((p125==0)) * !(EG((p113==1))))) + EG(!(EG((p113==1))))))))))) * !(...403
Reverse transition relation is NOT exact ! Due to transitions t1, t6, t7, t8, t10, t16, t18, t21, t23, t24, t25, t28, t30, t49, Intersection with reachabl...226
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,0.8938,26500,1,0,726,133545,136,431,1532,149540,724
FORMULA AutonomousCar-PT-02b-CTLCardinality-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 150/150 places, 188/188 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 132 transition count 170
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 132 transition count 170
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 52 place count 132 transition count 154
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 57 place count 127 transition count 149
Iterating global reduction 1 with 5 rules applied. Total rules applied 62 place count 127 transition count 149
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 63 place count 126 transition count 148
Iterating global reduction 1 with 1 rules applied. Total rules applied 64 place count 126 transition count 148
Applied a total of 64 rules in 5 ms. Remains 126 /150 variables (removed 24) and now considering 148/188 (removed 40) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2749797951949642725.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10728551934290878324.kers'
[2026-05-22 18:14:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2749797951949642725.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10728551934290878324.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 148 rows 126 cols 430 entries
Finished phase 1 with 119 SingleSign rule and 0 generalized
[2026-05-22 18:14:35] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10728551934290878324.kers
Total runtime 1 ms.
[2026-05-22 18:14:35] [INFO ] Implicit Places using invariants in 58 ms returned []
[2026-05-22 18:14:35] [INFO ] Invariant cache hit.
[2026-05-22 18:14:36] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 184 ms to find 0 implicit places.
Running 147 sub problems to find dead transitions.
[2026-05-22 18:14:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 1 (OVERLAPS) 1/126 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 5/32 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 5 (OVERLAPS) 148/274 variables, 126/158 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/274 variables, 2/160 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/274 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 8 (OVERLAPS) 0/274 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/274 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 10 (OVERLAPS) 0/274 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 147 unsolved
No progress, stopping.
After SMT solving in domain Real declared 274/274 variables, and 161 constraints, problems are : Problem set: 0 solved, 147 unsolved in 16734 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 126/126 constraints, PredecessorRefiner: 147/147 constraints, Known Traps: 26/26 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 147 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 1 (OVERLAPS) 1/126 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 26/33 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 4 (OVERLAPS) 148/274 variables, 126/159 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/274 variables, 147/306 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/274 variables, 2/308 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/274 variables, 1/309 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/274 variables, 2/311 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/274 variables, 3/314 constraints. Problems are: Problem set: 0 solved, 147 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 274/274 variables, and 314 constraints, problems are : Problem set: 0 solved, 147 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 126/126 constraints, PredecessorRefiner: 147/147 constraints, Known Traps: 27/27 constraints, Known Traps Along Path: 7/7 constraints]
After SMT, in 46760ms problems are : Problem set: 0 solved, 147 unsolved
Search for dead transitions found 0 dead transitions in 46761ms
Starting structural reductions in LTL mode, iteration 1 : 126/150 places, 148/188 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46950 ms. Remains : 126/150 places, 148/188 transitions.
[2026-05-22 18:15:22] [INFO ] Flatten gal took : 9 ms
[2026-05-22 18:15:22] [INFO ] Flatten gal took : 9 ms
[2026-05-22 18:15:22] [INFO ] Input system was already deterministic with 148 transitions.
[2026-05-22 18:15:22] [INFO ] Flatten gal took : 9 ms
[2026-05-22 18:15:22] [INFO ] Flatten gal took : 8 ms
[2026-05-22 18:15:22] [INFO ] Time to serialize gal into /tmp/CTLCardinality9909720001214154718.gal : 2 ms
[2026-05-22 18:15:22] [INFO ] Time to serialize properties into /tmp/CTLCardinality10397314799233515690.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality9909720001214154718.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10397314799233515690.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.8183e+06,0.301471,9772,2,2617,5,22420,6,0,654,26086,0
Converting to forward existential form...Done !
original formula: (AG(AF(EX(E(((p83==0)||(p123==1)) U (p92==1))))) * EF((AX(FALSE) + (p7==1))))
=> equivalent forward existential formula: ([FwdG(FwdU(Init,TRUE),!(EX(E(((p83==0)||(p123==1)) U (p92==1)))))] = FALSE * [(Init * !(E(TRUE U (!(EX(!(FALSE)...181
Reverse transition relation is NOT exact ! Due to transitions t10, t16, t17, t25, t29, t33, t36, t37, t38, t62, t63, t66, t67, t69, t82, t87, t88, t91, t92...322
(forward)formula 0,0,15.4934,385140,1,0,754,2.27887e+06,328,338,4168,2.19396e+06,833
FORMULA AutonomousCar-PT-02b-CTLCardinality-2024-09 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 : 150/150 places, 188/188 transitions.
Graph (trivial) has 108 edges and 150 vertex of which 4 / 150 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 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 44 rules applied. Total rules applied 45 place count 147 transition count 141
Reduce places removed 44 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 50 rules applied. Total rules applied 95 place count 103 transition count 135
Reduce places removed 3 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 2 with 10 rules applied. Total rules applied 105 place count 100 transition count 128
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 113 place count 93 transition count 127
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 113 place count 93 transition count 119
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 129 place count 85 transition count 119
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 138 place count 76 transition count 110
Iterating global reduction 4 with 9 rules applied. Total rules applied 147 place count 76 transition count 110
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 4 with 17 rules applied. Total rules applied 164 place count 76 transition count 93
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 164 place count 76 transition count 91
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 168 place count 74 transition count 91
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 169 place count 73 transition count 90
Iterating global reduction 5 with 1 rules applied. Total rules applied 170 place count 73 transition count 90
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 5 with 22 rules applied. Total rules applied 192 place count 62 transition count 79
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 195 place count 59 transition count 71
Iterating global reduction 5 with 3 rules applied. Total rules applied 198 place count 59 transition count 71
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 199 place count 59 transition count 70
Partial Post-agglomeration rule applied 3 times.
Drop transitions (Partial Post agglomeration) removed 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 202 place count 59 transition count 70
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 204 place count 57 transition count 68
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 205 place count 56 transition count 68
Applied a total of 205 rules in 30 ms. Remains 56 /150 variables (removed 94) and now considering 68/188 (removed 120) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4999562899895999092.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9055045413597693882.kers'
[2026-05-22 18:15:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4999562899895999092.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9055045413597693882.kers]
Normalized transition count is 67 out of 68 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 67 rows 56 cols 203 entries
Finished phase 1 with 51 SingleSign rule and 0 generalized
[2026-05-22 18:15:38] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-9055045413597693882.kers
Total runtime 1 ms.
[2026-05-22 18:15:38] [INFO ] Implicit Places using invariants in 81 ms returned []
[2026-05-22 18:15:38] [INFO ] Invariant cache hit.
[2026-05-22 18:15:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-22 18:15:38] [INFO ] Implicit Places using invariants and state equation in 105 ms returned [55]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 190 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 55/150 places, 68/188 transitions.
Applied a total of 0 rules in 3 ms. Remains 55 /55 variables (removed 0) and now considering 68/68 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 223 ms. Remains : 55/150 places, 68/188 transitions.
[2026-05-22 18:15:38] [INFO ] Flatten gal took : 5 ms
[2026-05-22 18:15:38] [INFO ] Flatten gal took : 5 ms
[2026-05-22 18:15:38] [INFO ] Input system was already deterministic with 68 transitions.
[2026-05-22 18:15:38] [INFO ] Flatten gal took : 4 ms
[2026-05-22 18:15:38] [INFO ] Flatten gal took : 4 ms
[2026-05-22 18:15:38] [INFO ] Time to serialize gal into /tmp/CTLCardinality9242404876546613073.gal : 1 ms
[2026-05-22 18:15:38] [INFO ] Time to serialize properties into /tmp/CTLCardinality5465510563570542950.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality9242404876546613073.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5465510563570542950.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/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,27748,0.042334,4600,2,509,5,2461,6,0,284,2927,0
Converting to forward existential form...Done !
original formula: EF(((AG((p25==1)) * E(!((((p130==0)||(p137==1))&&(p20==1))) U ((p102!=1)&&((p32==0)||(p83==1))))) * (AF((((p64==0)||(p108==1))||(((p27==0...264
=> equivalent forward existential formula: ([((((FwdU(Init,TRUE) * (!(E(TRUE U !((p25==1)))) * E(!((((p130==0)||(p137==1))&&(p20==1))) U ((p102!=1)&&((p32=...658
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t5, t7, t8, t11, t12, t14, t21, t24, t26, t31, t36, t37, t38, t42, t43, t44, t55, t56...280
(forward)formula 0,0,0.883888,25280,1,0,462,120905,183,189,1884,138435,526
FORMULA AutonomousCar-PT-02b-CTLCardinality-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 150/150 places, 188/188 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 132 transition count 170
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 132 transition count 170
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 52 place count 132 transition count 154
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 55 place count 129 transition count 151
Iterating global reduction 1 with 3 rules applied. Total rules applied 58 place count 129 transition count 151
Applied a total of 58 rules in 3 ms. Remains 129 /150 variables (removed 21) and now considering 151/188 (removed 37) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1303604248107764411.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11866407815050523247.kers'
[2026-05-22 18:15:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1303604248107764411.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11866407815050523247.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 151 rows 129 cols 436 entries
Finished phase 1 with 122 SingleSign rule and 0 generalized
[2026-05-22 18:15:39] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-11866407815050523247.kers
Total runtime 1 ms.
[2026-05-22 18:15:39] [INFO ] Implicit Places using invariants in 56 ms returned []
[2026-05-22 18:15:39] [INFO ] Invariant cache hit.
[2026-05-22 18:15:39] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 178 ms to find 0 implicit places.
Running 150 sub problems to find dead transitions.
[2026-05-22 18:15:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (OVERLAPS) 1/129 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 5/32 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (OVERLAPS) 151/280 variables, 129/162 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/280 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 8 (OVERLAPS) 0/280 variables, 2/164 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/280 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 10 (OVERLAPS) 0/280 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Real declared 280/280 variables, and 164 constraints, problems are : Problem set: 0 solved, 150 unsolved in 23570 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 129/129 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 26/26 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 150 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (OVERLAPS) 1/129 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 26/33 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (OVERLAPS) 151/280 variables, 129/164 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/280 variables, 150/314 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/280 variables, 1/315 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/280 variables, 2/317 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/280 variables, 1/318 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/280 variables, 4/322 constraints. Problems are: Problem set: 0 solved, 150 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 280/280 variables, and 322 constraints, problems are : Problem set: 0 solved, 150 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 129/129 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 30/30 constraints, Known Traps Along Path: 6/6 constraints]
After SMT, in 53592ms problems are : Problem set: 0 solved, 150 unsolved
Search for dead transitions found 0 dead transitions in 53592ms
Starting structural reductions in LTL mode, iteration 1 : 129/150 places, 151/188 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53775 ms. Remains : 129/150 places, 151/188 transitions.
[2026-05-22 18:16:33] [INFO ] Flatten gal took : 4 ms
[2026-05-22 18:16:33] [INFO ] Flatten gal took : 8 ms
[2026-05-22 18:16:33] [INFO ] Input system was already deterministic with 151 transitions.
[2026-05-22 18:16:33] [INFO ] Flatten gal took : 4 ms
[2026-05-22 18:16:33] [INFO ] Flatten gal took : 4 ms
[2026-05-22 18:16:33] [INFO ] Time to serialize gal into /tmp/CTLCardinality13375873049369307353.gal : 1 ms
[2026-05-22 18:16:33] [INFO ] Time to serialize properties into /tmp/CTLCardinality17191642147488514853.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality13375873049369307353.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17191642147488514853.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.96217e+06,0.22759,10788,2,2576,5,25544,6,0,669,30715,0
Converting to forward existential form...Done !
original formula: ((AX(((p43==0)||(p29==1))) + EX((p124==0))) * (!(A(AF(((p25==1)&&(p27==0))) U AX(((p135==0)||(p14==1))))) + AF(AG((EF((p55==0)) + ((p28==...173
=> equivalent forward existential formula: ([(EY((Init * !(EX((p124==0))))) * !(((p43==0)||(p29==1))))] = FALSE * [FwdG((Init * !(!(!((E(!(!(EX(!(((p135==0...367
Reverse transition relation is NOT exact ! Due to transitions t10, t16, t17, t25, t33, t36, t37, t38, t62, t63, t66, t67, t69, t82, t88, t89, t92, t93, t95...310
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,18.149,482936,1,0,1149,3.20018e+06,347,503,4447,2.82161e+06,1311
FORMULA AutonomousCar-PT-02b-CTLCardinality-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 150/150 places, 188/188 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 132 transition count 170
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 132 transition count 170
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 52 place count 132 transition count 154
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 55 place count 129 transition count 151
Iterating global reduction 1 with 3 rules applied. Total rules applied 58 place count 129 transition count 151
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 59 place count 128 transition count 150
Iterating global reduction 1 with 1 rules applied. Total rules applied 60 place count 128 transition count 150
Applied a total of 60 rules in 3 ms. Remains 128 /150 variables (removed 22) and now considering 150/188 (removed 38) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12511001116093506013.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12748132631309488638.kers'
[2026-05-22 18:16:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12511001116093506013.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12748132631309488638.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 150 rows 128 cols 434 entries
Finished phase 1 with 121 SingleSign rule and 0 generalized
[2026-05-22 18:16:51] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12748132631309488638.kers
Total runtime 1 ms.
[2026-05-22 18:16:51] [INFO ] Implicit Places using invariants in 57 ms returned []
[2026-05-22 18:16:51] [INFO ] Invariant cache hit.
[2026-05-22 18:16:51] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
Running 149 sub problems to find dead transitions.
[2026-05-22 18:16:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 1 (OVERLAPS) 1/128 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 19/26 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 6/32 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 6 (OVERLAPS) 150/278 variables, 128/162 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/278 variables, 2/164 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/278 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 9 (OVERLAPS) 0/278 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 149 unsolved
No progress, stopping.
After SMT solving in domain Real declared 278/278 variables, and 164 constraints, problems are : Problem set: 0 solved, 149 unsolved in 16985 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 149/149 constraints, Known Traps: 27/27 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 149 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 1 (OVERLAPS) 1/128 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 27/34 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 4 (OVERLAPS) 150/278 variables, 128/162 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/278 variables, 149/311 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/278 variables, 2/313 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/278 variables, 1/314 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/278 variables, 3/317 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/278 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 149 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 278/278 variables, and 318 constraints, problems are : Problem set: 0 solved, 149 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 149/149 constraints, Known Traps: 28/28 constraints, Known Traps Along Path: 6/6 constraints]
After SMT, in 47011ms problems are : Problem set: 0 solved, 149 unsolved
Search for dead transitions found 0 dead transitions in 47011ms
Starting structural reductions in LTL mode, iteration 1 : 128/150 places, 150/188 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47197 ms. Remains : 128/150 places, 150/188 transitions.
[2026-05-22 18:17:38] [INFO ] Flatten gal took : 4 ms
[2026-05-22 18:17:39] [INFO ] Flatten gal took : 4 ms
[2026-05-22 18:17:39] [INFO ] Input system was already deterministic with 150 transitions.
[2026-05-22 18:17:39] [INFO ] Flatten gal took : 4 ms
[2026-05-22 18:17:39] [INFO ] Flatten gal took : 4 ms
[2026-05-22 18:17:39] [INFO ] Time to serialize gal into /tmp/CTLCardinality8976570300540215955.gal : 1 ms
[2026-05-22 18:17:39] [INFO ] Time to serialize properties into /tmp/CTLCardinality17961671987503233527.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality8976570300540215955.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17961671987503233527.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.86827e+06,0.250174,10740,2,2628,5,26448,6,0,664,30505,0
Converting to forward existential form...Done !
original formula: (AX(FALSE) + AG((E((E((p120==1) U ((p106==0)||(p95==1))) + (AX(((p70==0)||(p113==1))) * ((p85==0)||(p63==1)))) U AX(((p72==1)&&(p50==1)))...178
=> equivalent forward existential formula: [((FwdU((Init * !(!(EX(!(FALSE))))),TRUE) * !(EG(!(EG(!((p38==1))))))) * !(E((E((p120==1) U ((p106==0)||(p95==1)...262
Reverse transition relation is NOT exact ! Due to transitions t10, t16, t17, t24, t33, t38, t39, t64, t65, t68, t69, t71, t83, t84, t89, t90, t93, t94, t96...305
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,25.7619,639876,1,0,1653,4.33628e+06,343,839,4482,3.9302e+06,1777
FORMULA AutonomousCar-PT-02b-CTLCardinality-2024-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-22 18:18:05] [INFO ] Flatten gal took : 5 ms
[2026-05-22 18:18:05] [INFO ] Flatten gal took : 5 ms
Total runtime 645350 ms.
BK_STOP 1779473885076
--------------------
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.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /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-02b"
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-5973"
echo " Executing tool itstools"
echo " Input is AutonomousCar-PT-02b, 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 r018-smll-177946787900025"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/AutonomousCar-PT-02b.tgz
mv AutonomousCar-PT-02b execution
cd execution
if [ "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 '
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 ;