Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/sdalzilio/mcc2026-input.r002-oct2-177944366300484.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/sdalzilio/mcc2026-input.qcow2 backing_fmt=qcow2 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 AutoFlight-PT-03b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r002-oct2-177944366300484
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 6.6K Mar 5 16:35 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Mar 5 16:35 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Mar 5 16:35 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Mar 5 16:35 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Mar 15 07:13 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 15 07:13 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 07:13 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Mar 5 16:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Mar 5 16:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Mar 5 16:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 93K Mar 5 16:35 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 07:13 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 07:13 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 70K 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 AutoFlight-PT-03b-LTLFireability-00
FORMULA_NAME AutoFlight-PT-03b-LTLFireability-01
FORMULA_NAME AutoFlight-PT-03b-LTLFireability-02
FORMULA_NAME AutoFlight-PT-03b-LTLFireability-03
FORMULA_NAME AutoFlight-PT-03b-LTLFireability-04
FORMULA_NAME AutoFlight-PT-03b-LTLFireability-05
FORMULA_NAME AutoFlight-PT-03b-LTLFireability-06
FORMULA_NAME AutoFlight-PT-03b-LTLFireability-07
FORMULA_NAME AutoFlight-PT-03b-LTLFireability-08
FORMULA_NAME AutoFlight-PT-03b-LTLFireability-09
FORMULA_NAME AutoFlight-PT-03b-LTLFireability-10
FORMULA_NAME AutoFlight-PT-03b-LTLFireability-11
FORMULA_NAME AutoFlight-PT-03b-LTLFireability-12
FORMULA_NAME AutoFlight-PT-03b-LTLFireability-13
FORMULA_NAME AutoFlight-PT-03b-LTLFireability-14
FORMULA_NAME AutoFlight-PT-03b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779491248298

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutoFlight-PT-03b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-22 23:07:29] [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 23:07:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-22 23:07:30] [INFO ] Load time of PNML (sax parser for PT used): 79 ms
[2026-05-22 23:07:30] [INFO ] Transformed 298 places.
[2026-05-22 23:07:30] [INFO ] Transformed 296 transitions.
[2026-05-22 23:07:30] [INFO ] Found NUPN structural information;
[2026-05-22 23:07:30] [INFO ] Parsed PT model containing 298 places and 296 transitions and 692 arcs in 180 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA AutoFlight-PT-03b-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Initial state reduction rules removed 1 formulas.
FORMULA AutoFlight-PT-03b-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 40 out of 298 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 298/298 places, 296/296 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 268 transition count 266
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 268 transition count 266
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 65 place count 268 transition count 261
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 74 place count 259 transition count 252
Iterating global reduction 1 with 9 rules applied. Total rules applied 83 place count 259 transition count 252
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 84 place count 258 transition count 251
Iterating global reduction 1 with 1 rules applied. Total rules applied 85 place count 258 transition count 251
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 86 place count 257 transition count 250
Iterating global reduction 1 with 1 rules applied. Total rules applied 87 place count 257 transition count 250
Applied a total of 87 rules in 74 ms. Remains 257 /298 variables (removed 41) and now considering 250/296 (removed 46) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15805379781058148597.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10758049220545769090.kers'
[2026-05-22 23:07:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15805379781058148597.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10758049220545769090.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 250 rows 257 cols 600 entries
Finished phase 1 with 230 SingleSign rule and 5 generalized
[2026-05-22 23:07:30] [INFO ] Computed 22 invariants in 1 ms
Computed 22 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-10758049220545769090.kers
Total runtime 2 ms.
[2026-05-22 23:07:30] [INFO ] Implicit Places using invariants in 306 ms returned []
[2026-05-22 23:07:30] [INFO ] Invariant cache hit.
[2026-05-22 23:07:30] [INFO ] Implicit Places using invariants and state equation in 217 ms returned []
Implicit Place search using SMT with State Equation took 561 ms to find 0 implicit places.
Running 249 sub problems to find dead transitions.
[2026-05-22 23:07:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 1 (OVERLAPS) 1/257 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/257 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/257 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/257 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/257 variables, 9/71 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/257 variables, 7/78 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/257 variables, 3/81 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/257 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 9 (OVERLAPS) 250/507 variables, 257/338 constraints. Problems are: Problem set: 0 solved, 249 unsolved
SMT process timed out in 30108ms, After SMT, problems are : Problem set: 0 solved, 249 unsolved
Search for dead transitions found 0 dead transitions in 30127ms
Starting structural reductions in LTL mode, iteration 1 : 257/298 places, 250/296 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30818 ms. Remains : 257/298 places, 250/296 transitions.
Starting structural reductions in LTL mode, iteration 0 : 257/257 places, 250/250 transitions.
Applied a total of 0 rules in 10 ms. Remains 257 /257 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2026-05-22 23:08:01] [INFO ] Invariant cache hit.
[2026-05-22 23:08:01] [INFO ] Implicit Places using invariants in 140 ms returned []
[2026-05-22 23:08:01] [INFO ] Invariant cache hit.
[2026-05-22 23:08:01] [INFO ] Implicit Places using invariants and state equation in 171 ms returned []
Implicit Place search using SMT with State Equation took 312 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 323 ms. Remains : 257/257 places, 250/250 transitions.
Support contains 40 out of 257 places after structural reductions.
[2026-05-22 23:08:01] [INFO ] Flatten gal took : 40 ms
[2026-05-22 23:08:01] [INFO ] Flatten gal took : 16 ms
[2026-05-22 23:08:01] [INFO ] Input system was already deterministic with 250 transitions.
RANDOM walk for 40000 steps (248 resets) in 2723 ms. (14 steps per ms) remains 7/37 properties
BEST_FIRST walk for 40003 steps (25 resets) in 160 ms. (248 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40003 steps (27 resets) in 114 ms. (347 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (25 resets) in 107 ms. (370 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (26 resets) in 151 ms. (263 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (27 resets) in 125 ms. (317 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (26 resets) in 133 ms. (298 steps per ms) remains 6/6 properties
[2026-05-22 23:08:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem AtomicPropp13 is UNSAT
At refinement iteration 1 (OVERLAPS) 245/254 variables, 20/20 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/254 variables, 4/24 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/254 variables, 0/24 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 3/257 variables, 2/26 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/257 variables, 3/29 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/257 variables, 0/29 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 250/507 variables, 257/286 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/507 variables, 0/286 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 0/507 variables, 0/286 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 507/507 variables, and 286 constraints, problems are : Problem set: 1 solved, 5 unsolved in 1163 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 257/257 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 71/77 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 2/5 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 177/254 variables, 17/22 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/254 variables, 5/27 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/254 variables, 2/29 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/254 variables, 0/29 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 3/257 variables, 2/31 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/257 variables, 1/32 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/257 variables, 0/32 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 250/507 variables, 257/289 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/507 variables, 5/294 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/507 variables, 0/294 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 0/507 variables, 0/294 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 507/507 variables, and 294 constraints, problems are : Problem set: 1 solved, 5 unsolved in 895 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 257/257 constraints, PredecessorRefiner: 5/6 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2081ms problems are : Problem set: 1 solved, 5 unsolved
Fused 5 Parikh solutions to 4 different solutions.
Finished Parikh walk after 8555 steps, including 60 resets, run visited all 3 properties in 36 ms. (steps per millisecond=237 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 5 properties in 221 ms.
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
Computed a total of 71 stabilizing places and 71 stable transitions
FORMULA AutoFlight-PT-03b-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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||G(p1))))'
Support contains 2 out of 257 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 257/257 places, 250/250 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 245 transition count 238
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 245 transition count 238
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 30 place count 239 transition count 232
Iterating global reduction 0 with 6 rules applied. Total rules applied 36 place count 239 transition count 232
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 38 place count 237 transition count 230
Iterating global reduction 0 with 2 rules applied. Total rules applied 40 place count 237 transition count 230
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 42 place count 235 transition count 228
Iterating global reduction 0 with 2 rules applied. Total rules applied 44 place count 235 transition count 228
Applied a total of 44 rules in 26 ms. Remains 235 /257 variables (removed 22) and now considering 228/250 (removed 22) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16334842062356057164.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8003595964635090413.kers'
[2026-05-22 23:08:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16334842062356057164.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8003595964635090413.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 228 rows 235 cols 556 entries
Finished phase 1 with 208 SingleSign rule and 5 generalized
[2026-05-22 23:08:06] [INFO ] Computed 22 invariants in 3 ms
Computed 22 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-8003595964635090413.kers
Total runtime 4 ms.
[2026-05-22 23:08:06] [INFO ] Implicit Places using invariants in 234 ms returned []
[2026-05-22 23:08:06] [INFO ] Invariant cache hit.
[2026-05-22 23:08:06] [INFO ] Implicit Places using invariants and state equation in 268 ms returned []
Implicit Place search using SMT with State Equation took 506 ms to find 0 implicit places.
Running 227 sub problems to find dead transitions.
[2026-05-22 23:08:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 1 (OVERLAPS) 1/235 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/235 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/235 variables, 7/69 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/235 variables, 2/71 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/235 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/235 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 9 (OVERLAPS) 228/463 variables, 235/307 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/463 variables, 2/309 constraints. Problems are: Problem set: 0 solved, 227 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 463/463 variables, and 309 constraints, problems are : Problem set: 0 solved, 227 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 235/235 constraints, PredecessorRefiner: 227/227 constraints, Known Traps: 52/52 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 227 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 1 (OVERLAPS) 1/235 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 52/74 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/235 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 5 (OVERLAPS) 228/463 variables, 235/309 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/463 variables, 227/536 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/463 variables, 6/542 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/463 variables, 1/543 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/463 variables, 7/550 constraints. Problems are: Problem set: 0 solved, 227 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 463/463 variables, and 550 constraints, problems are : Problem set: 0 solved, 227 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 235/235 constraints, PredecessorRefiner: 227/227 constraints, Known Traps: 59/59 constraints, Known Traps Along Path: 7/7 constraints]
After SMT, in 60075ms problems are : Problem set: 0 solved, 227 unsolved
Search for dead transitions found 0 dead transitions in 60077ms
Starting structural reductions in LTL mode, iteration 1 : 235/257 places, 228/250 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60612 ms. Remains : 235/257 places, 228/250 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||G(p1))))'
Stuttering acceptance computed with spot in 262 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : AutoFlight-PT-03b-LTLFireability-00
Entered a terminal (fully accepting) state of product in 142 steps with 0 reset in 9 ms.
FORMULA AutoFlight-PT-03b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-03b-LTLFireability-00 finished in 61004 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&&F(p2)) U p3))))'
Support contains 4 out of 257 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 257/257 places, 250/250 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 246 transition count 239
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 246 transition count 239
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 246 transition count 238
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 28 place count 241 transition count 233
Iterating global reduction 1 with 5 rules applied. Total rules applied 33 place count 241 transition count 233
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 35 place count 239 transition count 231
Iterating global reduction 1 with 2 rules applied. Total rules applied 37 place count 239 transition count 231
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 39 place count 237 transition count 229
Iterating global reduction 1 with 2 rules applied. Total rules applied 41 place count 237 transition count 229
Applied a total of 41 rules in 36 ms. Remains 237 /257 variables (removed 20) and now considering 229/250 (removed 21) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7322225158120638179.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4093639175058386126.kers'
[2026-05-22 23:09:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7322225158120638179.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4093639175058386126.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 229 rows 237 cols 558 entries
Finished phase 1 with 210 SingleSign rule and 5 generalized
[2026-05-22 23:09:06] [INFO ] Computed 22 invariants in 1 ms
Computed 22 P flows in 14 ms.
Exported basis to /tmp/petrispot-output-4093639175058386126.kers
Total runtime 15 ms.
[2026-05-22 23:09:07] [INFO ] Implicit Places using invariants in 94 ms returned []
[2026-05-22 23:09:07] [INFO ] Invariant cache hit.
[2026-05-22 23:09:07] [INFO ] Implicit Places using invariants and state equation in 190 ms returned []
Implicit Place search using SMT with State Equation took 285 ms to find 0 implicit places.
Running 228 sub problems to find dead transitions.
[2026-05-22 23:09:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 1 (OVERLAPS) 1/237 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/237 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/237 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/237 variables, 14/56 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 14/70 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/237 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/237 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 9 (OVERLAPS) 229/466 variables, 237/309 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/466 variables, 1/310 constraints. Problems are: Problem set: 0 solved, 228 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 466/466 variables, and 312 constraints, problems are : Problem set: 0 solved, 228 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 237/237 constraints, PredecessorRefiner: 228/228 constraints, Known Traps: 53/53 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 228 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 1 (OVERLAPS) 1/237 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/237 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/237 variables, 53/75 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/237 variables, 3/78 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/237 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 8 (OVERLAPS) 229/466 variables, 237/317 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/466 variables, 228/545 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/466 variables, 6/551 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/466 variables, 6/557 constraints. Problems are: Problem set: 0 solved, 228 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 466/466 variables, and 557 constraints, problems are : Problem set: 0 solved, 228 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 237/237 constraints, PredecessorRefiner: 228/228 constraints, Known Traps: 64/64 constraints, Known Traps Along Path: 6/6 constraints]
After SMT, in 60058ms problems are : Problem set: 0 solved, 228 unsolved
Search for dead transitions found 0 dead transitions in 60059ms
Starting structural reductions in LTL mode, iteration 1 : 237/257 places, 229/250 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60381 ms. Remains : 237/257 places, 229/250 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&&F(p2)) U p3))))'
Stuttering acceptance computed with spot in 196 ms :[(NOT p3), (NOT p3), true, (NOT p2), (NOT p3)]
Running random walk in product with property : AutoFlight-PT-03b-LTLFireability-01
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-03b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-03b-LTLFireability-01 finished in 60618 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)||X((F(p1)&&X(X(F(p2))))))))'
Support contains 2 out of 257 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 257/257 places, 250/250 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 86 transitions
Trivial Post-agglo rules discarded 86 transitions
Performed 86 trivial Post agglomeration. Transition count delta: 86
Iterating post reduction 0 with 86 rules applied. Total rules applied 86 place count 256 transition count 163
Reduce places removed 86 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 96 rules applied. Total rules applied 182 place count 170 transition count 153
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 7 rules applied. Total rules applied 189 place count 164 transition count 152
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 190 place count 163 transition count 152
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 35 Pre rules applied. Total rules applied 190 place count 163 transition count 117
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 4 with 70 rules applied. Total rules applied 260 place count 128 transition count 117
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 268 place count 120 transition count 109
Iterating global reduction 4 with 8 rules applied. Total rules applied 276 place count 120 transition count 109
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 276 place count 120 transition count 105
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 284 place count 116 transition count 105
Performed 41 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 41 places in 1 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 4 with 82 rules applied. Total rules applied 366 place count 75 transition count 58
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 367 place count 74 transition count 57
Reduce places removed 4 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 5 rules applied. Total rules applied 372 place count 70 transition count 56
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 373 place count 69 transition count 56
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 3 Pre rules applied. Total rules applied 373 place count 69 transition count 53
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 379 place count 66 transition count 53
Applied a total of 379 rules in 60 ms. Remains 66 /257 variables (removed 191) and now considering 53/250 (removed 197) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12015934009988431496.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11693547661208036500.kers'
[2026-05-22 23:10:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12015934009988431496.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11693547661208036500.kers]
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 0 ms.
// Phase 1: matrix 53 rows 58 cols 140 entries
Finished phase 1 with 43 SingleSign rule and 5 generalized
[2026-05-22 23:10:07] [INFO ] Computed 18 invariants in 0 ms
Computed 18 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-11693547661208036500.kers
Total runtime 0 ms.
[2026-05-22 23:10:07] [INFO ] Implicit Places using invariants in 53 ms returned [25, 36, 47, 51, 65]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 54 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 61/257 places, 53/250 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 58 transition count 50
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 58 transition count 50
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 57 transition count 49
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 57 transition count 49
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 56 transition count 48
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 56 transition count 48
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 55 transition count 47
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 55 transition count 47
Applied a total of 12 rules in 5 ms. Remains 55 /61 variables (removed 6) and now considering 47/53 (removed 6) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4149632726234286932.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18304800691481578505.kers'
[2026-05-22 23:10:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4149632726234286932.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18304800691481578505.kers]
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 0 ms.
// Phase 1: matrix 47 rows 47 cols 110 entries
Finished phase 1 with 42 SingleSign rule and 0 generalized
[2026-05-22 23:10:07] [INFO ] Computed 13 invariants in 0 ms
Computed 13 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-18304800691481578505.kers
Total runtime 3 ms.
[2026-05-22 23:10:07] [INFO ] Implicit Places using invariants in 49 ms returned []
[2026-05-22 23:10:07] [INFO ] Invariant cache hit.
[2026-05-22 23:10:07] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-22 23:10:07] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 138 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 55/257 places, 47/250 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 257 ms. Remains : 55/257 places, 47/250 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)||X((F(p1)&&X(X(F(p2))))))))'
Stuttering acceptance computed with spot in 253 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : AutoFlight-PT-03b-LTLFireability-02
Product exploration explored 100000 steps with 16165 reset in 223 ms.
Product exploration explored 100000 steps with 16045 reset in 155 ms.
Computed a total of 6 stabilizing places and 4 stable transitions
Computed a total of 6 stabilizing places and 4 stable transitions
Detected a total of 6/55 stabilizing places and 4/47 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge based reduction with 8 factoid took 112 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 5 edges and 3 AP (stutter insensitive).
RANDOM walk for 40000 steps (2268 resets) in 461 ms. (86 steps per ms) remains 1/5 properties
BEST_FIRST walk for 40003 steps (302 resets) in 179 ms. (222 steps per ms) remains 1/1 properties
[2026-05-22 23:10:08] [INFO ] Invariant cache hit.
[2026-05-22 23:10:08] [INFO ] State equation strengthened by 2 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 26/27 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 3/30 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 35/65 variables, 30/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/65 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 37/102 variables, 25/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/102 variables, 11/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/102 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/102 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 102/102 variables, and 70 constraints, problems are : Problem set: 0 solved, 1 unsolved in 50 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 55/55 constraints, ReadFeed: 2/2 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf2 is UNSAT
After SMT solving in domain Int declared 27/102 variables, and 1 constraints, problems are : Problem set: 1 solved, 0 unsolved in 24 ms.
Refiners :[Positive P Invariants (semi-flows): 1/13 constraints, State Equation: 0/55 constraints, ReadFeed: 0/2 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 77ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge based reduction with 9 factoid took 145 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 134 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Knowledge-based reduction took 663 ms.
Stuttering acceptance computed with spot in 137 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 2 out of 55 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 55/55 places, 47/47 transitions.
Applied a total of 0 rules in 4 ms. Remains 55 /55 variables (removed 0) and now considering 47/47 (removed 0) transitions.
[2026-05-22 23:10:09] [INFO ] Invariant cache hit.
[2026-05-22 23:10:09] [INFO ] Implicit Places using invariants in 83 ms returned []
[2026-05-22 23:10:09] [INFO ] Invariant cache hit.
[2026-05-22 23:10:09] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-22 23:10:09] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 202 ms to find 0 implicit places.
[2026-05-22 23:10:09] [INFO ] Redundant transitions in 0 ms returned []
Running 30 sub problems to find dead transitions.
[2026-05-22 23:10:09] [INFO ] Invariant cache hit.
[2026-05-22 23:10:09] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (OVERLAPS) 1/55 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (OVERLAPS) 47/102 variables, 55/69 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 2/71 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 8 (OVERLAPS) 0/102 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Real declared 102/102 variables, and 71 constraints, problems are : Problem set: 0 solved, 30 unsolved in 916 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 55/55 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 30 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (OVERLAPS) 1/55 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (OVERLAPS) 47/102 variables, 55/69 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 2/71 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 30/101 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/102 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 9 (OVERLAPS) 0/102 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Int declared 102/102 variables, and 101 constraints, problems are : Problem set: 0 solved, 30 unsolved in 757 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 55/55 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1686ms problems are : Problem set: 0 solved, 30 unsolved
Search for dead transitions found 0 dead transitions in 1686ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1902 ms. Remains : 55/55 places, 47/47 transitions.
Computed a total of 6 stabilizing places and 4 stable transitions
Computed a total of 6 stabilizing places and 4 stable transitions
Detected a total of 6/55 stabilizing places and 4/47 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge based reduction with 4 factoid took 122 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
RANDOM walk for 1494 steps (84 resets) in 6 ms. (213 steps per ms) remains 0/3 properties
Knowledge based reduction with 4 factoid took 199 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Knowledge-based reduction took 409 ms.
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 117 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 7544 reset in 148 ms.
Product exploration explored 100000 steps with 7555 reset in 174 ms.
Built C files in :
/tmp/ltsmin6848670544299932106
[2026-05-22 23:10:12] [INFO ] Computing symmetric may disable matrix : 47 transitions.
[2026-05-22 23:10:12] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 23:10:12] [INFO ] Computing symmetric may enable matrix : 47 transitions.
[2026-05-22 23:10:12] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 23:10:12] [INFO ] Computing Do-Not-Accords matrix : 47 transitions.
[2026-05-22 23:10:12] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 23:10:12] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6848670544299932106
Running compilation step : cd /tmp/ltsmin6848670544299932106;'/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 346 ms.
Running link step : cd /tmp/ltsmin6848670544299932106;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 74 ms.
Running LTSmin : cd /tmp/ltsmin6848670544299932106;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased2628370044624605267.hoa' '--buchi-type=spotba'
LTSmin run took 5248 ms.
FORMULA AutoFlight-PT-03b-LTLFireability-02 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property AutoFlight-PT-03b-LTLFireability-02 finished in 10371 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) U X(X(G(p1)))) U X(p2)))'
Support contains 3 out of 257 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 257/257 places, 250/250 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 244 transition count 237
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 244 transition count 237
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 244 transition count 236
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 33 place count 238 transition count 230
Iterating global reduction 1 with 6 rules applied. Total rules applied 39 place count 238 transition count 230
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 41 place count 236 transition count 228
Iterating global reduction 1 with 2 rules applied. Total rules applied 43 place count 236 transition count 228
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 45 place count 234 transition count 226
Iterating global reduction 1 with 2 rules applied. Total rules applied 47 place count 234 transition count 226
Applied a total of 47 rules in 33 ms. Remains 234 /257 variables (removed 23) and now considering 226/250 (removed 24) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8579829276701432442.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4412001304706283549.kers'
[2026-05-22 23:10:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8579829276701432442.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4412001304706283549.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 226 rows 234 cols 552 entries
Finished phase 1 with 207 SingleSign rule and 5 generalized
[2026-05-22 23:10:17] [INFO ] Computed 22 invariants in 0 ms
Computed 22 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4412001304706283549.kers
Total runtime 1 ms.
[2026-05-22 23:10:18] [INFO ] Implicit Places using invariants in 81 ms returned []
[2026-05-22 23:10:18] [INFO ] Invariant cache hit.
[2026-05-22 23:10:18] [INFO ] Implicit Places using invariants and state equation in 175 ms returned []
Implicit Place search using SMT with State Equation took 274 ms to find 0 implicit places.
Running 225 sub problems to find dead transitions.
[2026-05-22 23:10:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/233 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 1 (OVERLAPS) 1/234 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/234 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/234 variables, 7/49 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/234 variables, 10/59 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/234 variables, 6/65 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/234 variables, 5/70 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/234 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 9 (OVERLAPS) 226/460 variables, 234/304 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/460 variables, 2/306 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/460 variables, 1/307 constraints. Problems are: Problem set: 0 solved, 225 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 460/460 variables, and 307 constraints, problems are : Problem set: 0 solved, 225 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 234/234 constraints, PredecessorRefiner: 225/225 constraints, Known Traps: 51/51 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 225 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/233 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 1 (OVERLAPS) 1/234 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/234 variables, 51/73 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/234 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 5 (OVERLAPS) 226/460 variables, 234/307 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/460 variables, 225/532 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/460 variables, 3/535 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/460 variables, 1/536 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/460 variables, 2/538 constraints. Problems are: Problem set: 0 solved, 225 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 460/460 variables, and 543 constraints, problems are : Problem set: 0 solved, 225 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 234/234 constraints, PredecessorRefiner: 225/225 constraints, Known Traps: 57/57 constraints, Known Traps Along Path: 5/5 constraints]
After SMT, in 60070ms problems are : Problem set: 0 solved, 225 unsolved
Search for dead transitions found 0 dead transitions in 60083ms
Starting structural reductions in LTL mode, iteration 1 : 234/257 places, 226/250 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60393 ms. Remains : 234/257 places, 226/250 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0) U X(X(G(p1)))) U X(p2)))'
Stuttering acceptance computed with spot in 318 ms :[(NOT p2), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-03b-LTLFireability-03
Product exploration explored 100000 steps with 1140 reset in 178 ms.
Product exploration explored 100000 steps with 1134 reset in 152 ms.
Computed a total of 58 stabilizing places and 58 stable transitions
Computed a total of 58 stabilizing places and 58 stable transitions
Detected a total of 58/234 stabilizing places and 58/226 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge based reduction with 10 factoid took 93 ms. Reduced automaton from 7 states, 12 edges and 3 AP (stutter sensitive) to 7 states, 12 edges and 3 AP (stutter sensitive).
RANDOM walk for 10651 steps (64 resets) in 30 ms. (343 steps per ms) remains 0/5 properties
Knowledge based reduction with 10 factoid took 179 ms. Reduced automaton from 7 states, 12 edges and 3 AP (stutter sensitive) to 7 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 322 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
[2026-05-22 23:11:19] [INFO ] Invariant cache hit.
[2026-05-22 23:11:19] [INFO ] [Real]Absence check using 20 positive place invariants in 3 ms returned unsat
Proved EG (NOT p2) asserting that LTL formula F !(NOT p2) is false.
[2026-05-22 23:11:19] [INFO ] Invariant cache hit.
[2026-05-22 23:11:19] [INFO ] [Real]Absence check using 20 positive place invariants in 6 ms returned sat
[2026-05-22 23:11:19] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 5 ms returned sat
[2026-05-22 23:11:20] [INFO ] [Real]Absence check using state equation in 185 ms returned sat
[2026-05-22 23:11:20] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 23:11:20] [INFO ] [Nat]Absence check using 20 positive place invariants in 7 ms returned sat
[2026-05-22 23:11:20] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-22 23:11:20] [INFO ] [Nat]Absence check using state equation in 125 ms returned sat
[2026-05-22 23:11:20] [INFO ] Computed and/alt/rep : 225/322/225 causal constraints (skipped 0 transitions) in 13 ms.
[2026-05-22 23:11:21] [INFO ] Added : 199 causal constraints over 40 iterations in 1016 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Negative knowledge disproves property using: (F p2)
Knowledge-based reduction took 2392 ms.
FORMULA AutoFlight-PT-03b-LTLFireability-03 FALSE TECHNIQUES NEGATIVE_KNOWLEDGE
Treatment of property AutoFlight-PT-03b-LTLFireability-03 finished in 63512 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0&&X(F(p1))&&(p2 U (G(p2)||(p2&&G(!p3))))) U X(!p4)))'
Support contains 5 out of 257 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 257/257 places, 250/250 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 245 transition count 238
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 245 transition count 238
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 25 place count 245 transition count 237
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 31 place count 239 transition count 231
Iterating global reduction 1 with 6 rules applied. Total rules applied 37 place count 239 transition count 231
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 39 place count 237 transition count 229
Iterating global reduction 1 with 2 rules applied. Total rules applied 41 place count 237 transition count 229
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 43 place count 235 transition count 227
Iterating global reduction 1 with 2 rules applied. Total rules applied 45 place count 235 transition count 227
Applied a total of 45 rules in 28 ms. Remains 235 /257 variables (removed 22) and now considering 227/250 (removed 23) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2102208769875768121.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16127472803787162739.kers'
[2026-05-22 23:11:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2102208769875768121.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16127472803787162739.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 227 rows 235 cols 554 entries
Finished phase 1 with 208 SingleSign rule and 5 generalized
[2026-05-22 23:11:21] [INFO ] Computed 22 invariants in 1 ms
Computed 22 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-16127472803787162739.kers
Total runtime 2 ms.
[2026-05-22 23:11:21] [INFO ] Implicit Places using invariants in 120 ms returned []
[2026-05-22 23:11:21] [INFO ] Invariant cache hit.
[2026-05-22 23:11:21] [INFO ] Implicit Places using invariants and state equation in 189 ms returned []
Implicit Place search using SMT with State Equation took 327 ms to find 0 implicit places.
Running 226 sub problems to find dead transitions.
[2026-05-22 23:11:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 1 (OVERLAPS) 1/235 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/235 variables, 8/50 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/235 variables, 5/55 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/235 variables, 5/60 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/235 variables, 15/75 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/235 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 9 (OVERLAPS) 227/462 variables, 235/310 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/462 variables, 1/311 constraints. Problems are: Problem set: 0 solved, 226 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 462/462 variables, and 311 constraints, problems are : Problem set: 0 solved, 226 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 235/235 constraints, PredecessorRefiner: 226/226 constraints, Known Traps: 54/54 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 226 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 1 (OVERLAPS) 1/235 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 54/76 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/235 variables, 3/79 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/235 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 6 (OVERLAPS) 227/462 variables, 235/314 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/462 variables, 226/540 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/462 variables, 4/544 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/462 variables, 2/546 constraints. Problems are: Problem set: 0 solved, 226 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 462/462 variables, and 552 constraints, problems are : Problem set: 0 solved, 226 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 235/235 constraints, PredecessorRefiner: 226/226 constraints, Known Traps: 63/63 constraints, Known Traps Along Path: 6/6 constraints]
After SMT, in 60058ms problems are : Problem set: 0 solved, 226 unsolved
Search for dead transitions found 0 dead transitions in 60058ms
Starting structural reductions in LTL mode, iteration 1 : 235/257 places, 227/250 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60415 ms. Remains : 235/257 places, 227/250 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&&X(F(p1))&&(p2 U (G(p2)||(p2&&G(!p3))))) U X(!p4)))'
Stuttering acceptance computed with spot in 608 ms :[p4, p4, p4, (AND (NOT p2) p3 p4), (AND (NOT p2) p4), true, (NOT p1), p3, (NOT p2), (AND p3 (NOT p2))]
Running random walk in product with property : AutoFlight-PT-03b-LTLFireability-05
Product exploration explored 100000 steps with 50000 reset in 151 ms.
Product exploration explored 100000 steps with 50000 reset in 122 ms.
Computed a total of 59 stabilizing places and 59 stable transitions
Computed a total of 59 stabilizing places and 59 stable transitions
Detected a total of 59/235 stabilizing places and 59/227 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/5 atomic propositions.
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 38 factoid took 22 ms. Proved property starting from automaton with 10 states, 28 edges and 5 AP (stutter sensitive
Knowledge-based reduction took 34 ms.
FORMULA AutoFlight-PT-03b-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutoFlight-PT-03b-LTLFireability-05 finished in 61416 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 257 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 257/257 places, 250/250 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 89 transitions
Trivial Post-agglo rules discarded 89 transitions
Performed 89 trivial Post agglomeration. Transition count delta: 89
Iterating post reduction 0 with 89 rules applied. Total rules applied 89 place count 256 transition count 160
Reduce places removed 89 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 99 rules applied. Total rules applied 188 place count 167 transition count 150
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 194 place count 161 transition count 150
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 33 Pre rules applied. Total rules applied 194 place count 161 transition count 117
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 260 place count 128 transition count 117
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 268 place count 120 transition count 109
Iterating global reduction 3 with 8 rules applied. Total rules applied 276 place count 120 transition count 109
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 276 place count 120 transition count 105
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 284 place count 116 transition count 105
Performed 43 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 43 places in 0 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 3 with 86 rules applied. Total rules applied 370 place count 73 transition count 56
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 371 place count 72 transition count 55
Reduce places removed 4 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 5 rules applied. Total rules applied 376 place count 68 transition count 54
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 377 place count 67 transition count 54
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 377 place count 67 transition count 51
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 383 place count 64 transition count 51
Applied a total of 383 rules in 27 ms. Remains 64 /257 variables (removed 193) and now considering 51/250 (removed 199) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15252654043442940470.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12368574445755379000.kers'
[2026-05-22 23:12:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15252654043442940470.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12368574445755379000.kers]
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 0 ms.
// Phase 1: matrix 51 rows 56 cols 136 entries
Finished phase 1 with 41 SingleSign rule and 5 generalized
[2026-05-22 23:12:22] [INFO ] Computed 18 invariants in 0 ms
Computed 18 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-12368574445755379000.kers
Total runtime 0 ms.
[2026-05-22 23:12:22] [INFO ] Implicit Places using invariants in 57 ms returned [25, 36, 47, 51, 56]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 57 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 59/257 places, 51/250 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 55 transition count 47
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 55 transition count 47
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 54 transition count 46
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 54 transition count 46
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 53 transition count 45
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 53 transition count 45
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 52 transition count 44
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 52 transition count 44
Applied a total of 14 rules in 5 ms. Remains 52 /59 variables (removed 7) and now considering 44/51 (removed 7) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1678878872179088997.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18102859689084664351.kers'
[2026-05-22 23:12:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1678878872179088997.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18102859689084664351.kers]
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 0 ms.
// Phase 1: matrix 44 rows 44 cols 108 entries
Finished phase 1 with 39 SingleSign rule and 0 generalized
[2026-05-22 23:12:22] [INFO ] Computed 13 invariants in 0 ms
Computed 13 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-18102859689084664351.kers
Total runtime 0 ms.
[2026-05-22 23:12:22] [INFO ] Implicit Places using invariants in 36 ms returned []
[2026-05-22 23:12:22] [INFO ] Invariant cache hit.
[2026-05-22 23:12:23] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-22 23:12:23] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 52/257 places, 44/250 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 208 ms. Remains : 52/257 places, 44/250 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 57 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-03b-LTLFireability-07
Stuttering criterion allowed to conclude after 46 steps with 7 reset in 0 ms.
FORMULA AutoFlight-PT-03b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-03b-LTLFireability-07 finished in 289 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 3 out of 257 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 257/257 places, 250/250 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 86 transitions
Trivial Post-agglo rules discarded 86 transitions
Performed 86 trivial Post agglomeration. Transition count delta: 86
Iterating post reduction 0 with 86 rules applied. Total rules applied 86 place count 256 transition count 163
Reduce places removed 86 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 95 rules applied. Total rules applied 181 place count 170 transition count 154
Reduce places removed 6 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 8 rules applied. Total rules applied 189 place count 164 transition count 152
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 192 place count 162 transition count 151
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 34 Pre rules applied. Total rules applied 192 place count 162 transition count 117
Deduced a syphon composed of 34 places in 1 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 4 with 68 rules applied. Total rules applied 260 place count 128 transition count 117
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 268 place count 120 transition count 109
Iterating global reduction 4 with 8 rules applied. Total rules applied 276 place count 120 transition count 109
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 276 place count 120 transition count 105
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 284 place count 116 transition count 105
Performed 43 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 43 places in 1 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 4 with 86 rules applied. Total rules applied 370 place count 73 transition count 56
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 371 place count 72 transition count 55
Reduce places removed 4 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 5 rules applied. Total rules applied 376 place count 68 transition count 54
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 377 place count 67 transition count 54
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 3 Pre rules applied. Total rules applied 377 place count 67 transition count 51
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 383 place count 64 transition count 51
Applied a total of 383 rules in 37 ms. Remains 64 /257 variables (removed 193) and now considering 51/250 (removed 199) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11536660783980713729.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14989329845706933271.kers'
[2026-05-22 23:12:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11536660783980713729.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14989329845706933271.kers]
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 0 ms.
// Phase 1: matrix 51 rows 56 cols 130 entries
Finished phase 1 with 46 SingleSign rule and 0 generalized
[2026-05-22 23:12:23] [INFO ] Computed 18 invariants in 0 ms
Computed 18 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-14989329845706933271.kers
Total runtime 0 ms.
[2026-05-22 23:12:23] [INFO ] Implicit Places using invariants in 47 ms returned [26, 37, 48, 52, 57, 63]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 55 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 58/257 places, 51/250 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 54 transition count 47
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 54 transition count 47
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 53 transition count 46
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 53 transition count 46
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 52 transition count 45
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 52 transition count 45
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 51 transition count 44
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 51 transition count 44
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 50 transition count 43
Applied a total of 16 rules in 5 ms. Remains 50 /58 variables (removed 8) and now considering 43/51 (removed 8) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14663860738032353490.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10409780947431040759.kers'
[2026-05-22 23:12:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14663860738032353490.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10409780947431040759.kers]
Culling duplicate invariants (modulo rational): removing 7 columns.
Culled 7 columns in 0 ms.
// Phase 1: matrix 43 rows 43 cols 104 entries
Finished phase 1 with 38 SingleSign rule and 0 generalized
[2026-05-22 23:12:23] [INFO ] Computed 12 invariants in 0 ms
Computed 12 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-10409780947431040759.kers
Total runtime 0 ms.
[2026-05-22 23:12:23] [INFO ] Implicit Places using invariants in 39 ms returned []
[2026-05-22 23:12:23] [INFO ] Invariant cache hit.
[2026-05-22 23:12:23] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-22 23:12:23] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 50/257 places, 43/250 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 186 ms. Remains : 50/257 places, 43/250 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Stuttering acceptance computed with spot in 95 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : AutoFlight-PT-03b-LTLFireability-08
Product exploration explored 100000 steps with 8145 reset in 171 ms.
Stack based approach found an accepted trace after 33177 steps with 2706 reset with depth 10 and stack size 10 in 60 ms.
FORMULA AutoFlight-PT-03b-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property AutoFlight-PT-03b-LTLFireability-08 finished in 535 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0)) U G((p1&&X(X(G(p2)))))))'
Support contains 3 out of 257 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 257/257 places, 250/250 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 244 transition count 237
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 244 transition count 237
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 244 transition count 236
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 32 place count 239 transition count 231
Iterating global reduction 1 with 5 rules applied. Total rules applied 37 place count 239 transition count 231
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 238 transition count 230
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 238 transition count 230
Applied a total of 39 rules in 22 ms. Remains 238 /257 variables (removed 19) and now considering 230/250 (removed 20) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13053188569473623972.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15416925979839966057.kers'
[2026-05-22 23:12:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13053188569473623972.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15416925979839966057.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 230 rows 238 cols 560 entries
Finished phase 1 with 211 SingleSign rule and 5 generalized
[2026-05-22 23:12:23] [INFO ] Computed 22 invariants in 1 ms
Computed 22 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15416925979839966057.kers
Total runtime 1 ms.
[2026-05-22 23:12:23] [INFO ] Implicit Places using invariants in 90 ms returned []
[2026-05-22 23:12:23] [INFO ] Invariant cache hit.
[2026-05-22 23:12:23] [INFO ] Implicit Places using invariants and state equation in 156 ms returned []
Implicit Place search using SMT with State Equation took 248 ms to find 0 implicit places.
Running 229 sub problems to find dead transitions.
[2026-05-22 23:12:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 1 (OVERLAPS) 1/238 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/238 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/238 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/238 variables, 11/53 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/238 variables, 17/70 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/238 variables, 5/75 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/238 variables, 2/77 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/238 variables, 6/83 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/238 variables, 3/86 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/238 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/238 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 12 (OVERLAPS) 230/468 variables, 238/325 constraints. Problems are: Problem set: 0 solved, 229 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 468/468 variables, and 325 constraints, problems are : Problem set: 0 solved, 229 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 238/238 constraints, PredecessorRefiner: 229/229 constraints, Known Traps: 65/65 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 229 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 1 (OVERLAPS) 1/238 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/238 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/238 variables, 65/87 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/238 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 5 (OVERLAPS) 230/468 variables, 238/325 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/468 variables, 229/554 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/468 variables, 2/556 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/468 variables, 2/558 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/468 variables, 2/560 constraints. Problems are: Problem set: 0 solved, 229 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 468/468 variables, and 560 constraints, problems are : Problem set: 0 solved, 229 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 238/238 constraints, PredecessorRefiner: 229/229 constraints, Known Traps: 71/71 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60050ms problems are : Problem set: 0 solved, 229 unsolved
Search for dead transitions found 0 dead transitions in 60051ms
Starting structural reductions in LTL mode, iteration 1 : 238/257 places, 230/250 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60321 ms. Remains : 238/257 places, 230/250 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0)) U G((p1&&X(X(G(p2)))))))'
Stuttering acceptance computed with spot in 319 ms :[(OR (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2)]
Running random walk in product with property : AutoFlight-PT-03b-LTLFireability-09
Product exploration explored 100000 steps with 1244 reset in 116 ms.
Product exploration explored 100000 steps with 1256 reset in 128 ms.
Computed a total of 62 stabilizing places and 62 stable transitions
Computed a total of 62 stabilizing places and 62 stable transitions
Detected a total of 62/238 stabilizing places and 62/230 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge based reduction with 14 factoid took 219 ms. Reduced automaton from 7 states, 31 edges and 3 AP (stutter sensitive) to 7 states, 31 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (249 resets) in 182 ms. (218 steps per ms) remains 4/9 properties
BEST_FIRST walk for 40003 steps (27 resets) in 148 ms. (268 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (26 resets) in 124 ms. (320 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (32 resets) in 119 ms. (333 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (26 resets) in 56 ms. (701 steps per ms) remains 4/4 properties
[2026-05-22 23:13:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 58/61 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 175/236 variables, 16/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/236 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 2/238 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/238 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/238 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 230/468 variables, 238/264 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/468 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/468 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 468/468 variables, and 264 constraints, problems are : Problem set: 0 solved, 4 unsolved in 750 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 238/238 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 58/61 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 175/236 variables, 16/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 4/25 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/236 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 2/238 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/238 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/238 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 230/468 variables, 238/265 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/468 variables, 4/269 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/468 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 0/468 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 468/468 variables, and 269 constraints, problems are : Problem set: 0 solved, 4 unsolved in 816 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 238/238 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1581ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 362 ms.
Support contains 3 out of 238 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 238/238 places, 230/230 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 80 transitions
Trivial Post-agglo rules discarded 80 transitions
Performed 80 trivial Post agglomeration. Transition count delta: 80
Iterating post reduction 0 with 80 rules applied. Total rules applied 80 place count 238 transition count 150
Reduce places removed 80 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 89 rules applied. Total rules applied 169 place count 158 transition count 141
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 175 place count 152 transition count 141
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 32 Pre rules applied. Total rules applied 175 place count 152 transition count 109
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 239 place count 120 transition count 109
Performed 45 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 3 with 90 rules applied. Total rules applied 329 place count 75 transition count 58
Free-agglomeration rule applied 12 times.
Iterating global reduction 3 with 12 rules applied. Total rules applied 341 place count 75 transition count 46
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 353 place count 63 transition count 46
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 354 place count 62 transition count 45
Reduce places removed 9 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 4 with 14 rules applied. Total rules applied 368 place count 53 transition count 40
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 373 place count 48 transition count 40
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 9 Pre rules applied. Total rules applied 373 place count 48 transition count 31
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 6 with 18 rules applied. Total rules applied 391 place count 39 transition count 31
Applied a total of 391 rules in 24 ms. Remains 39 /238 variables (removed 199) and now considering 31/230 (removed 199) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 39/238 places, 31/230 transitions.
RANDOM walk for 40000 steps (8 resets) in 196 ms. (203 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 94 ms. (421 steps per ms) remains 1/1 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2068456602066888764.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11892145519934199233.kers'
[2026-05-22 23:13:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2068456602066888764.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11892145519934199233.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 31 rows 34 cols 73 entries
Finished phase 1 with 25 SingleSign rule and 1 generalized
[2026-05-22 23:13:27] [INFO ] Computed 13 invariants in 0 ms
Computed 13 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-11892145519934199233.kers
Total runtime 0 ms.
[2026-05-22 23:13:27] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/9 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/11 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/11 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 6/17 variables, 11/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/17 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 4/21 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf1 is UNSAT
After SMT solving in domain Real declared 21/70 variables, and 20 constraints, problems are : Problem set: 1 solved, 0 unsolved in 45 ms.
Refiners :[Positive P Invariants (semi-flows): 4/10 constraints, Generalized P Invariants (flows): 2/3 constraints, State Equation: 13/39 constraints, ReadFeed: 1/15 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 51ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge based reduction with 15 factoid took 414 ms. Reduced automaton from 7 states, 31 edges and 3 AP (stutter sensitive) to 7 states, 28 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 344 ms :[(OR (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2))]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5167947543599270001.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12604139896354712238.kers'
[2026-05-22 23:13:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5167947543599270001.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12604139896354712238.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 230 rows 238 cols 560 entries
Finished phase 1 with 211 SingleSign rule and 5 generalized
[2026-05-22 23:13:27] [INFO ] Computed 22 invariants in 0 ms
Computed 22 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12604139896354712238.kers
Total runtime 1 ms.
[2026-05-22 23:13:28] [INFO ] [Real]Absence check using 21 positive place invariants in 1 ms returned unsat
Proved EG (NOT p2) asserting that LTL formula F !(NOT p2) is false.
Negative knowledge disproves property using: (F p2)
Knowledge-based reduction took 3402 ms.
FORMULA AutoFlight-PT-03b-LTLFireability-09 FALSE TECHNIQUES NEGATIVE_KNOWLEDGE
Treatment of property AutoFlight-PT-03b-LTLFireability-09 finished in 64357 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0||X(G(p1))) U ((p2 U (p3 U p1)) U (p4 U p1))))'
Support contains 6 out of 257 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 257/257 places, 250/250 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 244 transition count 237
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 244 transition count 237
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 244 transition count 236
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 32 place count 239 transition count 231
Iterating global reduction 1 with 5 rules applied. Total rules applied 37 place count 239 transition count 231
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 39 place count 237 transition count 229
Iterating global reduction 1 with 2 rules applied. Total rules applied 41 place count 237 transition count 229
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 43 place count 235 transition count 227
Iterating global reduction 1 with 2 rules applied. Total rules applied 45 place count 235 transition count 227
Applied a total of 45 rules in 24 ms. Remains 235 /257 variables (removed 22) and now considering 227/250 (removed 23) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11998581457185269726.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3104618505684025285.kers'
[2026-05-22 23:13:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11998581457185269726.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3104618505684025285.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 227 rows 235 cols 554 entries
Finished phase 1 with 208 SingleSign rule and 5 generalized
[2026-05-22 23:13:28] [INFO ] Computed 22 invariants in 1 ms
Computed 22 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-3104618505684025285.kers
Total runtime 2 ms.
[2026-05-22 23:13:28] [INFO ] Implicit Places using invariants in 94 ms returned []
[2026-05-22 23:13:28] [INFO ] Invariant cache hit.
[2026-05-22 23:13:28] [INFO ] Implicit Places using invariants and state equation in 224 ms returned []
Implicit Place search using SMT with State Equation took 332 ms to find 0 implicit places.
Running 226 sub problems to find dead transitions.
[2026-05-22 23:13:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 1 (OVERLAPS) 1/235 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/235 variables, 7/49 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/235 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/235 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/235 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/235 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/235 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 10 (OVERLAPS) 227/462 variables, 235/295 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/462 variables, 3/298 constraints. Problems are: Problem set: 0 solved, 226 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 462/462 variables, and 300 constraints, problems are : Problem set: 0 solved, 226 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 235/235 constraints, PredecessorRefiner: 226/226 constraints, Known Traps: 43/43 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 226 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 1 (OVERLAPS) 1/235 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 43/65 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/235 variables, 3/68 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/235 variables, 2/70 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/235 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/235 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 8 (OVERLAPS) 227/462 variables, 235/306 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/462 variables, 226/532 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/462 variables, 5/537 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/462 variables, 2/539 constraints. Problems are: Problem set: 0 solved, 226 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 462/462 variables, and 545 constraints, problems are : Problem set: 0 solved, 226 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 235/235 constraints, PredecessorRefiner: 226/226 constraints, Known Traps: 56/56 constraints, Known Traps Along Path: 6/6 constraints]
After SMT, in 60070ms problems are : Problem set: 0 solved, 226 unsolved
Search for dead transitions found 0 dead transitions in 60070ms
Starting structural reductions in LTL mode, iteration 1 : 235/257 places, 227/250 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60427 ms. Remains : 235/257 places, 227/250 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||X(G(p1))) U ((p2 U (p3 U p1)) U (p4 U p1))))'
Stuttering acceptance computed with spot in 523 ms :[true, (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : AutoFlight-PT-03b-LTLFireability-10
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-03b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-03b-LTLFireability-10 finished in 61022 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 p1)&&X(p1))))&&X(!(p0 U p2)))))'
Support contains 3 out of 257 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 257/257 places, 250/250 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 244 transition count 237
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 244 transition count 237
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 244 transition count 236
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 33 place count 238 transition count 230
Iterating global reduction 1 with 6 rules applied. Total rules applied 39 place count 238 transition count 230
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 41 place count 236 transition count 228
Iterating global reduction 1 with 2 rules applied. Total rules applied 43 place count 236 transition count 228
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 45 place count 234 transition count 226
Iterating global reduction 1 with 2 rules applied. Total rules applied 47 place count 234 transition count 226
Applied a total of 47 rules in 38 ms. Remains 234 /257 variables (removed 23) and now considering 226/250 (removed 24) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4972742291370437631.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15023466422345779483.kers'
[2026-05-22 23:14:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4972742291370437631.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15023466422345779483.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 226 rows 234 cols 552 entries
Finished phase 1 with 207 SingleSign rule and 5 generalized
[2026-05-22 23:14:29] [INFO ] Computed 22 invariants in 2 ms
Computed 22 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-15023466422345779483.kers
Total runtime 3 ms.
[2026-05-22 23:14:29] [INFO ] Implicit Places using invariants in 125 ms returned []
[2026-05-22 23:14:29] [INFO ] Invariant cache hit.
[2026-05-22 23:14:29] [INFO ] Implicit Places using invariants and state equation in 232 ms returned []
Implicit Place search using SMT with State Equation took 372 ms to find 0 implicit places.
Running 225 sub problems to find dead transitions.
[2026-05-22 23:14:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/233 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 1 (OVERLAPS) 1/234 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/234 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/234 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/234 variables, 12/55 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/234 variables, 5/60 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/234 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/234 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 9 (OVERLAPS) 226/460 variables, 234/296 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/460 variables, 3/299 constraints. Problems are: Problem set: 0 solved, 225 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 460/460 variables, and 299 constraints, problems are : Problem set: 0 solved, 225 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 234/234 constraints, PredecessorRefiner: 225/225 constraints, Known Traps: 43/43 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 225 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/233 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 1 (OVERLAPS) 1/234 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/234 variables, 43/65 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/234 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/234 variables, 4/71 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/234 variables, 2/73 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/234 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 8 (OVERLAPS) 226/460 variables, 234/307 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/460 variables, 225/532 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/460 variables, 5/537 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/460 variables, 6/543 constraints. Problems are: Problem set: 0 solved, 225 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 460/460 variables, and 543 constraints, problems are : Problem set: 0 solved, 225 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 234/234 constraints, PredecessorRefiner: 225/225 constraints, Known Traps: 56/56 constraints, Known Traps Along Path: 6/6 constraints]
After SMT, in 60045ms problems are : Problem set: 0 solved, 225 unsolved
Search for dead transitions found 0 dead transitions in 60046ms
Starting structural reductions in LTL mode, iteration 1 : 234/257 places, 226/250 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60457 ms. Remains : 234/257 places, 226/250 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 p1)&&X(p1))))&&X(!(p0 U p2)))))'
Stuttering acceptance computed with spot in 267 ms :[(OR (NOT p1) p2), (OR (NOT p1) p2), (OR (NOT p1) p2), true, p2, (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : AutoFlight-PT-03b-LTLFireability-12
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-03b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-03b-LTLFireability-12 finished in 60769 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0&&(p1||X((X(X(!p0)) U (p1&&X(X(!p0))))))))))'
Support contains 2 out of 257 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 257/257 places, 250/250 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 244 transition count 237
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 244 transition count 237
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 244 transition count 236
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 32 place count 239 transition count 231
Iterating global reduction 1 with 5 rules applied. Total rules applied 37 place count 239 transition count 231
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 238 transition count 230
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 238 transition count 230
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 237 transition count 229
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 237 transition count 229
Applied a total of 41 rules in 18 ms. Remains 237 /257 variables (removed 20) and now considering 229/250 (removed 21) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5718515704860619357.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12335083977534118058.kers'
[2026-05-22 23:15:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5718515704860619357.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12335083977534118058.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 229 rows 237 cols 558 entries
Finished phase 1 with 210 SingleSign rule and 5 generalized
[2026-05-22 23:15:29] [INFO ] Computed 22 invariants in 2 ms
Computed 22 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-12335083977534118058.kers
Total runtime 3 ms.
[2026-05-22 23:15:30] [INFO ] Implicit Places using invariants in 160 ms returned []
[2026-05-22 23:15:30] [INFO ] Invariant cache hit.
[2026-05-22 23:15:30] [INFO ] Implicit Places using invariants and state equation in 203 ms returned []
Implicit Place search using SMT with State Equation took 367 ms to find 0 implicit places.
Running 228 sub problems to find dead transitions.
[2026-05-22 23:15:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 1 (OVERLAPS) 1/237 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/237 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/237 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/237 variables, 8/50 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 11/61 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/237 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/237 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 9 (OVERLAPS) 229/466 variables, 237/301 constraints. Problems are: Problem set: 0 solved, 228 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 466/466 variables, and 302 constraints, problems are : Problem set: 0 solved, 228 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 237/237 constraints, PredecessorRefiner: 228/228 constraints, Known Traps: 43/43 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 228 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 1 (OVERLAPS) 1/237 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/237 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/237 variables, 43/65 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/237 variables, 3/68 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 2/70 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 2/72 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/237 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 8 (OVERLAPS) 229/466 variables, 237/309 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/466 variables, 228/537 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/466 variables, 5/542 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/466 variables, 1/543 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/466 variables, 2/545 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/466 variables, 1/546 constraints. Problems are: Problem set: 0 solved, 228 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 466/466 variables, and 546 constraints, problems are : Problem set: 0 solved, 228 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 237/237 constraints, PredecessorRefiner: 228/228 constraints, Known Traps: 59/59 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60058ms problems are : Problem set: 0 solved, 228 unsolved
Search for dead transitions found 0 dead transitions in 60060ms
Starting structural reductions in LTL mode, iteration 1 : 237/257 places, 229/250 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60447 ms. Remains : 237/257 places, 229/250 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0&&(p1||X((X(X(!p0)) U (p1&&X(X(!p0))))))))))'
Stuttering acceptance computed with spot in 271 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (OR (NOT p1) p0), p0, p0]
Running random walk in product with property : AutoFlight-PT-03b-LTLFireability-13
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-03b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-03b-LTLFireability-13 finished in 60759 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F((p0&&G(p1))) U (X(!p0)&&G(p2)))))'
Support contains 3 out of 257 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 257/257 places, 250/250 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 245 transition count 238
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 245 transition count 238
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 25 place count 245 transition count 237
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 29 place count 241 transition count 233
Iterating global reduction 1 with 4 rules applied. Total rules applied 33 place count 241 transition count 233
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 35 place count 239 transition count 231
Iterating global reduction 1 with 2 rules applied. Total rules applied 37 place count 239 transition count 231
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 39 place count 237 transition count 229
Iterating global reduction 1 with 2 rules applied. Total rules applied 41 place count 237 transition count 229
Applied a total of 41 rules in 25 ms. Remains 237 /257 variables (removed 20) and now considering 229/250 (removed 21) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9636997353546872343.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11514651140677546233.kers'
[2026-05-22 23:16:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9636997353546872343.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11514651140677546233.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 229 rows 237 cols 558 entries
Finished phase 1 with 210 SingleSign rule and 5 generalized
[2026-05-22 23:16:30] [INFO ] Computed 22 invariants in 0 ms
Computed 22 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-11514651140677546233.kers
Total runtime 1 ms.
[2026-05-22 23:16:30] [INFO ] Implicit Places using invariants in 94 ms returned []
[2026-05-22 23:16:30] [INFO ] Invariant cache hit.
[2026-05-22 23:16:30] [INFO ] Implicit Places using invariants and state equation in 191 ms returned []
Implicit Place search using SMT with State Equation took 301 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 237/257 places, 229/250 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 326 ms. Remains : 237/257 places, 229/250 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F((p0&&G(p1))) U (X(!p0)&&G(p2)))))'
Stuttering acceptance computed with spot in 294 ms :[(OR (NOT p2) p0), (OR (NOT p1) (NOT p0)), (OR (NOT p2) p0), (NOT p1), p0, (NOT p2)]
Running random walk in product with property : AutoFlight-PT-03b-LTLFireability-14
Product exploration explored 100000 steps with 33382 reset in 115 ms.
Product exploration explored 100000 steps with 33371 reset in 128 ms.
Computed a total of 59 stabilizing places and 59 stable transitions
Computed a total of 59 stabilizing places and 59 stable transitions
Knowledge based reduction with 21 factoid took 98 ms. Reduced automaton from 6 states, 23 edges and 3 AP (stutter sensitive) to 8 states, 31 edges and 3 AP (stutter insensitive).
Reduction of identical properties reduced properties to check from 14 to 13
RANDOM walk for 40000 steps (250 resets) in 304 ms. (131 steps per ms) remains 2/13 properties
BEST_FIRST walk for 40004 steps (25 resets) in 131 ms. (303 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (25 resets) in 133 ms. (298 steps per ms) remains 2/2 properties
[2026-05-22 23:16:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf5 is UNSAT
Problem apf7 is UNSAT
After SMT solving in domain Real declared 35/466 variables, and 2 constraints, problems are : Problem set: 2 solved, 0 unsolved in 26 ms.
Refiners :[Positive P Invariants (semi-flows): 2/21 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/237 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 29ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge based reduction with 23 factoid took 370 ms. Reduced automaton from 8 states, 31 edges and 3 AP (stutter insensitive) to 8 states, 30 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 514 ms :[(OR (NOT p2) p0), (OR (NOT p1) (NOT p0)), (OR (NOT p2) p0), (NOT p1), p0, (NOT p2), false, false]
Knowledge-based reduction took 1196 ms.
Stuttering acceptance computed with spot in 527 ms :[(OR (NOT p2) p0), (OR (NOT p1) (NOT p0)), (OR (NOT p2) p0), (NOT p1), p0, (NOT p2), false, false]
Support contains 3 out of 237 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 237/237 places, 229/229 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 78 transitions
Trivial Post-agglo rules discarded 78 transitions
Performed 78 trivial Post agglomeration. Transition count delta: 78
Iterating post reduction 0 with 78 rules applied. Total rules applied 78 place count 236 transition count 150
Reduce places removed 78 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 84 rules applied. Total rules applied 162 place count 158 transition count 144
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 167 place count 154 transition count 143
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 168 place count 153 transition count 143
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 31 Pre rules applied. Total rules applied 168 place count 153 transition count 112
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 4 with 62 rules applied. Total rules applied 230 place count 122 transition count 112
Performed 45 Post agglomeration using F-continuation condition with reduction of 5 identical transitions.
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 4 with 90 rules applied. Total rules applied 320 place count 77 transition count 62
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 4 with 2 rules applied. Total rules applied 322 place count 76 transition count 62
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 323 place count 76 transition count 61
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 4 with 2 rules applied. Total rules applied 325 place count 75 transition count 60
Applied a total of 325 rules in 51 ms. Remains 75 /237 variables (removed 162) and now considering 60/229 (removed 169) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8161988138341559130.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7358078226411913022.kers'
[2026-05-22 23:16:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8161988138341559130.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7358078226411913022.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 60 rows 70 cols 198 entries
Finished phase 1 with 48 SingleSign rule and 5 generalized
[2026-05-22 23:16:33] [INFO ] Computed 22 invariants in 0 ms
Computed 22 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-7358078226411913022.kers
Total runtime 0 ms.
[2026-05-22 23:16:33] [INFO ] Implicit Places using invariants in 104 ms returned [25, 26, 27, 28, 32, 33, 44, 55, 61, 67, 74]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 106 ms to find 11 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 64/237 places, 60/229 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 64 transition count 55
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 59 transition count 55
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 14 place count 55 transition count 51
Iterating global reduction 2 with 4 rules applied. Total rules applied 18 place count 55 transition count 51
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 19 place count 54 transition count 50
Iterating global reduction 2 with 1 rules applied. Total rules applied 20 place count 54 transition count 50
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 21 place count 53 transition count 49
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 53 transition count 49
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 23 place count 52 transition count 48
Iterating global reduction 2 with 1 rules applied. Total rules applied 24 place count 52 transition count 48
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 26 place count 51 transition count 47
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -19
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 50 transition count 66
Applied a total of 28 rules in 25 ms. Remains 50 /64 variables (removed 14) and now considering 66/60 (removed -6) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10335696172206317083.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17443636942302284527.kers'
[2026-05-22 23:16:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10335696172206317083.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17443636942302284527.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 66 rows 50 cols 268 entries
Finished phase 1 with 39 SingleSign rule and 0 generalized
[2026-05-22 23:16:33] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-17443636942302284527.kers
Total runtime 0 ms.
[2026-05-22 23:16:33] [INFO ] Implicit Places using invariants in 58 ms returned []
[2026-05-22 23:16:33] [INFO ] Invariant cache hit.
[2026-05-22 23:16:33] [INFO ] State equation strengthened by 21 read => feed constraints.
[2026-05-22 23:16:33] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 193 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 50/237 places, 66/229 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 388 ms. Remains : 50/237 places, 66/229 transitions.
Computed a total of 1 stabilizing places and 10 stable transitions
Computed a total of 1 stabilizing places and 10 stable transitions
Knowledge based reduction with 18 factoid took 491 ms. Reduced automaton from 8 states, 30 edges and 3 AP (stutter insensitive) to 8 states, 30 edges and 3 AP (stutter insensitive).
Reduction of identical properties reduced properties to check from 14 to 13
RANDOM walk for 40000 steps (2174 resets) in 139 ms. (285 steps per ms) remains 2/13 properties
BEST_FIRST walk for 40004 steps (312 resets) in 58 ms. (678 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (315 resets) in 59 ms. (666 steps per ms) remains 2/2 properties
[2026-05-22 23:16:34] [INFO ] Invariant cache hit.
[2026-05-22 23:16:34] [INFO ] State equation strengthened by 21 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf4 is UNSAT
Problem apf6 is UNSAT
After SMT solving in domain Real declared 9/116 variables, and 2 constraints, problems are : Problem set: 2 solved, 0 unsolved in 19 ms.
Refiners :[Positive P Invariants (semi-flows): 2/11 constraints, State Equation: 0/50 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 22ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge based reduction with 20 factoid took 592 ms. Reduced automaton from 8 states, 30 edges and 3 AP (stutter insensitive) to 8 states, 31 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 484 ms :[(OR (NOT p2) p0), (OR (NOT p1) (NOT p0)), (OR (NOT p2) p0), (NOT p1), p0, (NOT p2), false, false]
Knowledge-based reduction took 1711 ms.
Stuttering acceptance computed with spot in 400 ms :[(OR (NOT p2) p0), (OR (NOT p1) (NOT p0)), (OR (NOT p2) p0), (NOT p1), p0, (NOT p2), false, false]
Stuttering acceptance computed with spot in 559 ms :[(OR (NOT p2) p0), (OR (NOT p1) (NOT p0)), (OR (NOT p2) p0), (NOT p1), p0, (NOT p2), false, false]
Stuttering criterion allowed to conclude after 72 steps with 4 reset in 1 ms.
FORMULA AutoFlight-PT-03b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-03b-LTLFireability-14 finished in 5759 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 257 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 257/257 places, 250/250 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 88 transitions
Trivial Post-agglo rules discarded 88 transitions
Performed 88 trivial Post agglomeration. Transition count delta: 88
Iterating post reduction 0 with 88 rules applied. Total rules applied 88 place count 256 transition count 161
Reduce places removed 88 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 98 rules applied. Total rules applied 186 place count 168 transition count 151
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 192 place count 162 transition count 151
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 33 Pre rules applied. Total rules applied 192 place count 162 transition count 118
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 258 place count 129 transition count 118
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 266 place count 121 transition count 110
Iterating global reduction 3 with 8 rules applied. Total rules applied 274 place count 121 transition count 110
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 274 place count 121 transition count 106
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 282 place count 117 transition count 106
Performed 44 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 370 place count 73 transition count 56
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 371 place count 72 transition count 55
Reduce places removed 4 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 5 rules applied. Total rules applied 376 place count 68 transition count 54
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 377 place count 67 transition count 54
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 377 place count 67 transition count 51
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 383 place count 64 transition count 51
Applied a total of 383 rules in 28 ms. Remains 64 /257 variables (removed 193) and now considering 51/250 (removed 199) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1652748522353826553.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8765915139820756398.kers'
[2026-05-22 23:16:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1652748522353826553.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8765915139820756398.kers]
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 0 ms.
// Phase 1: matrix 51 rows 56 cols 125 entries
Finished phase 1 with 46 SingleSign rule and 0 generalized
[2026-05-22 23:16:36] [INFO ] Computed 18 invariants in 0 ms
Computed 18 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8765915139820756398.kers
Total runtime 1 ms.
[2026-05-22 23:16:36] [INFO ] Implicit Places using invariants in 85 ms returned [26, 37, 48, 52, 57, 63]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 90 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 58/257 places, 51/250 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 54 transition count 47
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 54 transition count 47
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 53 transition count 46
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 53 transition count 46
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 52 transition count 45
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 52 transition count 45
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 51 transition count 44
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 51 transition count 44
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 50 transition count 43
Applied a total of 16 rules in 7 ms. Remains 50 /58 variables (removed 8) and now considering 43/51 (removed 8) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8557520299468085708.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13758645588077313973.kers'
[2026-05-22 23:16:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8557520299468085708.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13758645588077313973.kers]
Culling duplicate invariants (modulo rational): removing 7 columns.
Culled 7 columns in 0 ms.
// Phase 1: matrix 43 rows 43 cols 99 entries
Finished phase 1 with 38 SingleSign rule and 0 generalized
[2026-05-22 23:16:36] [INFO ] Computed 12 invariants in 0 ms
Computed 12 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-13758645588077313973.kers
Total runtime 0 ms.
[2026-05-22 23:16:36] [INFO ] Implicit Places using invariants in 82 ms returned []
[2026-05-22 23:16:36] [INFO ] Invariant cache hit.
[2026-05-22 23:16:36] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-22 23:16:36] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 170 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 50/257 places, 43/250 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 295 ms. Remains : 50/257 places, 43/250 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 29 ms :[(NOT p0)]
Running random walk in product with property : AutoFlight-PT-03b-LTLFireability-15
Stuttering criterion allowed to conclude after 18 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-03b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-03b-LTLFireability-15 finished in 354 ms.
All properties solved by simple procedures.
Total runtime 546748 ms.

BK_STOP 1779491796716

--------------------
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="AutoFlight-PT-03b"
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 AutoFlight-PT-03b, 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 r002-oct2-177944366300484"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/AutoFlight-PT-03b.tgz
mv AutoFlight-PT-03b 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 ;