About the Execution of ITS-Tools for AutonomousCar-PT-05b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 962.392 | 670165.00 | 772258.00 | 2274.50 | TFFFTTFFFFTFFFFF | 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-177946787900076.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-05b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r018-smll-177946787900076
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 640K
-rw-r--r-- 1 mcc users 8.7K Mar 5 16:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 98K Mar 5 16:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Mar 5 16:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Mar 5 16:49 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Mar 15 07:19 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 07:19 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 07:19 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 07:19 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Mar 5 16:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 113K Mar 5 16:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Mar 5 16:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 93K Mar 5 16:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 07:19 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 07:19 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 159K 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-05b-LTLFireability-00
FORMULA_NAME AutonomousCar-PT-05b-LTLFireability-01
FORMULA_NAME AutonomousCar-PT-05b-LTLFireability-02
FORMULA_NAME AutonomousCar-PT-05b-LTLFireability-03
FORMULA_NAME AutonomousCar-PT-05b-LTLFireability-04
FORMULA_NAME AutonomousCar-PT-05b-LTLFireability-05
FORMULA_NAME AutonomousCar-PT-05b-LTLFireability-06
FORMULA_NAME AutonomousCar-PT-05b-LTLFireability-07
FORMULA_NAME AutonomousCar-PT-05b-LTLFireability-08
FORMULA_NAME AutonomousCar-PT-05b-LTLFireability-09
FORMULA_NAME AutonomousCar-PT-05b-LTLFireability-10
FORMULA_NAME AutonomousCar-PT-05b-LTLFireability-11
FORMULA_NAME AutonomousCar-PT-05b-LTLFireability-12
FORMULA_NAME AutonomousCar-PT-05b-LTLFireability-13
FORMULA_NAME AutonomousCar-PT-05b-LTLFireability-14
FORMULA_NAME AutonomousCar-PT-05b-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1779480699523
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-05b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-22 20:11:42] [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 20:11:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-22 20:11:42] [INFO ] Load time of PNML (sax parser for PT used): 217 ms
[2026-05-22 20:11:42] [INFO ] Transformed 255 places.
[2026-05-22 20:11:42] [INFO ] Transformed 490 transitions.
[2026-05-22 20:11:42] [INFO ] Found NUPN structural information;
[2026-05-22 20:11:42] [INFO ] Parsed PT model containing 255 places and 490 transitions and 2527 arcs in 452 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 3 formulas.
FORMULA AutonomousCar-PT-05b-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-05b-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-05b-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 46 out of 255 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 255/255 places, 490/490 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 224 transition count 459
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 224 transition count 459
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Iterating post reduction 0 with 100 rules applied. Total rules applied 162 place count 224 transition count 359
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 168 place count 218 transition count 353
Iterating global reduction 1 with 6 rules applied. Total rules applied 174 place count 218 transition count 353
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 175 place count 217 transition count 352
Iterating global reduction 1 with 1 rules applied. Total rules applied 176 place count 217 transition count 352
Applied a total of 176 rules in 158 ms. Remains 217 /255 variables (removed 38) and now considering 352/490 (removed 138) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2937748492742538143.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12423071457272396656.kers'
[2026-05-22 20:11:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2937748492742538143.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12423071457272396656.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 352 rows 217 cols 1651 entries
Finished phase 1 with 207 SingleSign rule and 0 generalized
[2026-05-22 20:11:43] [INFO ] Computed 10 invariants in 3 ms
Computed 10 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-12423071457272396656.kers
Total runtime 5 ms.
[2026-05-22 20:11:43] [INFO ] Implicit Places using invariants in 485 ms returned []
[2026-05-22 20:11:43] [INFO ] Invariant cache hit.
[2026-05-22 20:11:44] [INFO ] Implicit Places using invariants and state equation in 571 ms returned []
Implicit Place search using SMT with State Equation took 1132 ms to find 0 implicit places.
Running 351 sub problems to find dead transitions.
[2026-05-22 20:11:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/216 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 1 (OVERLAPS) 1/217 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/217 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/217 variables, 16/46 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/217 variables, 10/56 constraints. Problems are: Problem set: 0 solved, 351 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 217/569 variables, and 56 constraints, problems are : Problem set: 0 solved, 351 unsolved in 30056 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/217 constraints, PredecessorRefiner: 351/351 constraints, Known Traps: 46/46 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 351 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/216 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 1 (OVERLAPS) 1/217 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/217 variables, 46/56 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/217 variables, 3/59 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/217 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 351 unsolved
Problem TDEAD10 is UNSAT
Problem TDEAD310 is UNSAT
At refinement iteration 5 (OVERLAPS) 352/569 variables, 217/276 constraints. Problems are: Problem set: 2 solved, 349 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/569 variables, 349/625 constraints. Problems are: Problem set: 2 solved, 349 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/569 variables, 3/628 constraints. Problems are: Problem set: 2 solved, 349 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 569/569 variables, and 628 constraints, problems are : Problem set: 2 solved, 349 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 217/217 constraints, PredecessorRefiner: 349/351 constraints, Known Traps: 52/52 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60910ms problems are : Problem set: 2 solved, 349 unsolved
Search for dead transitions found 2 dead transitions in 60949ms
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 : 217/255 places, 350/490 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 216 transition count 350
Applied a total of 1 rules in 13 ms. Remains 216 /217 variables (removed 1) and now considering 350/350 (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-18309174771987507995.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-892360051992138204.kers'
[2026-05-22 20:12:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18309174771987507995.kers, --Pflows, --basisKERS=/tmp/petrispot-output-892360051992138204.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 350 rows 216 cols 1645 entries
Finished phase 1 with 206 SingleSign rule and 0 generalized
[2026-05-22 20:12:45] [INFO ] Computed 10 invariants in 3 ms
Computed 10 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-892360051992138204.kers
Total runtime 5 ms.
[2026-05-22 20:12:45] [INFO ] Implicit Places using invariants in 135 ms returned []
[2026-05-22 20:12:45] [INFO ] Invariant cache hit.
[2026-05-22 20:12:45] [INFO ] Implicit Places using invariants and state equation in 353 ms returned []
Implicit Place search using SMT with State Equation took 498 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 216/255 places, 350/490 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 62851 ms. Remains : 216/255 places, 350/490 transitions.
Starting structural reductions in LTL mode, iteration 0 : 216/216 places, 350/350 transitions.
Applied a total of 0 rules in 10 ms. Remains 216 /216 variables (removed 0) and now considering 350/350 (removed 0) transitions.
[2026-05-22 20:12:45] [INFO ] Invariant cache hit.
[2026-05-22 20:12:46] [INFO ] Implicit Places using invariants in 119 ms returned []
[2026-05-22 20:12:46] [INFO ] Invariant cache hit.
[2026-05-22 20:12:46] [INFO ] Implicit Places using invariants and state equation in 288 ms returned []
Implicit Place search using SMT with State Equation took 411 ms to find 0 implicit places.
Running 349 sub problems to find dead transitions.
[2026-05-22 20:12:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/215 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 1 (OVERLAPS) 1/216 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/216 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/216 variables, 19/49 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/216 variables, 5/54 constraints. Problems are: Problem set: 0 solved, 349 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 216/566 variables, and 57 constraints, problems are : Problem set: 0 solved, 349 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/216 constraints, PredecessorRefiner: 349/349 constraints, Known Traps: 47/47 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 349 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/215 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 1 (OVERLAPS) 1/216 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/216 variables, 47/57 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/216 variables, 10/67 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/216 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 5 (OVERLAPS) 350/566 variables, 216/283 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/566 variables, 349/632 constraints. Problems are: Problem set: 0 solved, 349 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 566/566 variables, and 632 constraints, problems are : Problem set: 0 solved, 349 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 216/216 constraints, PredecessorRefiner: 349/349 constraints, Known Traps: 57/57 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60293ms problems are : Problem set: 0 solved, 349 unsolved
Search for dead transitions found 0 dead transitions in 60296ms
Finished structural reductions in LTL mode , in 1 iterations and 60721 ms. Remains : 216/216 places, 350/350 transitions.
Support contains 46 out of 216 places after structural reductions.
[2026-05-22 20:13:47] [INFO ] Flatten gal took : 134 ms
[2026-05-22 20:13:47] [INFO ] Flatten gal took : 42 ms
[2026-05-22 20:13:47] [INFO ] Input system was already deterministic with 350 transitions.
Reduction of identical properties reduced properties to check from 33 to 32
RANDOM walk for 40000 steps (83 resets) in 3046 ms. (13 steps per ms) remains 7/32 properties
BEST_FIRST walk for 40002 steps (91 resets) in 357 ms. (111 steps per ms) remains 5/7 properties
BEST_FIRST walk for 40004 steps (87 resets) in 276 ms. (144 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (70 resets) in 326 ms. (122 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40003 steps (79 resets) in 134 ms. (296 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40003 steps (83 resets) in 96 ms. (412 steps per ms) remains 2/3 properties
[2026-05-22 20:13:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 102/108 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 108/216 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/216 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/216 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 350/566 variables, 216/227 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/566 variables, 1/228 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/566 variables, 1/229 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/566 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/566 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/566 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 566/566 variables, and 230 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1381 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 216/216 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 102/108 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 108/216 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/216 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/216 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 350/566 variables, 216/229 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/566 variables, 2/231 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/566 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/566 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/566 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 566/566 variables, and 232 constraints, problems are : Problem set: 0 solved, 2 unsolved in 681 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 216/216 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 2084ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 334 ms.
Support contains 6 out of 216 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 216/216 places, 350/350 transitions.
Graph (trivial) has 198 edges and 216 vertex of which 4 / 216 are part of one of the 2 SCC in 9 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 688 edges and 214 vertex of which 211 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Discarding 3 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 84 transitions
Trivial Post-agglo rules discarded 84 transitions
Performed 84 trivial Post agglomeration. Transition count delta: 84
Iterating post reduction 0 with 86 rules applied. Total rules applied 88 place count 211 transition count 259
Reduce places removed 84 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 1 with 118 rules applied. Total rules applied 206 place count 127 transition count 225
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 226 place count 107 transition count 225
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 226 place count 107 transition count 219
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 238 place count 101 transition count 219
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 241 place count 98 transition count 216
Iterating global reduction 3 with 3 rules applied. Total rules applied 244 place count 98 transition count 216
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 328 place count 56 transition count 174
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 329 place count 56 transition count 173
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 337 place count 48 transition count 134
Iterating global reduction 4 with 8 rules applied. Total rules applied 345 place count 48 transition count 134
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 349 place count 48 transition count 130
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 351 place count 47 transition count 129
Free-agglomeration rule applied 8 times.
Iterating global reduction 5 with 8 rules applied. Total rules applied 359 place count 47 transition count 121
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 367 place count 39 transition count 121
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 368 place count 38 transition count 120
Applied a total of 368 rules in 138 ms. Remains 38 /216 variables (removed 178) and now considering 120/350 (removed 230) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 138 ms. Remains : 38/216 places, 120/350 transitions.
RANDOM walk for 40000 steps (821 resets) in 420 ms. (95 steps per ms) remains 0/2 properties
Computed a total of 38 stabilizing places and 38 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' '!((F(p0)&&(X(X(p1))||G(p2))))'
Support contains 11 out of 216 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 216/216 places, 350/350 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 207 transition count 341
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 207 transition count 341
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 206 transition count 340
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 206 transition count 340
Applied a total of 20 rules in 16 ms. Remains 206 /216 variables (removed 10) and now considering 340/350 (removed 10) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6097337881830953120.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10779933954984611620.kers'
[2026-05-22 20:13:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6097337881830953120.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10779933954984611620.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 340 rows 206 cols 1625 entries
Finished phase 1 with 196 SingleSign rule and 0 generalized
[2026-05-22 20:13:51] [INFO ] Computed 10 invariants in 2 ms
Computed 10 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-10779933954984611620.kers
Total runtime 3 ms.
[2026-05-22 20:13:51] [INFO ] Implicit Places using invariants in 98 ms returned []
[2026-05-22 20:13:52] [INFO ] Invariant cache hit.
[2026-05-22 20:13:52] [INFO ] Implicit Places using invariants and state equation in 323 ms returned []
Implicit Place search using SMT with State Equation took 425 ms to find 0 implicit places.
Running 339 sub problems to find dead transitions.
[2026-05-22 20:13:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 1 (OVERLAPS) 1/206 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 18/48 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 4/52 constraints. Problems are: Problem set: 0 solved, 339 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 206/546 variables, and 52 constraints, problems are : Problem set: 0 solved, 339 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/206 constraints, PredecessorRefiner: 339/339 constraints, Known Traps: 42/42 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 339 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 1 (OVERLAPS) 1/206 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 42/52 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 4 (OVERLAPS) 340/546 variables, 206/258 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/546 variables, 339/597 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/546 variables, 2/599 constraints. Problems are: Problem set: 0 solved, 339 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 546/546 variables, and 599 constraints, problems are : Problem set: 0 solved, 339 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 206/206 constraints, PredecessorRefiner: 339/339 constraints, Known Traps: 44/44 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60327ms problems are : Problem set: 0 solved, 339 unsolved
Search for dead transitions found 0 dead transitions in 60333ms
Starting structural reductions in LTL mode, iteration 1 : 206/216 places, 340/350 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60777 ms. Remains : 206/216 places, 340/350 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(X(p1))||G(p2))))'
Stuttering acceptance computed with spot in 588 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p1), true, (AND (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : AutonomousCar-PT-05b-LTLFireability-00
Product exploration explored 100000 steps with 33333 reset in 556 ms.
Product exploration explored 100000 steps with 33333 reset in 385 ms.
Computed a total of 35 stabilizing places and 35 stable transitions
Computed a total of 35 stabilizing places and 35 stable transitions
Detected a total of 35/206 stabilizing places and 35/340 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 9 factoid took 23 ms. Proved property starting from automaton with 8 states, 13 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 59 ms.
FORMULA AutonomousCar-PT-05b-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-05b-LTLFireability-00 finished in 62492 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((p0||X(G(p1))))))))'
Support contains 3 out of 216 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 216/216 places, 350/350 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 209 transition count 343
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 209 transition count 343
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 208 transition count 342
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 208 transition count 342
Applied a total of 16 rules in 16 ms. Remains 208 /216 variables (removed 8) and now considering 342/350 (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-3187559318402814405.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9308657998229964606.kers'
[2026-05-22 20:14:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3187559318402814405.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9308657998229964606.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 342 rows 208 cols 1629 entries
Finished phase 1 with 198 SingleSign rule and 0 generalized
[2026-05-22 20:14:54] [INFO ] Computed 10 invariants in 3 ms
Computed 10 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-9308657998229964606.kers
Total runtime 4 ms.
[2026-05-22 20:14:54] [INFO ] Implicit Places using invariants in 189 ms returned []
[2026-05-22 20:14:54] [INFO ] Invariant cache hit.
[2026-05-22 20:14:54] [INFO ] Implicit Places using invariants and state equation in 414 ms returned []
Implicit Place search using SMT with State Equation took 605 ms to find 0 implicit places.
Running 341 sub problems to find dead transitions.
[2026-05-22 20:14:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/207 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 1 (OVERLAPS) 1/208 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/208 variables, 20/50 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 16/66 constraints. Problems are: Problem set: 0 solved, 341 unsolved
SMT process timed out in 30446ms, After SMT, problems are : Problem set: 0 solved, 341 unsolved
Search for dead transitions found 0 dead transitions in 30449ms
Starting structural reductions in LTL mode, iteration 1 : 208/216 places, 342/350 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31071 ms. Remains : 208/216 places, 342/350 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||X(G(p1))))))))'
Stuttering acceptance computed with spot in 334 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-05b-LTLFireability-02
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-05b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-05b-LTLFireability-02 finished in 31460 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)&&F(G(p1)))))'
Support contains 2 out of 216 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 216/216 places, 350/350 transitions.
Graph (trivial) has 202 edges and 216 vertex of which 4 / 216 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 83 transitions
Trivial Post-agglo rules discarded 83 transitions
Performed 83 trivial Post agglomeration. Transition count delta: 83
Iterating post reduction 0 with 83 rules applied. Total rules applied 84 place count 213 transition count 264
Reduce places removed 83 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 1 with 115 rules applied. Total rules applied 199 place count 130 transition count 232
Reduce places removed 19 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 20 rules applied. Total rules applied 219 place count 111 transition count 231
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 220 place count 110 transition count 231
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 220 place count 110 transition count 226
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 230 place count 105 transition count 226
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 234 place count 101 transition count 222
Iterating global reduction 4 with 4 rules applied. Total rules applied 238 place count 101 transition count 222
Performed 44 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 4 with 88 rules applied. Total rules applied 326 place count 57 transition count 177
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 337 place count 46 transition count 121
Iterating global reduction 4 with 11 rules applied. Total rules applied 348 place count 46 transition count 121
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 353 place count 46 transition count 116
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 355 place count 45 transition count 115
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 356 place count 44 transition count 114
Applied a total of 356 rules in 78 ms. Remains 44 /216 variables (removed 172) and now considering 114/350 (removed 236) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11475072800682801203.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2010523027869901734.kers'
[2026-05-22 20:15:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11475072800682801203.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2010523027869901734.kers]
Normalized transition count is 113 out of 114 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 113 rows 43 cols 757 entries
Finished phase 1 with 35 SingleSign rule and 0 generalized
[2026-05-22 20:15:25] [INFO ] Computed 9 invariants in 1 ms
Computed 9 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2010523027869901734.kers
Total runtime 2 ms.
[2026-05-22 20:15:25] [INFO ] Implicit Places using invariants in 106 ms returned []
[2026-05-22 20:15:25] [INFO ] Invariant cache hit.
[2026-05-22 20:15:26] [INFO ] State equation strengthened by 54 read => feed constraints.
[2026-05-22 20:15:26] [INFO ] Implicit Places using invariants and state equation in 213 ms returned [40, 43]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 325 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 42/216 places, 114/350 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 40 transition count 112
Applied a total of 4 rules in 20 ms. Remains 40 /42 variables (removed 2) and now considering 112/114 (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-15824305192483477334.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5247314979603569503.kers'
[2026-05-22 20:15:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15824305192483477334.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5247314979603569503.kers]
Normalized transition count is 111 out of 112 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 111 rows 40 cols 755 entries
Finished phase 1 with 33 SingleSign rule and 0 generalized
[2026-05-22 20:15:26] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5247314979603569503.kers
Total runtime 1 ms.
[2026-05-22 20:15:26] [INFO ] Implicit Places using invariants in 101 ms returned []
[2026-05-22 20:15:26] [INFO ] Invariant cache hit.
[2026-05-22 20:15:26] [INFO ] State equation strengthened by 55 read => feed constraints.
[2026-05-22 20:15:26] [INFO ] Implicit Places using invariants and state equation in 174 ms returned []
Implicit Place search using SMT with State Equation took 278 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 40/216 places, 112/350 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 701 ms. Remains : 40/216 places, 112/350 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)&&F(G(p1)))))'
Stuttering acceptance computed with spot in 159 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-05b-LTLFireability-03
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-05b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-05b-LTLFireability-03 finished in 902 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((X((!p1&&X(X(!p2)))) U ((p3&&X((!p1&&X(X(!p2)))))||X(G((!p1&&X(X(!p2))))))))))'
Support contains 8 out of 216 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 216/216 places, 350/350 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 209 transition count 343
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 209 transition count 343
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 208 transition count 342
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 208 transition count 342
Applied a total of 16 rules in 13 ms. Remains 208 /216 variables (removed 8) and now considering 342/350 (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-15102147649160203264.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4267312008383713623.kers'
[2026-05-22 20:15:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15102147649160203264.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4267312008383713623.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 342 rows 208 cols 1629 entries
Finished phase 1 with 198 SingleSign rule and 0 generalized
[2026-05-22 20:15:26] [INFO ] Computed 10 invariants in 2 ms
Computed 10 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-4267312008383713623.kers
Total runtime 3 ms.
[2026-05-22 20:15:26] [INFO ] Implicit Places using invariants in 165 ms returned []
[2026-05-22 20:15:26] [INFO ] Invariant cache hit.
[2026-05-22 20:15:27] [INFO ] Implicit Places using invariants and state equation in 397 ms returned []
Implicit Place search using SMT with State Equation took 566 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 208/216 places, 342/350 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 579 ms. Remains : 208/216 places, 342/350 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((X((!p1&&X(X(!p2)))) U ((p3&&X((!p1&&X(X(!p2)))))||X(G((!p1&&X(X(!p2))))))))))'
Stuttering acceptance computed with spot in 596 ms :[(OR (AND (NOT p0) p1) (AND (NOT p0) p2)), (OR (AND (NOT p0) p1) (AND (NOT p0) p2)), (OR (AND (NOT p0) p1) (AND (NOT p0) p2)), (AND (NOT p0) p2), (NOT p0), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2)]
Running random walk in product with property : AutonomousCar-PT-05b-LTLFireability-04
Product exploration explored 100000 steps with 20000 reset in 194 ms.
Product exploration explored 100000 steps with 20000 reset in 209 ms.
Computed a total of 35 stabilizing places and 35 stable transitions
Computed a total of 35 stabilizing places and 35 stable transitions
Knowledge based reduction with 13 factoid took 131 ms. Reduced automaton from 10 states, 24 edges and 4 AP (stutter sensitive) to 6 states, 6 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (145 resets) in 378 ms. (105 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40002 steps (92 resets) in 225 ms. (177 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (95 resets) in 151 ms. (263 steps per ms) remains 2/2 properties
[2026-05-22 20:15:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 97/102 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 106/208 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 342/550 variables, 208/218 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/550 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/550 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/550 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 550/550 variables, and 219 constraints, problems are : Problem set: 0 solved, 2 unsolved in 641 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 208/208 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 97/102 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 106/208 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 342/550 variables, 208/219 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/550 variables, 2/221 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/550 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/550 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/550 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/550 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 550/550 variables, and 222 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1550 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 208/208 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 2206ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 181 ms.
Support contains 5 out of 208 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 208/208 places, 342/342 transitions.
Graph (trivial) has 193 edges and 208 vertex of which 4 / 208 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 680 edges and 206 vertex of which 203 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 76 transitions
Trivial Post-agglo rules discarded 76 transitions
Performed 76 trivial Post agglomeration. Transition count delta: 76
Iterating post reduction 0 with 78 rules applied. Total rules applied 80 place count 203 transition count 259
Reduce places removed 76 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 1 with 108 rules applied. Total rules applied 188 place count 127 transition count 227
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 2 with 19 rules applied. Total rules applied 207 place count 108 transition count 227
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 207 place count 108 transition count 220
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 221 place count 101 transition count 220
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 45
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 3 with 90 rules applied. Total rules applied 311 place count 56 transition count 175
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 312 place count 56 transition count 174
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 322 place count 46 transition count 123
Iterating global reduction 4 with 10 rules applied. Total rules applied 332 place count 46 transition count 123
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 336 place count 46 transition count 119
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 338 place count 45 transition count 118
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 339 place count 45 transition count 117
Free-agglomeration rule applied 6 times.
Iterating global reduction 5 with 6 rules applied. Total rules applied 345 place count 45 transition count 111
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 351 place count 39 transition count 111
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 352 place count 38 transition count 110
Applied a total of 352 rules in 74 ms. Remains 38 /208 variables (removed 170) and now considering 110/342 (removed 232) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75 ms. Remains : 38/208 places, 110/342 transitions.
RANDOM walk for 15232 steps (446 resets) in 233 ms. (65 steps per ms) remains 0/2 properties
Knowledge based reduction with 13 factoid took 140 ms. Reduced automaton from 6 states, 6 edges and 2 AP (stutter sensitive) to 6 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 306 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), (NOT p0), (AND (NOT p0) p2), (AND (NOT p0) p2)]
Knowledge-based reduction took 3507 ms.
Stuttering acceptance computed with spot in 327 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), (NOT p0), (AND (NOT p0) p2), (AND (NOT p0) p2)]
Support contains 5 out of 208 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 208/208 places, 342/342 transitions.
Applied a total of 0 rules in 5 ms. Remains 208 /208 variables (removed 0) and now considering 342/342 (removed 0) transitions.
[2026-05-22 20:15:32] [INFO ] Invariant cache hit.
[2026-05-22 20:15:32] [INFO ] Implicit Places using invariants in 171 ms returned []
[2026-05-22 20:15:32] [INFO ] Invariant cache hit.
[2026-05-22 20:15:32] [INFO ] Implicit Places using invariants and state equation in 395 ms returned []
Implicit Place search using SMT with State Equation took 570 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 575 ms. Remains : 208/208 places, 342/342 transitions.
Computed a total of 35 stabilizing places and 35 stable transitions
Computed a total of 35 stabilizing places and 35 stable transitions
Knowledge based reduction with 1 factoid took 71 ms. Reduced automaton from 6 states, 6 edges and 2 AP (stutter sensitive) to 6 states, 6 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (37 resets) in 166 ms. (239 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40003 steps (93 resets) in 129 ms. (307 steps per ms) remains 2/2 properties
BEST_FIRST walk for 36603 steps (67 resets) in 109 ms. (332 steps per ms) remains 0/2 properties
Knowledge based reduction with 1 factoid took 130 ms. Reduced automaton from 6 states, 6 edges and 2 AP (stutter sensitive) to 6 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 323 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (NOT p0), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2)]
Knowledge-based reduction took 683 ms.
Stuttering acceptance computed with spot in 315 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (NOT p0), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2)]
Stuttering acceptance computed with spot in 308 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (NOT p0), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2)]
Product exploration explored 100000 steps with 20000 reset in 144 ms.
Product exploration explored 100000 steps with 20000 reset in 168 ms.
Spot run failed in 156 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/ltsmin3939956126729084327
[2026-05-22 20:15:34] [INFO ] Built C files in 45ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3939956126729084327
Running compilation step : cd /tmp/ltsmin3939956126729084327;'/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 1719 ms.
Running link step : cd /tmp/ltsmin3939956126729084327;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 85 ms.
Running LTSmin : cd /tmp/ltsmin3939956126729084327;'/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/stateBased8171971267967253054.hoa' '--buchi-type=spotba'
LTSmin run took 98 ms.
FORMULA AutonomousCar-PT-05b-LTLFireability-04 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property AutonomousCar-PT-05b-LTLFireability-04 finished in 9905 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)||(F(p1)&&G((X(F((p3&&F(p4))))||p2)))))'
Support contains 9 out of 216 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 216/216 places, 350/350 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 208 transition count 342
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 208 transition count 342
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 207 transition count 341
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 207 transition count 341
Applied a total of 18 rules in 13 ms. Remains 207 /216 variables (removed 9) and now considering 341/350 (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-13933086859866827076.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2944912525283802555.kers'
[2026-05-22 20:15:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13933086859866827076.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2944912525283802555.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 341 rows 207 cols 1627 entries
Finished phase 1 with 197 SingleSign rule and 0 generalized
[2026-05-22 20:15:36] [INFO ] Computed 10 invariants in 3 ms
Computed 10 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-2944912525283802555.kers
Total runtime 4 ms.
[2026-05-22 20:15:36] [INFO ] Implicit Places using invariants in 166 ms returned []
[2026-05-22 20:15:36] [INFO ] Invariant cache hit.
[2026-05-22 20:15:37] [INFO ] Implicit Places using invariants and state equation in 401 ms returned []
Implicit Place search using SMT with State Equation took 571 ms to find 0 implicit places.
Running 340 sub problems to find dead transitions.
[2026-05-22 20:15:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/206 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 1 (OVERLAPS) 1/207 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/207 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/207 variables, 20/50 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/207 variables, 18/68 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/207 variables, 3/71 constraints. Problems are: Problem set: 0 solved, 340 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 207/548 variables, and 71 constraints, problems are : Problem set: 0 solved, 340 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/207 constraints, PredecessorRefiner: 340/340 constraints, Known Traps: 61/61 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 340 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/206 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 1 (OVERLAPS) 1/207 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/207 variables, 61/71 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/207 variables, 4/75 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/207 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 5 (OVERLAPS) 341/548 variables, 207/282 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/548 variables, 340/622 constraints. Problems are: Problem set: 0 solved, 340 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 548/548 variables, and 623 constraints, problems are : Problem set: 0 solved, 340 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 207/207 constraints, PredecessorRefiner: 340/340 constraints, Known Traps: 65/65 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60312ms problems are : Problem set: 0 solved, 340 unsolved
Search for dead transitions found 0 dead transitions in 60315ms
Starting structural reductions in LTL mode, iteration 1 : 207/216 places, 341/350 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60902 ms. Remains : 207/216 places, 341/350 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)||(F(p1)&&G((X(F((p3&&F(p4))))||p2)))))'
Stuttering acceptance computed with spot in 483 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p0)), (OR (AND (NOT p0) p2 (NOT p3)) (AND (NOT p0) p3 (NOT p4))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p4))), (NOT p1), (OR (NOT p3) (NOT p4)), (NOT p4), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p2) (NOT p4)))]
Running random walk in product with property : AutonomousCar-PT-05b-LTLFireability-07
Stuttering criterion allowed to conclude after 318 steps with 3 reset in 1 ms.
FORMULA AutonomousCar-PT-05b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-05b-LTLFireability-07 finished in 61475 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 216 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 216/216 places, 350/350 transitions.
Graph (trivial) has 203 edges and 216 vertex of which 4 / 216 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 83 transitions
Trivial Post-agglo rules discarded 83 transitions
Performed 83 trivial Post agglomeration. Transition count delta: 83
Iterating post reduction 0 with 83 rules applied. Total rules applied 84 place count 213 transition count 264
Reduce places removed 83 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 1 with 112 rules applied. Total rules applied 196 place count 130 transition count 235
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 2 with 17 rules applied. Total rules applied 213 place count 113 transition count 235
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 213 place count 113 transition count 229
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 225 place count 107 transition count 229
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 230 place count 102 transition count 224
Iterating global reduction 3 with 5 rules applied. Total rules applied 235 place count 102 transition count 224
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 235 place count 102 transition count 223
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 237 place count 101 transition count 223
Performed 44 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 325 place count 57 transition count 178
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 326 place count 57 transition count 177
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 337 place count 46 transition count 121
Iterating global reduction 4 with 11 rules applied. Total rules applied 348 place count 46 transition count 121
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 353 place count 46 transition count 116
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 5 with 4 rules applied. Total rules applied 357 place count 44 transition count 114
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 359 place count 42 transition count 112
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 360 place count 41 transition count 112
Applied a total of 360 rules in 57 ms. Remains 41 /216 variables (removed 175) and now considering 112/350 (removed 238) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9490333669597450619.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5994541949111348675.kers'
[2026-05-22 20:16:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9490333669597450619.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5994541949111348675.kers]
Normalized transition count is 111 out of 112 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 111 rows 40 cols 752 entries
Finished phase 1 with 33 SingleSign rule and 0 generalized
[2026-05-22 20:16:38] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5994541949111348675.kers
Total runtime 2 ms.
[2026-05-22 20:16:38] [INFO ] Implicit Places using invariants in 95 ms returned []
[2026-05-22 20:16:38] [INFO ] Invariant cache hit.
[2026-05-22 20:16:38] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-22 20:16:38] [INFO ] Implicit Places using invariants and state equation in 161 ms returned [37, 40]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 260 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 39/216 places, 112/350 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 37 transition count 110
Applied a total of 4 rules in 8 ms. Remains 37 /39 variables (removed 2) and now considering 110/112 (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-8764851200861129373.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7591264099538790397.kers'
[2026-05-22 20:16:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8764851200861129373.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7591264099538790397.kers]
Normalized transition count is 109 out of 110 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 109 rows 37 cols 750 entries
Finished phase 1 with 31 SingleSign rule and 0 generalized
[2026-05-22 20:16:38] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7591264099538790397.kers
Total runtime 2 ms.
[2026-05-22 20:16:38] [INFO ] Implicit Places using invariants in 85 ms returned []
[2026-05-22 20:16:38] [INFO ] Invariant cache hit.
[2026-05-22 20:16:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-22 20:16:38] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 230 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 37/216 places, 110/350 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 556 ms. Remains : 37/216 places, 110/350 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 50 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-05b-LTLFireability-08
Product exploration explored 100000 steps with 134 reset in 201 ms.
Product exploration explored 100000 steps with 2 reset in 206 ms.
Computed a total of 2 stabilizing places and 3 stable transitions
Computed a total of 2 stabilizing places and 3 stable transitions
Knowledge based reduction with 3 factoid took 70 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
RANDOM walk for 120 steps (9 resets) in 4 ms. (24 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 82 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Knowledge-based reduction took 208 ms.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Support contains 1 out of 37 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 37/37 places, 110/110 transitions.
Applied a total of 0 rules in 5 ms. Remains 37 /37 variables (removed 0) and now considering 110/110 (removed 0) transitions.
[2026-05-22 20:16:39] [INFO ] Invariant cache hit.
[2026-05-22 20:16:39] [INFO ] Implicit Places using invariants in 91 ms returned []
[2026-05-22 20:16:39] [INFO ] Invariant cache hit.
[2026-05-22 20:16:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-22 20:16:39] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 231 ms to find 0 implicit places.
[2026-05-22 20:16:39] [INFO ] Redundant transitions in 21 ms returned []
Running 109 sub problems to find dead transitions.
[2026-05-22 20:16:39] [INFO ] Invariant cache hit.
[2026-05-22 20:16:39] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (OVERLAPS) 109/146 variables, 37/43 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 2/46 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (OVERLAPS) 1/147 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/147 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/147 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 10 (OVERLAPS) 0/147 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Real declared 147/147 variables, and 49 constraints, problems are : Problem set: 0 solved, 109 unsolved in 10052 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 37/37 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 109 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (OVERLAPS) 109/146 variables, 37/44 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 109/153 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 4/157 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/146 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 8 (OVERLAPS) 1/147 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/147 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 10 (OVERLAPS) 0/147 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Int declared 147/147 variables, and 159 constraints, problems are : Problem set: 0 solved, 109 unsolved in 11914 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 37/37 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 5/5 constraints]
After SMT, in 22109ms problems are : Problem set: 0 solved, 109 unsolved
Search for dead transitions found 0 dead transitions in 22109ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 22372 ms. Remains : 37/37 places, 110/110 transitions.
Computed a total of 2 stabilizing places and 3 stable transitions
Computed a total of 2 stabilizing places and 3 stable transitions
Knowledge based reduction with 3 factoid took 65 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
RANDOM walk for 148 steps (11 resets) in 4 ms. (29 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 72 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Knowledge-based reduction took 190 ms.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Product exploration explored 100000 steps with 79 reset in 117 ms.
Product exploration explored 100000 steps with 79 reset in 460 ms.
Built C files in :
/tmp/ltsmin641115869419093645
[2026-05-22 20:17:02] [INFO ] Computing symmetric may disable matrix : 110 transitions.
[2026-05-22 20:17:02] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 20:17:02] [INFO ] Computing symmetric may enable matrix : 110 transitions.
[2026-05-22 20:17:02] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 20:17:02] [INFO ] Computing Do-Not-Accords matrix : 110 transitions.
[2026-05-22 20:17:02] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 20:17:02] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin641115869419093645
Running compilation step : cd /tmp/ltsmin641115869419093645;'/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 395 ms.
Running link step : cd /tmp/ltsmin641115869419093645;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin641115869419093645;'/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/stateBased5878781770483234329.hoa' '--buchi-type=spotba'
LTSmin run took 267 ms.
FORMULA AutonomousCar-PT-05b-LTLFireability-08 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property AutonomousCar-PT-05b-LTLFireability-08 finished in 25326 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((p0||X(G(p0)))) U G(p1)))'
Support contains 2 out of 216 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 216/216 places, 350/350 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 208 transition count 342
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 208 transition count 342
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 207 transition count 341
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 207 transition count 341
Applied a total of 18 rules in 12 ms. Remains 207 /216 variables (removed 9) and now considering 341/350 (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-14808570632486979027.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11645582701189720243.kers'
[2026-05-22 20:17:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14808570632486979027.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11645582701189720243.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 341 rows 207 cols 1627 entries
Finished phase 1 with 197 SingleSign rule and 0 generalized
[2026-05-22 20:17:03] [INFO ] Computed 10 invariants in 2 ms
Computed 10 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-11645582701189720243.kers
Total runtime 4 ms.
[2026-05-22 20:17:03] [INFO ] Implicit Places using invariants in 152 ms returned []
[2026-05-22 20:17:03] [INFO ] Invariant cache hit.
[2026-05-22 20:17:03] [INFO ] Implicit Places using invariants and state equation in 318 ms returned []
Implicit Place search using SMT with State Equation took 474 ms to find 0 implicit places.
Running 340 sub problems to find dead transitions.
[2026-05-22 20:17:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/206 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 1 (OVERLAPS) 1/207 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/207 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/207 variables, 20/50 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/207 variables, 18/68 constraints. Problems are: Problem set: 0 solved, 340 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 207/548 variables, and 71 constraints, problems are : Problem set: 0 solved, 340 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/207 constraints, PredecessorRefiner: 340/340 constraints, Known Traps: 61/61 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 340 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/206 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 1 (OVERLAPS) 1/207 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/207 variables, 61/71 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/207 variables, 4/75 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/207 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 5 (OVERLAPS) 341/548 variables, 207/282 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/548 variables, 340/622 constraints. Problems are: Problem set: 0 solved, 340 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 548/548 variables, and 627 constraints, problems are : Problem set: 0 solved, 340 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 207/207 constraints, PredecessorRefiner: 340/340 constraints, Known Traps: 65/65 constraints, Known Traps Along Path: 5/5 constraints]
After SMT, in 60321ms problems are : Problem set: 0 solved, 340 unsolved
Search for dead transitions found 0 dead transitions in 60324ms
Starting structural reductions in LTL mode, iteration 1 : 207/216 places, 341/350 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60811 ms. Remains : 207/216 places, 341/350 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((p0||X(G(p0)))) U G(p1)))'
Stuttering acceptance computed with spot in 229 ms :[(NOT p1), (NOT p0), (AND (NOT p0) p1), (AND (NOT p0) (NOT p1)), true, (AND (NOT p1) p0)]
Running random walk in product with property : AutonomousCar-PT-05b-LTLFireability-09
Product exploration explored 100000 steps with 33350 reset in 214 ms.
Product exploration explored 100000 steps with 33291 reset in 243 ms.
Computed a total of 35 stabilizing places and 35 stable transitions
Computed a total of 35 stabilizing places and 35 stable transitions
Knowledge based reduction with 13 factoid took 66 ms. Reduced automaton from 6 states, 16 edges and 2 AP (stutter sensitive) to 6 states, 16 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (80 resets) in 173 ms. (229 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40001 steps (51 resets) in 81 ms. (487 steps per ms) remains 1/1 properties
[2026-05-22 20:18:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 63/65 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 142/207 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/207 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 341/548 variables, 207/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/548 variables, 1/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/548 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/548 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/548 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 548/548 variables, and 219 constraints, problems are : Problem set: 0 solved, 1 unsolved in 630 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 207/207 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 63/65 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 142/207 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/207 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/207 variables, 7/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/207 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 341/548 variables, 207/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/548 variables, 1/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/548 variables, 1/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/548 variables, 1/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/548 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/548 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 548/548 variables, and 228 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1770 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 207/207 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 2405ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 32 ms.
Support contains 2 out of 207 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 207/207 places, 341/341 transitions.
Graph (trivial) has 193 edges and 207 vertex of which 4 / 207 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 679 edges and 205 vertex of which 203 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 74 transitions
Trivial Post-agglo rules discarded 74 transitions
Performed 74 trivial Post agglomeration. Transition count delta: 74
Iterating post reduction 0 with 76 rules applied. Total rules applied 78 place count 203 transition count 261
Reduce places removed 74 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 1 with 105 rules applied. Total rules applied 183 place count 129 transition count 230
Reduce places removed 18 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 19 rules applied. Total rules applied 202 place count 111 transition count 229
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 203 place count 110 transition count 229
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 203 place count 110 transition count 221
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 219 place count 102 transition count 221
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 4 with 94 rules applied. Total rules applied 313 place count 55 transition count 174
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 314 place count 55 transition count 173
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 324 place count 45 transition count 123
Iterating global reduction 5 with 10 rules applied. Total rules applied 334 place count 45 transition count 123
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 339 place count 45 transition count 118
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 6 with 2 rules applied. Total rules applied 341 place count 44 transition count 117
Free-agglomeration rule applied 6 times.
Iterating global reduction 6 with 6 rules applied. Total rules applied 347 place count 44 transition count 111
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 353 place count 38 transition count 111
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 354 place count 38 transition count 110
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 355 place count 37 transition count 109
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 356 place count 36 transition count 109
Applied a total of 356 rules in 36 ms. Remains 36 /207 variables (removed 171) and now considering 109/341 (removed 232) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 36/207 places, 109/341 transitions.
RANDOM walk for 9589 steps (160 resets) in 37 ms. (252 steps per ms) remains 0/1 properties
Knowledge based reduction with 13 factoid took 173 ms. Reduced automaton from 6 states, 16 edges and 2 AP (stutter sensitive) to 6 states, 16 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 237 ms :[(NOT p1), (NOT p0), (AND (NOT p0) p1), (AND (NOT p0) (NOT p1)), true, (AND (NOT p1) p0)]
[2026-05-22 20:18:08] [INFO ] Invariant cache hit.
[2026-05-22 20:18:08] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned unsat
Proved EG (NOT p1) asserting that LTL formula F !(NOT p1) is false.
Negative knowledge disproves property using: (F p1)
Knowledge-based reduction took 3314 ms.
FORMULA AutonomousCar-PT-05b-LTLFireability-09 FALSE TECHNIQUES NEGATIVE_KNOWLEDGE
Treatment of property AutonomousCar-PT-05b-LTLFireability-09 finished in 64857 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(F((p0&&X(F(p1)))))))'
Support contains 7 out of 216 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 216/216 places, 350/350 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 207 transition count 341
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 207 transition count 341
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 206 transition count 340
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 206 transition count 340
Applied a total of 20 rules in 7 ms. Remains 206 /216 variables (removed 10) and now considering 340/350 (removed 10) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15170013122276865809.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5142628725716589576.kers'
[2026-05-22 20:18:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15170013122276865809.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5142628725716589576.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 340 rows 206 cols 1625 entries
Finished phase 1 with 196 SingleSign rule and 0 generalized
[2026-05-22 20:18:08] [INFO ] Computed 10 invariants in 1 ms
Computed 10 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-5142628725716589576.kers
Total runtime 2 ms.
[2026-05-22 20:18:08] [INFO ] Implicit Places using invariants in 106 ms returned []
[2026-05-22 20:18:08] [INFO ] Invariant cache hit.
[2026-05-22 20:18:08] [INFO ] Implicit Places using invariants and state equation in 247 ms returned []
Implicit Place search using SMT with State Equation took 355 ms to find 0 implicit places.
Running 339 sub problems to find dead transitions.
[2026-05-22 20:18:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 1 (OVERLAPS) 1/206 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 18/48 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 4/52 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/206 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 6 (OVERLAPS) 340/546 variables, 206/258 constraints. Problems are: Problem set: 0 solved, 339 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 546/546 variables, and 258 constraints, problems are : Problem set: 0 solved, 339 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 206/206 constraints, PredecessorRefiner: 339/339 constraints, Known Traps: 42/42 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 339 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 1 (OVERLAPS) 1/206 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 42/52 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 4 (OVERLAPS) 340/546 variables, 206/258 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/546 variables, 339/597 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/546 variables, 2/599 constraints. Problems are: Problem set: 0 solved, 339 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 546/546 variables, and 601 constraints, problems are : Problem set: 0 solved, 339 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 206/206 constraints, PredecessorRefiner: 339/339 constraints, Known Traps: 46/46 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60217ms problems are : Problem set: 0 solved, 339 unsolved
Search for dead transitions found 0 dead transitions in 60219ms
Starting structural reductions in LTL mode, iteration 1 : 206/216 places, 340/350 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60584 ms. Remains : 206/216 places, 340/350 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(F((X(F(p0))&&p1)))))'
Stuttering acceptance computed with spot in 153 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : AutonomousCar-PT-05b-LTLFireability-10
Product exploration explored 100000 steps with 1966 reset in 122 ms.
Product exploration explored 100000 steps with 1967 reset in 138 ms.
Computed a total of 35 stabilizing places and 35 stable transitions
Computed a total of 35 stabilizing places and 35 stable transitions
Knowledge based reduction with 2 factoid took 64 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
RANDOM walk for 200 steps (0 resets) in 6 ms. (28 steps per ms) remains 0/1 properties
Knowledge based reduction with 2 factoid took 69 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 146 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
[2026-05-22 20:19:09] [INFO ] Invariant cache hit.
[2026-05-22 20:19:09] [INFO ] [Real]Absence check using 10 positive place invariants in 8 ms returned sat
[2026-05-22 20:19:09] [INFO ] [Real]Absence check using state equation in 240 ms returned sat
[2026-05-22 20:19:10] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 20:19:10] [INFO ] [Nat]Absence check using 10 positive place invariants in 8 ms returned sat
[2026-05-22 20:19:10] [INFO ] [Nat]Absence check using state equation in 253 ms returned sat
[2026-05-22 20:19:10] [INFO ] Computed and/alt/rep : 182/309/182 causal constraints (skipped 157 transitions) in 62 ms.
[2026-05-22 20:19:11] [INFO ] Added : 155 causal constraints over 31 iterations in 1036 ms. Result :sat
Could not prove EG (NOT p0)
Knowledge-based reduction took 2306 ms.
Stuttering acceptance computed with spot in 160 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 206 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 206/206 places, 340/340 transitions.
Applied a total of 0 rules in 4 ms. Remains 206 /206 variables (removed 0) and now considering 340/340 (removed 0) transitions.
[2026-05-22 20:19:11] [INFO ] Invariant cache hit.
[2026-05-22 20:19:11] [INFO ] Implicit Places using invariants in 154 ms returned []
[2026-05-22 20:19:11] [INFO ] Invariant cache hit.
[2026-05-22 20:19:12] [INFO ] Implicit Places using invariants and state equation in 382 ms returned []
Implicit Place search using SMT with State Equation took 540 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 544 ms. Remains : 206/206 places, 340/340 transitions.
Computed a total of 35 stabilizing places and 35 stable transitions
Computed a total of 35 stabilizing places and 35 stable transitions
Knowledge based reduction with 1 factoid took 62 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 200 steps (0 resets) in 4 ms. (40 steps per ms) remains 0/1 properties
Knowledge based reduction with 1 factoid took 66 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 159 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
[2026-05-22 20:19:12] [INFO ] Invariant cache hit.
[2026-05-22 20:19:12] [INFO ] [Real]Absence check using 10 positive place invariants in 9 ms returned sat
[2026-05-22 20:19:13] [INFO ] [Real]Absence check using state equation in 253 ms returned sat
[2026-05-22 20:19:13] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 20:19:13] [INFO ] [Nat]Absence check using 10 positive place invariants in 8 ms returned sat
[2026-05-22 20:19:13] [INFO ] [Nat]Absence check using state equation in 236 ms returned sat
[2026-05-22 20:19:13] [INFO ] Computed and/alt/rep : 182/309/182 causal constraints (skipped 157 transitions) in 61 ms.
[2026-05-22 20:19:14] [INFO ] Added : 155 causal constraints over 31 iterations in 1120 ms. Result :sat
Could not prove EG (NOT p0)
Knowledge-based reduction took 2381 ms.
Stuttering acceptance computed with spot in 152 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 1967 reset in 114 ms.
Product exploration explored 100000 steps with 1966 reset in 230 ms.
Spot run failed in 55 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/ltsmin8359288512533056690
[2026-05-22 20:19:15] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8359288512533056690
Running compilation step : cd /tmp/ltsmin8359288512533056690;'/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 861 ms.
Running link step : cd /tmp/ltsmin8359288512533056690;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin8359288512533056690;'/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/stateBased5811249324531614729.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 206/206 places, 340/340 transitions.
Applied a total of 0 rules in 2 ms. Remains 206 /206 variables (removed 0) and now considering 340/340 (removed 0) transitions.
[2026-05-22 20:19:30] [INFO ] Invariant cache hit.
[2026-05-22 20:19:30] [INFO ] Implicit Places using invariants in 117 ms returned []
[2026-05-22 20:19:30] [INFO ] Invariant cache hit.
[2026-05-22 20:19:30] [INFO ] Implicit Places using invariants and state equation in 309 ms returned []
Implicit Place search using SMT with State Equation took 437 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 439 ms. Remains : 206/206 places, 340/340 transitions.
Built C files in :
/tmp/ltsmin3675031963158857154
[2026-05-22 20:19:30] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3675031963158857154
Running compilation step : cd /tmp/ltsmin3675031963158857154;'/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 861 ms.
Running link step : cd /tmp/ltsmin3675031963158857154;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin3675031963158857154;'/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/stateBased12829623749380567984.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-22 20:19:46] [INFO ] Flatten gal took : 28 ms
[2026-05-22 20:19:46] [INFO ] Flatten gal took : 27 ms
[2026-05-22 20:19:46] [INFO ] Time to serialize gal into /tmp/LTL3342381236949475473.gal : 8 ms
[2026-05-22 20:19:46] [INFO ] Time to serialize properties into /tmp/LTL3320385543712562204.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3342381236949475473.gal' '-t' 'CGAL' '-hoa' '/tmp/aut18305472182084989273.hoa' '-atoms' '/tmp/LTL3320385543712562204.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL3320385543712562204.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut18305472182084989273.hoa
Detected timeout of ITS tools.
[2026-05-22 20:20:01] [INFO ] Flatten gal took : 28 ms
[2026-05-22 20:20:01] [INFO ] Flatten gal took : 49 ms
[2026-05-22 20:20:01] [INFO ] Time to serialize gal into /tmp/LTL1299155394562407507.gal : 7 ms
[2026-05-22 20:20:01] [INFO ] Time to serialize properties into /tmp/LTL16752678360788828894.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1299155394562407507.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16752678360788828894.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(F((X(F("(p151==1)")))&&("((((p53==0)||(p84==0))||((p115==0)||(p146==0)))||((p177==0)||(p213==0)))"))))))
Formula 0 simplified : XXG(!"((((p53==0)||(p84==0))||((p115==0)||(p146==0)))||((p177==0)||(p213==0)))" | XG!"(p151==1)")
Detected timeout of ITS tools.
[2026-05-22 20:20:16] [INFO ] Flatten gal took : 26 ms
[2026-05-22 20:20:16] [INFO ] Applying decomposition
[2026-05-22 20:20:16] [INFO ] Flatten gal took : 21 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph7707789981342406946.txt' '-o' '/tmp/graph7707789981342406946.bin' '-w' '/tmp/graph7707789981342406946.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph7707789981342406946.bin' '-l' '-1' '-v' '-w' '/tmp/graph7707789981342406946.weights' '-q' '0' '-e' '0.001'
[2026-05-22 20:20:16] [INFO ] Decomposing Gal with order
[2026-05-22 20:20:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 20:20:16] [INFO ] Removed a total of 440 redundant transitions.
[2026-05-22 20:20:16] [INFO ] Flatten gal took : 179 ms
[2026-05-22 20:20:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 38 labels/synchronizations in 21 ms.
[2026-05-22 20:20:16] [INFO ] Time to serialize gal into /tmp/LTL9603137063031352885.gal : 10 ms
[2026-05-22 20:20:16] [INFO ] Time to serialize properties into /tmp/LTL11709504521782718321.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9603137063031352885.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11709504521782718321.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(X(F((X(F("(i9.u43.p151==1)")))&&("((((i3.u14.p53==0)||(i5.u23.p84==0))||((i6.u32.p115==0)||(i9.u41.p146==0)))||((i11.u50.p177==0)...183
Formula 0 simplified : XXG(!"((((i3.u14.p53==0)||(i5.u23.p84==0))||((i6.u32.p115==0)||(i9.u41.p146==0)))||((i11.u50.p177==0)||(i13.u59.p213==0)))" | XG!"(i...171
Reverse transition relation is NOT exact ! Due to transitions t202, t209, t229, t259, t284, t304, t347, i0.t200, i2.i0.t193, i2.i0.u10.t172, i2.i0.u16.t173...683
Computing Next relation with stutter on 17888 deadlock states
4 unique states visited
0 strongly connected components in search stack
3 transitions explored
4 items max in DFS search stack
50 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.53288,32956,1,0,41420,1071,2711,42174,423,2795,109162
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA AutonomousCar-PT-05b-LTLFireability-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property AutonomousCar-PT-05b-LTLFireability-10 finished in 129193 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 216 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 216/216 places, 350/350 transitions.
Graph (trivial) has 203 edges and 216 vertex of which 4 / 216 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 83 transitions
Trivial Post-agglo rules discarded 83 transitions
Performed 83 trivial Post agglomeration. Transition count delta: 83
Iterating post reduction 0 with 83 rules applied. Total rules applied 84 place count 213 transition count 264
Reduce places removed 83 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 1 with 112 rules applied. Total rules applied 196 place count 130 transition count 235
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 2 with 17 rules applied. Total rules applied 213 place count 113 transition count 235
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 213 place count 113 transition count 229
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 225 place count 107 transition count 229
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 230 place count 102 transition count 224
Iterating global reduction 3 with 5 rules applied. Total rules applied 235 place count 102 transition count 224
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 235 place count 102 transition count 223
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 237 place count 101 transition count 223
Performed 44 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 325 place count 57 transition count 178
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 326 place count 57 transition count 177
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 337 place count 46 transition count 121
Iterating global reduction 4 with 11 rules applied. Total rules applied 348 place count 46 transition count 121
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 353 place count 46 transition count 116
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 5 with 4 rules applied. Total rules applied 357 place count 44 transition count 114
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 359 place count 42 transition count 112
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 360 place count 41 transition count 112
Applied a total of 360 rules in 25 ms. Remains 41 /216 variables (removed 175) and now considering 112/350 (removed 238) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10665541045959903662.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6891203323270691510.kers'
[2026-05-22 20:20:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10665541045959903662.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6891203323270691510.kers]
Normalized transition count is 111 out of 112 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 111 rows 40 cols 752 entries
Finished phase 1 with 33 SingleSign rule and 0 generalized
[2026-05-22 20:20:17] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6891203323270691510.kers
Total runtime 1 ms.
[2026-05-22 20:20:17] [INFO ] Implicit Places using invariants in 72 ms returned []
[2026-05-22 20:20:17] [INFO ] Invariant cache hit.
[2026-05-22 20:20:17] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-22 20:20:17] [INFO ] Implicit Places using invariants and state equation in 135 ms returned [37, 40]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 209 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 39/216 places, 112/350 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 37 transition count 110
Applied a total of 4 rules in 3 ms. Remains 37 /39 variables (removed 2) and now considering 110/112 (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-12380151621880739049.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8961228665611659040.kers'
[2026-05-22 20:20:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12380151621880739049.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8961228665611659040.kers]
Normalized transition count is 109 out of 110 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 109 rows 37 cols 750 entries
Finished phase 1 with 31 SingleSign rule and 0 generalized
[2026-05-22 20:20:17] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8961228665611659040.kers
Total runtime 1 ms.
[2026-05-22 20:20:17] [INFO ] Implicit Places using invariants in 93 ms returned []
[2026-05-22 20:20:17] [INFO ] Invariant cache hit.
[2026-05-22 20:20:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-22 20:20:17] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 207 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 37/216 places, 110/350 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 444 ms. Remains : 37/216 places, 110/350 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-05b-LTLFireability-11
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-05b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-05b-LTLFireability-11 finished in 526 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)&&F(p1))))'
Support contains 5 out of 216 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 216/216 places, 350/350 transitions.
Graph (trivial) has 199 edges and 216 vertex of which 4 / 216 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 80 transitions
Trivial Post-agglo rules discarded 80 transitions
Performed 80 trivial Post agglomeration. Transition count delta: 80
Iterating post reduction 0 with 80 rules applied. Total rules applied 81 place count 213 transition count 267
Reduce places removed 80 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 1 with 109 rules applied. Total rules applied 190 place count 133 transition count 238
Reduce places removed 17 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 18 rules applied. Total rules applied 208 place count 116 transition count 237
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 209 place count 115 transition count 237
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 209 place count 115 transition count 230
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 223 place count 108 transition count 230
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 228 place count 103 transition count 225
Iterating global reduction 4 with 5 rules applied. Total rules applied 233 place count 103 transition count 225
Performed 44 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 4 with 88 rules applied. Total rules applied 321 place count 59 transition count 180
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 322 place count 59 transition count 179
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 332 place count 49 transition count 129
Iterating global reduction 5 with 10 rules applied. Total rules applied 342 place count 49 transition count 129
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 347 place count 49 transition count 124
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 6 with 4 rules applied. Total rules applied 351 place count 47 transition count 122
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 353 place count 45 transition count 120
Applied a total of 353 rules in 21 ms. Remains 45 /216 variables (removed 171) and now considering 120/350 (removed 230) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1319545575275696220.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15933781315998786604.kers'
[2026-05-22 20:20:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1319545575275696220.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15933781315998786604.kers]
Normalized transition count is 119 out of 120 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 119 rows 43 cols 844 entries
Finished phase 1 with 36 SingleSign rule and 0 generalized
[2026-05-22 20:20:17] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15933781315998786604.kers
Total runtime 1 ms.
[2026-05-22 20:20:18] [INFO ] Implicit Places using invariants in 68 ms returned []
[2026-05-22 20:20:18] [INFO ] Invariant cache hit.
[2026-05-22 20:20:18] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-22 20:20:18] [INFO ] Implicit Places using invariants and state equation in 123 ms returned [41, 44]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 195 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 43/216 places, 120/350 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 41 transition count 118
Applied a total of 4 rules in 6 ms. Remains 41 /43 variables (removed 2) and now considering 118/120 (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-4502276378925705839.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16733272067720168117.kers'
[2026-05-22 20:20:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4502276378925705839.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16733272067720168117.kers]
Normalized transition count is 117 out of 118 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 117 rows 40 cols 844 entries
Finished phase 1 with 34 SingleSign rule and 0 generalized
[2026-05-22 20:20:18] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-16733272067720168117.kers
Total runtime 1 ms.
[2026-05-22 20:20:18] [INFO ] Implicit Places using invariants in 73 ms returned []
[2026-05-22 20:20:18] [INFO ] Invariant cache hit.
[2026-05-22 20:20:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-22 20:20:18] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 181 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 41/216 places, 118/350 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 403 ms. Remains : 41/216 places, 118/350 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)&&F(p1))))'
Stuttering acceptance computed with spot in 127 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-05b-LTLFireability-12
Product exploration explored 100000 steps with 45 reset in 91 ms.
Product exploration explored 100000 steps with 225 reset in 99 ms.
Computed a total of 2 stabilizing places and 3 stable transitions
Computed a total of 2 stabilizing places and 3 stable transitions
Knowledge based reduction with 5 factoid took 56 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
RANDOM walk for 40000 steps (2382 resets) in 415 ms. (96 steps per ms) remains 1/2 properties
BEST_FIRST walk for 35988 steps (283 resets) in 58 ms. (609 steps per ms) remains 0/1 properties
Knowledge based reduction with 5 factoid took 98 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 133 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Knowledge-based reduction took 424 ms.
Stuttering acceptance computed with spot in 144 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 5 out of 41 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 41/41 places, 118/118 transitions.
Applied a total of 0 rules in 3 ms. Remains 41 /41 variables (removed 0) and now considering 118/118 (removed 0) transitions.
[2026-05-22 20:20:19] [INFO ] Invariant cache hit.
[2026-05-22 20:20:19] [INFO ] Implicit Places using invariants in 71 ms returned []
[2026-05-22 20:20:19] [INFO ] Invariant cache hit.
[2026-05-22 20:20:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-22 20:20:19] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 221 ms to find 0 implicit places.
[2026-05-22 20:20:19] [INFO ] Redundant transitions in 19 ms returned []
Running 116 sub problems to find dead transitions.
[2026-05-22 20:20:19] [INFO ] Invariant cache hit.
[2026-05-22 20:20:19] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (OVERLAPS) 1/41 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 4 (OVERLAPS) 117/158 variables, 41/48 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/158 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 8 (OVERLAPS) 1/159 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/159 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 10 (OVERLAPS) 0/159 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/159 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 12 (OVERLAPS) 0/159 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Real declared 159/159 variables, and 52 constraints, problems are : Problem set: 0 solved, 116 unsolved in 10368 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 41/41 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 116 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (OVERLAPS) 1/41 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (OVERLAPS) 117/158 variables, 41/49 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 116/165 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/158 variables, 2/167 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/158 variables, 3/170 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/158 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 10 (OVERLAPS) 1/159 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/159 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 12 (OVERLAPS) 0/159 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Int declared 159/159 variables, and 171 constraints, problems are : Problem set: 0 solved, 116 unsolved in 13951 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 41/41 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 5/5 constraints]
After SMT, in 24449ms problems are : Problem set: 0 solved, 116 unsolved
Search for dead transitions found 0 dead transitions in 24451ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 24699 ms. Remains : 41/41 places, 118/118 transitions.
Computed a total of 2 stabilizing places and 3 stable transitions
Computed a total of 2 stabilizing places and 3 stable transitions
Knowledge based reduction with 5 factoid took 56 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
RANDOM walk for 40000 steps (2390 resets) in 422 ms. (94 steps per ms) remains 1/2 properties
BEST_FIRST walk for 38955 steps (309 resets) in 101 ms. (381 steps per ms) remains 0/1 properties
Knowledge based reduction with 5 factoid took 105 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 158 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Knowledge-based reduction took 481 ms.
Stuttering acceptance computed with spot in 128 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 131 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 2 reset in 142 ms.
Product exploration explored 100000 steps with 18 reset in 151 ms.
Built C files in :
/tmp/ltsmin4786571365709162999
[2026-05-22 20:20:45] [INFO ] Computing symmetric may disable matrix : 118 transitions.
[2026-05-22 20:20:45] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 20:20:45] [INFO ] Computing symmetric may enable matrix : 118 transitions.
[2026-05-22 20:20:45] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 20:20:45] [INFO ] Computing Do-Not-Accords matrix : 118 transitions.
[2026-05-22 20:20:45] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 20:20:45] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4786571365709162999
Running compilation step : cd /tmp/ltsmin4786571365709162999;'/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 489 ms.
Running link step : cd /tmp/ltsmin4786571365709162999;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin4786571365709162999;'/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/stateBased10428441981688806211.hoa' '--buchi-type=spotba'
LTSmin run took 849 ms.
FORMULA AutonomousCar-PT-05b-LTLFireability-12 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property AutonomousCar-PT-05b-LTLFireability-12 finished in 28511 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(G((X((X(X(p1))&&p0)) U p2))) U (p2 U G(p3))))'
Support contains 9 out of 216 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 216/216 places, 350/350 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 208 transition count 342
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 208 transition count 342
Applied a total of 16 rules in 5 ms. Remains 208 /216 variables (removed 8) and now considering 342/350 (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-9124148921736783287.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8042455142567254210.kers'
[2026-05-22 20:20:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9124148921736783287.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8042455142567254210.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 342 rows 208 cols 1629 entries
Finished phase 1 with 198 SingleSign rule and 0 generalized
[2026-05-22 20:20:46] [INFO ] Computed 10 invariants in 1 ms
Computed 10 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-8042455142567254210.kers
Total runtime 2 ms.
[2026-05-22 20:20:46] [INFO ] Implicit Places using invariants in 107 ms returned []
[2026-05-22 20:20:46] [INFO ] Invariant cache hit.
[2026-05-22 20:20:46] [INFO ] Implicit Places using invariants and state equation in 338 ms returned []
Implicit Place search using SMT with State Equation took 447 ms to find 0 implicit places.
Running 341 sub problems to find dead transitions.
[2026-05-22 20:20:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/207 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 1 (OVERLAPS) 1/208 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/208 variables, 14/44 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 4/48 constraints. Problems are: Problem set: 0 solved, 341 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 208/550 variables, and 48 constraints, problems are : Problem set: 0 solved, 341 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/208 constraints, PredecessorRefiner: 341/341 constraints, Known Traps: 38/38 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 341 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/207 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 1 (OVERLAPS) 1/208 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 38/48 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/208 variables, 2/50 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 5 (OVERLAPS) 342/550 variables, 208/258 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/550 variables, 341/599 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/550 variables, 1/600 constraints. Problems are: Problem set: 0 solved, 341 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 550/550 variables, and 600 constraints, problems are : Problem set: 0 solved, 341 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 208/208 constraints, PredecessorRefiner: 341/341 constraints, Known Traps: 41/41 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60188ms problems are : Problem set: 0 solved, 341 unsolved
Search for dead transitions found 0 dead transitions in 60189ms
Starting structural reductions in LTL mode, iteration 1 : 208/216 places, 342/350 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60643 ms. Remains : 208/216 places, 342/350 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(G((X((X(X(p1))&&p0)) U p2))) U (p2 U G(p3))))'
Stuttering acceptance computed with spot in 579 ms :[(NOT p3), (NOT p2), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p0) (NOT p1)), true, (NOT p1), (NOT p1), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (NOT p3), (AND (NOT p1) (NOT p3)), (AND (NOT p3) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-05b-LTLFireability-13
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-05b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-05b-LTLFireability-13 finished in 61291 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' '!((((p0 U G(!p1)) U p2)&&X(X((p1 U p3)))))'
Support contains 7 out of 216 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 216/216 places, 350/350 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 209 transition count 343
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 209 transition count 343
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 208 transition count 342
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 208 transition count 342
Applied a total of 16 rules in 11 ms. Remains 208 /216 variables (removed 8) and now considering 342/350 (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-11153128454783184050.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4897004278200925493.kers'
[2026-05-22 20:21:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11153128454783184050.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4897004278200925493.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 342 rows 208 cols 1629 entries
Finished phase 1 with 198 SingleSign rule and 0 generalized
[2026-05-22 20:21:47] [INFO ] Computed 10 invariants in 3 ms
Computed 10 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-4897004278200925493.kers
Total runtime 4 ms.
[2026-05-22 20:21:47] [INFO ] Implicit Places using invariants in 175 ms returned []
[2026-05-22 20:21:47] [INFO ] Invariant cache hit.
[2026-05-22 20:21:48] [INFO ] Implicit Places using invariants and state equation in 387 ms returned []
Implicit Place search using SMT with State Equation took 566 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 208/216 places, 342/350 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 578 ms. Remains : 208/216 places, 342/350 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' '!((((p0 U G(!p1)) U p2)&&X(X((p1 U p3)))))'
Stuttering acceptance computed with spot in 341 ms :[(OR (NOT p2) (NOT p3)), true, p1, (NOT p2), (NOT p3), p1, (NOT p3)]
Running random walk in product with property : AutonomousCar-PT-05b-LTLFireability-14
Entered a terminal (fully accepting) state of product in 355 steps with 4 reset in 2 ms.
FORMULA AutonomousCar-PT-05b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-05b-LTLFireability-14 finished in 981 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(p0)&&G(p1))))'
Support contains 11 out of 216 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 216/216 places, 350/350 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 208 transition count 342
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 208 transition count 342
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 207 transition count 341
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 207 transition count 341
Applied a total of 18 rules in 11 ms. Remains 207 /216 variables (removed 9) and now considering 341/350 (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-9251362457433384139.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17863266085634168895.kers'
[2026-05-22 20:21:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9251362457433384139.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17863266085634168895.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 341 rows 207 cols 1627 entries
Finished phase 1 with 197 SingleSign rule and 0 generalized
[2026-05-22 20:21:48] [INFO ] Computed 10 invariants in 3 ms
Computed 10 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-17863266085634168895.kers
Total runtime 4 ms.
[2026-05-22 20:21:48] [INFO ] Implicit Places using invariants in 151 ms returned []
[2026-05-22 20:21:48] [INFO ] Invariant cache hit.
[2026-05-22 20:21:49] [INFO ] Implicit Places using invariants and state equation in 304 ms returned []
Implicit Place search using SMT with State Equation took 458 ms to find 0 implicit places.
Running 340 sub problems to find dead transitions.
[2026-05-22 20:21:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/206 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 1 (OVERLAPS) 1/207 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/207 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/207 variables, 20/50 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/207 variables, 18/68 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/207 variables, 3/71 constraints. Problems are: Problem set: 0 solved, 340 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 207/548 variables, and 71 constraints, problems are : Problem set: 0 solved, 340 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/207 constraints, PredecessorRefiner: 340/340 constraints, Known Traps: 61/61 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 340 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/206 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 1 (OVERLAPS) 1/207 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/207 variables, 61/71 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/207 variables, 4/75 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/207 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 5 (OVERLAPS) 341/548 variables, 207/282 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/548 variables, 340/622 constraints. Problems are: Problem set: 0 solved, 340 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 548/548 variables, and 624 constraints, problems are : Problem set: 0 solved, 340 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 207/207 constraints, PredecessorRefiner: 340/340 constraints, Known Traps: 65/65 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 60181ms problems are : Problem set: 0 solved, 340 unsolved
Search for dead transitions found 0 dead transitions in 60182ms
Starting structural reductions in LTL mode, iteration 1 : 207/216 places, 341/350 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60652 ms. Remains : 207/216 places, 341/350 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(p0)&&G(p1))))'
Stuttering acceptance computed with spot in 183 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : AutonomousCar-PT-05b-LTLFireability-15
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-05b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-05b-LTLFireability-15 finished in 60883 ms.
All properties solved by simple procedures.
Total runtime 667474 ms.
BK_STOP 1779481369688
--------------------
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-05b"
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-05b, 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-177946787900076"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/AutonomousCar-PT-05b.tgz
mv AutonomousCar-PT-05b 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 ;