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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 744K
-rw-r--r-- 1 mcc users 7.7K Mar 5 16:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K Mar 5 16:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Mar 5 16:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Mar 5 16:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Mar 15 07:20 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 15 07:20 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 07:20 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 07:20 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Mar 5 16:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 123K Mar 5 16:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Mar 5 16:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K Mar 5 16:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 07:20 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 07:20 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 276K 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-07a-LTLFireability-00
FORMULA_NAME AutonomousCar-PT-07a-LTLFireability-01
FORMULA_NAME AutonomousCar-PT-07a-LTLFireability-02
FORMULA_NAME AutonomousCar-PT-07a-LTLFireability-03
FORMULA_NAME AutonomousCar-PT-07a-LTLFireability-04
FORMULA_NAME AutonomousCar-PT-07a-LTLFireability-05
FORMULA_NAME AutonomousCar-PT-07a-LTLFireability-06
FORMULA_NAME AutonomousCar-PT-07a-LTLFireability-07
FORMULA_NAME AutonomousCar-PT-07a-LTLFireability-08
FORMULA_NAME AutonomousCar-PT-07a-LTLFireability-09
FORMULA_NAME AutonomousCar-PT-07a-LTLFireability-10
FORMULA_NAME AutonomousCar-PT-07a-LTLFireability-11
FORMULA_NAME AutonomousCar-PT-07a-LTLFireability-12
FORMULA_NAME AutonomousCar-PT-07a-LTLFireability-13
FORMULA_NAME AutonomousCar-PT-07a-LTLFireability-14
FORMULA_NAME AutonomousCar-PT-07a-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779488523184

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-07a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-22 22:22:05] [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 22:22:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-22 22:22:05] [INFO ] Load time of PNML (sax parser for PT used): 220 ms
[2026-05-22 22:22:05] [INFO ] Transformed 73 places.
[2026-05-22 22:22:05] [INFO ] Transformed 593 transitions.
[2026-05-22 22:22:05] [INFO ] Found NUPN structural information;
[2026-05-22 22:22:05] [INFO ] Parsed PT model containing 73 places and 593 transitions and 5357 arcs in 445 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Ensure Unique test removed 213 transitions
Reduce redundant transitions removed 213 transitions.
FORMULA AutonomousCar-PT-07a-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-07a-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-07a-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-07a-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-07a-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 37 out of 73 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 380/380 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 71 transition count 371
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 71 transition count 371
Applied a total of 4 rules in 34 ms. Remains 71 /73 variables (removed 2) and now considering 371/380 (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-3991353605740671198.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4043612869210080039.kers'
[2026-05-22 22:22:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3991353605740671198.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4043612869210080039.kers]
Normalized transition count is 370 out of 371 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 370 rows 70 cols 3310 entries
Finished phase 1 with 60 SingleSign rule and 0 generalized
[2026-05-22 22:22:06] [INFO ] Computed 11 invariants in 2 ms
Computed 11 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-4043612869210080039.kers
Total runtime 3 ms.
[2026-05-22 22:22:06] [INFO ] Implicit Places using invariants in 308 ms returned []
[2026-05-22 22:22:06] [INFO ] Invariant cache hit.
[2026-05-22 22:22:06] [INFO ] State equation strengthened by 192 read => feed constraints.
[2026-05-22 22:22:06] [INFO ] Implicit Places using invariants and state equation in 386 ms returned [67, 69]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 767 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 69/73 places, 371/380 transitions.
Applied a total of 0 rules in 8 ms. Remains 69 /69 variables (removed 0) and now considering 371/371 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 836 ms. Remains : 69/73 places, 371/380 transitions.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 371/371 transitions.
Applied a total of 0 rules in 5 ms. Remains 69 /69 variables (removed 0) and now considering 371/371 (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-11736059813015820282.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8132365386056283755.kers'
[2026-05-22 22:22:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11736059813015820282.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8132365386056283755.kers]
Normalized transition count is 370 out of 371 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 1 ms.
// Phase 1: matrix 370 rows 68 cols 3303 entries
Finished phase 1 with 60 SingleSign rule and 0 generalized
[2026-05-22 22:22:06] [INFO ] Computed 9 invariants in 4 ms
Computed 9 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-8132365386056283755.kers
Total runtime 5 ms.
[2026-05-22 22:22:07] [INFO ] Implicit Places using invariants in 97 ms returned []
[2026-05-22 22:22:07] [INFO ] Invariant cache hit.
[2026-05-22 22:22:07] [INFO ] State equation strengthened by 192 read => feed constraints.
[2026-05-22 22:22:07] [INFO ] Implicit Places using invariants and state equation in 323 ms returned []
Implicit Place search using SMT with State Equation took 424 ms to find 0 implicit places.
Running 370 sub problems to find dead transitions.
[2026-05-22 22:22:07] [INFO ] Invariant cache hit.
[2026-05-22 22:22:07] [INFO ] State equation strengthened by 192 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 1 (OVERLAPS) 1/69 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 3 (OVERLAPS) 370/439 variables, 69/78 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/439 variables, 191/269 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/439 variables, 3/272 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/439 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 370 unsolved
SMT process timed out in 31462ms, After SMT, problems are : Problem set: 0 solved, 370 unsolved
Search for dead transitions found 0 dead transitions in 31502ms
Finished structural reductions in LTL mode , in 1 iterations and 31984 ms. Remains : 69/69 places, 371/371 transitions.
Support contains 37 out of 69 places after structural reductions.
[2026-05-22 22:22:39] [INFO ] Flatten gal took : 180 ms
[2026-05-22 22:22:39] [INFO ] Flatten gal took : 109 ms
[2026-05-22 22:22:39] [INFO ] Input system was already deterministic with 371 transitions.
Reduction of identical properties reduced properties to check from 27 to 26
RANDOM walk for 40000 steps (2138 resets) in 3376 ms. (11 steps per ms) remains 8/26 properties
BEST_FIRST walk for 40003 steps (165 resets) in 141 ms. (281 steps per ms) remains 5/8 properties
BEST_FIRST walk for 40004 steps (60 resets) in 112 ms. (354 steps per ms) remains 3/5 properties
BEST_FIRST walk for 40003 steps (171 resets) in 97 ms. (408 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (156 resets) in 106 ms. (373 steps per ms) remains 3/3 properties
[2026-05-22 22:22:40] [INFO ] Invariant cache hit.
[2026-05-22 22:22:40] [INFO ] State equation strengthened by 192 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 25/33 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 27/60 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 362/422 variables, 60/69 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/422 variables, 191/260 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/422 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 13/435 variables, 5/265 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/435 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 4/439 variables, 4/269 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/439 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 1/440 variables, 1/270 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/440 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/440 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 440/440 variables, and 270 constraints, problems are : Problem set: 0 solved, 3 unsolved in 976 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 69/69 constraints, ReadFeed: 192/192 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 25/33 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 27/60 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 362/422 variables, 60/69 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/422 variables, 191/260 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/422 variables, 4/264 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/422 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 13/435 variables, 5/269 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/435 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 4/439 variables, 4/273 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/439 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 1/440 variables, 1/274 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/440 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/440 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 440/440 variables, and 274 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1505 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 69/69 constraints, ReadFeed: 192/192 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 2516ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 1129 ms.
Support contains 8 out of 69 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 69/69 places, 371/371 transitions.
Graph (complete) has 661 edges and 69 vertex of which 68 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 68 transition count 359
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 20 place count 60 transition count 359
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 20 place count 60 transition count 358
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 22 place count 59 transition count 358
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 27 place count 54 transition count 325
Iterating global reduction 2 with 5 rules applied. Total rules applied 32 place count 54 transition count 325
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 38 place count 51 transition count 322
Free-agglomeration rule applied 7 times.
Iterating global reduction 2 with 7 rules applied. Total rules applied 45 place count 51 transition count 315
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 2 with 49 rules applied. Total rules applied 94 place count 44 transition count 273
Applied a total of 94 rules in 128 ms. Remains 44 /69 variables (removed 25) and now considering 273/371 (removed 98) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 128 ms. Remains : 44/69 places, 273/371 transitions.
RANDOM walk for 40000 steps (64 resets) in 393 ms. (101 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40002 steps (196 resets) in 76 ms. (519 steps per ms) remains 1/2 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6062255002912226236.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4892038669570887451.kers'
[2026-05-22 22:22:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6062255002912226236.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4892038669570887451.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 273 rows 42 cols 2824 entries
Finished phase 1 with 33 SingleSign rule and 0 generalized
[2026-05-22 22:22:44] [INFO ] Computed 11 invariants in 2 ms
Computed 11 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-4892038669570887451.kers
Total runtime 3 ms.
[2026-05-22 22:22:44] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 13/17 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 27/44 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 273/317 variables, 44/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/317 variables, 120/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/317 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/317 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 317/317 variables, and 175 constraints, problems are : Problem set: 0 solved, 1 unsolved in 203 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 44/44 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 13/17 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 27/44 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 273/317 variables, 44/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/317 variables, 120/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/317 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/317 variables, 5/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/317 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/317 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/317 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 317/317 variables, and 182 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1864 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 44/44 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 6/6 constraints]
After SMT, in 2086ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 40 ms.
Support contains 4 out of 44 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 44/44 places, 273/273 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 43 transition count 265
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 43 transition count 265
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 43 transition count 264
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 11 place count 42 transition count 257
Applied a total of 11 rules in 41 ms. Remains 42 /44 variables (removed 2) and now considering 257/273 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 42/44 places, 257/273 transitions.
RANDOM walk for 40000 steps (22 resets) in 367 ms. (108 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (273 resets) in 94 ms. (421 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 165842 steps, run visited all 1 properties in 341 ms. (steps per millisecond=486 )
Probabilistic random walk after 165842 steps, saw 24512 distinct states, run finished after 347 ms. (steps per millisecond=477 ) properties seen :1
FORMULA AutonomousCar-PT-07a-LTLFireability-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 3 stabilizing places and 2 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' '!(((p0 U (F(p2)&&p1))||X(X(G(p3)))))'
Support contains 8 out of 69 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 371/371 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 65 transition count 339
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 65 transition count 339
Applied a total of 8 rules in 6 ms. Remains 65 /69 variables (removed 4) and now considering 339/371 (removed 32) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12380806178268487924.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15706807279844698064.kers'
[2026-05-22 22:22:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12380806178268487924.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15706807279844698064.kers]
Normalized transition count is 338 out of 339 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 338 rows 64 cols 3127 entries
Finished phase 1 with 56 SingleSign rule and 0 generalized
[2026-05-22 22:22:48] [INFO ] Computed 9 invariants in 2 ms
Computed 9 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-15706807279844698064.kers
Total runtime 3 ms.
[2026-05-22 22:22:48] [INFO ] Implicit Places using invariants in 167 ms returned []
[2026-05-22 22:22:48] [INFO ] Invariant cache hit.
[2026-05-22 22:22:48] [INFO ] State equation strengthened by 164 read => feed constraints.
[2026-05-22 22:22:48] [INFO ] Implicit Places using invariants and state equation in 374 ms returned []
Implicit Place search using SMT with State Equation took 545 ms to find 0 implicit places.
Running 338 sub problems to find dead transitions.
[2026-05-22 22:22:48] [INFO ] Invariant cache hit.
[2026-05-22 22:22:48] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 1 (OVERLAPS) 1/65 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 3 (OVERLAPS) 338/403 variables, 65/74 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/403 variables, 163/237 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/403 variables, 3/240 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/403 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 7 (OVERLAPS) 1/404 variables, 1/241 constraints. Problems are: Problem set: 0 solved, 338 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 404/404 variables, and 241 constraints, problems are : Problem set: 0 solved, 338 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 65/65 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 338/47 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 338 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 1 (OVERLAPS) 1/65 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 4 (OVERLAPS) 338/403 variables, 65/77 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/403 variables, 163/240 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/403 variables, 47/287 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/403 variables, 6/293 constraints. Problems are: Problem set: 0 solved, 338 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 403/404 variables, and 293 constraints, problems are : Problem set: 0 solved, 338 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 65/65 constraints, ReadFeed: 163/164 constraints, PredecessorRefiner: 338/47 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 6/6 constraints]
After SMT, in 60932ms problems are : Problem set: 0 solved, 338 unsolved
Search for dead transitions found 0 dead transitions in 60938ms
Starting structural reductions in LTL mode, iteration 1 : 65/69 places, 339/371 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61493 ms. Remains : 65/69 places, 339/371 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 (F(p2)&&p1))||X(X(G(p3)))))'
Stuttering acceptance computed with spot in 876 ms :[true, (OR (NOT p1) (NOT p2)), (NOT p3), (NOT p3), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (NOT p2), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : AutonomousCar-PT-07a-LTLFireability-00
Entered a terminal (fully accepting) state of product in 1521 steps with 88 reset in 40 ms.
FORMULA AutonomousCar-PT-07a-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-07a-LTLFireability-00 finished in 62566 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 4 out of 69 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 69/69 places, 371/371 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 69 transition count 362
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 60 transition count 362
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 18 place count 60 transition count 361
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 20 place count 59 transition count 361
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 25 place count 54 transition count 321
Iterating global reduction 2 with 5 rules applied. Total rules applied 30 place count 54 transition count 321
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 2 with 4 rules applied. Total rules applied 34 place count 52 transition count 319
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 36 place count 51 transition count 319
Applied a total of 36 rules in 102 ms. Remains 51 /69 variables (removed 18) and now considering 319/371 (removed 52) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6070200553440577179.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1759415488422322735.kers'
[2026-05-22 22:23:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6070200553440577179.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1759415488422322735.kers]
Normalized transition count is 318 out of 319 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 318 rows 50 cols 3064 entries
Finished phase 1 with 42 SingleSign rule and 0 generalized
[2026-05-22 22:23:50] [INFO ] Computed 9 invariants in 2 ms
Computed 9 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-1759415488422322735.kers
Total runtime 4 ms.
[2026-05-22 22:23:50] [INFO ] Implicit Places using invariants in 128 ms returned []
[2026-05-22 22:23:50] [INFO ] Invariant cache hit.
[2026-05-22 22:23:50] [INFO ] State equation strengthened by 159 read => feed constraints.
[2026-05-22 22:23:51] [INFO ] Implicit Places using invariants and state equation in 297 ms returned []
Implicit Place search using SMT with State Equation took 429 ms to find 0 implicit places.
[2026-05-22 22:23:51] [INFO ] Redundant transitions in 43 ms returned []
Running 318 sub problems to find dead transitions.
[2026-05-22 22:23:51] [INFO ] Invariant cache hit.
[2026-05-22 22:23:51] [INFO ] State equation strengthened by 159 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 1 (OVERLAPS) 1/51 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 3 (OVERLAPS) 318/369 variables, 51/60 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/369 variables, 158/218 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/369 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/369 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 7 (OVERLAPS) 1/370 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 318 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 370/370 variables, and 220 constraints, problems are : Problem set: 0 solved, 318 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 51/51 constraints, ReadFeed: 159/159 constraints, PredecessorRefiner: 318/86 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 318 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 1 (OVERLAPS) 1/51 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 4 (OVERLAPS) 318/369 variables, 51/61 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/369 variables, 158/219 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/369 variables, 86/305 constraints. Problems are: Problem set: 0 solved, 318 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 369/370 variables, and 305 constraints, problems are : Problem set: 0 solved, 318 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 51/51 constraints, ReadFeed: 158/159 constraints, PredecessorRefiner: 318/86 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60567ms problems are : Problem set: 0 solved, 318 unsolved
Search for dead transitions found 0 dead transitions in 60569ms
Starting structural reductions in SI_LTL mode, iteration 1 : 51/69 places, 319/371 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61152 ms. Remains : 51/69 places, 319/371 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-07a-LTLFireability-02
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-07a-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-07a-LTLFireability-02 finished in 61266 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(p0))) U ((X(X(X(p0)))&&G(!p1))||X(X(X(G(p0)))))))'
Support contains 13 out of 69 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 371/371 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 63 transition count 323
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 63 transition count 323
Applied a total of 12 rules in 33 ms. Remains 63 /69 variables (removed 6) and now considering 323/371 (removed 48) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10726463828566794810.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2335730443360656731.kers'
[2026-05-22 22:24:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10726463828566794810.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2335730443360656731.kers]
Normalized transition count is 322 out of 323 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 322 rows 62 cols 3039 entries
Finished phase 1 with 54 SingleSign rule and 0 generalized
[2026-05-22 22:24:51] [INFO ] Computed 9 invariants in 2 ms
Computed 9 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-2335730443360656731.kers
Total runtime 3 ms.
[2026-05-22 22:24:52] [INFO ] Implicit Places using invariants in 276 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 279 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 62/69 places, 323/371 transitions.
Applied a total of 0 rules in 5 ms. Remains 62 /62 variables (removed 0) and now considering 323/323 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 318 ms. Remains : 62/69 places, 323/371 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(p0))) U (X(X(X(G(p0))))||(X(X(X(p0)))&&G(!p1)))))'
Stuttering acceptance computed with spot in 529 ms :[(NOT p0), (NOT p0), (AND (NOT p0) p1), (NOT p0), (AND (NOT p0) p1), (AND p1 (NOT p0)), (NOT p0), true, (AND p1 (NOT p0)), (AND p1 p0)]
Running random walk in product with property : AutonomousCar-PT-07a-LTLFireability-03
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-07a-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-07a-LTLFireability-03 finished in 923 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G((F(p2)&&p1)))))'
Support contains 6 out of 69 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 69/69 places, 371/371 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 69 transition count 364
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 8 rules applied. Total rules applied 15 place count 62 transition count 363
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 16 place count 61 transition count 363
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 16 place count 61 transition count 362
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 18 place count 60 transition count 362
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 24 place count 54 transition count 314
Iterating global reduction 3 with 6 rules applied. Total rules applied 30 place count 54 transition count 314
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 3 with 4 rules applied. Total rules applied 34 place count 52 transition count 312
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
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 36 place count 51 transition count 312
Applied a total of 36 rules in 48 ms. Remains 51 /69 variables (removed 18) and now considering 312/371 (removed 59) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18268301648298846228.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1954595680827298102.kers'
[2026-05-22 22:24:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18268301648298846228.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1954595680827298102.kers]
Normalized transition count is 311 out of 312 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 311 rows 50 cols 3022 entries
Finished phase 1 with 42 SingleSign rule and 0 generalized
[2026-05-22 22:24:52] [INFO ] Computed 9 invariants in 2 ms
Computed 9 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-1954595680827298102.kers
Total runtime 3 ms.
[2026-05-22 22:24:53] [INFO ] Implicit Places using invariants in 219 ms returned []
[2026-05-22 22:24:53] [INFO ] Invariant cache hit.
[2026-05-22 22:24:53] [INFO ] State equation strengthened by 152 read => feed constraints.
[2026-05-22 22:24:53] [INFO ] Implicit Places using invariants and state equation in 340 ms returned []
Implicit Place search using SMT with State Equation took 561 ms to find 0 implicit places.
[2026-05-22 22:24:53] [INFO ] Redundant transitions in 20 ms returned []
Running 311 sub problems to find dead transitions.
[2026-05-22 22:24:53] [INFO ] Invariant cache hit.
[2026-05-22 22:24:53] [INFO ] State equation strengthened by 152 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 1 (OVERLAPS) 1/51 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 3 (OVERLAPS) 311/362 variables, 51/60 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/362 variables, 151/211 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/362 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/362 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 7 (OVERLAPS) 1/363 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/363 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 311 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 363/363 variables, and 213 constraints, problems are : Problem set: 0 solved, 311 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 51/51 constraints, ReadFeed: 152/152 constraints, PredecessorRefiner: 311/183 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 311 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 1 (OVERLAPS) 1/51 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 4 (OVERLAPS) 311/362 variables, 51/61 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/362 variables, 151/212 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/362 variables, 183/395 constraints. Problems are: Problem set: 0 solved, 311 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 362/363 variables, and 395 constraints, problems are : Problem set: 0 solved, 311 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 51/51 constraints, ReadFeed: 151/152 constraints, PredecessorRefiner: 311/183 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60742ms problems are : Problem set: 0 solved, 311 unsolved
Search for dead transitions found 0 dead transitions in 60743ms
Starting structural reductions in SI_LTL mode, iteration 1 : 51/69 places, 312/371 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61380 ms. Remains : 51/69 places, 312/371 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((F(p1)&&p0))||p2)))'
Stuttering acceptance computed with spot in 90 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-07a-LTLFireability-07
Stuttering criterion allowed to conclude after 21 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-07a-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-07a-LTLFireability-07 finished in 61519 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)))&&F((X(X(p3))&&p2))))'
Support contains 6 out of 69 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 371/371 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 65 transition count 339
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 65 transition count 339
Applied a total of 8 rules in 5 ms. Remains 65 /69 variables (removed 4) and now considering 339/371 (removed 32) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12524193073466180192.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11633781350375695357.kers'
[2026-05-22 22:25:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12524193073466180192.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11633781350375695357.kers]
Normalized transition count is 338 out of 339 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 338 rows 64 cols 3127 entries
Finished phase 1 with 56 SingleSign rule and 0 generalized
[2026-05-22 22:25:54] [INFO ] Computed 9 invariants in 2 ms
Computed 9 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-11633781350375695357.kers
Total runtime 3 ms.
[2026-05-22 22:25:54] [INFO ] Implicit Places using invariants in 185 ms returned []
[2026-05-22 22:25:54] [INFO ] Invariant cache hit.
[2026-05-22 22:25:54] [INFO ] State equation strengthened by 164 read => feed constraints.
[2026-05-22 22:25:54] [INFO ] Implicit Places using invariants and state equation in 315 ms returned []
Implicit Place search using SMT with State Equation took 522 ms to find 0 implicit places.
Running 338 sub problems to find dead transitions.
[2026-05-22 22:25:54] [INFO ] Invariant cache hit.
[2026-05-22 22:25:54] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 1 (OVERLAPS) 1/65 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 3 (OVERLAPS) 338/403 variables, 65/74 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/403 variables, 163/237 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/403 variables, 3/240 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/403 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 7 (OVERLAPS) 1/404 variables, 1/241 constraints. Problems are: Problem set: 0 solved, 338 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 404/404 variables, and 241 constraints, problems are : Problem set: 0 solved, 338 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 65/65 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 338/47 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 338 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 1 (OVERLAPS) 1/65 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 4 (OVERLAPS) 338/403 variables, 65/77 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/403 variables, 163/240 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/403 variables, 47/287 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/403 variables, 6/293 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/403 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 338 unsolved
SMT process timed out in 60577ms, After SMT, problems are : Problem set: 0 solved, 338 unsolved
Search for dead transitions found 0 dead transitions in 60580ms
Starting structural reductions in LTL mode, iteration 1 : 65/69 places, 339/371 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61109 ms. Remains : 65/69 places, 339/371 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)))&&F((X(X(p3))&&p2))))'
Stuttering acceptance computed with spot in 377 ms :[(OR (NOT p2) (NOT p3) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p0)), (OR (NOT p2) (NOT p3)), (NOT p3), (NOT p1), (NOT p3), (NOT p3)]
Running random walk in product with property : AutonomousCar-PT-07a-LTLFireability-08
Stuttering criterion allowed to conclude after 26 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-07a-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-07a-LTLFireability-08 finished in 61543 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 U p1)&&X(p2))))'
Support contains 12 out of 69 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 371/371 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 63 transition count 323
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 63 transition count 323
Applied a total of 12 rules in 5 ms. Remains 63 /69 variables (removed 6) and now considering 323/371 (removed 48) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5739554089035968230.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1196177489672762967.kers'
[2026-05-22 22:26:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5739554089035968230.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1196177489672762967.kers]
Normalized transition count is 322 out of 323 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 322 rows 62 cols 3039 entries
Finished phase 1 with 54 SingleSign rule and 0 generalized
[2026-05-22 22:26:55] [INFO ] Computed 9 invariants in 2 ms
Computed 9 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-1196177489672762967.kers
Total runtime 3 ms.
[2026-05-22 22:26:55] [INFO ] Implicit Places using invariants in 103 ms returned []
[2026-05-22 22:26:55] [INFO ] Invariant cache hit.
[2026-05-22 22:26:56] [INFO ] State equation strengthened by 150 read => feed constraints.
[2026-05-22 22:26:56] [INFO ] Implicit Places using invariants and state equation in 369 ms returned []
Implicit Place search using SMT with State Equation took 484 ms to find 0 implicit places.
Running 322 sub problems to find dead transitions.
[2026-05-22 22:26:56] [INFO ] Invariant cache hit.
[2026-05-22 22:26:56] [INFO ] State equation strengthened by 150 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 3 (OVERLAPS) 322/385 variables, 63/72 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/385 variables, 149/221 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/385 variables, 3/224 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/385 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 7 (OVERLAPS) 1/386 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 322 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 386/386 variables, and 225 constraints, problems are : Problem set: 0 solved, 322 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 63/63 constraints, ReadFeed: 150/150 constraints, PredecessorRefiner: 322/194 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 322 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 4 (OVERLAPS) 322/385 variables, 63/75 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/385 variables, 149/224 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/385 variables, 194/418 constraints. Problems are: Problem set: 0 solved, 322 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 385/386 variables, and 424 constraints, problems are : Problem set: 0 solved, 322 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 63/63 constraints, ReadFeed: 149/150 constraints, PredecessorRefiner: 322/194 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 6/6 constraints]
After SMT, in 60989ms problems are : Problem set: 0 solved, 322 unsolved
Search for dead transitions found 0 dead transitions in 60992ms
Starting structural reductions in LTL mode, iteration 1 : 63/69 places, 323/371 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61483 ms. Remains : 63/69 places, 323/371 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 U p1)&&X(p2))))'
Stuttering acceptance computed with spot in 251 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), true, (NOT p1), (NOT p2)]
Running random walk in product with property : AutonomousCar-PT-07a-LTLFireability-09
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-07a-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-07a-LTLFireability-09 finished in 61788 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 U (!p1&&G(!p2)))))'
Support contains 8 out of 69 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 69/69 places, 371/371 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 69 transition count 364
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 62 transition count 364
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 14 place count 62 transition count 363
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 16 place count 61 transition count 363
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 21 place count 56 transition count 323
Iterating global reduction 2 with 5 rules applied. Total rules applied 26 place count 56 transition count 323
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 28 place count 55 transition count 322
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 30 place count 54 transition count 322
Applied a total of 30 rules in 62 ms. Remains 54 /69 variables (removed 15) and now considering 322/371 (removed 49) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10675924648969709905.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17376641476257312153.kers'
[2026-05-22 22:27:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10675924648969709905.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17376641476257312153.kers]
Normalized transition count is 321 out of 322 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 1 ms.
// Phase 1: matrix 321 rows 53 cols 3070 entries
Finished phase 1 with 45 SingleSign rule and 0 generalized
[2026-05-22 22:27:57] [INFO ] Computed 9 invariants in 3 ms
Computed 9 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-17376641476257312153.kers
Total runtime 4 ms.
[2026-05-22 22:27:57] [INFO ] Implicit Places using invariants in 169 ms returned []
[2026-05-22 22:27:57] [INFO ] Invariant cache hit.
[2026-05-22 22:27:58] [INFO ] State equation strengthened by 159 read => feed constraints.
[2026-05-22 22:27:58] [INFO ] Implicit Places using invariants and state equation in 381 ms returned []
Implicit Place search using SMT with State Equation took 553 ms to find 0 implicit places.
[2026-05-22 22:27:58] [INFO ] Redundant transitions in 28 ms returned []
Running 321 sub problems to find dead transitions.
[2026-05-22 22:27:58] [INFO ] Invariant cache hit.
[2026-05-22 22:27:58] [INFO ] State equation strengthened by 159 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 1 (OVERLAPS) 1/54 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 3 (OVERLAPS) 321/375 variables, 54/63 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/375 variables, 158/221 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/375 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 6 (OVERLAPS) 1/376 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/376 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 321 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 376/376 variables, and 222 constraints, problems are : Problem set: 0 solved, 321 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 54/54 constraints, ReadFeed: 159/159 constraints, PredecessorRefiner: 321/89 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 321 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 1 (OVERLAPS) 1/54 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 3 (OVERLAPS) 321/375 variables, 54/63 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/375 variables, 158/221 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/375 variables, 89/310 constraints. Problems are: Problem set: 0 solved, 321 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 375/376 variables, and 310 constraints, problems are : Problem set: 0 solved, 321 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 54/54 constraints, ReadFeed: 158/159 constraints, PredecessorRefiner: 321/89 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60824ms problems are : Problem set: 0 solved, 321 unsolved
Search for dead transitions found 0 dead transitions in 60828ms
Starting structural reductions in SI_LTL mode, iteration 1 : 54/69 places, 322/371 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61482 ms. Remains : 54/69 places, 322/371 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 U (!p1&&G(!p2)))))'
Stuttering acceptance computed with spot in 190 ms :[(OR p1 p2), true, p2, (OR p2 p1), p2]
Running random walk in product with property : AutonomousCar-PT-07a-LTLFireability-10
Product exploration explored 100000 steps with 4 reset in 281 ms.
Product exploration explored 100000 steps with 68 reset in 317 ms.
Computed a total of 5 stabilizing places and 6 stable transitions
Computed a total of 5 stabilizing places and 6 stable transitions
Knowledge based reduction with 21 factoid took 94 ms. Reduced automaton from 5 states, 15 edges and 3 AP (stutter insensitive) to 5 states, 15 edges and 3 AP (stutter insensitive).
RANDOM walk for 40000 steps (2705 resets) in 898 ms. (44 steps per ms) remains 7/12 properties
BEST_FIRST walk for 40004 steps (197 resets) in 224 ms. (177 steps per ms) remains 4/7 properties
BEST_FIRST walk for 40003 steps (178 resets) in 406 ms. (98 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (206 resets) in 562 ms. (71 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (179 resets) in 184 ms. (216 steps per ms) remains 4/4 properties
[2026-05-22 22:29:00] [INFO ] Invariant cache hit.
[2026-05-22 22:29:00] [INFO ] State equation strengthened by 159 read => feed constraints.
Problem apf9 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 22/30 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 20/50 variables, 4/9 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 319/369 variables, 50/59 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/369 variables, 158/217 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/369 variables, 0/217 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 6/375 variables, 4/221 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/375 variables, 0/221 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 1/376 variables, 1/222 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/376 variables, 0/222 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/376 variables, 0/222 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 376/376 variables, and 222 constraints, problems are : Problem set: 1 solved, 3 unsolved in 321 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 54/54 constraints, ReadFeed: 159/159 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 22/30 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 20/50 variables, 4/9 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 319/369 variables, 50/59 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/369 variables, 158/217 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/369 variables, 5/222 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/369 variables, 0/222 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 6/375 variables, 4/226 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/375 variables, 0/226 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 1/376 variables, 1/227 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/376 variables, 0/227 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/376 variables, 0/227 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 376/376 variables, and 227 constraints, problems are : Problem set: 1 solved, 3 unsolved in 1153 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 54/54 constraints, ReadFeed: 159/159 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 5/5 constraints]
After SMT, in 1502ms problems are : Problem set: 1 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 116 ms.
Support contains 8 out of 54 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 54/54 places, 322/322 transitions.
Graph (complete) has 610 edges and 54 vertex of which 53 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 53 transition count 319
Free-agglomeration rule applied 7 times.
Iterating global reduction 1 with 7 rules applied. Total rules applied 10 place count 53 transition count 312
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 52 place count 46 transition count 277
Applied a total of 52 rules in 48 ms. Remains 46 /54 variables (removed 8) and now considering 277/322 (removed 45) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 46/54 places, 277/322 transitions.
RANDOM walk for 23995 steps (554 resets) in 481 ms. (49 steps per ms) remains 0/3 properties
Found 1 invariant AP formulas.
Negative knowledge disproves property using: (G (OR p0 (AND (NOT p1) (NOT p2))))
Knowledge based reduction with 22 factoid took 83 ms. Proved property starting from automaton with 5 states, 15 edges and 3 AP (stutter insensitive
Knowledge-based reduction took 2793 ms.
FORMULA AutonomousCar-PT-07a-LTLFireability-10 FALSE TECHNIQUES NEGATIVE_KNOWLEDGE
Treatment of property AutonomousCar-PT-07a-LTLFireability-10 finished in 65116 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 4 out of 69 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 69/69 places, 371/371 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 69 transition count 362
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 60 transition count 362
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 18 place count 60 transition count 361
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 20 place count 59 transition count 361
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 25 place count 54 transition count 321
Iterating global reduction 2 with 5 rules applied. Total rules applied 30 place count 54 transition count 321
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 2 with 4 rules applied. Total rules applied 34 place count 52 transition count 319
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 36 place count 51 transition count 319
Applied a total of 36 rules in 48 ms. Remains 51 /69 variables (removed 18) and now considering 319/371 (removed 52) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17456683932323669366.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6177326458962336661.kers'
[2026-05-22 22:29:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17456683932323669366.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6177326458962336661.kers]
Normalized transition count is 318 out of 319 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 318 rows 50 cols 3064 entries
Finished phase 1 with 42 SingleSign rule and 0 generalized
[2026-05-22 22:29:02] [INFO ] Computed 9 invariants in 3 ms
Computed 9 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-6177326458962336661.kers
Total runtime 5 ms.
[2026-05-22 22:29:02] [INFO ] Implicit Places using invariants in 165 ms returned []
[2026-05-22 22:29:02] [INFO ] Invariant cache hit.
[2026-05-22 22:29:03] [INFO ] State equation strengthened by 159 read => feed constraints.
[2026-05-22 22:29:03] [INFO ] Implicit Places using invariants and state equation in 387 ms returned []
Implicit Place search using SMT with State Equation took 555 ms to find 0 implicit places.
[2026-05-22 22:29:03] [INFO ] Redundant transitions in 24 ms returned []
Running 318 sub problems to find dead transitions.
[2026-05-22 22:29:03] [INFO ] Invariant cache hit.
[2026-05-22 22:29:03] [INFO ] State equation strengthened by 159 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 1 (OVERLAPS) 1/51 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 3 (OVERLAPS) 318/369 variables, 51/60 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/369 variables, 158/218 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/369 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/369 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 7 (OVERLAPS) 1/370 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 318 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 370/370 variables, and 220 constraints, problems are : Problem set: 0 solved, 318 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 51/51 constraints, ReadFeed: 159/159 constraints, PredecessorRefiner: 318/86 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 318 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 1 (OVERLAPS) 1/51 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 4 (OVERLAPS) 318/369 variables, 51/61 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/369 variables, 158/219 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/369 variables, 86/305 constraints. Problems are: Problem set: 0 solved, 318 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 369/370 variables, and 305 constraints, problems are : Problem set: 0 solved, 318 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 51/51 constraints, ReadFeed: 158/159 constraints, PredecessorRefiner: 318/86 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61355ms problems are : Problem set: 0 solved, 318 unsolved
Search for dead transitions found 0 dead transitions in 61358ms
Starting structural reductions in SI_LTL mode, iteration 1 : 51/69 places, 319/371 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61994 ms. Remains : 51/69 places, 319/371 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 40 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-07a-LTLFireability-11
Product exploration explored 100000 steps with 108 reset in 139 ms.
Stuttering criterion allowed to conclude after 349 steps with 16 reset in 3 ms.
FORMULA AutonomousCar-PT-07a-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-07a-LTLFireability-11 finished in 62214 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||G(p1))))))'
Support contains 5 out of 69 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 371/371 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 64 transition count 331
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 64 transition count 331
Applied a total of 10 rules in 4 ms. Remains 64 /69 variables (removed 5) and now considering 331/371 (removed 40) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13162314598860107732.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7865489413964217932.kers'
[2026-05-22 22:30:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13162314598860107732.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7865489413964217932.kers]
Normalized transition count is 330 out of 331 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 330 rows 63 cols 3083 entries
Finished phase 1 with 55 SingleSign rule and 0 generalized
[2026-05-22 22:30:04] [INFO ] Computed 9 invariants in 2 ms
Computed 9 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-7865489413964217932.kers
Total runtime 3 ms.
[2026-05-22 22:30:05] [INFO ] Implicit Places using invariants in 123 ms returned []
[2026-05-22 22:30:05] [INFO ] Invariant cache hit.
[2026-05-22 22:30:05] [INFO ] State equation strengthened by 157 read => feed constraints.
[2026-05-22 22:30:05] [INFO ] Implicit Places using invariants and state equation in 339 ms returned []
Implicit Place search using SMT with State Equation took 464 ms to find 0 implicit places.
Running 330 sub problems to find dead transitions.
[2026-05-22 22:30:05] [INFO ] Invariant cache hit.
[2026-05-22 22:30:05] [INFO ] State equation strengthened by 157 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 3 (OVERLAPS) 330/394 variables, 64/73 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/394 variables, 156/229 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/394 variables, 3/232 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/394 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 7 (OVERLAPS) 1/395 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 330 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 395/395 variables, and 233 constraints, problems are : Problem set: 0 solved, 330 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 64/64 constraints, ReadFeed: 157/157 constraints, PredecessorRefiner: 330/104 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 330 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 4 (OVERLAPS) 330/394 variables, 64/76 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/394 variables, 156/232 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/394 variables, 104/336 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/394 variables, 6/342 constraints. Problems are: Problem set: 0 solved, 330 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 394/395 variables, and 342 constraints, problems are : Problem set: 0 solved, 330 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 64/64 constraints, ReadFeed: 156/157 constraints, PredecessorRefiner: 330/104 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 6/6 constraints]
After SMT, in 60575ms problems are : Problem set: 0 solved, 330 unsolved
Search for dead transitions found 0 dead transitions in 60576ms
Starting structural reductions in LTL mode, iteration 1 : 64/69 places, 331/371 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61045 ms. Remains : 64/69 places, 331/371 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((G(p0)||p1)))))'
Stuttering acceptance computed with spot in 162 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-07a-LTLFireability-13
Product exploration explored 100000 steps with 144 reset in 383 ms.
Product exploration explored 100000 steps with 52 reset in 205 ms.
Computed a total of 3 stabilizing places and 2 stable transitions
Computed a total of 3 stabilizing places and 2 stable transitions
Knowledge based reduction with 5 factoid took 78 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (2129 resets) in 418 ms. (95 steps per ms) remains 1/4 properties
BEST_FIRST walk for 37118 steps (164 resets) in 87 ms. (421 steps per ms) remains 0/1 properties
Knowledge based reduction with 5 factoid took 131 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 138 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Knowledge-based reduction took 518 ms.
Stuttering acceptance computed with spot in 122 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 64 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 64/64 places, 331/331 transitions.
Applied a total of 0 rules in 2 ms. Remains 64 /64 variables (removed 0) and now considering 331/331 (removed 0) transitions.
[2026-05-22 22:31:07] [INFO ] Invariant cache hit.
[2026-05-22 22:31:07] [INFO ] Implicit Places using invariants in 166 ms returned []
[2026-05-22 22:31:07] [INFO ] Invariant cache hit.
[2026-05-22 22:31:07] [INFO ] State equation strengthened by 157 read => feed constraints.
[2026-05-22 22:31:08] [INFO ] Implicit Places using invariants and state equation in 390 ms returned []
Implicit Place search using SMT with State Equation took 558 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 560 ms. Remains : 64/64 places, 331/331 transitions.
Computed a total of 3 stabilizing places and 2 stable transitions
Computed a total of 3 stabilizing places and 2 stable transitions
Knowledge based reduction with 5 factoid took 74 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (2201 resets) in 336 ms. (118 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (182 resets) in 60 ms. (655 steps per ms) remains 1/1 properties
[2026-05-22 22:31:08] [INFO ] Invariant cache hit.
[2026-05-22 22:31:08] [INFO ] State equation strengthened by 157 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 14/18 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 37/55 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 322/377 variables, 55/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/377 variables, 156/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/377 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 13/390 variables, 5/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/390 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 4/394 variables, 4/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/394 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/395 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/395 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/395 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 395/395 variables, and 230 constraints, problems are : Problem set: 0 solved, 1 unsolved in 461 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 64/64 constraints, ReadFeed: 157/157 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 14/18 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 37/55 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 322/377 variables, 55/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/377 variables, 156/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/377 variables, 4/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/377 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 13/390 variables, 5/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/390 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 4/394 variables, 4/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/394 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/395 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/395 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/395 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 395/395 variables, and 234 constraints, problems are : Problem set: 0 solved, 1 unsolved in 952 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 64/64 constraints, ReadFeed: 157/157 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 1430ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 39 ms.
Support contains 4 out of 64 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 64/64 places, 331/331 transitions.
Graph (complete) has 616 edges and 64 vertex of which 63 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 63 transition count 319
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 20 place count 55 transition count 319
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 20 place count 55 transition count 318
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 22 place count 54 transition count 318
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 24 place count 52 transition count 309
Iterating global reduction 2 with 2 rules applied. Total rules applied 26 place count 52 transition count 309
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 32 place count 49 transition count 306
Free-agglomeration rule applied 7 times.
Iterating global reduction 2 with 7 rules applied. Total rules applied 39 place count 49 transition count 299
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 2 with 49 rules applied. Total rules applied 88 place count 42 transition count 257
Applied a total of 88 rules in 56 ms. Remains 42 /64 variables (removed 22) and now considering 257/331 (removed 74) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 42/64 places, 257/331 transitions.
RANDOM walk for 30033 steps (49 resets) in 241 ms. (124 steps per ms) remains 0/1 properties
Knowledge based reduction with 5 factoid took 156 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 154 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Knowledge-based reduction took 2108 ms.
Stuttering acceptance computed with spot in 158 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 8 reset in 160 ms.
Product exploration explored 100000 steps with 279 reset in 215 ms.
Spot run failed in 114 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/ltsmin4114349287178672942
[2026-05-22 22:31:11] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4114349287178672942
Running compilation step : cd /tmp/ltsmin4114349287178672942;'/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 1407 ms.
Running link step : cd /tmp/ltsmin4114349287178672942;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 83 ms.
Running LTSmin : cd /tmp/ltsmin4114349287178672942;'/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/stateBased2302776642302824619.hoa' '--buchi-type=spotba'
LTSmin run took 97 ms.
FORMULA AutonomousCar-PT-07a-LTLFireability-13 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property AutonomousCar-PT-07a-LTLFireability-13 finished in 67662 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(!p1) U ((!p2&&X(!p1))||X(G(!p1)))))) U (X(G((F(!p0)||(X(!p1) U ((!p2&&X(!p1))||X(G(!p1)))))))||(!p3&&X((F(!p0)||(X(!p1) U ((!p2&&X(!p1))||X(G(!p1)))))))))))'
Support contains 15 out of 69 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 371/371 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 65 transition count 339
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 65 transition count 339
Applied a total of 8 rules in 4 ms. Remains 65 /69 variables (removed 4) and now considering 339/371 (removed 32) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6219529344932338328.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11085761623591286109.kers'
[2026-05-22 22:31:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6219529344932338328.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11085761623591286109.kers]
Normalized transition count is 338 out of 339 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 338 rows 64 cols 3127 entries
Finished phase 1 with 56 SingleSign rule and 0 generalized
[2026-05-22 22:31:12] [INFO ] Computed 9 invariants in 2 ms
Computed 9 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-11085761623591286109.kers
Total runtime 3 ms.
[2026-05-22 22:31:12] [INFO ] Implicit Places using invariants in 102 ms returned []
[2026-05-22 22:31:12] [INFO ] Invariant cache hit.
[2026-05-22 22:31:12] [INFO ] State equation strengthened by 164 read => feed constraints.
[2026-05-22 22:31:13] [INFO ] Implicit Places using invariants and state equation in 302 ms returned []
Implicit Place search using SMT with State Equation took 407 ms to find 0 implicit places.
Running 338 sub problems to find dead transitions.
[2026-05-22 22:31:13] [INFO ] Invariant cache hit.
[2026-05-22 22:31:13] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 1 (OVERLAPS) 1/65 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 3 (OVERLAPS) 338/403 variables, 65/74 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/403 variables, 163/237 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/403 variables, 3/240 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/403 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 7 (OVERLAPS) 1/404 variables, 1/241 constraints. Problems are: Problem set: 0 solved, 338 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 404/404 variables, and 241 constraints, problems are : Problem set: 0 solved, 338 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 65/65 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 338/47 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 338 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 1 (OVERLAPS) 1/65 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 4 (OVERLAPS) 338/403 variables, 65/77 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/403 variables, 163/240 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/403 variables, 47/287 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/403 variables, 6/293 constraints. Problems are: Problem set: 0 solved, 338 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 403/404 variables, and 293 constraints, problems are : Problem set: 0 solved, 338 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 65/65 constraints, ReadFeed: 163/164 constraints, PredecessorRefiner: 338/47 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 6/6 constraints]
After SMT, in 60767ms problems are : Problem set: 0 solved, 338 unsolved
Search for dead transitions found 0 dead transitions in 60769ms
Starting structural reductions in LTL mode, iteration 1 : 65/69 places, 339/371 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61182 ms. Remains : 65/69 places, 339/371 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(!p0)||(X(!p1) U ((!p2&&X(!p1))||X(G(!p1)))))) U (X(G((F(!p0)||(X(!p1) U ((!p2&&X(!p1))||X(G(!p1)))))))||(!p3&&X((F(!p0)||(X(!p1) U ((!p2&&X(!p1))||X(G(!p1)))))))))))'
Stuttering acceptance computed with spot in 368 ms :[(AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1), p0, false]
Running random walk in product with property : AutonomousCar-PT-07a-LTLFireability-14
Product exploration explored 100000 steps with 33333 reset in 1685 ms.
Product exploration explored 100000 steps with 33333 reset in 1257 ms.
Computed a total of 3 stabilizing places and 2 stable transitions
Computed a total of 3 stabilizing places and 2 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 13 factoid took 13 ms. Proved property starting from automaton with 7 states, 15 edges and 4 AP (stutter sensitive
Knowledge-based reduction took 19 ms.
FORMULA AutonomousCar-PT-07a-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-07a-LTLFireability-14 finished in 64636 ms.
All properties solved by simple procedures.
Total runtime 611893 ms.

BK_STOP 1779489137293

--------------------
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-07a"
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-07a, 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-177946788000100"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/AutonomousCar-PT-07a.tgz
mv AutonomousCar-PT-07a 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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;