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-177946787900082.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-06a, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r018-smll-177946787900082
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 580K
-rw-r--r-- 1 mcc users 7.6K Mar 5 16:45 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K Mar 5 16:45 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Mar 5 16:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Mar 5 16:45 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 15 07:20 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 15 07:20 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 07:20 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 07:20 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.2K Mar 5 16:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 82K Mar 5 16:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Mar 5 16:45 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Mar 5 16:45 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 07:20 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 07:20 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 177K 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-06a-CTLFireability-2024-00
FORMULA_NAME AutonomousCar-PT-06a-CTLFireability-2024-01
FORMULA_NAME AutonomousCar-PT-06a-CTLFireability-2024-02
FORMULA_NAME AutonomousCar-PT-06a-CTLFireability-2024-03
FORMULA_NAME AutonomousCar-PT-06a-CTLFireability-2024-04
FORMULA_NAME AutonomousCar-PT-06a-CTLFireability-2024-05
FORMULA_NAME AutonomousCar-PT-06a-CTLFireability-2024-06
FORMULA_NAME AutonomousCar-PT-06a-CTLFireability-2024-07
FORMULA_NAME AutonomousCar-PT-06a-CTLFireability-2024-08
FORMULA_NAME AutonomousCar-PT-06a-CTLFireability-2024-09
FORMULA_NAME AutonomousCar-PT-06a-CTLFireability-2024-10
FORMULA_NAME AutonomousCar-PT-06a-CTLFireability-2024-11
FORMULA_NAME AutonomousCar-PT-06a-CTLFireability-2024-12
FORMULA_NAME AutonomousCar-PT-06a-CTLFireability-2024-13
FORMULA_NAME AutonomousCar-PT-06a-CTLFireability-2024-14
FORMULA_NAME AutonomousCar-PT-06a-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1779481382227

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-06a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202604301425
[2026-05-22 20:23:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-22 20:23:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-22 20:23:05] [INFO ] Load time of PNML (sax parser for PT used): 228 ms
[2026-05-22 20:23:05] [INFO ] Transformed 65 places.
[2026-05-22 20:23:05] [INFO ] Transformed 417 transitions.
[2026-05-22 20:23:05] [INFO ] Found NUPN structural information;
[2026-05-22 20:23:05] [INFO ] Parsed PT model containing 65 places and 417 transitions and 3356 arcs in 479 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 30 ms.
Ensure Unique test removed 159 transitions
Reduce redundant transitions removed 159 transitions.
Support contains 51 out of 65 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 258/258 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 64 transition count 257
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 64 transition count 257
Applied a total of 2 rules in 50 ms. Remains 64 /65 variables (removed 1) and now considering 257/258 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2585485012802426083.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-155946801125070731.kers'
[2026-05-22 20:23:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2585485012802426083.kers, --Pflows, --basisKERS=/tmp/petrispot-output-155946801125070731.kers]
Normalized transition count is 256 out of 257 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 256 rows 63 cols 1877 entries
Finished phase 1 with 54 SingleSign rule and 0 generalized
[2026-05-22 20:23:05] [INFO ] Computed 10 invariants in 2 ms
Computed 10 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-155946801125070731.kers
Total runtime 5 ms.
[2026-05-22 20:23:05] [INFO ] Implicit Places using invariants in 468 ms returned []
[2026-05-22 20:23:05] [INFO ] Invariant cache hit.
[2026-05-22 20:23:06] [INFO ] State equation strengthened by 147 read => feed constraints.
[2026-05-22 20:23:06] [INFO ] Implicit Places using invariants and state equation in 284 ms returned [60, 62]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 830 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 62/65 places, 257/258 transitions.
Applied a total of 0 rules in 5 ms. Remains 62 /62 variables (removed 0) and now considering 257/257 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 914 ms. Remains : 62/65 places, 257/258 transitions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 257/257 transitions.
Applied a total of 0 rules in 4 ms. Remains 62 /62 variables (removed 0) and now considering 257/257 (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-9098708738183759054.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18100280703805907843.kers'
[2026-05-22 20:23:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9098708738183759054.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18100280703805907843.kers]
Normalized transition count is 256 out of 257 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 256 rows 61 cols 1870 entries
Finished phase 1 with 54 SingleSign rule and 0 generalized
[2026-05-22 20:23:06] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-18100280703805907843.kers
Total runtime 2 ms.
[2026-05-22 20:23:06] [INFO ] Implicit Places using invariants in 53 ms returned []
[2026-05-22 20:23:06] [INFO ] Invariant cache hit.
[2026-05-22 20:23:06] [INFO ] State equation strengthened by 147 read => feed constraints.
[2026-05-22 20:23:06] [INFO ] Implicit Places using invariants and state equation in 251 ms returned []
Implicit Place search using SMT with State Equation took 309 ms to find 0 implicit places.
Running 256 sub problems to find dead transitions.
[2026-05-22 20:23:06] [INFO ] Invariant cache hit.
[2026-05-22 20:23:06] [INFO ] State equation strengthened by 147 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (OVERLAPS) 1/62 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (OVERLAPS) 256/318 variables, 62/70 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/318 variables, 146/216 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/318 variables, 3/219 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/318 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 7 (OVERLAPS) 1/319 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/319 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 256 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 9 (OVERLAPS) 0/319 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 256 unsolved
No progress, stopping.
After SMT solving in domain Real declared 319/319 variables, and 220 constraints, problems are : Problem set: 0 solved, 256 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 62/62 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 256 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (OVERLAPS) 1/62 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (OVERLAPS) 256/318 variables, 62/73 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/318 variables, 146/219 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/318 variables, 256/475 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/318 variables, 5/480 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/318 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 256 unsolved
SMT process timed out in 61225ms, After SMT, problems are : Problem set: 0 solved, 256 unsolved
Search for dead transitions found 0 dead transitions in 61251ms
Finished structural reductions in LTL mode , in 1 iterations and 61602 ms. Remains : 62/62 places, 257/257 transitions.
Support contains 51 out of 62 places after structural reductions.
[2026-05-22 20:24:08] [INFO ] Flatten gal took : 101 ms
[2026-05-22 20:24:08] [INFO ] Flatten gal took : 56 ms
[2026-05-22 20:24:08] [INFO ] Input system was already deterministic with 257 transitions.
RANDOM walk for 40000 steps (2256 resets) in 4400 ms. (9 steps per ms) remains 22/89 properties
BEST_FIRST walk for 4003 steps (20 resets) in 85 ms. (46 steps per ms) remains 21/22 properties
BEST_FIRST walk for 4004 steps (29 resets) in 27 ms. (143 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (20 resets) in 26 ms. (148 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (19 resets) in 27 ms. (143 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (19 resets) in 25 ms. (153 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (18 resets) in 24 ms. (160 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (19 resets) in 18 ms. (210 steps per ms) remains 19/21 properties
BEST_FIRST walk for 4003 steps (20 resets) in 19 ms. (200 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (21 resets) in 19 ms. (200 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (21 resets) in 12 ms. (308 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (20 resets) in 13 ms. (286 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (18 resets) in 24 ms. (160 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (23 resets) in 16 ms. (235 steps per ms) remains 16/19 properties
BEST_FIRST walk for 4004 steps (23 resets) in 12 ms. (308 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (19 resets) in 10 ms. (363 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (21 resets) in 12 ms. (308 steps per ms) remains 15/16 properties
BEST_FIRST walk for 4002 steps (19 resets) in 10 ms. (363 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (17 resets) in 12 ms. (308 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 15/15 properties
[2026-05-22 20:24:09] [INFO ] Invariant cache hit.
[2026-05-22 20:24:09] [INFO ] State equation strengthened by 147 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp53 is UNSAT
Problem AtomicPropp80 is UNSAT
At refinement iteration 1 (OVERLAPS) 19/55 variables, 8/8 constraints. Problems are: Problem set: 4 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/8 constraints. Problems are: Problem set: 4 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 251/306 variables, 55/63 constraints. Problems are: Problem set: 4 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/306 variables, 146/209 constraints. Problems are: Problem set: 4 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/306 variables, 0/209 constraints. Problems are: Problem set: 4 solved, 11 unsolved
Problem AtomicPropp62 is UNSAT
At refinement iteration 6 (OVERLAPS) 11/317 variables, 6/215 constraints. Problems are: Problem set: 5 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/317 variables, 0/215 constraints. Problems are: Problem set: 5 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 1/318 variables, 1/216 constraints. Problems are: Problem set: 5 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/318 variables, 0/216 constraints. Problems are: Problem set: 5 solved, 10 unsolved
At refinement iteration 10 (OVERLAPS) 1/319 variables, 1/217 constraints. Problems are: Problem set: 5 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/319 variables, 0/217 constraints. Problems are: Problem set: 5 solved, 10 unsolved
At refinement iteration 12 (OVERLAPS) 0/319 variables, 0/217 constraints. Problems are: Problem set: 5 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 319/319 variables, and 217 constraints, problems are : Problem set: 5 solved, 10 unsolved in 1170 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 62/62 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 15/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 5 solved, 10 unsolved
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp81 is UNSAT
At refinement iteration 1 (OVERLAPS) 29/54 variables, 8/8 constraints. Problems are: Problem set: 7 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/8 constraints. Problems are: Problem set: 7 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 250/304 variables, 54/62 constraints. Problems are: Problem set: 7 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/304 variables, 146/208 constraints. Problems are: Problem set: 7 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/304 variables, 4/212 constraints. Problems are: Problem set: 7 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/304 variables, 0/212 constraints. Problems are: Problem set: 7 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 13/317 variables, 7/219 constraints. Problems are: Problem set: 7 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/317 variables, 7/226 constraints. Problems are: Problem set: 7 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/317 variables, 1/227 constraints. Problems are: Problem set: 7 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/317 variables, 0/227 constraints. Problems are: Problem set: 7 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 1/318 variables, 1/228 constraints. Problems are: Problem set: 7 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/318 variables, 0/228 constraints. Problems are: Problem set: 7 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 1/319 variables, 1/229 constraints. Problems are: Problem set: 7 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/319 variables, 0/229 constraints. Problems are: Problem set: 7 solved, 8 unsolved
At refinement iteration 15 (OVERLAPS) 0/319 variables, 0/229 constraints. Problems are: Problem set: 7 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 319/319 variables, and 229 constraints, problems are : Problem set: 7 solved, 8 unsolved in 3755 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 62/62 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 9/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 5/5 constraints]
After SMT, in 4985ms problems are : Problem set: 7 solved, 8 unsolved
Fused 8 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 1351 ms.
Support contains 12 out of 62 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 62/62 places, 257/257 transitions.
Graph (complete) has 518 edges and 62 vertex of which 61 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 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 0 with 7 rules applied. Total rules applied 8 place count 61 transition count 249
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 13 place count 57 transition count 248
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 14 place count 56 transition count 248
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 14 place count 56 transition count 247
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 16 place count 55 transition count 247
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 19 place count 52 transition count 232
Iterating global reduction 3 with 3 rules applied. Total rules applied 22 place count 52 transition count 232
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 28 place count 49 transition count 229
Free-agglomeration rule applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 33 place count 49 transition count 224
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 17 rules applied. Total rules applied 50 place count 44 transition count 212
Applied a total of 50 rules in 106 ms. Remains 44 /62 variables (removed 18) and now considering 212/257 (removed 45) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 106 ms. Remains : 44/62 places, 212/257 transitions.
RANDOM walk for 40000 steps (603 resets) in 471 ms. (84 steps per ms) remains 5/8 properties
BEST_FIRST walk for 40003 steps (235 resets) in 97 ms. (408 steps per ms) remains 3/5 properties
BEST_FIRST walk for 40004 steps (235 resets) in 97 ms. (408 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40003 steps (220 resets) in 77 ms. (512 steps per ms) remains 2/2 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-284218580270813408.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1908814155941381133.kers'
[2026-05-22 20:24:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-284218580270813408.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1908814155941381133.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 212 rows 42 cols 1681 entries
Finished phase 1 with 34 SingleSign rule and 0 generalized
[2026-05-22 20:24:16] [INFO ] Computed 10 invariants in 1 ms
Computed 10 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-1908814155941381133.kers
Total runtime 2 ms.
[2026-05-22 20:24:16] [INFO ] State equation strengthened by 121 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 20/27 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 17/44 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 212/256 variables, 44/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/256 variables, 121/175 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/256 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/256 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 256/256 variables, and 175 constraints, problems are : Problem set: 0 solved, 2 unsolved in 388 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 44/44 constraints, ReadFeed: 121/121 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 20/27 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 17/44 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 212/256 variables, 44/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/256 variables, 121/175 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/256 variables, 2/177 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/256 variables, 5/182 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/256 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/256 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 256/256 variables, and 182 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1283 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 44/44 constraints, ReadFeed: 121/121 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 5/5 constraints]
After SMT, in 1692ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 128 ms.
Support contains 7 out of 44 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 44/44 places, 212/212 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 41 transition count 191
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 41 transition count 191
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 41 transition count 189
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 22 place count 39 transition count 177
Applied a total of 22 rules in 24 ms. Remains 39 /44 variables (removed 5) and now considering 177/212 (removed 35) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 39/44 places, 177/212 transitions.
RANDOM walk for 40000 steps (255 resets) in 245 ms. (162 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (176 resets) in 64 ms. (615 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (241 resets) in 88 ms. (449 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 339034 steps, run visited all 2 properties in 653 ms. (steps per millisecond=519 )
Probabilistic random walk after 339034 steps, saw 51033 distinct states, run finished after 661 ms. (steps per millisecond=512 ) properties seen :2
Successfully simplified 7 atomic propositions for a total of 16 simplifications.
FORMULA AutonomousCar-PT-06a-CTLFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-06a-CTLFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-06a-CTLFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-22 20:24:19] [INFO ] Flatten gal took : 52 ms
[2026-05-22 20:24:19] [INFO ] Flatten gal took : 55 ms
[2026-05-22 20:24:19] [INFO ] Input system was already deterministic with 257 transitions.
Computed a total of 3 stabilizing places and 2 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 62/62 places, 257/257 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 0 with 7 rules applied. Total rules applied 7 place count 62 transition count 250
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 8 rules applied. Total rules applied 15 place count 55 transition count 249
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 16 place count 54 transition count 249
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 16 place count 54 transition count 248
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 18 place count 53 transition count 248
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 24 place count 47 transition count 206
Iterating global reduction 3 with 6 rules applied. Total rules applied 30 place count 47 transition count 206
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 34 place count 45 transition count 204
Applied a total of 34 rules in 44 ms. Remains 45 /62 variables (removed 17) and now considering 204/257 (removed 53) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15738369998355902027.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2807565634316006144.kers'
[2026-05-22 20:24:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15738369998355902027.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2807565634316006144.kers]
Normalized transition count is 203 out of 204 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 203 rows 44 cols 1620 entries
Finished phase 1 with 37 SingleSign rule and 0 generalized
[2026-05-22 20:24:19] [INFO ] Computed 8 invariants in 2 ms
Computed 8 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-2807565634316006144.kers
Total runtime 3 ms.
[2026-05-22 20:24:19] [INFO ] Implicit Places using invariants in 102 ms returned []
[2026-05-22 20:24:19] [INFO ] Invariant cache hit.
[2026-05-22 20:24:19] [INFO ] State equation strengthened by 111 read => feed constraints.
[2026-05-22 20:24:19] [INFO ] Implicit Places using invariants and state equation in 221 ms returned []
Implicit Place search using SMT with State Equation took 325 ms to find 0 implicit places.
[2026-05-22 20:24:19] [INFO ] Redundant transitions in 21 ms returned []
Running 203 sub problems to find dead transitions.
[2026-05-22 20:24:19] [INFO ] Invariant cache hit.
[2026-05-22 20:24:19] [INFO ] State equation strengthened by 111 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (OVERLAPS) 1/45 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 3 (OVERLAPS) 203/248 variables, 45/53 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/248 variables, 110/163 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/248 variables, 2/165 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/248 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 7 (OVERLAPS) 1/249 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/249 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 9 (OVERLAPS) 0/249 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 203 unsolved
No progress, stopping.
After SMT solving in domain Real declared 249/249 variables, and 166 constraints, problems are : Problem set: 0 solved, 203 unsolved in 17134 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 45/45 constraints, ReadFeed: 111/111 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 203 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (OVERLAPS) 1/45 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 4 (OVERLAPS) 203/248 variables, 45/55 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/248 variables, 110/165 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/248 variables, 203/368 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/248 variables, 5/373 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/248 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 9 (OVERLAPS) 1/249 variables, 1/374 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/249 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 203 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 249/249 variables, and 374 constraints, problems are : Problem set: 0 solved, 203 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 45/45 constraints, ReadFeed: 111/111 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 5/5 constraints]
After SMT, in 47765ms problems are : Problem set: 0 solved, 203 unsolved
Search for dead transitions found 0 dead transitions in 47768ms
Starting structural reductions in SI_CTL mode, iteration 1 : 45/62 places, 204/257 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 48178 ms. Remains : 45/62 places, 204/257 transitions.
[2026-05-22 20:25:07] [INFO ] Flatten gal took : 42 ms
[2026-05-22 20:25:07] [INFO ] Flatten gal took : 36 ms
[2026-05-22 20:25:07] [INFO ] Input system was already deterministic with 204 transitions.
[2026-05-22 20:25:07] [INFO ] Flatten gal took : 27 ms
[2026-05-22 20:25:07] [INFO ] Flatten gal took : 26 ms
[2026-05-22 20:25:07] [INFO ] Time to serialize gal into /tmp/CTLFireability8056643611460680048.gal : 28 ms
[2026-05-22 20:25:07] [INFO ] Time to serialize properties into /tmp/CTLFireability3099077994192388635.ctl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8056643611460680048.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3099077994192388635.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,873131,2.86356,63648,2,9184,5,166140,6,0,380,129428,0


Converting to forward existential form...Done !
original formula: EG((((p1==0)||(p9==0))||((p15==0)||(p57==0))))
=> equivalent forward existential formula: [FwdG(Init,(((p1==0)||(p9==0))||((p15==0)||(p57==0))))] != FALSE
Hit Full ! (commute/partial/dont) 26/0/178
(forward)formula 0,1,18.7209,329144,1,0,75,1.10426e+06,19,4,5297,929320,71
FORMULA AutonomousCar-PT-06a-CTLFireability-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 62/62 places, 257/257 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 62 transition count 251
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 56 transition count 251
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 12 place count 56 transition count 249
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 16 place count 54 transition count 249
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 22 place count 48 transition count 207
Iterating global reduction 2 with 6 rules applied. Total rules applied 28 place count 48 transition count 207
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 30 place count 47 transition count 206
Applied a total of 30 rules in 31 ms. Remains 47 /62 variables (removed 15) and now considering 206/257 (removed 51) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6706201656843940186.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11710172472872433700.kers'
[2026-05-22 20:25:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6706201656843940186.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11710172472872433700.kers]
Normalized transition count is 205 out of 206 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 205 rows 46 cols 1624 entries
Finished phase 1 with 39 SingleSign rule and 0 generalized
[2026-05-22 20:25:27] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-11710172472872433700.kers
Total runtime 2 ms.
[2026-05-22 20:25:27] [INFO ] Implicit Places using invariants in 156 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 158 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 46/62 places, 206/257 transitions.
Applied a total of 0 rules in 9 ms. Remains 46 /46 variables (removed 0) and now considering 206/206 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 199 ms. Remains : 46/62 places, 206/257 transitions.
[2026-05-22 20:25:27] [INFO ] Flatten gal took : 17 ms
[2026-05-22 20:25:27] [INFO ] Flatten gal took : 16 ms
[2026-05-22 20:25:27] [INFO ] Input system was already deterministic with 206 transitions.
[2026-05-22 20:25:27] [INFO ] Flatten gal took : 14 ms
[2026-05-22 20:25:27] [INFO ] Flatten gal took : 25 ms
[2026-05-22 20:25:27] [INFO ] Time to serialize gal into /tmp/CTLFireability8563029709963823165.gal : 10 ms
[2026-05-22 20:25:27] [INFO ] Time to serialize properties into /tmp/CTLFireability8484000587036763976.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/CTLFireability8563029709963823165.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8484000587036763976.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,1.24626e+06,0.52151,16412,2,1637,5,34851,6,0,388,40488,0


Converting to forward existential form...Done !
original formula: E(AF(EG(((((p13==1)&&(p23==1))&&((p30==1)&&(p37==1)))&&(((p44==1)&&(p51==1))&&(p58==1))))) U ((((p13==1)&&(p23==1))&&((p27==1)&&(p37==1))...192
=> equivalent forward existential formula: [(FwdU(Init,!(EG(!(EG(((((p13==1)&&(p23==1))&&((p30==1)&&(p37==1)))&&(((p44==1)&&(p51==1))&&(p58==1)))))))) * ((...244
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t5, t6, t8, t9, t11, t12, t14, t15, t17, t18, t128, t129, t130, t131, t132, t133, t13...624
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,7.58981,158236,1,0,1046,549740,444,536,7118,677501,1004
FORMULA AutonomousCar-PT-06a-CTLFireability-2024-02 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 : 62/62 places, 257/257 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 0 with 3 rules applied. Total rules applied 3 place count 62 transition count 254
Reduce places removed 3 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 5 rules applied. Total rules applied 8 place count 59 transition count 252
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 10 place count 57 transition count 252
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 10 place count 57 transition count 250
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 14 place count 55 transition count 250
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 17 place count 52 transition count 229
Iterating global reduction 3 with 3 rules applied. Total rules applied 20 place count 52 transition count 229
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 22 place count 51 transition count 228
Applied a total of 22 rules in 24 ms. Remains 51 /62 variables (removed 11) and now considering 228/257 (removed 29) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18287758281522119704.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10499804885175340536.kers'
[2026-05-22 20:25:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18287758281522119704.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10499804885175340536.kers]
Normalized transition count is 227 out of 228 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 1 ms.
// Phase 1: matrix 227 rows 50 cols 1740 entries
Finished phase 1 with 43 SingleSign rule and 0 generalized
[2026-05-22 20:25:35] [INFO ] Computed 8 invariants in 3 ms
Computed 8 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-10499804885175340536.kers
Total runtime 4 ms.
[2026-05-22 20:25:35] [INFO ] Implicit Places using invariants in 83 ms returned []
[2026-05-22 20:25:35] [INFO ] Invariant cache hit.
[2026-05-22 20:25:35] [INFO ] State equation strengthened by 129 read => feed constraints.
[2026-05-22 20:25:35] [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.
[2026-05-22 20:25:35] [INFO ] Redundant transitions in 11 ms returned []
Running 227 sub problems to find dead transitions.
[2026-05-22 20:25:35] [INFO ] Invariant cache hit.
[2026-05-22 20:25:35] [INFO ] State equation strengthened by 129 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 1 (OVERLAPS) 1/51 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 3 (OVERLAPS) 227/278 variables, 51/59 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/278 variables, 128/187 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/278 variables, 3/190 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/278 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 7 (OVERLAPS) 1/279 variables, 1/191 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/279 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 9 (OVERLAPS) 0/279 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 227 unsolved
No progress, stopping.
After SMT solving in domain Real declared 279/279 variables, and 191 constraints, problems are : Problem set: 0 solved, 227 unsolved in 24350 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 51/51 constraints, ReadFeed: 129/129 constraints, PredecessorRefiner: 227/227 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 227 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 1 (OVERLAPS) 1/51 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 4 (OVERLAPS) 227/278 variables, 51/62 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/278 variables, 128/190 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/278 variables, 227/417 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/278 variables, 5/422 constraints. Problems are: Problem set: 0 solved, 227 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 278/279 variables, and 422 constraints, problems are : Problem set: 0 solved, 227 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 51/51 constraints, ReadFeed: 128/129 constraints, PredecessorRefiner: 227/227 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 5/5 constraints]
After SMT, in 54908ms problems are : Problem set: 0 solved, 227 unsolved
Search for dead transitions found 0 dead transitions in 54909ms
Starting structural reductions in SI_CTL mode, iteration 1 : 51/62 places, 228/257 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 55246 ms. Remains : 51/62 places, 228/257 transitions.
[2026-05-22 20:26:30] [INFO ] Flatten gal took : 19 ms
[2026-05-22 20:26:30] [INFO ] Flatten gal took : 16 ms
[2026-05-22 20:26:30] [INFO ] Input system was already deterministic with 228 transitions.
[2026-05-22 20:26:30] [INFO ] Flatten gal took : 17 ms
[2026-05-22 20:26:30] [INFO ] Flatten gal took : 17 ms
[2026-05-22 20:26:30] [INFO ] Time to serialize gal into /tmp/CTLFireability2409631754928390797.gal : 4 ms
[2026-05-22 20:26:30] [INFO ] Time to serialize properties into /tmp/CTLFireability13887129003147064812.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2409631754928390797.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13887129003147064812.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,2.50792e+06,2.799,68392,2,5025,5,170496,6,0,428,172173,0


Converting to forward existential form...Done !
original formula: AG((((E(AG((((p1==1)&&(p8==1))&&((p49==1)&&(p57==1)))) U !((((p1==1)&&(p6==1))&&((p33==1)&&(p57==1))))) + A((((p1==1)&&(p9==1))&&((p21==1...379
=> equivalent forward existential formula: [((((FwdU(Init,TRUE) * !(((((p43==1)&&(p1==1))&&((p5==1)&&(p50==1)))&&(p57==1)))) * !((EG(E(TRUE U (p25==1))) + ...573
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t4, t5, t6, t7, t8, t9, t11, t12, t15, t16, t17, t19, t20, t22, t46, t70, t148, t149,...316
Detected timeout of ITS tools.
[2026-05-22 20:27:00] [INFO ] Flatten gal took : 26 ms
[2026-05-22 20:27:00] [INFO ] Applying decomposition
[2026-05-22 20:27:00] [INFO ] Flatten gal took : 23 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph12579381099281359627.txt' '-o' '/tmp/graph12579381099281359627.bin' '-w' '/tmp/graph12579381099281359627.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph12579381099281359627.bin' '-l' '-1' '-v' '-w' '/tmp/graph12579381099281359627.weights' '-q' '0' '-e' '0.001'
[2026-05-22 20:27:00] [INFO ] Decomposing Gal with order
[2026-05-22 20:27:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 20:27:00] [INFO ] Removed a total of 731 redundant transitions.
[2026-05-22 20:27:01] [INFO ] Flatten gal took : 181 ms
[2026-05-22 20:27:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 56 labels/synchronizations in 32 ms.
[2026-05-22 20:27:01] [INFO ] Time to serialize gal into /tmp/CTLFireability3260064293136522433.gal : 4 ms
[2026-05-22 20:27:01] [INFO ] Time to serialize properties into /tmp/CTLFireability12636731010037343979.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/CTLFireability3260064293136522433.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12636731010037343979.ctl'

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 -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.50792e+06,0.052759,4872,122,138,1201,776,129,2145,72,4237,0


Converting to forward existential form...Done !
original formula: AG((((E(AG((((u13.p1==1)&&(u13.p8==1))&&((i5.u11.p49==1)&&(u13.p57==1)))) U !((((u13.p1==1)&&(u13.p6==1))&&((i3.u7.p33==1)&&(u13.p57==1))...526
=> equivalent forward existential formula: [((((FwdU(Init,TRUE) * !(((((i4.u10.p43==1)&&(u13.p1==1))&&((u13.p5==1)&&(i5.u12.p50==1)))&&(u13.p57==1)))) * !(...756
Reverse transition relation is NOT exact ! Due to transitions t36, t66, t84, t166, t223, u14.t218, u14.t219, u14.t224, u14.t225, i0.u0.t20, i0.u1.t19, i1.u...388
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 7
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 7
(forward)formula 0,0,0.62982,21564,1,0,37418,1684,807,48463,410,8365,50631
FORMULA AutonomousCar-PT-06a-CTLFireability-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 257/257 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 58 transition count 229
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 58 transition count 229
Applied a total of 8 rules in 4 ms. Remains 58 /62 variables (removed 4) and now considering 229/257 (removed 28) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-815712893293465319.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15900558683002449478.kers'
[2026-05-22 20:27:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-815712893293465319.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15900558683002449478.kers]
Normalized transition count is 228 out of 229 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 228 rows 57 cols 1718 entries
Finished phase 1 with 50 SingleSign rule and 0 generalized
[2026-05-22 20:27:01] [INFO ] Computed 8 invariants in 3 ms
Computed 8 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-15900558683002449478.kers
Total runtime 4 ms.
[2026-05-22 20:27:01] [INFO ] Implicit Places using invariants in 97 ms returned []
[2026-05-22 20:27:01] [INFO ] Invariant cache hit.
[2026-05-22 20:27:01] [INFO ] State equation strengthened by 123 read => feed constraints.
[2026-05-22 20:27:02] [INFO ] Implicit Places using invariants and state equation in 206 ms returned []
Implicit Place search using SMT with State Equation took 307 ms to find 0 implicit places.
Running 228 sub problems to find dead transitions.
[2026-05-22 20:27:02] [INFO ] Invariant cache hit.
[2026-05-22 20:27:02] [INFO ] State equation strengthened by 123 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 3 (OVERLAPS) 228/286 variables, 58/66 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 122/188 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 3/191 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/286 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 7 (OVERLAPS) 1/287 variables, 1/192 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/287 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 9 (OVERLAPS) 0/287 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 228 unsolved
No progress, stopping.
After SMT solving in domain Real declared 287/287 variables, and 192 constraints, problems are : Problem set: 0 solved, 228 unsolved in 27277 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 58/58 constraints, ReadFeed: 123/123 constraints, PredecessorRefiner: 228/228 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 228 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 4 (OVERLAPS) 228/286 variables, 58/69 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 122/191 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/286 variables, 228/419 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/286 variables, 5/424 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/286 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 9 (OVERLAPS) 1/287 variables, 1/425 constraints. Problems are: Problem set: 0 solved, 228 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 287/287 variables, and 425 constraints, problems are : Problem set: 0 solved, 228 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 58/58 constraints, ReadFeed: 123/123 constraints, PredecessorRefiner: 228/228 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 5/5 constraints]
After SMT, in 57721ms problems are : Problem set: 0 solved, 228 unsolved
Search for dead transitions found 0 dead transitions in 57722ms
Starting structural reductions in LTL mode, iteration 1 : 58/62 places, 229/257 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58038 ms. Remains : 58/62 places, 229/257 transitions.
[2026-05-22 20:27:59] [INFO ] Flatten gal took : 22 ms
[2026-05-22 20:27:59] [INFO ] Flatten gal took : 22 ms
[2026-05-22 20:27:59] [INFO ] Input system was already deterministic with 229 transitions.
[2026-05-22 20:27:59] [INFO ] Flatten gal took : 22 ms
[2026-05-22 20:27:59] [INFO ] Flatten gal took : 23 ms
[2026-05-22 20:27:59] [INFO ] Time to serialize gal into /tmp/CTLFireability1908434801536489610.gal : 7 ms
[2026-05-22 20:27:59] [INFO ] Time to serialize properties into /tmp/CTLFireability17841469044616265504.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1908434801536489610.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17841469044616265504.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,8.44459e+06,3.59277,79820,2,7341,5,181507,6,0,457,195080,0


Converting to forward existential form...Done !
original formula: A(A(!((((p1==1)&&(p5==1))&&((p47==1)&&(p57==1)))) U !(((AX(((((p16==1)&&(p23==1))&&((p27==1)&&(p34==1)))&&(((p41==1)&&(p48==1))&&(p58==1)...422
=> equivalent forward existential formula: [((Init * !(EG(!((p11==1))))) * !(E(!((p11==1)) U (!(!((E(!(!(((!(EX(!(((((p16==1)&&(p23==1))&&((p27==1)&&(p34==...1651
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t5, t6, t7, t10, t11, t14, t15, t18, t19, t20, t23, t24, t27, t28, t31, t127, t153, t...362
Detected timeout of ITS tools.
[2026-05-22 20:28:30] [INFO ] Flatten gal took : 12 ms
[2026-05-22 20:28:30] [INFO ] Applying decomposition
[2026-05-22 20:28:30] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph12441123768939229126.txt' '-o' '/tmp/graph12441123768939229126.bin' '-w' '/tmp/graph12441123768939229126.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph12441123768939229126.bin' '-l' '-1' '-v' '-w' '/tmp/graph12441123768939229126.weights' '-q' '0' '-e' '0.001'
[2026-05-22 20:28:30] [INFO ] Decomposing Gal with order
[2026-05-22 20:28:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 20:28:30] [INFO ] Removed a total of 776 redundant transitions.
[2026-05-22 20:28:30] [INFO ] Flatten gal took : 47 ms
[2026-05-22 20:28:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 23 labels/synchronizations in 9 ms.
[2026-05-22 20:28:30] [INFO ] Time to serialize gal into /tmp/CTLFireability1695260946897436304.gal : 3 ms
[2026-05-22 20:28:30] [INFO ] Time to serialize properties into /tmp/CTLFireability3236841935175451061.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/CTLFireability1695260946897436304.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3236841935175451061.ctl'

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 -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,8.44459e+06,1.08998,26112,1082,70,27535,834,273,140005,57,4344,0


Converting to forward existential form...Done !
original formula: A(A(!((((i8.u20.p1==1)&&(i8.u20.p5==1))&&((i6.u17.p47==1)&&(i8.u20.p57==1)))) U !(((AX(((((i0.u3.p16==1)&&(i1.u6.p23==1))&&((u8.p27==1)&&...637
=> equivalent forward existential formula: [((Init * !(EG(!((i0.u1.p11==1))))) * !(E(!((i0.u1.p11==1)) U (!(!((E(!(!(((!(EX(!(((((i0.u3.p16==1)&&(i1.u6.p23...2444
Reverse transition relation is NOT exact ! Due to transitions t31, t121, t192, t193, t194, t195, t200, t201, t202, t203, t209, t210, t211, t216, t217, t218...476
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 9
(forward)formula 0,0,27.8687,407956,1,0,776502,1212,2134,1.15211e+06,313,5996,1150095
FORMULA AutonomousCar-PT-06a-CTLFireability-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 62/62 places, 257/257 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 62 transition count 251
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 56 transition count 251
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 12 place count 56 transition count 250
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 14 place count 55 transition count 250
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 20 place count 49 transition count 208
Iterating global reduction 2 with 6 rules applied. Total rules applied 26 place count 49 transition count 208
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 28 place count 48 transition count 207
Applied a total of 28 rules in 25 ms. Remains 48 /62 variables (removed 14) and now considering 207/257 (removed 50) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3048172312326186530.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-277920309178588311.kers'
[2026-05-22 20:28:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3048172312326186530.kers, --Pflows, --basisKERS=/tmp/petrispot-output-277920309178588311.kers]
Normalized transition count is 206 out of 207 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 206 rows 47 cols 1626 entries
Finished phase 1 with 40 SingleSign rule and 0 generalized
[2026-05-22 20:28:58] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-277920309178588311.kers
Total runtime 2 ms.
[2026-05-22 20:28:58] [INFO ] Implicit Places using invariants in 125 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 139 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 47/62 places, 207/257 transitions.
Applied a total of 0 rules in 8 ms. Remains 47 /47 variables (removed 0) and now considering 207/207 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 172 ms. Remains : 47/62 places, 207/257 transitions.
[2026-05-22 20:28:58] [INFO ] Flatten gal took : 13 ms
[2026-05-22 20:28:58] [INFO ] Flatten gal took : 12 ms
[2026-05-22 20:28:58] [INFO ] Input system was already deterministic with 207 transitions.
[2026-05-22 20:28:58] [INFO ] Flatten gal took : 12 ms
[2026-05-22 20:28:58] [INFO ] Flatten gal took : 12 ms
[2026-05-22 20:28:58] [INFO ] Time to serialize gal into /tmp/CTLFireability17440960171286876410.gal : 5 ms
[2026-05-22 20:28:58] [INFO ] Time to serialize properties into /tmp/CTLFireability11726566001343712786.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/CTLFireability17440960171286876410.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11726566001343712786.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.55001e+06,0.554775,15976,2,1620,5,34140,6,0,393,39414,0


Converting to forward existential form...Done !
original formula: AF(!(E(AF((p62==1)) U ((((p13==1)&&(p23==1))&&((p27==1)&&(p37==1)))&&(((p41==1)&&(p48==1))&&(p58==1))))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(!(EG(!((p62==1)))) U ((((p13==1)&&(p23==1))&&((p27==1)&&(p37==1)))&&(((p41==1)&&(p48==1))&&(p58...174
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t7, t9, t10, t12, t13, t15, t16, t18, t19, t130, t131, t132, t133, t134, t135...623
(forward)formula 0,1,8.00799,184512,1,0,1101,659313,444,478,6964,763176,1130
FORMULA AutonomousCar-PT-06a-CTLFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 257/257 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 57 transition count 222
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 57 transition count 222
Applied a total of 10 rules in 4 ms. Remains 57 /62 variables (removed 5) and now considering 222/257 (removed 35) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11295400219667201013.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7167986317776698242.kers'
[2026-05-22 20:29:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11295400219667201013.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7167986317776698242.kers]
Normalized transition count is 221 out of 222 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 221 rows 56 cols 1680 entries
Finished phase 1 with 49 SingleSign rule and 0 generalized
[2026-05-22 20:29:06] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7167986317776698242.kers
Total runtime 2 ms.
[2026-05-22 20:29:06] [INFO ] Implicit Places using invariants in 79 ms returned []
[2026-05-22 20:29:06] [INFO ] Invariant cache hit.
[2026-05-22 20:29:06] [INFO ] State equation strengthened by 117 read => feed constraints.
[2026-05-22 20:29:06] [INFO ] Implicit Places using invariants and state equation in 180 ms returned []
Implicit Place search using SMT with State Equation took 277 ms to find 0 implicit places.
Running 221 sub problems to find dead transitions.
[2026-05-22 20:29:06] [INFO ] Invariant cache hit.
[2026-05-22 20:29:06] [INFO ] State equation strengthened by 117 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (OVERLAPS) 1/57 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (OVERLAPS) 221/278 variables, 57/65 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/278 variables, 116/181 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/278 variables, 3/184 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/278 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 7 (OVERLAPS) 1/279 variables, 1/185 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/279 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 9 (OVERLAPS) 0/279 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Real declared 279/279 variables, and 185 constraints, problems are : Problem set: 0 solved, 221 unsolved in 28161 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 57/57 constraints, ReadFeed: 117/117 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 221 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (OVERLAPS) 1/57 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (OVERLAPS) 221/278 variables, 57/68 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/278 variables, 116/184 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/278 variables, 221/405 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/278 variables, 5/410 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/278 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 9 (OVERLAPS) 1/279 variables, 1/411 constraints. Problems are: Problem set: 0 solved, 221 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 279/279 variables, and 411 constraints, problems are : Problem set: 0 solved, 221 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 57/57 constraints, ReadFeed: 117/117 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 5/5 constraints]
After SMT, in 58672ms problems are : Problem set: 0 solved, 221 unsolved
Search for dead transitions found 0 dead transitions in 58675ms
Starting structural reductions in LTL mode, iteration 1 : 57/62 places, 222/257 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58957 ms. Remains : 57/62 places, 222/257 transitions.
[2026-05-22 20:30:05] [INFO ] Flatten gal took : 9 ms
[2026-05-22 20:30:05] [INFO ] Flatten gal took : 9 ms
[2026-05-22 20:30:05] [INFO ] Input system was already deterministic with 222 transitions.
[2026-05-22 20:30:05] [INFO ] Flatten gal took : 9 ms
[2026-05-22 20:30:05] [INFO ] Flatten gal took : 9 ms
[2026-05-22 20:30:05] [INFO ] Time to serialize gal into /tmp/CTLFireability9031347566505129257.gal : 4 ms
[2026-05-22 20:30:05] [INFO ] Time to serialize properties into /tmp/CTLFireability6726676461276980338.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/CTLFireability9031347566505129257.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6726676461276980338.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,7.29495e+06,7.87204,163336,2,18716,5,516666,6,0,446,445053,0


Converting to forward existential form...Done !
original formula: (EF((((p1==1)&&(p8==1))&&((p14==1)&&(p57==1)))) * EF((AG(AX((((p1==0)||(p7==0))||((p15==0)||(p57==0))))) * EG(AX((((p1==0)||(p7==0))||((p...178
=> equivalent forward existential formula: [FwdG((FwdU((Init * E(TRUE U (((p1==1)&&(p8==1))&&((p14==1)&&(p57==1))))),TRUE) * !(E(TRUE U !(!(EX(!((((p1==0)|...258
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t5, t6, t9, t10, t13, t14, t17, t18, t21, t22, t25, t26, t27, t84, t146, t148, t149, ...447
Detected timeout of ITS tools.
[2026-05-22 20:30:35] [INFO ] Flatten gal took : 10 ms
[2026-05-22 20:30:35] [INFO ] Applying decomposition
[2026-05-22 20:30:35] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph4099093345473648652.txt' '-o' '/tmp/graph4099093345473648652.bin' '-w' '/tmp/graph4099093345473648652.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph4099093345473648652.bin' '-l' '-1' '-v' '-w' '/tmp/graph4099093345473648652.weights' '-q' '0' '-e' '0.001'
[2026-05-22 20:30:35] [INFO ] Decomposing Gal with order
[2026-05-22 20:30:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 20:30:35] [INFO ] Removed a total of 745 redundant transitions.
[2026-05-22 20:30:35] [INFO ] Flatten gal took : 52 ms
[2026-05-22 20:30:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 30 labels/synchronizations in 10 ms.
[2026-05-22 20:30:35] [INFO ] Time to serialize gal into /tmp/CTLFireability13007332367850183909.gal : 3 ms
[2026-05-22 20:30:35] [INFO ] Time to serialize properties into /tmp/CTLFireability18059820564586268314.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/CTLFireability13007332367850183909.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18059820564586268314.ctl'

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 -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.29495e+06,0.051208,4720,98,109,904,630,148,1593,72,4083,0


Converting to forward existential form...Done !
original formula: (EF((((u18.p1==1)&&(u18.p8==1))&&((u1.p14==1)&&(u18.p57==1)))) * EF((AG(AX((((u18.p1==0)||(u18.p7==0))||((i0.u2.p15==0)||(u18.p57==0)))))...230
=> equivalent forward existential formula: [FwdG((FwdU((Init * E(TRUE U (((u18.p1==1)&&(u18.p8==1))&&((u1.p14==1)&&(u18.p57==1))))),TRUE) * !(E(TRUE U !(!(...310
Reverse transition relation is NOT exact ! Due to transitions t93, t165, t197, u1.t26, u1.t27, u18.t146, i0.u2.t25, i2.u4.t22, i2.u5.t21, i3.u7.t18, i3.u8....384
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 7
Fast SCC detection found an SCC at level 8
(forward)formula 0,1,0.459473,12764,1,0,17742,1672,1009,24258,395,11327,24625
FORMULA AutonomousCar-PT-06a-CTLFireability-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 257/257 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 58 transition count 229
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 58 transition count 229
Applied a total of 8 rules in 4 ms. Remains 58 /62 variables (removed 4) and now considering 229/257 (removed 28) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2569043498286892919.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13493008680358998426.kers'
[2026-05-22 20:30:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2569043498286892919.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13493008680358998426.kers]
Normalized transition count is 228 out of 229 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 228 rows 57 cols 1718 entries
Finished phase 1 with 50 SingleSign rule and 0 generalized
[2026-05-22 20:30:36] [INFO ] Computed 8 invariants in 2 ms
Computed 8 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-13493008680358998426.kers
Total runtime 3 ms.
[2026-05-22 20:30:36] [INFO ] Implicit Places using invariants in 95 ms returned []
[2026-05-22 20:30:36] [INFO ] Invariant cache hit.
[2026-05-22 20:30:36] [INFO ] State equation strengthened by 123 read => feed constraints.
[2026-05-22 20:30:36] [INFO ] Implicit Places using invariants and state equation in 248 ms returned []
Implicit Place search using SMT with State Equation took 355 ms to find 0 implicit places.
Running 228 sub problems to find dead transitions.
[2026-05-22 20:30:36] [INFO ] Invariant cache hit.
[2026-05-22 20:30:36] [INFO ] State equation strengthened by 123 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 3 (OVERLAPS) 228/286 variables, 58/66 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 122/188 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 2/190 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/286 variables, 1/191 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/286 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 8 (OVERLAPS) 1/287 variables, 1/192 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/287 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 10 (OVERLAPS) 0/287 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 228 unsolved
No progress, stopping.
After SMT solving in domain Real declared 287/287 variables, and 192 constraints, problems are : Problem set: 0 solved, 228 unsolved in 26503 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 58/58 constraints, ReadFeed: 123/123 constraints, PredecessorRefiner: 228/228 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 228 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 4 (OVERLAPS) 228/286 variables, 58/69 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 122/191 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/286 variables, 228/419 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/286 variables, 5/424 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/286 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 9 (OVERLAPS) 1/287 variables, 1/425 constraints. Problems are: Problem set: 0 solved, 228 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 287/287 variables, and 425 constraints, problems are : Problem set: 0 solved, 228 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 58/58 constraints, ReadFeed: 123/123 constraints, PredecessorRefiner: 228/228 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 5/5 constraints]
After SMT, in 57084ms problems are : Problem set: 0 solved, 228 unsolved
Search for dead transitions found 0 dead transitions in 57085ms
Starting structural reductions in LTL mode, iteration 1 : 58/62 places, 229/257 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57447 ms. Remains : 58/62 places, 229/257 transitions.
[2026-05-22 20:31:33] [INFO ] Flatten gal took : 13 ms
[2026-05-22 20:31:33] [INFO ] Flatten gal took : 15 ms
[2026-05-22 20:31:33] [INFO ] Input system was already deterministic with 229 transitions.
[2026-05-22 20:31:34] [INFO ] Flatten gal took : 18 ms
[2026-05-22 20:31:34] [INFO ] Flatten gal took : 14 ms
[2026-05-22 20:31:34] [INFO ] Time to serialize gal into /tmp/CTLFireability14863262589491367701.gal : 6 ms
[2026-05-22 20:31:34] [INFO ] Time to serialize properties into /tmp/CTLFireability7452564352349747957.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/CTLFireability14863262589491367701.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7452564352349747957.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,8.44459e+06,9.02467,189148,2,20133,5,590545,6,0,457,494148,0


Converting to forward existential form...Done !
original formula: AX(E(!((EF((((p1==1)&&(p6==1))&&((p28==1)&&(p57==1)))) + ((((p16==1)&&(p23==1))&&((p30==1)&&(p34==1)))&&(((p41==1)&&(p51==1))&&((p58==1)&...253
=> equivalent forward existential formula: [(EY(Init) * !(E(!((E(TRUE U (((p1==1)&&(p6==1))&&((p28==1)&&(p57==1)))) + ((((p16==1)&&(p23==1))&&((p30==1)&&(p...306
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t5, t6, t9, t10, t13, t14, t17, t18, t19, t22, t23, t26, t27, t28, t85, t127, t153, t...362
Detected timeout of ITS tools.
[2026-05-22 20:32:04] [INFO ] Flatten gal took : 9 ms
[2026-05-22 20:32:04] [INFO ] Applying decomposition
[2026-05-22 20:32:04] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph7030071500832230308.txt' '-o' '/tmp/graph7030071500832230308.bin' '-w' '/tmp/graph7030071500832230308.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph7030071500832230308.bin' '-l' '-1' '-v' '-w' '/tmp/graph7030071500832230308.weights' '-q' '0' '-e' '0.001'
[2026-05-22 20:32:04] [INFO ] Decomposing Gal with order
[2026-05-22 20:32:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 20:32:04] [INFO ] Removed a total of 756 redundant transitions.
[2026-05-22 20:32:04] [INFO ] Flatten gal took : 25 ms
[2026-05-22 20:32:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 31 labels/synchronizations in 5 ms.
[2026-05-22 20:32:04] [INFO ] Time to serialize gal into /tmp/CTLFireability10466237265283426094.gal : 2 ms
[2026-05-22 20:32:04] [INFO ] Time to serialize properties into /tmp/CTLFireability8707338373998420681.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/CTLFireability10466237265283426094.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8707338373998420681.ctl'

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 -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,8.44459e+06,0.032624,4784,128,110,853,618,161,1672,72,4198,0


Converting to forward existential form...Done !
original formula: AX(E(!((EF((((u18.p1==1)&&(u18.p6==1))&&((u7.p28==1)&&(u18.p57==1)))) + ((((i0.u2.p16==1)&&(i1.u5.p23==1))&&((i2.u8.p30==1)&&(i4.u10.p34=...350
=> equivalent forward existential formula: [(EY(Init) * !(E(!((E(TRUE U (((u18.p1==1)&&(u18.p6==1))&&((u7.p28==1)&&(u18.p57==1)))) + ((((i0.u2.p16==1)&&(i1...403
Reverse transition relation is NOT exact ! Due to transitions t93, t123, t176, t208, u7.t18, u7.t19, u18.t153, i0.u1.t27, i0.u1.t28, i0.u2.t26, i1.u4.t23, ...401
(forward)formula 0,0,0.153321,9136,1,0,10343,1372,1028,14820,386,5710,17343
FORMULA AutonomousCar-PT-06a-CTLFireability-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 257/257 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 57 transition count 222
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 57 transition count 222
Applied a total of 10 rules in 4 ms. Remains 57 /62 variables (removed 5) and now considering 222/257 (removed 35) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3875478846198649435.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10585982998252992930.kers'
[2026-05-22 20:32:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3875478846198649435.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10585982998252992930.kers]
Normalized transition count is 221 out of 222 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 221 rows 56 cols 1680 entries
Finished phase 1 with 49 SingleSign rule and 0 generalized
[2026-05-22 20:32:04] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10585982998252992930.kers
Total runtime 2 ms.
[2026-05-22 20:32:04] [INFO ] Implicit Places using invariants in 88 ms returned []
[2026-05-22 20:32:04] [INFO ] Invariant cache hit.
[2026-05-22 20:32:04] [INFO ] State equation strengthened by 117 read => feed constraints.
[2026-05-22 20:32:04] [INFO ] Implicit Places using invariants and state equation in 199 ms returned []
Implicit Place search using SMT with State Equation took 292 ms to find 0 implicit places.
Running 221 sub problems to find dead transitions.
[2026-05-22 20:32:04] [INFO ] Invariant cache hit.
[2026-05-22 20:32:04] [INFO ] State equation strengthened by 117 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (OVERLAPS) 1/57 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (OVERLAPS) 221/278 variables, 57/65 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/278 variables, 116/181 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/278 variables, 3/184 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/278 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 7 (OVERLAPS) 1/279 variables, 1/185 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/279 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 9 (OVERLAPS) 0/279 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Real declared 279/279 variables, and 185 constraints, problems are : Problem set: 0 solved, 221 unsolved in 24443 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 57/57 constraints, ReadFeed: 117/117 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 221 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (OVERLAPS) 1/57 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (OVERLAPS) 221/278 variables, 57/68 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/278 variables, 116/184 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/278 variables, 221/405 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/278 variables, 5/410 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/278 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 9 (OVERLAPS) 1/279 variables, 1/411 constraints. Problems are: Problem set: 0 solved, 221 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 279/279 variables, and 411 constraints, problems are : Problem set: 0 solved, 221 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 57/57 constraints, ReadFeed: 117/117 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 5/5 constraints]
After SMT, in 54831ms problems are : Problem set: 0 solved, 221 unsolved
Search for dead transitions found 0 dead transitions in 54832ms
Starting structural reductions in LTL mode, iteration 1 : 57/62 places, 222/257 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55129 ms. Remains : 57/62 places, 222/257 transitions.
[2026-05-22 20:32:59] [INFO ] Flatten gal took : 8 ms
[2026-05-22 20:32:59] [INFO ] Flatten gal took : 8 ms
[2026-05-22 20:32:59] [INFO ] Input system was already deterministic with 222 transitions.
[2026-05-22 20:32:59] [INFO ] Flatten gal took : 9 ms
[2026-05-22 20:32:59] [INFO ] Flatten gal took : 8 ms
[2026-05-22 20:32:59] [INFO ] Time to serialize gal into /tmp/CTLFireability15696125362277944924.gal : 3 ms
[2026-05-22 20:32:59] [INFO ] Time to serialize properties into /tmp/CTLFireability7352442914769544649.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/CTLFireability15696125362277944924.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7352442914769544649.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,7.29495e+06,2.8673,75616,2,7312,5,168133,6,0,446,193380,0


Converting to forward existential form...Done !
original formula: A(!((((p1==1)&&(p8==1))&&((p50==1)&&(p57==1)))) U (EX(((((p1==1)&&(p6==1))&&((p49==1)&&(p57==1))) + AX(((((p1==1)&&(p5==1))&&((p10==1)&&(...279
=> equivalent forward existential formula: [((Init * !(EG(!((EX(((((p1==1)&&(p6==1))&&((p49==1)&&(p57==1))) + !(EX(!(((((p1==1)&&(p5==1))&&((p10==1)&&(p57=...794
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t5, t6, t7, t10, t11, t14, t15, t18, t19, t22, t23, t26, t27, t30, t146, t148, t149, ...447
Using saturation style SCC detection
Detected timeout of ITS tools.
[2026-05-22 20:33:29] [INFO ] Flatten gal took : 9 ms
[2026-05-22 20:33:29] [INFO ] Applying decomposition
[2026-05-22 20:33:29] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph855403603637310167.txt' '-o' '/tmp/graph855403603637310167.bin' '-w' '/tmp/graph855403603637310167.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph855403603637310167.bin' '-l' '-1' '-v' '-w' '/tmp/graph855403603637310167.weights' '-q' '0' '-e' '0.001'
[2026-05-22 20:33:29] [INFO ] Decomposing Gal with order
[2026-05-22 20:33:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 20:33:29] [INFO ] Removed a total of 764 redundant transitions.
[2026-05-22 20:33:29] [INFO ] Flatten gal took : 38 ms
[2026-05-22 20:33:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 26 labels/synchronizations in 10 ms.
[2026-05-22 20:33:29] [INFO ] Time to serialize gal into /tmp/CTLFireability14713211607633439369.gal : 2 ms
[2026-05-22 20:33:29] [INFO ] Time to serialize properties into /tmp/CTLFireability13181752162487204176.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/CTLFireability14713211607633439369.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13181752162487204176.ctl'

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 -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.29495e+06,0.062852,5864,194,63,3825,453,195,6197,57,1444,0


Converting to forward existential form...Done !
original formula: A(!((((i0.u0.p1==1)&&(i0.u0.p8==1))&&((i6.u19.p50==1)&&(i0.u0.p57==1)))) U (EX(((((i0.u0.p1==1)&&(i0.u0.p6==1))&&((u18.p49==1)&&(i0.u0.p5...407
=> equivalent forward existential formula: [((Init * !(EG(!((EX(((((i0.u0.p1==1)&&(i0.u0.p6==1))&&((u18.p49==1)&&(i0.u0.p57==1))) + !(EX(!(((((i0.u0.p1==1)...1128
Reverse transition relation is NOT exact ! Due to transitions t36, t161, t162, t177, t178, u18.t6, u18.t7, i0.u1.t146, i1.u3.t27, i1.u4.t26, i2.u6.t23, i2....396
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 2
Fast SCC detection found a local SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 2
Fast SCC detection found a local SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
(forward)formula 0,0,2.45779,65876,1,0,123104,1183,1248,203534,322,8582,148947
FORMULA AutonomousCar-PT-06a-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 257/257 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 59 transition count 236
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 59 transition count 236
Applied a total of 6 rules in 2 ms. Remains 59 /62 variables (removed 3) and now considering 236/257 (removed 21) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13565473722449465366.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17591747708954640901.kers'
[2026-05-22 20:33:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13565473722449465366.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17591747708954640901.kers]
Normalized transition count is 235 out of 236 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 235 rows 58 cols 1756 entries
Finished phase 1 with 51 SingleSign rule and 0 generalized
[2026-05-22 20:33:32] [INFO ] Computed 8 invariants in 2 ms
Computed 8 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-17591747708954640901.kers
Total runtime 3 ms.
[2026-05-22 20:33:32] [INFO ] Implicit Places using invariants in 94 ms returned []
[2026-05-22 20:33:32] [INFO ] Invariant cache hit.
[2026-05-22 20:33:32] [INFO ] State equation strengthened by 129 read => feed constraints.
[2026-05-22 20:33:32] [INFO ] Implicit Places using invariants and state equation in 236 ms returned []
Implicit Place search using SMT with State Equation took 333 ms to find 0 implicit places.
Running 235 sub problems to find dead transitions.
[2026-05-22 20:33:32] [INFO ] Invariant cache hit.
[2026-05-22 20:33:32] [INFO ] State equation strengthened by 129 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 1 (OVERLAPS) 1/59 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 3 (OVERLAPS) 235/294 variables, 59/67 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/294 variables, 128/195 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/294 variables, 2/197 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/294 variables, 1/198 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/294 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 8 (OVERLAPS) 1/295 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/295 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 10 (OVERLAPS) 0/295 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 235 unsolved
No progress, stopping.
After SMT solving in domain Real declared 295/295 variables, and 199 constraints, problems are : Problem set: 0 solved, 235 unsolved in 29944 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 59/59 constraints, ReadFeed: 129/129 constraints, PredecessorRefiner: 235/235 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 235 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 1 (OVERLAPS) 1/59 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 4 (OVERLAPS) 235/294 variables, 59/70 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/294 variables, 128/198 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/294 variables, 235/433 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/294 variables, 5/438 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/294 variables, 0/438 constraints. Problems are: Problem set: 0 solved, 235 unsolved
SMT process timed out in 60524ms, After SMT, problems are : Problem set: 0 solved, 235 unsolved
Search for dead transitions found 0 dead transitions in 60525ms
Starting structural reductions in LTL mode, iteration 1 : 59/62 places, 236/257 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60862 ms. Remains : 59/62 places, 236/257 transitions.
[2026-05-22 20:34:33] [INFO ] Flatten gal took : 13 ms
[2026-05-22 20:34:33] [INFO ] Flatten gal took : 14 ms
[2026-05-22 20:34:33] [INFO ] Input system was already deterministic with 236 transitions.
[2026-05-22 20:34:33] [INFO ] Flatten gal took : 18 ms
[2026-05-22 20:34:33] [INFO ] Flatten gal took : 26 ms
[2026-05-22 20:34:33] [INFO ] Time to serialize gal into /tmp/CTLFireability11408609429887962574.gal : 5 ms
[2026-05-22 20:34:33] [INFO ] Time to serialize properties into /tmp/CTLFireability11419560596145666556.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/CTLFireability11408609429887962574.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11419560596145666556.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,9.77657e+06,4.48337,92084,2,7508,5,229223,6,0,468,229008,0


Converting to forward existential form...Done !
original formula: (E(EG(E(EX((p26==1)) U (((p1==1)&&(p5==1))&&((p33==1)&&(p57==1))))) U EG(!(((((((p16==1)&&(p20==1))&&((p27==1)&&(p37==1)))&&(((p44==1)&&(...321
=> equivalent forward existential formula: ([FwdG(FwdU(Init,EG(E(EX((p26==1)) U (((p1==1)&&(p5==1))&&((p33==1)&&(p57==1)))))),!(((((((p16==1)&&(p20==1))&&(...392
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t5, t6, t9, t10, t13, t14, t15, t18, t19, t20, t23, t24, t27, t28, t29, t50, t92, t13...324
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,26.5096,484720,1,0,1050,1.57406e+06,511,582,7775,1.82466e+06,1014
FORMULA AutonomousCar-PT-06a-CTLFireability-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 257/257 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 60 transition count 243
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 60 transition count 243
Applied a total of 4 rules in 8 ms. Remains 60 /62 variables (removed 2) and now considering 243/257 (removed 14) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1174329464295336876.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1856615684473133592.kers'
[2026-05-22 20:35:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1174329464295336876.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1856615684473133592.kers]
Normalized transition count is 242 out of 243 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 242 rows 59 cols 1794 entries
Finished phase 1 with 52 SingleSign rule and 0 generalized
[2026-05-22 20:35:00] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1856615684473133592.kers
Total runtime 2 ms.
[2026-05-22 20:35:00] [INFO ] Implicit Places using invariants in 48 ms returned []
[2026-05-22 20:35:00] [INFO ] Invariant cache hit.
[2026-05-22 20:35:00] [INFO ] State equation strengthened by 135 read => feed constraints.
[2026-05-22 20:35:00] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 197 ms to find 0 implicit places.
Running 242 sub problems to find dead transitions.
[2026-05-22 20:35:00] [INFO ] Invariant cache hit.
[2026-05-22 20:35:00] [INFO ] State equation strengthened by 135 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 1 (OVERLAPS) 1/60 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 3 (OVERLAPS) 242/302 variables, 60/68 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/302 variables, 134/202 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/302 variables, 3/205 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/302 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 7 (OVERLAPS) 1/303 variables, 1/206 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/303 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 9 (OVERLAPS) 0/303 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 242 unsolved
No progress, stopping.
After SMT solving in domain Real declared 303/303 variables, and 206 constraints, problems are : Problem set: 0 solved, 242 unsolved in 28385 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 60/60 constraints, ReadFeed: 135/135 constraints, PredecessorRefiner: 242/242 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 242 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 1 (OVERLAPS) 1/60 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 4 (OVERLAPS) 242/302 variables, 60/71 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/302 variables, 134/205 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/302 variables, 242/447 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/302 variables, 5/452 constraints. Problems are: Problem set: 0 solved, 242 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 302/303 variables, and 452 constraints, problems are : Problem set: 0 solved, 242 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 60/60 constraints, ReadFeed: 134/135 constraints, PredecessorRefiner: 242/242 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 5/5 constraints]
After SMT, in 58774ms problems are : Problem set: 0 solved, 242 unsolved
Search for dead transitions found 0 dead transitions in 58775ms
Starting structural reductions in LTL mode, iteration 1 : 60/62 places, 243/257 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58981 ms. Remains : 60/62 places, 243/257 transitions.
[2026-05-22 20:35:59] [INFO ] Flatten gal took : 15 ms
[2026-05-22 20:35:59] [INFO ] Flatten gal took : 16 ms
[2026-05-22 20:35:59] [INFO ] Input system was already deterministic with 243 transitions.
[2026-05-22 20:35:59] [INFO ] Flatten gal took : 13 ms
[2026-05-22 20:35:59] [INFO ] Flatten gal took : 13 ms
[2026-05-22 20:35:59] [INFO ] Time to serialize gal into /tmp/CTLFireability8178896778392405156.gal : 3 ms
[2026-05-22 20:35:59] [INFO ] Time to serialize properties into /tmp/CTLFireability395544684242718888.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/CTLFireability8178896778392405156.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability395544684242718888.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 -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.13189e+07,4.34959,94628,2,7824,5,239481,6,0,479,257820,0


Converting to forward existential form...Done !
original formula: A((A(AG(AX((((p1==1)&&(p7==1))&&((p36==1)&&(p57==1))))) U ((EG(((((p16==1)&&(p20==1))&&((p27==1)&&(p37==1)))&&(((p44==1)&&(p51==1))&&(p58...837
=> equivalent forward existential formula: [((Init * !(EG(!(!((E(!((EG(E(TRUE U (((p1==1)&&(p9==1))&&((p42==1)&&(p57==1))))) + E(TRUE U ((((p1==1)&&(p7==1)...3142
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t5, t6, t7, t10, t11, t12, t15, t16, t17, t20, t21, t24, t25, t28, t29, t30, t33, t57...310
Detected timeout of ITS tools.
[2026-05-22 20:36:29] [INFO ] Flatten gal took : 9 ms
[2026-05-22 20:36:29] [INFO ] Applying decomposition
[2026-05-22 20:36:29] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph13208116934153440406.txt' '-o' '/tmp/graph13208116934153440406.bin' '-w' '/tmp/graph13208116934153440406.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph13208116934153440406.bin' '-l' '-1' '-v' '-w' '/tmp/graph13208116934153440406.weights' '-q' '0' '-e' '0.001'
[2026-05-22 20:36:29] [INFO ] Decomposing Gal with order
[2026-05-22 20:36:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 20:36:29] [INFO ] Removed a total of 778 redundant transitions.
[2026-05-22 20:36:29] [INFO ] Flatten gal took : 41 ms
[2026-05-22 20:36:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 22 labels/synchronizations in 5 ms.
[2026-05-22 20:36:29] [INFO ] Time to serialize gal into /tmp/CTLFireability6010551297628591383.gal : 2 ms
[2026-05-22 20:36:29] [INFO ] Time to serialize properties into /tmp/CTLFireability3780317017516352352.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/CTLFireability6010551297628591383.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3780317017516352352.ctl'

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 -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.13189e+07,0.106621,7564,353,132,6192,1414,184,10288,64,9686,0


Converting to forward existential form...Done !
original formula: A((A(AG(AX((((u0.p1==1)&&(u0.p7==1))&&((i6.u12.p36==1)&&(u0.p57==1))))) U ((EG(((((i1.u3.p16==1)&&(i3.u5.p20==1))&&((i4.u8.p27==1)&&(i6.u...1125
=> equivalent forward existential formula: [((Init * !(EG(!(!((E(!((EG(E(TRUE U (((u0.p1==1)&&(u0.p9==1))&&((u14.p42==1)&&(u0.p57==1))))) + E(TRUE U ((((u0...4026
Reverse transition relation is NOT exact ! Due to transitions t40, t58, t106, t160, t190, u0.t167, u2.t29, u2.t30, u11.t16, u11.t17, u14.t11, u14.t12, u17....413
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 2
Fast SCC detection found a local SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 2
Fast SCC detection found a local SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 2
Fast SCC detection found a local SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found a local SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
(forward)formula 0,1,14.4802,428616,1,0,821692,5466,1543,1.14303e+06,373,62737,1254307
FORMULA AutonomousCar-PT-06a-CTLFireability-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 62/62 places, 257/257 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 62 transition count 256
Reduce places removed 1 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 6 rules applied. Total rules applied 7 place count 61 transition count 251
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 12 place count 56 transition count 251
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 12 place count 56 transition count 250
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 14 place count 55 transition count 250
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 17 place count 52 transition count 229
Iterating global reduction 3 with 3 rules applied. Total rules applied 20 place count 52 transition count 229
Applied a total of 20 rules in 21 ms. Remains 52 /62 variables (removed 10) and now considering 229/257 (removed 28) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5452287055097604937.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16160868863867752845.kers'
[2026-05-22 20:36:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5452287055097604937.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16160868863867752845.kers]
Normalized transition count is 228 out of 229 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 228 rows 51 cols 1742 entries
Finished phase 1 with 44 SingleSign rule and 0 generalized
[2026-05-22 20:36:43] [INFO ] Computed 8 invariants in 2 ms
Computed 8 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-16160868863867752845.kers
Total runtime 4 ms.
[2026-05-22 20:36:44] [INFO ] Implicit Places using invariants in 94 ms returned []
[2026-05-22 20:36:44] [INFO ] Invariant cache hit.
[2026-05-22 20:36:44] [INFO ] State equation strengthened by 129 read => feed constraints.
[2026-05-22 20:36:44] [INFO ] Implicit Places using invariants and state equation in 211 ms returned []
Implicit Place search using SMT with State Equation took 306 ms to find 0 implicit places.
[2026-05-22 20:36:44] [INFO ] Redundant transitions in 3 ms returned []
Running 228 sub problems to find dead transitions.
[2026-05-22 20:36:44] [INFO ] Invariant cache hit.
[2026-05-22 20:36:44] [INFO ] State equation strengthened by 129 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 1 (OVERLAPS) 1/52 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 3 (OVERLAPS) 228/280 variables, 52/60 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/280 variables, 128/188 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 2/190 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/280 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 7 (OVERLAPS) 1/281 variables, 1/191 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/281 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 9 (OVERLAPS) 0/281 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 228 unsolved
No progress, stopping.
After SMT solving in domain Real declared 281/281 variables, and 191 constraints, problems are : Problem set: 0 solved, 228 unsolved in 26264 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 52/52 constraints, ReadFeed: 129/129 constraints, PredecessorRefiner: 228/228 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 228 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 1 (OVERLAPS) 1/52 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 4 (OVERLAPS) 228/280 variables, 52/62 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 128/190 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/280 variables, 228/418 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/280 variables, 5/423 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/280 variables, 1/424 constraints. Problems are: Problem set: 0 solved, 228 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 280/281 variables, and 424 constraints, problems are : Problem set: 0 solved, 228 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 52/52 constraints, ReadFeed: 128/129 constraints, PredecessorRefiner: 228/228 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 5/5 constraints]
After SMT, in 56703ms problems are : Problem set: 0 solved, 228 unsolved
Search for dead transitions found 0 dead transitions in 56704ms
Starting structural reductions in SI_CTL mode, iteration 1 : 52/62 places, 229/257 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 57041 ms. Remains : 52/62 places, 229/257 transitions.
[2026-05-22 20:37:40] [INFO ] Flatten gal took : 16 ms
[2026-05-22 20:37:41] [INFO ] Flatten gal took : 16 ms
[2026-05-22 20:37:41] [INFO ] Input system was already deterministic with 229 transitions.
[2026-05-22 20:37:41] [INFO ] Flatten gal took : 20 ms
[2026-05-22 20:37:41] [INFO ] Flatten gal took : 33 ms
[2026-05-22 20:37:41] [INFO ] Time to serialize gal into /tmp/CTLFireability14222712656690188361.gal : 4 ms
[2026-05-22 20:37:41] [INFO ] Time to serialize properties into /tmp/CTLFireability15850753736680881612.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/CTLFireability14222712656690188361.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15850753736680881612.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,2.93808e+06,6.77165,153424,2,6974,5,337320,6,0,433,363398,0


Converting to forward existential form...Done !
original formula: (!(E((AF((((p1==1)&&(p9==1))&&((p29==1)&&(p57==1)))) * !(((((p1==1)&&(p9==1))&&((p21==1)&&(p57==1)))||(p22==1)))) U (((p1==1)&&(p5==1))&&...567
=> equivalent forward existential formula: ([(FwdU(Init,(!(EG(!((((p1==1)&&(p9==1))&&((p29==1)&&(p57==1)))))) * !(((((p1==1)&&(p9==1))&&((p21==1)&&(p57==1)...651
Hit Full ! (commute/partial/dont) 34/397/195
Reverse transition relation is NOT exact ! Due to transitions t1, t4, t5, t6, t7, t8, t9, t10, t12, t13, t14, t15, t16, t17, t18, t19, t38, t62, t122, t147...323
Detected timeout of ITS tools.
[2026-05-22 20:38:11] [INFO ] Flatten gal took : 10 ms
[2026-05-22 20:38:11] [INFO ] Applying decomposition
[2026-05-22 20:38:11] [INFO ] Flatten gal took : 14 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph5700833708359219207.txt' '-o' '/tmp/graph5700833708359219207.bin' '-w' '/tmp/graph5700833708359219207.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph5700833708359219207.bin' '-l' '-1' '-v' '-w' '/tmp/graph5700833708359219207.weights' '-q' '0' '-e' '0.001'
[2026-05-22 20:38:11] [INFO ] Decomposing Gal with order
[2026-05-22 20:38:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 20:38:11] [INFO ] Removed a total of 745 redundant transitions.
[2026-05-22 20:38:11] [INFO ] Flatten gal took : 37 ms
[2026-05-22 20:38:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 61 labels/synchronizations in 6 ms.
[2026-05-22 20:38:11] [INFO ] Time to serialize gal into /tmp/CTLFireability12928194356778999319.gal : 2 ms
[2026-05-22 20:38:11] [INFO ] Time to serialize properties into /tmp/CTLFireability7923687649418340129.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/CTLFireability12928194356778999319.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7923687649418340129.ctl'

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 -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.93808e+06,0.046327,4892,150,61,1484,586,147,2589,63,2437,0


Converting to forward existential form...Done !
original formula: (!(E((AF((((i6.u13.p1==1)&&(i6.u13.p9==1))&&((i2.u6.p29==1)&&(i6.u13.p57==1)))) * !(((((i6.u13.p1==1)&&(i6.u13.p9==1))&&((i1.u3.p21==1)&&...864
=> equivalent forward existential formula: ([(FwdU(Init,(!(EG(!((((i6.u13.p1==1)&&(i6.u13.p9==1))&&((i2.u6.p29==1)&&(i6.u13.p57==1)))))) * !(((((i6.u13.p1=...948
Reverse transition relation is NOT exact ! Due to transitions t56, t62, t116, t165, t219, u15.t218, u15.t226, u15.t228, i0.u1.t19, i0.u2.t18, i0.u14.t1, i1...403
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 7
(forward)formula 0,1,0.573969,17352,1,0,28364,1130,862,41129,342,5485,41463
FORMULA AutonomousCar-PT-06a-CTLFireability-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 62/62 places, 257/257 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 62 transition count 252
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 57 transition count 252
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 10 place count 57 transition count 250
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 14 place count 55 transition count 250
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 17 place count 52 transition count 229
Iterating global reduction 2 with 3 rules applied. Total rules applied 20 place count 52 transition count 229
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 22 place count 51 transition count 228
Applied a total of 22 rules in 45 ms. Remains 51 /62 variables (removed 11) and now considering 228/257 (removed 29) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16145013343933175863.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16035798854391110404.kers'
[2026-05-22 20:38:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16145013343933175863.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16035798854391110404.kers]
Normalized transition count is 227 out of 228 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 227 rows 50 cols 1740 entries
Finished phase 1 with 43 SingleSign rule and 0 generalized
[2026-05-22 20:38:11] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-16035798854391110404.kers
Total runtime 2 ms.
[2026-05-22 20:38:12] [INFO ] Implicit Places using invariants in 82 ms returned []
[2026-05-22 20:38:12] [INFO ] Invariant cache hit.
[2026-05-22 20:38:12] [INFO ] State equation strengthened by 129 read => feed constraints.
[2026-05-22 20:38:12] [INFO ] Implicit Places using invariants and state equation in 181 ms returned []
Implicit Place search using SMT with State Equation took 266 ms to find 0 implicit places.
[2026-05-22 20:38:12] [INFO ] Redundant transitions in 6 ms returned []
Running 227 sub problems to find dead transitions.
[2026-05-22 20:38:12] [INFO ] Invariant cache hit.
[2026-05-22 20:38:12] [INFO ] State equation strengthened by 129 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 1 (OVERLAPS) 1/51 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 3 (OVERLAPS) 227/278 variables, 51/59 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/278 variables, 128/187 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/278 variables, 3/190 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/278 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 7 (OVERLAPS) 1/279 variables, 1/191 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/279 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 227 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 9 (OVERLAPS) 0/279 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 227 unsolved
No progress, stopping.
After SMT solving in domain Real declared 279/279 variables, and 191 constraints, problems are : Problem set: 0 solved, 227 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 51/51 constraints, ReadFeed: 129/129 constraints, PredecessorRefiner: 227/227 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 227 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 1 (OVERLAPS) 1/51 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 4 (OVERLAPS) 227/278 variables, 51/62 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/278 variables, 128/190 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/278 variables, 227/417 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/278 variables, 5/422 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/278 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 227 unsolved
SMT process timed out in 60442ms, After SMT, problems are : Problem set: 0 solved, 227 unsolved
Search for dead transitions found 0 dead transitions in 60444ms
Starting structural reductions in SI_CTL mode, iteration 1 : 51/62 places, 228/257 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 60766 ms. Remains : 51/62 places, 228/257 transitions.
[2026-05-22 20:39:12] [INFO ] Flatten gal took : 11 ms
[2026-05-22 20:39:12] [INFO ] Flatten gal took : 12 ms
[2026-05-22 20:39:12] [INFO ] Input system was already deterministic with 228 transitions.
[2026-05-22 20:39:12] [INFO ] Flatten gal took : 12 ms
[2026-05-22 20:39:12] [INFO ] Flatten gal took : 12 ms
[2026-05-22 20:39:12] [INFO ] Time to serialize gal into /tmp/CTLFireability10417902978675028285.gal : 2 ms
[2026-05-22 20:39:12] [INFO ] Time to serialize properties into /tmp/CTLFireability15487041834256609729.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/CTLFireability10417902978675028285.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15487041834256609729.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,2.50792e+06,3.32962,73776,2,5033,5,166800,6,0,428,183523,0


Converting to forward existential form...Done !
original formula: EG(((AG(((((p16==0)||(p20==0))||((p30==0)||(p34==0)))||(((p41==0)||(p48==0))||(p58==0)))) + ((((EG((((p1==0)||(p6==0))||((p14==0)||(p57==...538
=> equivalent forward existential formula: [FwdG(Init,((!(E(TRUE U !(((((p16==0)||(p20==0))||((p30==0)||(p34==0)))||(((p41==0)||(p48==0))||(p58==0)))))) + ...819
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t6, t7, t8, t10, t11, t12, t14, t15, t17, t18, t20, t21, t22, t42, t84, t144, t166, t...320
Detected timeout of ITS tools.
[2026-05-22 20:39:42] [INFO ] Flatten gal took : 11 ms
[2026-05-22 20:39:42] [INFO ] Applying decomposition
[2026-05-22 20:39:42] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph280921511963792703.txt' '-o' '/tmp/graph280921511963792703.bin' '-w' '/tmp/graph280921511963792703.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph280921511963792703.bin' '-l' '-1' '-v' '-w' '/tmp/graph280921511963792703.weights' '-q' '0' '-e' '0.001'
[2026-05-22 20:39:42] [INFO ] Decomposing Gal with order
[2026-05-22 20:39:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 20:39:42] [INFO ] Removed a total of 731 redundant transitions.
[2026-05-22 20:39:42] [INFO ] Flatten gal took : 24 ms
[2026-05-22 20:39:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 56 labels/synchronizations in 3 ms.
[2026-05-22 20:39:42] [INFO ] Time to serialize gal into /tmp/CTLFireability8700986382588880397.gal : 1 ms
[2026-05-22 20:39:42] [INFO ] Time to serialize properties into /tmp/CTLFireability14179720546176732467.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/CTLFireability8700986382588880397.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14179720546176732467.ctl'

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 -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.50792e+06,0.032311,4812,118,138,1141,746,129,1944,72,3940,0


Converting to forward existential form...Done !
original formula: EG(((AG(((((i0.u1.p16==0)||(i1.u2.p20==0))||((i2.u5.p30==0)||(i3.u6.p34==0)))||(((i4.u8.p41==0)||(i5.u11.p48==0))||(u14.p58==0)))) + ((((...747
=> equivalent forward existential formula: [FwdG(Init,((!(E(TRUE U !(((((i0.u1.p16==0)||(i1.u2.p20==0))||((i2.u5.p30==0)||(i3.u6.p34==0)))||(((i4.u8.p41==0...1102
Reverse transition relation is NOT exact ! Due to transitions t60, t102, t132, t185, t223, u14.t220, u14.t221, u14.t224, u14.t225, i0.u0.t21, i0.u0.t22, i0...391
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 7
(forward)formula 0,0,0.698887,32560,1,0,61590,2596,815,75486,408,14624,78760
FORMULA AutonomousCar-PT-06a-CTLFireability-2024-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 62/62 places, 257/257 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 0 with 3 rules applied. Total rules applied 3 place count 62 transition count 254
Reduce places removed 3 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 6 rules applied. Total rules applied 9 place count 59 transition count 251
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 12 place count 56 transition count 251
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 12 place count 56 transition count 250
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 14 place count 55 transition count 250
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 16 place count 53 transition count 236
Iterating global reduction 3 with 2 rules applied. Total rules applied 18 place count 53 transition count 236
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 20 place count 52 transition count 235
Applied a total of 20 rules in 18 ms. Remains 52 /62 variables (removed 10) and now considering 235/257 (removed 22) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1756100817982095437.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3363265313706212022.kers'
[2026-05-22 20:39:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1756100817982095437.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3363265313706212022.kers]
Normalized transition count is 234 out of 235 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 234 rows 51 cols 1778 entries
Finished phase 1 with 44 SingleSign rule and 0 generalized
[2026-05-22 20:39:43] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-3363265313706212022.kers
Total runtime 2 ms.
[2026-05-22 20:39:43] [INFO ] Implicit Places using invariants in 59 ms returned []
[2026-05-22 20:39:43] [INFO ] Invariant cache hit.
[2026-05-22 20:39:43] [INFO ] State equation strengthened by 135 read => feed constraints.
[2026-05-22 20:39:43] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 213 ms to find 0 implicit places.
[2026-05-22 20:39:43] [INFO ] Redundant transitions in 1 ms returned []
Running 234 sub problems to find dead transitions.
[2026-05-22 20:39:43] [INFO ] Invariant cache hit.
[2026-05-22 20:39:43] [INFO ] State equation strengthened by 135 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 1 (OVERLAPS) 1/52 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 3 (OVERLAPS) 234/286 variables, 52/60 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 134/194 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 2/196 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/286 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 7 (OVERLAPS) 1/287 variables, 1/197 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/287 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 9 (OVERLAPS) 0/287 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 234 unsolved
No progress, stopping.
After SMT solving in domain Real declared 287/287 variables, and 197 constraints, problems are : Problem set: 0 solved, 234 unsolved in 27534 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 52/52 constraints, ReadFeed: 135/135 constraints, PredecessorRefiner: 234/234 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 234 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 1 (OVERLAPS) 1/52 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 4 (OVERLAPS) 234/286 variables, 52/62 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 134/196 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/286 variables, 234/430 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/286 variables, 5/435 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/286 variables, 1/436 constraints. Problems are: Problem set: 0 solved, 234 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 286/287 variables, and 436 constraints, problems are : Problem set: 0 solved, 234 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 52/52 constraints, ReadFeed: 134/135 constraints, PredecessorRefiner: 234/234 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 5/5 constraints]
After SMT, in 57948ms problems are : Problem set: 0 solved, 234 unsolved
Search for dead transitions found 0 dead transitions in 57949ms
Starting structural reductions in SI_CTL mode, iteration 1 : 52/62 places, 235/257 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 58188 ms. Remains : 52/62 places, 235/257 transitions.
[2026-05-22 20:40:41] [INFO ] Flatten gal took : 14 ms
[2026-05-22 20:40:41] [INFO ] Flatten gal took : 16 ms
[2026-05-22 20:40:41] [INFO ] Input system was already deterministic with 235 transitions.
[2026-05-22 20:40:41] [INFO ] Flatten gal took : 16 ms
[2026-05-22 20:40:41] [INFO ] Flatten gal took : 16 ms
[2026-05-22 20:40:41] [INFO ] Time to serialize gal into /tmp/CTLFireability8587004924249354509.gal : 4 ms
[2026-05-22 20:40:41] [INFO ] Time to serialize properties into /tmp/CTLFireability6016456773642008197.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/CTLFireability8587004924249354509.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6016456773642008197.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,3.20614e+06,6.77891,147676,2,6927,5,317316,6,0,439,374192,0


Converting to forward existential form...Done !
original formula: EF(((EG(((((p1==0)||(p9==0))||((p29==0)||(p57==0)))&&(((p1==0)||(p9==0))||((p21==0)||(p57==0))))) + EF((((p1==1)&&(p9==1))&&((p19==1)&&(p...468
=> equivalent forward existential formula: (([FwdG(FwdU(Init,TRUE),((((p1==0)||(p9==0))||((p29==0)||(p57==0)))&&(((p1==0)||(p9==0))||((p21==0)||(p57==0))))...700
Hit Full ! (commute/partial/dont) 31/2/204
Detected timeout of ITS tools.
[2026-05-22 20:41:12] [INFO ] Flatten gal took : 10 ms
[2026-05-22 20:41:12] [INFO ] Applying decomposition
[2026-05-22 20:41:12] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph3263486896989972880.txt' '-o' '/tmp/graph3263486896989972880.bin' '-w' '/tmp/graph3263486896989972880.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph3263486896989972880.bin' '-l' '-1' '-v' '-w' '/tmp/graph3263486896989972880.weights' '-q' '0' '-e' '0.001'
[2026-05-22 20:41:12] [INFO ] Decomposing Gal with order
[2026-05-22 20:41:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 20:41:12] [INFO ] Removed a total of 736 redundant transitions.
[2026-05-22 20:41:12] [INFO ] Flatten gal took : 28 ms
[2026-05-22 20:41:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 60 labels/synchronizations in 3 ms.
[2026-05-22 20:41:12] [INFO ] Time to serialize gal into /tmp/CTLFireability3782679696935468283.gal : 1 ms
[2026-05-22 20:41:12] [INFO ] Time to serialize properties into /tmp/CTLFireability15784881686839780693.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/CTLFireability3782679696935468283.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15784881686839780693.ctl'

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 -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.20614e+06,0.06397,6012,172,120,3757,792,128,6146,66,5251,0


Converting to forward existential form...Done !
original formula: EF(((EG(((((u0.p1==0)||(u0.p9==0))||((i2.u6.p29==0)||(u0.p57==0)))&&(((u0.p1==0)||(u0.p9==0))||((i7.u3.p21==0)||(u0.p57==0))))) + EF((((u...629
=> equivalent forward existential formula: (([FwdG(FwdU(Init,TRUE),((((u0.p1==0)||(u0.p9==0))||((i2.u6.p29==0)||(u0.p57==0)))&&(((u0.p1==0)||(u0.p9==0))||(...864
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local SCC at level 6
Fast SCC detection found an SCC at level 7
(forward)formula 0,1,0.483348,20700,1,0,40099,1145,485,48020,317,8305,44218
FORMULA AutonomousCar-PT-06a-CTLFireability-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

[2026-05-22 20:41:12] [INFO ] Flatten gal took : 10 ms
[2026-05-22 20:41:12] [INFO ] Flatten gal took : 10 ms
Total runtime 1088049 ms.

BK_STOP 1779482472723

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ 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 CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="AutonomousCar-PT-06a"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5973"
echo " Executing tool itstools"
echo " Input is AutonomousCar-PT-06a, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r018-smll-177946787900082"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/AutonomousCar-PT-06a.tgz
mv AutonomousCar-PT-06a execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;