About the Execution of ITS-Tools for AutonomousCar-PT-02b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 570.155 | 508975.00 | 583740.00 | 1635.00 | FFFTFTFFFTFFFFTF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2026-input.r018-smll-177946787900028.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5973
Executing tool itstools
Input is AutonomousCar-PT-02b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r018-smll-177946787900028
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 508K
-rw-r--r-- 1 mcc users 7.3K Mar 5 16:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Mar 5 16:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Mar 5 16:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Mar 5 16:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 15 07:18 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 07:18 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 07:18 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Mar 5 16:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K Mar 5 16:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Mar 5 16:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Mar 5 16:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 07:18 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 07:18 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 49K Mar 3 18:30 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME AutonomousCar-PT-02b-LTLFireability-00
FORMULA_NAME AutonomousCar-PT-02b-LTLFireability-01
FORMULA_NAME AutonomousCar-PT-02b-LTLFireability-02
FORMULA_NAME AutonomousCar-PT-02b-LTLFireability-03
FORMULA_NAME AutonomousCar-PT-02b-LTLFireability-04
FORMULA_NAME AutonomousCar-PT-02b-LTLFireability-05
FORMULA_NAME AutonomousCar-PT-02b-LTLFireability-06
FORMULA_NAME AutonomousCar-PT-02b-LTLFireability-07
FORMULA_NAME AutonomousCar-PT-02b-LTLFireability-08
FORMULA_NAME AutonomousCar-PT-02b-LTLFireability-09
FORMULA_NAME AutonomousCar-PT-02b-LTLFireability-10
FORMULA_NAME AutonomousCar-PT-02b-LTLFireability-11
FORMULA_NAME AutonomousCar-PT-02b-LTLFireability-12
FORMULA_NAME AutonomousCar-PT-02b-LTLFireability-13
FORMULA_NAME AutonomousCar-PT-02b-LTLFireability-14
FORMULA_NAME AutonomousCar-PT-02b-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1779474108173
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-02b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-22 18:21:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-22 18:21:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-22 18:21:51] [INFO ] Load time of PNML (sax parser for PT used): 146 ms
[2026-05-22 18:21:51] [INFO ] Transformed 155 places.
[2026-05-22 18:21:51] [INFO ] Transformed 194 transitions.
[2026-05-22 18:21:51] [INFO ] Found NUPN structural information;
[2026-05-22 18:21:51] [INFO ] Parsed PT model containing 155 places and 194 transitions and 620 arcs in 364 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 21 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA AutonomousCar-PT-02b-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 34 out of 155 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 155/155 places, 194/194 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 138 transition count 177
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 138 transition count 177
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 50 place count 138 transition count 161
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 53 place count 135 transition count 158
Iterating global reduction 1 with 3 rules applied. Total rules applied 56 place count 135 transition count 158
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 57 place count 134 transition count 157
Iterating global reduction 1 with 1 rules applied. Total rules applied 58 place count 134 transition count 157
Applied a total of 58 rules in 100 ms. Remains 134 /155 variables (removed 21) and now considering 157/194 (removed 37) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3421846558841873299.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15178594866467004640.kers'
[2026-05-22 18:21:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3421846558841873299.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15178594866467004640.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 157 rows 134 cols 450 entries
Finished phase 1 with 127 SingleSign rule and 0 generalized
[2026-05-22 18:21:51] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-15178594866467004640.kers
Total runtime 4 ms.
[2026-05-22 18:21:52] [INFO ] Implicit Places using invariants in 429 ms returned []
[2026-05-22 18:21:52] [INFO ] Invariant cache hit.
[2026-05-22 18:21:52] [INFO ] Implicit Places using invariants and state equation in 365 ms returned []
Implicit Place search using SMT with State Equation took 864 ms to find 0 implicit places.
Running 156 sub problems to find dead transitions.
[2026-05-22 18:21:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 1 (OVERLAPS) 1/134 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 19/26 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/134 variables, 5/31 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 156 unsolved
Problem TDEAD10 is UNSAT
Problem TDEAD147 is UNSAT
At refinement iteration 6 (OVERLAPS) 157/291 variables, 134/167 constraints. Problems are: Problem set: 2 solved, 154 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/291 variables, 2/169 constraints. Problems are: Problem set: 2 solved, 154 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/291 variables, 0/169 constraints. Problems are: Problem set: 2 solved, 154 unsolved
At refinement iteration 9 (OVERLAPS) 0/291 variables, 0/169 constraints. Problems are: Problem set: 2 solved, 154 unsolved
No progress, stopping.
After SMT solving in domain Real declared 291/291 variables, and 169 constraints, problems are : Problem set: 2 solved, 154 unsolved in 22753 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 134/134 constraints, PredecessorRefiner: 156/156 constraints, Known Traps: 26/26 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 2 solved, 154 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 154 unsolved
At refinement iteration 1 (OVERLAPS) 2/134 variables, 7/7 constraints. Problems are: Problem set: 2 solved, 154 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 26/33 constraints. Problems are: Problem set: 2 solved, 154 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/134 variables, 0/33 constraints. Problems are: Problem set: 2 solved, 154 unsolved
At refinement iteration 4 (OVERLAPS) 157/291 variables, 134/167 constraints. Problems are: Problem set: 2 solved, 154 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/291 variables, 154/321 constraints. Problems are: Problem set: 2 solved, 154 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/291 variables, 1/322 constraints. Problems are: Problem set: 2 solved, 154 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/291 variables, 2/324 constraints. Problems are: Problem set: 2 solved, 154 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/291 variables, 1/325 constraints. Problems are: Problem set: 2 solved, 154 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/291 variables, 2/327 constraints. Problems are: Problem set: 2 solved, 154 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/291 variables, 0/327 constraints. Problems are: Problem set: 2 solved, 154 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 291/291 variables, and 327 constraints, problems are : Problem set: 2 solved, 154 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 134/134 constraints, PredecessorRefiner: 154/156 constraints, Known Traps: 30/30 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 52941ms problems are : Problem set: 2 solved, 154 unsolved
Search for dead transitions found 2 dead transitions in 52967ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in LTL mode, iteration 1 : 134/155 places, 155/194 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 133 transition count 155
Applied a total of 1 rules in 14 ms. Remains 133 /134 variables (removed 1) and now considering 155/155 (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-18358317555968133430.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3330414352686584887.kers'
[2026-05-22 18:22:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18358317555968133430.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3330414352686584887.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 155 rows 133 cols 444 entries
Finished phase 1 with 126 SingleSign rule and 0 generalized
[2026-05-22 18:22:45] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-3330414352686584887.kers
Total runtime 4 ms.
[2026-05-22 18:22:45] [INFO ] Implicit Places using invariants in 117 ms returned []
[2026-05-22 18:22:45] [INFO ] Invariant cache hit.
[2026-05-22 18:22:46] [INFO ] Implicit Places using invariants and state equation in 212 ms returned []
Implicit Place search using SMT with State Equation took 334 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 133/155 places, 155/194 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 54525 ms. Remains : 133/155 places, 155/194 transitions.
Starting structural reductions in LTL mode, iteration 0 : 133/133 places, 155/155 transitions.
Applied a total of 0 rules in 9 ms. Remains 133 /133 variables (removed 0) and now considering 155/155 (removed 0) transitions.
[2026-05-22 18:22:46] [INFO ] Invariant cache hit.
[2026-05-22 18:22:46] [INFO ] Implicit Places using invariants in 91 ms returned []
[2026-05-22 18:22:46] [INFO ] Invariant cache hit.
[2026-05-22 18:22:46] [INFO ] Implicit Places using invariants and state equation in 205 ms returned []
Implicit Place search using SMT with State Equation took 299 ms to find 0 implicit places.
Running 154 sub problems to find dead transitions.
[2026-05-22 18:22:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 3/30 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 5 (OVERLAPS) 155/288 variables, 133/163 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/288 variables, 2/165 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/288 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/288 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 9 (OVERLAPS) 0/288 variables, 1/167 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/288 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 11 (OVERLAPS) 0/288 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 154 unsolved
No progress, stopping.
After SMT solving in domain Real declared 288/288 variables, and 167 constraints, problems are : Problem set: 0 solved, 154 unsolved in 27954 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 133/133 constraints, PredecessorRefiner: 154/154 constraints, Known Traps: 25/25 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 154 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 25/32 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/133 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 6 (OVERLAPS) 155/288 variables, 133/168 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/288 variables, 154/322 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/288 variables, 2/324 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/288 variables, 3/327 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/288 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 154 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 288/288 variables, and 328 constraints, problems are : Problem set: 0 solved, 154 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 133/133 constraints, PredecessorRefiner: 154/154 constraints, Known Traps: 28/28 constraints, Known Traps Along Path: 6/6 constraints]
After SMT, in 58017ms problems are : Problem set: 0 solved, 154 unsolved
Search for dead transitions found 0 dead transitions in 58020ms
Finished structural reductions in LTL mode , in 1 iterations and 58332 ms. Remains : 133/133 places, 155/155 transitions.
Support contains 34 out of 133 places after structural reductions.
[2026-05-22 18:23:44] [INFO ] Flatten gal took : 80 ms
[2026-05-22 18:23:44] [INFO ] Flatten gal took : 30 ms
[2026-05-22 18:23:44] [INFO ] Input system was already deterministic with 155 transitions.
Support contains 32 out of 133 places (down from 34) after GAL structural reductions.
RANDOM walk for 40000 steps (20 resets) in 1969 ms. (20 steps per ms) remains 2/30 properties
BEST_FIRST walk for 40000 steps (23 resets) in 601 ms. (66 steps per ms) remains 1/2 properties
BEST_FIRST walk for 13036 steps (13 resets) in 33 ms. (383 steps per ms) remains 0/1 properties
FORMULA AutonomousCar-PT-02b-LTLFireability-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA AutonomousCar-PT-02b-LTLFireability-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 30 stabilizing places and 30 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(X(p0)) U ((X(X(p0))&&G((p1||G(p2))))||X(X(G(p0))))))))'
Support contains 3 out of 133 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 133/133 places, 155/155 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 126 transition count 148
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 126 transition count 148
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 125 transition count 147
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 125 transition count 147
Applied a total of 16 rules in 20 ms. Remains 125 /133 variables (removed 8) and now considering 147/155 (removed 8) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-288949172599209650.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17267161803767204462.kers'
[2026-05-22 18:23:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-288949172599209650.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17267161803767204462.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 147 rows 125 cols 428 entries
Finished phase 1 with 118 SingleSign rule and 0 generalized
[2026-05-22 18:23:46] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-17267161803767204462.kers
Total runtime 2 ms.
[2026-05-22 18:23:46] [INFO ] Implicit Places using invariants in 160 ms returned []
[2026-05-22 18:23:46] [INFO ] Invariant cache hit.
[2026-05-22 18:23:47] [INFO ] Implicit Places using invariants and state equation in 227 ms returned []
Implicit Place search using SMT with State Equation took 390 ms to find 0 implicit places.
Running 146 sub problems to find dead transitions.
[2026-05-22 18:23:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (OVERLAPS) 1/125 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (OVERLAPS) 147/272 variables, 125/154 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/272 variables, 2/156 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/272 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 8 (OVERLAPS) 0/272 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Real declared 272/272 variables, and 156 constraints, problems are : Problem set: 0 solved, 146 unsolved in 17687 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 125/125 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 146 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (OVERLAPS) 1/125 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 22/29 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 2/31 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 7 (OVERLAPS) 147/272 variables, 125/158 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/272 variables, 146/304 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/272 variables, 1/305 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/272 variables, 2/307 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/272 variables, 3/310 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/272 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 146 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 272/272 variables, and 310 constraints, problems are : Problem set: 0 solved, 146 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 125/125 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 27/27 constraints, Known Traps Along Path: 5/5 constraints]
After SMT, in 47737ms problems are : Problem set: 0 solved, 146 unsolved
Search for dead transitions found 0 dead transitions in 47739ms
Starting structural reductions in LTL mode, iteration 1 : 125/133 places, 147/155 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48151 ms. Remains : 125/133 places, 147/155 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(X(p0)) U (X(X(G(p0)))||(X(X(p0))&&G((p1||G(p2)))))))))'
Stuttering acceptance computed with spot in 954 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p1) (NOT p2)), true, (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-02b-LTLFireability-00
Entered a terminal (fully accepting) state of product in 234 steps with 4 reset in 5 ms.
FORMULA AutonomousCar-PT-02b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-02b-LTLFireability-00 finished in 49359 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 133 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 133/133 places, 155/155 transitions.
Graph (trivial) has 122 edges and 133 vertex of which 4 / 133 are part of one of the 2 SCC in 4 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 57 place count 130 transition count 96
Reduce places removed 56 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 72 rules applied. Total rules applied 129 place count 74 transition count 80
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 138 place count 65 transition count 80
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 138 place count 65 transition count 74
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 150 place count 59 transition count 74
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 154 place count 55 transition count 70
Iterating global reduction 3 with 4 rules applied. Total rules applied 158 place count 55 transition count 70
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 159 place count 54 transition count 68
Iterating global reduction 3 with 1 rules applied. Total rules applied 160 place count 54 transition count 68
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 162 place count 54 transition count 66
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 163 place count 53 transition count 66
Performed 21 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 5 with 42 rules applied. Total rules applied 205 place count 32 transition count 44
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 206 place count 32 transition count 43
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 209 place count 29 transition count 37
Iterating global reduction 6 with 3 rules applied. Total rules applied 212 place count 29 transition count 37
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 213 place count 29 transition count 36
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 217 place count 27 transition count 34
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 221 place count 25 transition count 40
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 223 place count 23 transition count 38
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 224 place count 22 transition count 38
Applied a total of 224 rules in 47 ms. Remains 22 /133 variables (removed 111) and now considering 38/155 (removed 117) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1274894021667581764.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12450258944498141273.kers'
[2026-05-22 18:24:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1274894021667581764.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12450258944498141273.kers]
Normalized transition count is 37 out of 38 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 37 rows 21 cols 172 entries
Finished phase 1 with 17 SingleSign rule and 0 generalized
[2026-05-22 18:24:36] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-12450258944498141273.kers
Total runtime 1 ms.
[2026-05-22 18:24:36] [INFO ] Implicit Places using invariants in 43 ms returned []
[2026-05-22 18:24:36] [INFO ] Invariant cache hit.
[2026-05-22 18:24:36] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-22 18:24:36] [INFO ] Implicit Places using invariants and state equation in 56 ms returned [18, 21]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 104 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 20/133 places, 38/155 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 18 transition count 36
Applied a total of 4 rules in 4 ms. Remains 18 /20 variables (removed 2) and now considering 36/38 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18303256725338888184.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15656904114049861046.kers'
[2026-05-22 18:24:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18303256725338888184.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15656904114049861046.kers]
Normalized transition count is 35 out of 36 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 35 rows 18 cols 170 entries
Finished phase 1 with 15 SingleSign rule and 0 generalized
[2026-05-22 18:24:36] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-15656904114049861046.kers
Total runtime 1 ms.
[2026-05-22 18:24:36] [INFO ] Implicit Places using invariants in 46 ms returned []
[2026-05-22 18:24:36] [INFO ] Invariant cache hit.
[2026-05-22 18:24:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-22 18:24:36] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 18/133 places, 36/155 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 279 ms. Remains : 18/133 places, 36/155 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-02b-LTLFireability-02
Stuttering criterion allowed to conclude after 6 steps with 1 reset in 0 ms.
FORMULA AutonomousCar-PT-02b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-02b-LTLFireability-02 finished in 364 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(p0)||(F(p1) U X(p2)))))'
Support contains 8 out of 133 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 133/133 places, 155/155 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 126 transition count 148
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 126 transition count 148
Applied a total of 14 rules in 15 ms. Remains 126 /133 variables (removed 7) and now considering 148/155 (removed 7) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16494995955571986204.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5646159071858825250.kers'
[2026-05-22 18:24:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16494995955571986204.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5646159071858825250.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 148 rows 126 cols 430 entries
Finished phase 1 with 119 SingleSign rule and 0 generalized
[2026-05-22 18:24:36] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5646159071858825250.kers
Total runtime 2 ms.
[2026-05-22 18:24:36] [INFO ] Implicit Places using invariants in 73 ms returned []
[2026-05-22 18:24:36] [INFO ] Invariant cache hit.
[2026-05-22 18:24:36] [INFO ] Implicit Places using invariants and state equation in 197 ms returned []
Implicit Place search using SMT with State Equation took 273 ms to find 0 implicit places.
Running 147 sub problems to find dead transitions.
[2026-05-22 18:24:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 1 (OVERLAPS) 1/126 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 19/26 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 4/30 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 6 (OVERLAPS) 148/274 variables, 126/158 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/274 variables, 2/160 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/274 variables, 2/162 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/274 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/274 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 11 (OVERLAPS) 0/274 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 147 unsolved
No progress, stopping.
After SMT solving in domain Real declared 274/274 variables, and 163 constraints, problems are : Problem set: 0 solved, 147 unsolved in 22243 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 126/126 constraints, PredecessorRefiner: 147/147 constraints, Known Traps: 28/28 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 147 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 1 (OVERLAPS) 1/126 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 28/35 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 4 (OVERLAPS) 148/274 variables, 126/161 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/274 variables, 147/308 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/274 variables, 1/309 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/274 variables, 2/311 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/274 variables, 4/315 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/274 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 147 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 274/274 variables, and 315 constraints, problems are : Problem set: 0 solved, 147 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 126/126 constraints, PredecessorRefiner: 147/147 constraints, Known Traps: 29/29 constraints, Known Traps Along Path: 6/6 constraints]
After SMT, in 52304ms problems are : Problem set: 0 solved, 147 unsolved
Search for dead transitions found 0 dead transitions in 52305ms
Starting structural reductions in LTL mode, iteration 1 : 126/133 places, 148/155 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52595 ms. Remains : 126/133 places, 148/155 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(p0)||(F(p1) U X(p2)))))'
Stuttering acceptance computed with spot in 392 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-02b-LTLFireability-03
Product exploration explored 100000 steps with 33333 reset in 379 ms.
Product exploration explored 100000 steps with 33333 reset in 284 ms.
Computed a total of 29 stabilizing places and 29 stable transitions
Computed a total of 29 stabilizing places and 29 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 7 factoid took 21 ms. Proved property starting from automaton with 7 states, 10 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 35 ms.
FORMULA AutonomousCar-PT-02b-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-02b-LTLFireability-03 finished in 53744 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Support contains 2 out of 133 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 133/133 places, 155/155 transitions.
Graph (trivial) has 120 edges and 133 vertex of which 4 / 133 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 55 transitions
Trivial Post-agglo rules discarded 55 transitions
Performed 55 trivial Post agglomeration. Transition count delta: 55
Iterating post reduction 0 with 55 rules applied. Total rules applied 56 place count 130 transition count 97
Reduce places removed 55 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 71 rules applied. Total rules applied 127 place count 75 transition count 81
Reduce places removed 9 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 10 rules applied. Total rules applied 137 place count 66 transition count 80
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 138 place count 65 transition count 80
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 138 place count 65 transition count 74
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 150 place count 59 transition count 74
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 154 place count 55 transition count 70
Iterating global reduction 4 with 4 rules applied. Total rules applied 158 place count 55 transition count 70
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 159 place count 54 transition count 68
Iterating global reduction 4 with 1 rules applied. Total rules applied 160 place count 54 transition count 68
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 162 place count 54 transition count 66
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 163 place count 53 transition count 66
Performed 21 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 6 with 42 rules applied. Total rules applied 205 place count 32 transition count 44
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 206 place count 32 transition count 43
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 209 place count 29 transition count 37
Iterating global reduction 7 with 3 rules applied. Total rules applied 212 place count 29 transition count 37
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 213 place count 29 transition count 36
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 215 place count 28 transition count 35
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 219 place count 26 transition count 41
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 221 place count 24 transition count 39
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 222 place count 23 transition count 39
Applied a total of 222 rules in 39 ms. Remains 23 /133 variables (removed 110) and now considering 39/155 (removed 116) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16266795153309606560.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6388824156618484184.kers'
[2026-05-22 18:25:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16266795153309606560.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6388824156618484184.kers]
Normalized transition count is 38 out of 39 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 38 rows 22 cols 170 entries
Finished phase 1 with 18 SingleSign rule and 0 generalized
[2026-05-22 18:25:30] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6388824156618484184.kers
Total runtime 1 ms.
[2026-05-22 18:25:30] [INFO ] Implicit Places using invariants in 100 ms returned []
[2026-05-22 18:25:30] [INFO ] Invariant cache hit.
[2026-05-22 18:25:30] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-22 18:25:30] [INFO ] Implicit Places using invariants and state equation in 280 ms returned [19, 22]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 388 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 21/133 places, 39/155 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 21 transition count 38
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 20 transition count 38
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 4 place count 19 transition count 37
Applied a total of 4 rules in 5 ms. Remains 19 /21 variables (removed 2) and now considering 37/39 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7384999727824569765.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9632920314569185969.kers'
[2026-05-22 18:25:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7384999727824569765.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9632920314569185969.kers]
Normalized transition count is 36 out of 37 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 36 rows 19 cols 165 entries
Finished phase 1 with 16 SingleSign rule and 0 generalized
[2026-05-22 18:25:30] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-9632920314569185969.kers
Total runtime 3 ms.
[2026-05-22 18:25:30] [INFO ] Implicit Places using invariants in 69 ms returned []
[2026-05-22 18:25:30] [INFO ] Invariant cache hit.
[2026-05-22 18:25:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-22 18:25:30] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 145 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 19/133 places, 37/155 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 577 ms. Remains : 19/133 places, 37/155 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Stuttering acceptance computed with spot in 93 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : AutonomousCar-PT-02b-LTLFireability-04
Stuttering criterion allowed to conclude after 41 steps with 4 reset in 0 ms.
FORMULA AutonomousCar-PT-02b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-02b-LTLFireability-04 finished in 702 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&X(X(F(p0))))))'
Support contains 1 out of 133 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 133/133 places, 155/155 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 126 transition count 148
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 126 transition count 148
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 125 transition count 147
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 125 transition count 147
Applied a total of 16 rules in 9 ms. Remains 125 /133 variables (removed 8) and now considering 147/155 (removed 8) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-812577118723376965.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17173108428119734648.kers'
[2026-05-22 18:25:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-812577118723376965.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17173108428119734648.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 147 rows 125 cols 428 entries
Finished phase 1 with 118 SingleSign rule and 0 generalized
[2026-05-22 18:25:30] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17173108428119734648.kers
Total runtime 1 ms.
[2026-05-22 18:25:31] [INFO ] Implicit Places using invariants in 412 ms returned []
[2026-05-22 18:25:31] [INFO ] Invariant cache hit.
[2026-05-22 18:25:31] [INFO ] Implicit Places using invariants and state equation in 201 ms returned []
Implicit Place search using SMT with State Equation took 631 ms to find 0 implicit places.
Running 146 sub problems to find dead transitions.
[2026-05-22 18:25:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (OVERLAPS) 1/125 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 16/23 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 6/31 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 7 (OVERLAPS) 147/272 variables, 125/157 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/272 variables, 2/159 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/272 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 10 (OVERLAPS) 0/272 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/272 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 12 (OVERLAPS) 0/272 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Real declared 272/272 variables, and 160 constraints, problems are : Problem set: 0 solved, 146 unsolved in 23745 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 125/125 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 26/26 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 146 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (OVERLAPS) 1/125 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 26/33 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 4 (OVERLAPS) 147/272 variables, 125/158 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/272 variables, 146/304 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/272 variables, 1/305 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/272 variables, 1/306 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/272 variables, 1/307 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/272 variables, 2/309 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/272 variables, 3/312 constraints. Problems are: Problem set: 0 solved, 146 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 272/272 variables, and 312 constraints, problems are : Problem set: 0 solved, 146 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 125/125 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 29/29 constraints, Known Traps Along Path: 5/5 constraints]
After SMT, in 53797ms problems are : Problem set: 0 solved, 146 unsolved
Search for dead transitions found 0 dead transitions in 53798ms
Starting structural reductions in LTL mode, iteration 1 : 125/133 places, 147/155 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54440 ms. Remains : 125/133 places, 147/155 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&X(X(F(p0))))))'
Stuttering acceptance computed with spot in 157 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Running random walk in product with property : AutonomousCar-PT-02b-LTLFireability-05
Product exploration explored 100000 steps with 25000 reset in 68 ms.
Product exploration explored 100000 steps with 25000 reset in 95 ms.
Computed a total of 29 stabilizing places and 29 stable transitions
Computed a total of 29 stabilizing places and 29 stable transitions
Knowledge based reduction with 2 factoid took 67 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
RANDOM walk for 3792 steps (4 resets) in 14 ms. (252 steps per ms) remains 0/1 properties
Knowledge based reduction with 2 factoid took 58 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 154 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Knowledge-based reduction took 310 ms.
Stuttering acceptance computed with spot in 163 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 125 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 125/125 places, 147/147 transitions.
Applied a total of 0 rules in 3 ms. Remains 125 /125 variables (removed 0) and now considering 147/147 (removed 0) transitions.
[2026-05-22 18:26:26] [INFO ] Invariant cache hit.
[2026-05-22 18:26:26] [INFO ] Implicit Places using invariants in 79 ms returned []
[2026-05-22 18:26:26] [INFO ] Invariant cache hit.
[2026-05-22 18:26:26] [INFO ] Implicit Places using invariants and state equation in 205 ms returned []
Implicit Place search using SMT with State Equation took 287 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 290 ms. Remains : 125/125 places, 147/147 transitions.
Computed a total of 29 stabilizing places and 29 stable transitions
Computed a total of 29 stabilizing places and 29 stable transitions
Knowledge based reduction with 1 factoid took 70 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
RANDOM walk for 13533 steps (4 resets) in 34 ms. (386 steps per ms) remains 0/1 properties
Knowledge based reduction with 1 factoid took 97 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 186 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Knowledge-based reduction took 389 ms.
Stuttering acceptance computed with spot in 180 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 161 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 116 ms.
Product exploration explored 100000 steps with 25000 reset in 141 ms.
Spot run failed in 166 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin767595302168024364
[2026-05-22 18:26:27] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin767595302168024364
Running compilation step : cd /tmp/ltsmin767595302168024364;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 852 ms.
Running link step : cd /tmp/ltsmin767595302168024364;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 72 ms.
Running LTSmin : cd /tmp/ltsmin767595302168024364;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased4546115131521765131.hoa' '--buchi-type=spotba'
LTSmin run took 76 ms.
FORMULA AutonomousCar-PT-02b-LTLFireability-05 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property AutonomousCar-PT-02b-LTLFireability-05 finished in 57830 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(X((F(G(p0))||(p1&&X(p2)))))))))'
Support contains 3 out of 133 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 133/133 places, 155/155 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 126 transition count 148
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 126 transition count 148
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 125 transition count 147
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 125 transition count 147
Applied a total of 16 rules in 9 ms. Remains 125 /133 variables (removed 8) and now considering 147/155 (removed 8) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15460370668954868398.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6600787498535749116.kers'
[2026-05-22 18:26:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15460370668954868398.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6600787498535749116.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 147 rows 125 cols 428 entries
Finished phase 1 with 118 SingleSign rule and 0 generalized
[2026-05-22 18:26:28] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6600787498535749116.kers
Total runtime 2 ms.
[2026-05-22 18:26:28] [INFO ] Implicit Places using invariants in 91 ms returned []
[2026-05-22 18:26:28] [INFO ] Invariant cache hit.
[2026-05-22 18:26:28] [INFO ] Implicit Places using invariants and state equation in 180 ms returned []
Implicit Place search using SMT with State Equation took 273 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 125/133 places, 147/155 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 283 ms. Remains : 125/133 places, 147/155 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(X((F(G(p0))||(p1&&X(p2)))))))))'
Stuttering acceptance computed with spot in 424 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) (NOT p0)), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : AutonomousCar-PT-02b-LTLFireability-06
Product exploration explored 100000 steps with 0 reset in 120 ms.
Stack based approach found an accepted trace after 78 steps with 0 reset with depth 79 and stack size 79 in 1 ms.
FORMULA AutonomousCar-PT-02b-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property AutonomousCar-PT-02b-LTLFireability-06 finished in 880 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 133 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 133/133 places, 155/155 transitions.
Graph (trivial) has 124 edges and 133 vertex of which 4 / 133 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 57 place count 130 transition count 96
Reduce places removed 56 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 72 rules applied. Total rules applied 129 place count 74 transition count 80
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 138 place count 65 transition count 80
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 138 place count 65 transition count 74
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 150 place count 59 transition count 74
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 155 place count 54 transition count 69
Iterating global reduction 3 with 5 rules applied. Total rules applied 160 place count 54 transition count 69
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 161 place count 53 transition count 67
Iterating global reduction 3 with 1 rules applied. Total rules applied 162 place count 53 transition count 67
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 164 place count 53 transition count 65
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 165 place count 52 transition count 65
Performed 21 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 5 with 42 rules applied. Total rules applied 207 place count 31 transition count 43
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 208 place count 31 transition count 42
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 211 place count 28 transition count 36
Iterating global reduction 6 with 3 rules applied. Total rules applied 214 place count 28 transition count 36
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 215 place count 28 transition count 35
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 219 place count 26 transition count 33
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 223 place count 24 transition count 39
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 225 place count 22 transition count 37
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 226 place count 21 transition count 37
Applied a total of 226 rules in 30 ms. Remains 21 /133 variables (removed 112) and now considering 37/155 (removed 118) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10040350089192268787.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12371242245658572833.kers'
[2026-05-22 18:26:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10040350089192268787.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12371242245658572833.kers]
Normalized transition count is 36 out of 37 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 36 rows 20 cols 170 entries
Finished phase 1 with 16 SingleSign rule and 0 generalized
[2026-05-22 18:26:29] [INFO ] Computed 5 invariants in 1 ms
Computed 5 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12371242245658572833.kers
Total runtime 1 ms.
[2026-05-22 18:26:29] [INFO ] Implicit Places using invariants in 57 ms returned []
[2026-05-22 18:26:29] [INFO ] Invariant cache hit.
[2026-05-22 18:26:29] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-22 18:26:29] [INFO ] Implicit Places using invariants and state equation in 83 ms returned [17, 20]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 142 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 19/133 places, 37/155 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 17 transition count 35
Applied a total of 4 rules in 3 ms. Remains 17 /19 variables (removed 2) and now considering 35/37 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10325964800217134406.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2004507130469490017.kers'
[2026-05-22 18:26:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10325964800217134406.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2004507130469490017.kers]
Normalized transition count is 34 out of 35 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 34 rows 17 cols 168 entries
Finished phase 1 with 14 SingleSign rule and 0 generalized
[2026-05-22 18:26:29] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-2004507130469490017.kers
Total runtime 1 ms.
[2026-05-22 18:26:29] [INFO ] Implicit Places using invariants in 44 ms returned []
[2026-05-22 18:26:29] [INFO ] Invariant cache hit.
[2026-05-22 18:26:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-22 18:26:29] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 17/133 places, 35/155 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 281 ms. Remains : 17/133 places, 35/155 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-02b-LTLFireability-07
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-02b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-02b-LTLFireability-07 finished in 358 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G((p0||X((p0||X(p1)))))&&F(p2)))))'
Support contains 3 out of 133 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 133/133 places, 155/155 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 125 transition count 147
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 125 transition count 147
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 124 transition count 146
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 124 transition count 146
Applied a total of 18 rules in 5 ms. Remains 124 /133 variables (removed 9) and now considering 146/155 (removed 9) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17657609141249888745.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16762908222477623238.kers'
[2026-05-22 18:26:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17657609141249888745.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16762908222477623238.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 146 rows 124 cols 426 entries
Finished phase 1 with 117 SingleSign rule and 0 generalized
[2026-05-22 18:26:29] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-16762908222477623238.kers
Total runtime 2 ms.
[2026-05-22 18:26:29] [INFO ] Implicit Places using invariants in 84 ms returned []
[2026-05-22 18:26:29] [INFO ] Invariant cache hit.
[2026-05-22 18:26:30] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 254 ms to find 0 implicit places.
Running 145 sub problems to find dead transitions.
[2026-05-22 18:26:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 17/24 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 6/30 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 5 (OVERLAPS) 146/270 variables, 124/154 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 2/156 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/270 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 8 (OVERLAPS) 0/270 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 145 unsolved
No progress, stopping.
After SMT solving in domain Real declared 270/270 variables, and 156 constraints, problems are : Problem set: 0 solved, 145 unsolved in 16721 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 145/145 constraints, Known Traps: 23/23 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 145 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 23/30 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 6 (OVERLAPS) 146/270 variables, 124/156 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/270 variables, 145/301 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/270 variables, 3/304 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/270 variables, 2/306 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/270 variables, 4/310 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/270 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 145 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 270/270 variables, and 310 constraints, problems are : Problem set: 0 solved, 145 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 145/145 constraints, Known Traps: 28/28 constraints, Known Traps Along Path: 6/6 constraints]
After SMT, in 46765ms problems are : Problem set: 0 solved, 145 unsolved
Search for dead transitions found 0 dead transitions in 46767ms
Starting structural reductions in LTL mode, iteration 1 : 124/133 places, 146/155 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47028 ms. Remains : 124/133 places, 146/155 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G((p0||X((p0||X(p1)))))&&F(p2)))))'
Stuttering acceptance computed with spot in 432 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-02b-LTLFireability-08
Stuttering criterion allowed to conclude after 64 steps with 5 reset in 1 ms.
FORMULA AutonomousCar-PT-02b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-02b-LTLFireability-08 finished in 47516 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 133 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 133/133 places, 155/155 transitions.
Graph (trivial) has 125 edges and 133 vertex of which 4 / 133 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 57 place count 131 transition count 97
Reduce places removed 56 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 72 rules applied. Total rules applied 129 place count 75 transition count 81
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 138 place count 66 transition count 81
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 138 place count 66 transition count 75
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 150 place count 60 transition count 75
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 155 place count 55 transition count 70
Iterating global reduction 3 with 5 rules applied. Total rules applied 160 place count 55 transition count 70
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 161 place count 54 transition count 68
Iterating global reduction 3 with 1 rules applied. Total rules applied 162 place count 54 transition count 68
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 164 place count 54 transition count 66
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 165 place count 53 transition count 66
Performed 24 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 5 with 48 rules applied. Total rules applied 213 place count 29 transition count 41
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 214 place count 29 transition count 40
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 218 place count 25 transition count 31
Iterating global reduction 6 with 4 rules applied. Total rules applied 222 place count 25 transition count 31
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 223 place count 25 transition count 30
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 227 place count 23 transition count 28
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 231 place count 21 transition count 34
Applied a total of 231 rules in 23 ms. Remains 21 /133 variables (removed 112) and now considering 34/155 (removed 121) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15968685289597242769.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6201403621163508057.kers'
[2026-05-22 18:27:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15968685289597242769.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6201403621163508057.kers]
Normalized transition count is 33 out of 34 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 33 rows 20 cols 165 entries
Finished phase 1 with 15 SingleSign rule and 0 generalized
[2026-05-22 18:27:17] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6201403621163508057.kers
Total runtime 1 ms.
[2026-05-22 18:27:17] [INFO ] Implicit Places using invariants in 56 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 58 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 20/133 places, 34/155 transitions.
Applied a total of 0 rules in 6 ms. Remains 20 /20 variables (removed 0) and now considering 34/34 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 87 ms. Remains : 20/133 places, 34/155 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-02b-LTLFireability-09
Product exploration explored 100000 steps with 14 reset in 352 ms.
Product exploration explored 100000 steps with 0 reset in 201 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Detected a total of 1/20 stabilizing places and 1/34 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge based reduction with 4 factoid took 52 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge based reduction with 4 factoid took 62 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8307276509082793777.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2412173325649915658.kers'
[2026-05-22 18:27:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8307276509082793777.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2412173325649915658.kers]
Normalized transition count is 33 out of 34 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 33 rows 20 cols 165 entries
Finished phase 1 with 15 SingleSign rule and 0 generalized
[2026-05-22 18:27:18] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-2412173325649915658.kers
Total runtime 0 ms.
[2026-05-22 18:27:18] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2026-05-22 18:27:18] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2026-05-22 18:27:18] [INFO ] State equation strengthened by 9 read => feed constraints.
[2026-05-22 18:27:18] [INFO ] [Real]Added 9 Read/Feed constraints in 3 ms returned sat
[2026-05-22 18:27:18] [INFO ] Computed and/alt/rep : 7/32/7 causal constraints (skipped 26 transitions) in 4 ms.
[2026-05-22 18:27:18] [INFO ] Added : 0 causal constraints over 0 iterations in 12 ms. Result :sat
Could not prove EG (NOT p0)
Knowledge-based reduction took 295 ms.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 20/20 places, 34/34 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 34/34 (removed 0) transitions.
[2026-05-22 18:27:18] [INFO ] Invariant cache hit.
[2026-05-22 18:27:18] [INFO ] Implicit Places using invariants in 34 ms returned []
[2026-05-22 18:27:18] [INFO ] Invariant cache hit.
[2026-05-22 18:27:18] [INFO ] State equation strengthened by 9 read => feed constraints.
[2026-05-22 18:27:18] [INFO ] Implicit Places using invariants and state equation in 49 ms returned [16, 19]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 96 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 18/20 places, 34/34 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 16 transition count 32
Applied a total of 4 rules in 2 ms. Remains 16 /18 variables (removed 2) and now considering 32/34 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12672605227792285440.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16194674518287829054.kers'
[2026-05-22 18:27:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12672605227792285440.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16194674518287829054.kers]
Normalized transition count is 31 out of 32 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 31 rows 16 cols 158 entries
Finished phase 1 with 13 SingleSign rule and 0 generalized
[2026-05-22 18:27:18] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-16194674518287829054.kers
Total runtime 1 ms.
[2026-05-22 18:27:18] [INFO ] Implicit Places using invariants in 36 ms returned []
[2026-05-22 18:27:18] [INFO ] Invariant cache hit.
[2026-05-22 18:27:18] [INFO ] State equation strengthened by 9 read => feed constraints.
[2026-05-22 18:27:18] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 16/20 places, 32/34 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 191 ms. Remains : 16/20 places, 32/34 transitions.
Computed a total of 3 stabilizing places and 4 stable transitions
Computed a total of 3 stabilizing places and 4 stable transitions
Detected a total of 3/16 stabilizing places and 4/32 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge based reduction with 4 factoid took 59 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge based reduction with 4 factoid took 68 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
[2026-05-22 18:27:18] [INFO ] Invariant cache hit.
[2026-05-22 18:27:18] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2026-05-22 18:27:18] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2026-05-22 18:27:18] [INFO ] State equation strengthened by 9 read => feed constraints.
[2026-05-22 18:27:18] [INFO ] [Real]Added 9 Read/Feed constraints in 2 ms returned sat
[2026-05-22 18:27:18] [INFO ] Computed and/alt/rep : 3/18/3 causal constraints (skipped 28 transitions) in 5 ms.
[2026-05-22 18:27:18] [INFO ] Added : 0 causal constraints over 0 iterations in 11 ms. Result :sat
Could not prove EG (NOT p0)
Knowledge-based reduction took 276 ms.
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 9 reset in 76 ms.
Product exploration explored 100000 steps with 2 reset in 82 ms.
Built C files in :
/tmp/ltsmin9109859820385166700
[2026-05-22 18:27:19] [INFO ] Computing symmetric may disable matrix : 32 transitions.
[2026-05-22 18:27:19] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 18:27:19] [INFO ] Computing symmetric may enable matrix : 32 transitions.
[2026-05-22 18:27:19] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 18:27:19] [INFO ] Computing Do-Not-Accords matrix : 32 transitions.
[2026-05-22 18:27:19] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 18:27:19] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9109859820385166700
Running compilation step : cd /tmp/ltsmin9109859820385166700;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 243 ms.
Running link step : cd /tmp/ltsmin9109859820385166700;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin9109859820385166700;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased9958897897233430381.hoa' '--buchi-type=spotba'
LTSmin run took 39 ms.
FORMULA AutonomousCar-PT-02b-LTLFireability-09 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property AutonomousCar-PT-02b-LTLFireability-09 finished in 2286 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((X(X((p0&&G(p1))))||F(p2))))))'
Support contains 3 out of 133 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 133/133 places, 155/155 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 127 transition count 149
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 127 transition count 149
Applied a total of 12 rules in 3 ms. Remains 127 /133 variables (removed 6) and now considering 149/155 (removed 6) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4124813133112265478.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17607635925145280919.kers'
[2026-05-22 18:27:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4124813133112265478.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17607635925145280919.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 149 rows 127 cols 432 entries
Finished phase 1 with 120 SingleSign rule and 0 generalized
[2026-05-22 18:27:19] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-17607635925145280919.kers
Total runtime 3 ms.
[2026-05-22 18:27:19] [INFO ] Implicit Places using invariants in 114 ms returned []
[2026-05-22 18:27:19] [INFO ] Invariant cache hit.
[2026-05-22 18:27:19] [INFO ] Implicit Places using invariants and state equation in 210 ms returned []
Implicit Place search using SMT with State Equation took 328 ms to find 0 implicit places.
Running 148 sub problems to find dead transitions.
[2026-05-22 18:27:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 1 (OVERLAPS) 1/127 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 15/22 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 3/25 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 6 (OVERLAPS) 149/276 variables, 127/154 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/276 variables, 2/156 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/276 variables, 2/158 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/276 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 10 (OVERLAPS) 0/276 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 148 unsolved
No progress, stopping.
After SMT solving in domain Real declared 276/276 variables, and 158 constraints, problems are : Problem set: 0 solved, 148 unsolved in 17897 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 127/127 constraints, PredecessorRefiner: 148/148 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 148 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 1 (OVERLAPS) 1/127 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 22/29 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 2/31 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 5 (OVERLAPS) 149/276 variables, 127/158 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/276 variables, 148/306 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/276 variables, 2/308 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/276 variables, 3/311 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/276 variables, 2/313 constraints. Problems are: Problem set: 0 solved, 148 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 276/276 variables, and 313 constraints, problems are : Problem set: 0 solved, 148 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 127/127 constraints, PredecessorRefiner: 148/148 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 7/7 constraints]
After SMT, in 47936ms problems are : Problem set: 0 solved, 148 unsolved
Search for dead transitions found 0 dead transitions in 47938ms
Starting structural reductions in LTL mode, iteration 1 : 127/133 places, 149/155 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48270 ms. Remains : 127/133 places, 149/155 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((X(X((p0&&G(p1))))||F(p2))))))'
Stuttering acceptance computed with spot in 355 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2)]
Running random walk in product with property : AutonomousCar-PT-02b-LTLFireability-10
Product exploration explored 100000 steps with 7 reset in 116 ms.
Product exploration explored 100000 steps with 18 reset in 135 ms.
Computed a total of 29 stabilizing places and 29 stable transitions
Computed a total of 29 stabilizing places and 29 stable transitions
Knowledge based reduction with 2 factoid took 79 ms. Reduced automaton from 6 states, 7 edges and 3 AP (stutter sensitive) to 6 states, 7 edges and 3 AP (stutter sensitive).
RANDOM walk for 4824 steps (22 resets) in 19 ms. (241 steps per ms) remains 0/4 properties
Knowledge based reduction with 2 factoid took 173 ms. Reduced automaton from 6 states, 7 edges and 3 AP (stutter sensitive) to 6 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 341 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2)]
Knowledge-based reduction took 611 ms.
Stuttering acceptance computed with spot in 315 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2)]
Support contains 3 out of 127 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 149/149 transitions.
Applied a total of 0 rules in 1 ms. Remains 127 /127 variables (removed 0) and now considering 149/149 (removed 0) transitions.
[2026-05-22 18:28:09] [INFO ] Invariant cache hit.
[2026-05-22 18:28:09] [INFO ] Implicit Places using invariants in 98 ms returned []
[2026-05-22 18:28:09] [INFO ] Invariant cache hit.
[2026-05-22 18:28:09] [INFO ] Implicit Places using invariants and state equation in 215 ms returned []
Implicit Place search using SMT with State Equation took 341 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 344 ms. Remains : 127/127 places, 149/149 transitions.
Computed a total of 29 stabilizing places and 29 stable transitions
Computed a total of 29 stabilizing places and 29 stable transitions
Knowledge based reduction with 2 factoid took 81 ms. Reduced automaton from 6 states, 7 edges and 3 AP (stutter sensitive) to 6 states, 7 edges and 3 AP (stutter sensitive).
RANDOM walk for 20415 steps (8 resets) in 37 ms. (537 steps per ms) remains 0/4 properties
Knowledge based reduction with 2 factoid took 128 ms. Reduced automaton from 6 states, 7 edges and 3 AP (stutter sensitive) to 6 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 241 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2)]
Knowledge-based reduction took 478 ms.
Stuttering acceptance computed with spot in 257 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2)]
Stuttering acceptance computed with spot in 337 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2)]
Product exploration explored 100000 steps with 1 reset in 118 ms.
Product exploration explored 100000 steps with 0 reset in 91 ms.
Spot run failed in 84 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin14153441866782954367
[2026-05-22 18:28:11] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14153441866782954367
Running compilation step : cd /tmp/ltsmin14153441866782954367;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 579 ms.
Running link step : cd /tmp/ltsmin14153441866782954367;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin14153441866782954367;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased6864991733985706006.hoa' '--buchi-type=spotba'
LTSmin run took 7501 ms.
FORMULA AutonomousCar-PT-02b-LTLFireability-10 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property AutonomousCar-PT-02b-LTLFireability-10 finished in 59771 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((X(X(p0))&&((p1&&F(!p2)) U (G((G(p1)||(p1&&F(!p2))))||(!p3&&(G(p1)||(p1&&F(!p2))))))))))'
Support contains 7 out of 133 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 133/133 places, 155/155 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 126 transition count 148
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 126 transition count 148
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 125 transition count 147
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 125 transition count 147
Applied a total of 16 rules in 3 ms. Remains 125 /133 variables (removed 8) and now considering 147/155 (removed 8) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12990193716333397743.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9673864999982810197.kers'
[2026-05-22 18:28:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12990193716333397743.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9673864999982810197.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 147 rows 125 cols 428 entries
Finished phase 1 with 118 SingleSign rule and 0 generalized
[2026-05-22 18:28:19] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-9673864999982810197.kers
Total runtime 3 ms.
[2026-05-22 18:28:19] [INFO ] Implicit Places using invariants in 62 ms returned []
[2026-05-22 18:28:19] [INFO ] Invariant cache hit.
[2026-05-22 18:28:19] [INFO ] Implicit Places using invariants and state equation in 186 ms returned []
Implicit Place search using SMT with State Equation took 252 ms to find 0 implicit places.
Running 146 sub problems to find dead transitions.
[2026-05-22 18:28:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (OVERLAPS) 1/125 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (OVERLAPS) 147/272 variables, 125/154 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/272 variables, 2/156 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/272 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 8 (OVERLAPS) 0/272 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Real declared 272/272 variables, and 156 constraints, problems are : Problem set: 0 solved, 146 unsolved in 15037 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 125/125 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 146 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (OVERLAPS) 1/125 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 22/29 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 2/31 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 7 (OVERLAPS) 147/272 variables, 125/158 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/272 variables, 146/304 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/272 variables, 1/305 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/272 variables, 2/307 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/272 variables, 3/310 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/272 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 146 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 272/272 variables, and 310 constraints, problems are : Problem set: 0 solved, 146 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 125/125 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 27/27 constraints, Known Traps Along Path: 5/5 constraints]
After SMT, in 45068ms problems are : Problem set: 0 solved, 146 unsolved
Search for dead transitions found 0 dead transitions in 45070ms
Starting structural reductions in LTL mode, iteration 1 : 125/133 places, 147/155 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45325 ms. Remains : 125/133 places, 147/155 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((X(X(p0))&&((p1&&F(!p2)) U (G((G(p1)||(p1&&F(!p2))))||(!p3&&(G(p1)||(p1&&F(!p2))))))))))'
Stuttering acceptance computed with spot in 1113 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (AND (NOT p1) p2), (AND (NOT p1) p2), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1) p2), (OR (AND (NOT p1) p2) (AND (NOT p0) p2)), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) p2)]
Running random walk in product with property : AutonomousCar-PT-02b-LTLFireability-12
Product exploration explored 100000 steps with 25000 reset in 196 ms.
Product exploration explored 100000 steps with 25024 reset in 216 ms.
Computed a total of 28 stabilizing places and 28 stable transitions
Computed a total of 28 stabilizing places and 28 stable transitions
Knowledge based reduction with 25 factoid took 850 ms. Reduced automaton from 17 states, 70 edges and 4 AP (stutter sensitive) to 17 states, 70 edges and 4 AP (stutter sensitive).
RANDOM walk for 40000 steps (20 resets) in 315 ms. (126 steps per ms) remains 8/16 properties
BEST_FIRST walk for 40000 steps (31 resets) in 261 ms. (152 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40000 steps (17 resets) in 307 ms. (129 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40000 steps (36 resets) in 286 ms. (139 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40000 steps (30 resets) in 164 ms. (242 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40000 steps (19 resets) in 272 ms. (146 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40002 steps (17 resets) in 233 ms. (170 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40000 steps (23 resets) in 246 ms. (161 steps per ms) remains 6/6 properties
[2026-05-22 18:29:08] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem apf2 is UNSAT
Problem apf6 is UNSAT
Problem apf8 is UNSAT
Problem apf10 is UNSAT
Problem apf11 is UNSAT
Problem apf14 is UNSAT
After SMT solving in domain Real declared 69/272 variables, and 4 constraints, problems are : Problem set: 6 solved, 0 unsolved in 73 ms.
Refiners :[Positive P Invariants (semi-flows): 4/7 constraints, State Equation: 0/125 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 85ms problems are : Problem set: 6 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 6 invariant AP formulas.
Knowledge based reduction with 31 factoid took 690 ms. Reduced automaton from 17 states, 70 edges and 4 AP (stutter sensitive) to 8 states, 22 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 454 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (AND (NOT p1) p2), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Knowledge-based reduction took 2986 ms.
Stuttering acceptance computed with spot in 378 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (AND (NOT p1) p2), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Support contains 7 out of 125 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 125/125 places, 147/147 transitions.
Applied a total of 0 rules in 1 ms. Remains 125 /125 variables (removed 0) and now considering 147/147 (removed 0) transitions.
[2026-05-22 18:29:09] [INFO ] Invariant cache hit.
[2026-05-22 18:29:09] [INFO ] Implicit Places using invariants in 62 ms returned []
[2026-05-22 18:29:09] [INFO ] Invariant cache hit.
[2026-05-22 18:29:10] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 198 ms. Remains : 125/125 places, 147/147 transitions.
Computed a total of 28 stabilizing places and 28 stable transitions
Computed a total of 28 stabilizing places and 28 stable transitions
Knowledge based reduction with 18 factoid took 364 ms. Reduced automaton from 8 states, 22 edges and 4 AP (stutter sensitive) to 8 states, 22 edges and 4 AP (stutter sensitive).
RANDOM walk for 40000 steps (25 resets) in 296 ms. (134 steps per ms) remains 2/10 properties
BEST_FIRST walk for 40000 steps (20 resets) in 53 ms. (740 steps per ms) remains 1/2 properties
BEST_FIRST walk for 38183 steps (33 resets) in 31 ms. (1193 steps per ms) remains 0/1 properties
Knowledge based reduction with 18 factoid took 446 ms. Reduced automaton from 8 states, 22 edges and 4 AP (stutter sensitive) to 8 states, 22 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 388 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (AND (NOT p1) p2), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Knowledge-based reduction took 1383 ms.
Stuttering acceptance computed with spot in 446 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (AND (NOT p1) p2), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 415 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (AND (NOT p1) p2), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 24960 reset in 91 ms.
Product exploration explored 100000 steps with 25009 reset in 111 ms.
Spot run failed in 57 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin8872652665169707765
[2026-05-22 18:29:12] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8872652665169707765
Running compilation step : cd /tmp/ltsmin8872652665169707765;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 410 ms.
Running link step : cd /tmp/ltsmin8872652665169707765;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin8872652665169707765;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased2778906215986603804.hoa' '--buchi-type=spotba'
LTSmin run took 7352 ms.
FORMULA AutonomousCar-PT-02b-LTLFireability-12 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property AutonomousCar-PT-02b-LTLFireability-12 finished in 61051 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X((p1&&X((X(F(p2))||G(p1)))))))'
Support contains 4 out of 133 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 133/133 places, 155/155 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 126 transition count 148
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 126 transition count 148
Applied a total of 14 rules in 4 ms. Remains 126 /133 variables (removed 7) and now considering 148/155 (removed 7) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10535648091323455169.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16027428991828170318.kers'
[2026-05-22 18:29:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10535648091323455169.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16027428991828170318.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 148 rows 126 cols 430 entries
Finished phase 1 with 119 SingleSign rule and 0 generalized
[2026-05-22 18:29:20] [INFO ] Computed 7 invariants in 2 ms
Computed 7 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-16027428991828170318.kers
Total runtime 3 ms.
[2026-05-22 18:29:20] [INFO ] Implicit Places using invariants in 103 ms returned []
[2026-05-22 18:29:20] [INFO ] Invariant cache hit.
[2026-05-22 18:29:20] [INFO ] Implicit Places using invariants and state equation in 193 ms returned []
Implicit Place search using SMT with State Equation took 299 ms to find 0 implicit places.
Running 147 sub problems to find dead transitions.
[2026-05-22 18:29:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 1 (OVERLAPS) 1/126 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 19/26 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 6 (OVERLAPS) 148/274 variables, 126/154 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/274 variables, 2/156 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/274 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 9 (OVERLAPS) 0/274 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 147 unsolved
No progress, stopping.
After SMT solving in domain Real declared 274/274 variables, and 156 constraints, problems are : Problem set: 0 solved, 147 unsolved in 17765 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 126/126 constraints, PredecessorRefiner: 147/147 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 147 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 1 (OVERLAPS) 1/126 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 21/28 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 6 (OVERLAPS) 148/274 variables, 126/156 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/274 variables, 147/303 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/274 variables, 1/304 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/274 variables, 2/306 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/274 variables, 3/309 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/274 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 147 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 274/274 variables, and 309 constraints, problems are : Problem set: 0 solved, 147 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 126/126 constraints, PredecessorRefiner: 147/147 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 5/5 constraints]
After SMT, in 47811ms problems are : Problem set: 0 solved, 147 unsolved
Search for dead transitions found 0 dead transitions in 47812ms
Starting structural reductions in LTL mode, iteration 1 : 126/133 places, 148/155 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48119 ms. Remains : 126/133 places, 148/155 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X((p1&&X((X(F(p2))||G(p1)))))))'
Stuttering acceptance computed with spot in 329 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), true, (AND (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-02b-LTLFireability-13
Product exploration explored 100000 steps with 0 reset in 105 ms.
Stuttering criterion allowed to conclude after 67 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-02b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-02b-LTLFireability-13 finished in 48601 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||(G(p1)&&(p2 U (p3||G(p2))))))'
Support contains 7 out of 133 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 133/133 places, 155/155 transitions.
Graph (trivial) has 116 edges and 133 vertex of which 4 / 133 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 52 rules applied. Total rules applied 53 place count 130 transition count 100
Reduce places removed 52 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 68 rules applied. Total rules applied 121 place count 78 transition count 84
Reduce places removed 9 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 10 rules applied. Total rules applied 131 place count 69 transition count 83
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 132 place count 68 transition count 83
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 132 place count 68 transition count 79
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 140 place count 64 transition count 79
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 145 place count 59 transition count 74
Iterating global reduction 4 with 5 rules applied. Total rules applied 150 place count 59 transition count 74
Performed 23 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 4 with 46 rules applied. Total rules applied 196 place count 36 transition count 50
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 200 place count 32 transition count 41
Iterating global reduction 4 with 4 rules applied. Total rules applied 204 place count 32 transition count 41
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 205 place count 32 transition count 40
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 5 with 2 rules applied. Total rules applied 207 place count 31 transition count 39
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 209 place count 30 transition count 41
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 211 place count 28 transition count 39
Applied a total of 211 rules in 28 ms. Remains 28 /133 variables (removed 105) and now considering 39/155 (removed 116) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3243273926795445799.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9818039456614688053.kers'
[2026-05-22 18:30:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3243273926795445799.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9818039456614688053.kers]
Normalized transition count is 38 out of 39 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 38 rows 27 cols 177 entries
Finished phase 1 with 22 SingleSign rule and 0 generalized
[2026-05-22 18:30:09] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-9818039456614688053.kers
Total runtime 1 ms.
[2026-05-22 18:30:09] [INFO ] Implicit Places using invariants in 79 ms returned []
[2026-05-22 18:30:09] [INFO ] Invariant cache hit.
[2026-05-22 18:30:09] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-22 18:30:09] [INFO ] Implicit Places using invariants and state equation in 76 ms returned [27]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 158 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 27/133 places, 39/155 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 26 transition count 38
Applied a total of 2 rules in 3 ms. Remains 26 /27 variables (removed 1) and now considering 38/39 (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-12289982227899516821.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7271827209262646572.kers'
[2026-05-22 18:30:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12289982227899516821.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7271827209262646572.kers]
Normalized transition count is 37 out of 38 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 37 rows 25 cols 175 entries
Finished phase 1 with 21 SingleSign rule and 0 generalized
[2026-05-22 18:30:09] [INFO ] Computed 5 invariants in 1 ms
Computed 5 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7271827209262646572.kers
Total runtime 1 ms.
[2026-05-22 18:30:09] [INFO ] Implicit Places using invariants in 63 ms returned []
[2026-05-22 18:30:09] [INFO ] Invariant cache hit.
[2026-05-22 18:30:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-22 18:30:09] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 148 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 26/133 places, 38/155 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 338 ms. Remains : 26/133 places, 38/155 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||(G(p1)&&(p2 U (p3||G(p2))))))'
Stuttering acceptance computed with spot in 173 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : AutonomousCar-PT-02b-LTLFireability-14
Product exploration explored 100000 steps with 41055 reset in 230 ms.
Product exploration explored 100000 steps with 40966 reset in 239 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 9 factoid took 355 ms. Reduced automaton from 3 states, 6 edges and 4 AP (stutter insensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
RANDOM walk for 1587 steps (104 resets) in 32 ms. (48 steps per ms) remains 0/6 properties
Knowledge based reduction with 9 factoid took 428 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 240 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Knowledge-based reduction took 1040 ms.
Stuttering acceptance computed with spot in 232 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Support contains 5 out of 26 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 26/26 places, 38/38 transitions.
Applied a total of 0 rules in 1 ms. Remains 26 /26 variables (removed 0) and now considering 38/38 (removed 0) transitions.
[2026-05-22 18:30:11] [INFO ] Invariant cache hit.
[2026-05-22 18:30:11] [INFO ] Implicit Places using invariants in 49 ms returned []
[2026-05-22 18:30:11] [INFO ] Invariant cache hit.
[2026-05-22 18:30:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-22 18:30:11] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
[2026-05-22 18:30:11] [INFO ] Redundant transitions in 1 ms returned []
Running 32 sub problems to find dead transitions.
[2026-05-22 18:30:11] [INFO ] Invariant cache hit.
[2026-05-22 18:30:11] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (OVERLAPS) 2/26 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/26 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 37/63 variables, 26/31 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/63 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (OVERLAPS) 1/64 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/64 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 9 (OVERLAPS) 0/64 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Real declared 64/64 variables, and 34 constraints, problems are : Problem set: 0 solved, 32 unsolved in 1395 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 26/26 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 32 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (OVERLAPS) 2/26 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (OVERLAPS) 37/63 variables, 26/33 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/63 variables, 32/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/63 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/63 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 9 (OVERLAPS) 1/64 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/64 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 11 (OVERLAPS) 0/64 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Int declared 64/64 variables, and 68 constraints, problems are : Problem set: 0 solved, 32 unsolved in 1942 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 26/26 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 3345ms problems are : Problem set: 0 solved, 32 unsolved
Search for dead transitions found 0 dead transitions in 3345ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 3473 ms. Remains : 26/26 places, 38/38 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 7 factoid took 266 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
RANDOM walk for 8188 steps (531 resets) in 22 ms. (356 steps per ms) remains 0/6 properties
Knowledge based reduction with 7 factoid took 364 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 260 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Knowledge-based reduction took 902 ms.
Stuttering acceptance computed with spot in 258 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 256 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Product exploration explored 100000 steps with 41012 reset in 195 ms.
Product exploration explored 100000 steps with 40985 reset in 226 ms.
Built C files in :
/tmp/ltsmin15759717816335059362
[2026-05-22 18:30:16] [INFO ] Computing symmetric may disable matrix : 38 transitions.
[2026-05-22 18:30:16] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 18:30:16] [INFO ] Computing symmetric may enable matrix : 38 transitions.
[2026-05-22 18:30:16] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 18:30:16] [INFO ] Computing Do-Not-Accords matrix : 38 transitions.
[2026-05-22 18:30:16] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 18:30:16] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15759717816335059362
Running compilation step : cd /tmp/ltsmin15759717816335059362;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 280 ms.
Running link step : cd /tmp/ltsmin15759717816335059362;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin15759717816335059362;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1849518212986189143.hoa' '--buchi-type=spotba'
LTSmin run took 30 ms.
FORMULA AutonomousCar-PT-02b-LTLFireability-14 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property AutonomousCar-PT-02b-LTLFireability-14 finished in 8047 ms.
All properties solved by simple procedures.
Total runtime 506327 ms.
BK_STOP 1779474617148
--------------------
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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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 LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="AutonomousCar-PT-02b"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5973"
echo " Executing tool itstools"
echo " Input is AutonomousCar-PT-02b, examination is LTLFireability"
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-177946787900028"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/AutonomousCar-PT-02b.tgz
mv AutonomousCar-PT-02b execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;