fond
Model Checking Contest 2026
16th edition, Hamburg, Germany, June 23, 2026
Execution of r002-oct2-177944366400516
Last Updated
Jun 17, 2026

About the Execution of ITS-Tools for AutoFlight-PT-05b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16203.571 3600000.00 6378509.00 328594.60 FFFFFTFFFFTTFTF? normal

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-177944366400516.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-05b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r002-oct2-177944366400516
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 596K
-rw-r--r-- 1 mcc users 8.2K Mar 5 16:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 94K Mar 5 16:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Mar 5 16:41 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Mar 5 16:41 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.6K Mar 15 07:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 15 07:14 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 07:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 15 07:14 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Mar 5 16:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 113K Mar 5 16:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Mar 5 16:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K Mar 5 16:41 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 07:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 07:14 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 113K 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-05b-LTLFireability-00
FORMULA_NAME AutoFlight-PT-05b-LTLFireability-01
FORMULA_NAME AutoFlight-PT-05b-LTLFireability-02
FORMULA_NAME AutoFlight-PT-05b-LTLFireability-03
FORMULA_NAME AutoFlight-PT-05b-LTLFireability-04
FORMULA_NAME AutoFlight-PT-05b-LTLFireability-05
FORMULA_NAME AutoFlight-PT-05b-LTLFireability-06
FORMULA_NAME AutoFlight-PT-05b-LTLFireability-07
FORMULA_NAME AutoFlight-PT-05b-LTLFireability-08
FORMULA_NAME AutoFlight-PT-05b-LTLFireability-09
FORMULA_NAME AutoFlight-PT-05b-LTLFireability-10
FORMULA_NAME AutoFlight-PT-05b-LTLFireability-11
FORMULA_NAME AutoFlight-PT-05b-LTLFireability-12
FORMULA_NAME AutoFlight-PT-05b-LTLFireability-13
FORMULA_NAME AutoFlight-PT-05b-LTLFireability-14
FORMULA_NAME AutoFlight-PT-05b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779491992858

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-05b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-22 23:19:54] [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:19:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-22 23:19:54] [INFO ] Load time of PNML (sax parser for PT used): 81 ms
[2026-05-22 23:19:54] [INFO ] Transformed 482 places.
[2026-05-22 23:19:54] [INFO ] Transformed 480 transitions.
[2026-05-22 23:19:54] [INFO ] Found NUPN structural information;
[2026-05-22 23:19:54] [INFO ] Parsed PT model containing 482 places and 480 transitions and 1120 arcs in 190 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
FORMULA AutoFlight-PT-05b-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-05b-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-05b-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-05b-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-05b-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-05b-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 25 out of 482 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 482/482 places, 480/480 transitions.
Discarding 61 places :
Symmetric choice reduction at 0 with 61 rule applications. Total rules 61 place count 421 transition count 419
Iterating global reduction 0 with 61 rules applied. Total rules applied 122 place count 421 transition count 419
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 132 place count 421 transition count 409
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 157 place count 396 transition count 384
Iterating global reduction 1 with 25 rules applied. Total rules applied 182 place count 396 transition count 384
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 187 place count 391 transition count 379
Iterating global reduction 1 with 5 rules applied. Total rules applied 192 place count 391 transition count 379
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 195 place count 388 transition count 376
Iterating global reduction 1 with 3 rules applied. Total rules applied 198 place count 388 transition count 376
Applied a total of 198 rules in 124 ms. Remains 388 /482 variables (removed 94) and now considering 376/480 (removed 104) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3427719934639825268.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2446532878052401369.kers'
[2026-05-22 23:19:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3427719934639825268.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2446532878052401369.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 376 rows 388 cols 912 entries
Finished phase 1 with 347 SingleSign rule and 7 generalized
[2026-05-22 23:19:54] [INFO ] Computed 34 invariants in 1 ms
Computed 34 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-2446532878052401369.kers
Total runtime 2 ms.
[2026-05-22 23:19:55] [INFO ] Implicit Places using invariants in 337 ms returned []
[2026-05-22 23:19:55] [INFO ] Invariant cache hit.
[2026-05-22 23:19:55] [INFO ] Implicit Places using invariants and state equation in 265 ms returned []
Implicit Place search using SMT with State Equation took 632 ms to find 0 implicit places.
Running 375 sub problems to find dead transitions.
[2026-05-22 23:19:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/387 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 1 (OVERLAPS) 1/388 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/388 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/388 variables, 20/54 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/388 variables, 20/74 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/388 variables, 20/94 constraints. Problems are: Problem set: 0 solved, 375 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 388/764 variables, and 99 constraints, problems are : Problem set: 0 solved, 375 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/388 constraints, PredecessorRefiner: 375/375 constraints, Known Traps: 65/65 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 375 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/387 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 1 (OVERLAPS) 1/388 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/388 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/388 variables, 65/99 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/388 variables, 20/119 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/388 variables, 20/139 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/388 variables, 14/153 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/388 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 8 (OVERLAPS) 376/764 variables, 388/541 constraints. Problems are: Problem set: 0 solved, 375 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 764/764 variables, and 916 constraints, problems are : Problem set: 0 solved, 375 unsolved in 30055 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 388/388 constraints, PredecessorRefiner: 375/375 constraints, Known Traps: 119/119 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60155ms problems are : Problem set: 0 solved, 375 unsolved
Search for dead transitions found 0 dead transitions in 60170ms
Starting structural reductions in LTL mode, iteration 1 : 388/482 places, 376/480 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60963 ms. Remains : 388/482 places, 376/480 transitions.
Starting structural reductions in LTL mode, iteration 0 : 388/388 places, 376/376 transitions.
Applied a total of 0 rules in 22 ms. Remains 388 /388 variables (removed 0) and now considering 376/376 (removed 0) transitions.
[2026-05-22 23:20:55] [INFO ] Invariant cache hit.
[2026-05-22 23:20:55] [INFO ] Implicit Places using invariants in 243 ms returned []
[2026-05-22 23:20:55] [INFO ] Invariant cache hit.
[2026-05-22 23:20:56] [INFO ] Implicit Places using invariants and state equation in 392 ms returned []
Implicit Place search using SMT with State Equation took 640 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 663 ms. Remains : 388/388 places, 376/376 transitions.
Support contains 25 out of 388 places after structural reductions.
[2026-05-22 23:20:56] [INFO ] Flatten gal took : 53 ms
[2026-05-22 23:20:56] [INFO ] Flatten gal took : 21 ms
[2026-05-22 23:20:56] [INFO ] Input system was already deterministic with 376 transitions.
RANDOM walk for 40000 steps (160 resets) in 1003 ms. (39 steps per ms) remains 5/23 properties
BEST_FIRST walk for 40003 steps (13 resets) in 127 ms. (312 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (14 resets) in 98 ms. (404 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (16 resets) in 103 ms. (384 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (13 resets) in 85 ms. (465 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (14 resets) in 64 ms. (615 steps per ms) remains 5/5 properties
[2026-05-22 23:20:57] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 174/182 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/182 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 204/386 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/386 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 2/388 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/388 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 376/764 variables, 388/422 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/764 variables, 8/430 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/764 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 0/764 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 764/764 variables, and 430 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1647 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 388/388 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 174/182 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/182 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/182 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 204/386 variables, 20/37 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/386 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 2/388 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/388 variables, 4/42 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/388 variables, 4/46 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/388 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 376/764 variables, 388/434 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/764 variables, 5/439 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/764 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 0/764 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 764/764 variables, and 439 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1645 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 388/388 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3303ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 4 properties in 528 ms.
Support contains 1 out of 388 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 388/388 places, 376/376 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 134 transitions
Trivial Post-agglo rules discarded 134 transitions
Performed 134 trivial Post agglomeration. Transition count delta: 134
Iterating post reduction 0 with 134 rules applied. Total rules applied 134 place count 388 transition count 242
Reduce places removed 134 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 149 rules applied. Total rules applied 283 place count 254 transition count 227
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 293 place count 244 transition count 227
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 49 Pre rules applied. Total rules applied 293 place count 244 transition count 178
Deduced a syphon composed of 49 places in 1 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 3 with 98 rules applied. Total rules applied 391 place count 195 transition count 178
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 396 place count 190 transition count 173
Iterating global reduction 3 with 5 rules applied. Total rules applied 401 place count 190 transition count 173
Performed 74 Post agglomeration using F-continuation condition with reduction of 10 identical transitions.
Deduced a syphon composed of 74 places in 0 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 3 with 148 rules applied. Total rules applied 549 place count 116 transition count 89
Free-agglomeration rule applied 20 times.
Iterating global reduction 3 with 20 rules applied. Total rules applied 569 place count 116 transition count 69
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 3 with 20 rules applied. Total rules applied 589 place count 96 transition count 69
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 590 place count 95 transition count 68
Reduce places removed 22 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 4 with 55 rules applied. Total rules applied 645 place count 73 transition count 35
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 5 with 33 rules applied. Total rules applied 678 place count 40 transition count 35
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 11 Pre rules applied. Total rules applied 678 place count 40 transition count 24
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 6 with 22 rules applied. Total rules applied 700 place count 29 transition count 24
Applied a total of 700 rules in 66 ms. Remains 29 /388 variables (removed 359) and now considering 24/376 (removed 352) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 29/388 places, 24/376 transitions.
RANDOM walk for 46 steps (0 resets) in 4 ms. (9 steps per ms) remains 0/1 properties
Computed a total of 98 stabilizing places and 98 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 388 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 388/388 places, 376/376 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 131 transitions
Trivial Post-agglo rules discarded 131 transitions
Performed 131 trivial Post agglomeration. Transition count delta: 131
Iterating post reduction 0 with 131 rules applied. Total rules applied 131 place count 387 transition count 244
Reduce places removed 131 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 146 rules applied. Total rules applied 277 place count 256 transition count 229
Reduce places removed 10 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 11 rules applied. Total rules applied 288 place count 246 transition count 228
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 289 place count 245 transition count 228
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 50 Pre rules applied. Total rules applied 289 place count 245 transition count 178
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 4 with 100 rules applied. Total rules applied 389 place count 195 transition count 178
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 395 place count 189 transition count 172
Iterating global reduction 4 with 6 rules applied. Total rules applied 401 place count 189 transition count 172
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 401 place count 189 transition count 171
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 403 place count 188 transition count 171
Performed 72 Post agglomeration using F-continuation condition with reduction of 10 identical transitions.
Deduced a syphon composed of 72 places in 0 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 4 with 144 rules applied. Total rules applied 547 place count 116 transition count 89
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 548 place count 115 transition count 88
Reduce places removed 8 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 4 with 11 rules applied. Total rules applied 559 place count 107 transition count 85
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 562 place count 104 transition count 85
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 5 Pre rules applied. Total rules applied 562 place count 104 transition count 80
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 6 with 10 rules applied. Total rules applied 572 place count 99 transition count 80
Applied a total of 572 rules in 38 ms. Remains 99 /388 variables (removed 289) and now considering 80/376 (removed 296) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8855669878569783828.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11628623505894417922.kers'
[2026-05-22 23:21:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8855669878569783828.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11628623505894417922.kers]
Culling duplicate invariants (modulo rational): removing 13 columns.
Culled 13 columns in 0 ms.
// Phase 1: matrix 80 rows 86 cols 196 entries
Finished phase 1 with 73 SingleSign rule and 0 generalized
[2026-05-22 23:21:01] [INFO ] Computed 26 invariants in 1 ms
Computed 26 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-11628623505894417922.kers
Total runtime 1 ms.
[2026-05-22 23:21:01] [INFO ] Implicit Places using invariants in 93 ms returned [39, 56, 73, 77, 88, 93, 98]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 95 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 92/388 places, 80/376 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 87 transition count 75
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 87 transition count 75
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 86 transition count 74
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 86 transition count 74
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 85 transition count 73
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 85 transition count 73
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 84 transition count 72
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 84 transition count 72
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 83 transition count 71
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 83 transition count 71
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 82 transition count 70
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 82 transition count 70
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 80 transition count 68
Applied a total of 24 rules in 16 ms. Remains 80 /92 variables (removed 12) and now considering 68/80 (removed 12) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13245012552573569359.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4073838995552324293.kers'
[2026-05-22 23:21:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13245012552573569359.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4073838995552324293.kers]
Culling duplicate invariants (modulo rational): removing 12 columns.
Culled 12 columns in 0 ms.
// Phase 1: matrix 68 rows 68 cols 160 entries
Finished phase 1 with 61 SingleSign rule and 0 generalized
[2026-05-22 23:21:01] [INFO ] Computed 19 invariants in 0 ms
Computed 19 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-4073838995552324293.kers
Total runtime 0 ms.
[2026-05-22 23:21:01] [INFO ] Implicit Places using invariants in 58 ms returned []
[2026-05-22 23:21:01] [INFO ] Invariant cache hit.
[2026-05-22 23:21:01] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-22 23:21:01] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 178 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 80/388 places, 68/376 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 327 ms. Remains : 80/388 places, 68/376 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 204 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-05b-LTLFireability-00
Stuttering criterion allowed to conclude after 73 steps with 3 reset in 2 ms.
FORMULA AutoFlight-PT-05b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-05b-LTLFireability-00 finished in 609 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 388 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 388/388 places, 376/376 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 133 transitions
Trivial Post-agglo rules discarded 133 transitions
Performed 133 trivial Post agglomeration. Transition count delta: 133
Iterating post reduction 0 with 133 rules applied. Total rules applied 133 place count 387 transition count 242
Reduce places removed 133 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 148 rules applied. Total rules applied 281 place count 254 transition count 227
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 291 place count 244 transition count 227
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 49 Pre rules applied. Total rules applied 291 place count 244 transition count 178
Deduced a syphon composed of 49 places in 1 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 3 with 98 rules applied. Total rules applied 389 place count 195 transition count 178
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 394 place count 190 transition count 173
Iterating global reduction 3 with 5 rules applied. Total rules applied 399 place count 190 transition count 173
Performed 74 Post agglomeration using F-continuation condition with reduction of 10 identical transitions.
Deduced a syphon composed of 74 places in 0 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 3 with 148 rules applied. Total rules applied 547 place count 116 transition count 89
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 548 place count 115 transition count 88
Reduce places removed 8 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 11 rules applied. Total rules applied 559 place count 107 transition count 85
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 562 place count 104 transition count 85
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 5 Pre rules applied. Total rules applied 562 place count 104 transition count 80
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 572 place count 99 transition count 80
Applied a total of 572 rules in 32 ms. Remains 99 /388 variables (removed 289) and now considering 80/376 (removed 296) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6809141330187012574.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5173947680511532335.kers'
[2026-05-22 23:21:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6809141330187012574.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5173947680511532335.kers]
Culling duplicate invariants (modulo rational): removing 13 columns.
Culled 13 columns in 0 ms.
// Phase 1: matrix 80 rows 86 cols 198 entries
Finished phase 1 with 73 SingleSign rule and 0 generalized
[2026-05-22 23:21:01] [INFO ] Computed 26 invariants in 0 ms
Computed 26 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-5173947680511532335.kers
Total runtime 0 ms.
[2026-05-22 23:21:01] [INFO ] Implicit Places using invariants in 59 ms returned [41, 58, 75, 79, 83, 88, 93, 98]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 60 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 91/388 places, 80/376 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 85 transition count 74
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 85 transition count 74
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 14 place count 84 transition count 73
Applied a total of 14 rules in 6 ms. Remains 84 /91 variables (removed 7) and now considering 73/80 (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-7521090895397013442.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4860300827677831771.kers'
[2026-05-22 23:21:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7521090895397013442.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4860300827677831771.kers]
Culling duplicate invariants (modulo rational): removing 12 columns.
Culled 12 columns in 0 ms.
// Phase 1: matrix 73 rows 72 cols 170 entries
Finished phase 1 with 66 SingleSign rule and 0 generalized
[2026-05-22 23:21:01] [INFO ] Computed 18 invariants in 0 ms
Computed 18 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-4860300827677831771.kers
Total runtime 0 ms.
[2026-05-22 23:21:01] [INFO ] Implicit Places using invariants in 41 ms returned []
[2026-05-22 23:21:02] [INFO ] Invariant cache hit.
[2026-05-22 23:21:02] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-22 23:21:02] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 84/388 places, 73/376 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 207 ms. Remains : 84/388 places, 73/376 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 27 ms :[(NOT p0)]
Running random walk in product with property : AutoFlight-PT-05b-LTLFireability-01
Stuttering criterion allowed to conclude after 26 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-05b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-05b-LTLFireability-01 finished in 253 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)) U (F(G(p1))||(p1&&F(p2)))))'
Support contains 3 out of 388 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 388/388 places, 376/376 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 128 transitions
Trivial Post-agglo rules discarded 128 transitions
Performed 128 trivial Post agglomeration. Transition count delta: 128
Iterating post reduction 0 with 128 rules applied. Total rules applied 128 place count 387 transition count 247
Reduce places removed 128 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 143 rules applied. Total rules applied 271 place count 259 transition count 232
Reduce places removed 10 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 12 rules applied. Total rules applied 283 place count 249 transition count 230
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 285 place count 247 transition count 230
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 51 Pre rules applied. Total rules applied 285 place count 247 transition count 179
Deduced a syphon composed of 51 places in 1 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 4 with 102 rules applied. Total rules applied 387 place count 196 transition count 179
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 393 place count 190 transition count 173
Iterating global reduction 4 with 6 rules applied. Total rules applied 399 place count 190 transition count 173
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 399 place count 190 transition count 172
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 401 place count 189 transition count 172
Performed 69 Post agglomeration using F-continuation condition with reduction of 10 identical transitions.
Deduced a syphon composed of 69 places in 0 ms
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 4 with 138 rules applied. Total rules applied 539 place count 120 transition count 93
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 540 place count 119 transition count 92
Reduce places removed 8 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 4 with 11 rules applied. Total rules applied 551 place count 111 transition count 89
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 554 place count 108 transition count 89
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 5 Pre rules applied. Total rules applied 554 place count 108 transition count 84
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 6 with 10 rules applied. Total rules applied 564 place count 103 transition count 84
Applied a total of 564 rules in 62 ms. Remains 103 /388 variables (removed 285) and now considering 84/376 (removed 292) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11707087834578458844.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8516784022917611086.kers'
[2026-05-22 23:21:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11707087834578458844.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8516784022917611086.kers]
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 0 ms.
// Phase 1: matrix 84 rows 99 cols 234 entries
Finished phase 1 with 77 SingleSign rule and 0 generalized
[2026-05-22 23:21:02] [INFO ] Computed 26 invariants in 0 ms
Computed 26 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-8516784022917611086.kers
Total runtime 0 ms.
[2026-05-22 23:21:02] [INFO ] Implicit Places using invariants in 58 ms returned [60, 77, 87, 92, 97, 102]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 60 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 97/388 places, 84/376 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 93 transition count 80
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 93 transition count 80
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 14 place count 90 transition count 77
Applied a total of 14 rules in 5 ms. Remains 90 /97 variables (removed 7) and now considering 77/84 (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-14133287404774803062.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15777803629588080317.kers'
[2026-05-22 23:21:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14133287404774803062.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15777803629588080317.kers]
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 77 rows 87 cols 210 entries
Finished phase 1 with 70 SingleSign rule and 0 generalized
[2026-05-22 23:21:02] [INFO ] Computed 20 invariants in 0 ms
Computed 20 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-15777803629588080317.kers
Total runtime 1 ms.
[2026-05-22 23:21:02] [INFO ] Implicit Places using invariants in 44 ms returned []
[2026-05-22 23:21:02] [INFO ] Invariant cache hit.
[2026-05-22 23:21:02] [INFO ] State equation strengthened by 19 read => feed constraints.
[2026-05-22 23:21:02] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 141 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 90/388 places, 77/376 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 269 ms. Remains : 90/388 places, 77/376 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)) U (F(G(p1))||(p1&&F(p2)))))'
Stuttering acceptance computed with spot in 98 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : AutoFlight-PT-05b-LTLFireability-02
Stuttering criterion allowed to conclude after 8026 steps with 320 reset in 39 ms.
FORMULA AutoFlight-PT-05b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-05b-LTLFireability-02 finished in 431 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F((p0&&F(p1)))||X(X(F(p2))))))'
Support contains 3 out of 388 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 388/388 places, 376/376 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 132 transitions
Trivial Post-agglo rules discarded 132 transitions
Performed 132 trivial Post agglomeration. Transition count delta: 132
Iterating post reduction 0 with 132 rules applied. Total rules applied 132 place count 387 transition count 243
Reduce places removed 132 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 147 rules applied. Total rules applied 279 place count 255 transition count 228
Reduce places removed 10 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 11 rules applied. Total rules applied 290 place count 245 transition count 227
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 291 place count 244 transition count 227
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 49 Pre rules applied. Total rules applied 291 place count 244 transition count 178
Deduced a syphon composed of 49 places in 1 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 4 with 98 rules applied. Total rules applied 389 place count 195 transition count 178
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 393 place count 191 transition count 174
Iterating global reduction 4 with 4 rules applied. Total rules applied 397 place count 191 transition count 174
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 397 place count 191 transition count 173
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 399 place count 190 transition count 173
Performed 73 Post agglomeration using F-continuation condition with reduction of 10 identical transitions.
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 4 with 146 rules applied. Total rules applied 545 place count 117 transition count 90
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 546 place count 116 transition count 89
Reduce places removed 8 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 4 with 11 rules applied. Total rules applied 557 place count 108 transition count 86
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 560 place count 105 transition count 86
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 5 Pre rules applied. Total rules applied 560 place count 105 transition count 81
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 6 with 10 rules applied. Total rules applied 570 place count 100 transition count 81
Applied a total of 570 rules in 44 ms. Remains 100 /388 variables (removed 288) and now considering 81/376 (removed 295) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14991730544496993035.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1860373886036207970.kers'
[2026-05-22 23:21:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14991730544496993035.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1860373886036207970.kers]
Culling duplicate invariants (modulo rational): removing 11 columns.
Culled 11 columns in 0 ms.
// Phase 1: matrix 81 rows 89 cols 206 entries
Finished phase 1 with 74 SingleSign rule and 0 generalized
[2026-05-22 23:21:02] [INFO ] Computed 26 invariants in 0 ms
Computed 26 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-1860373886036207970.kers
Total runtime 0 ms.
[2026-05-22 23:21:02] [INFO ] Implicit Places using invariants in 51 ms returned [42, 59, 76, 80, 84, 89, 94, 99]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 52 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 92/388 places, 81/376 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 86 transition count 75
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 86 transition count 75
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 85 transition count 74
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 85 transition count 74
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 84 transition count 73
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 84 transition count 73
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 18 place count 83 transition count 72
Applied a total of 18 rules in 9 ms. Remains 83 /92 variables (removed 9) and now considering 72/81 (removed 9) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2201651134482670084.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10230526722767955078.kers'
[2026-05-22 23:21:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2201651134482670084.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10230526722767955078.kers]
Culling duplicate invariants (modulo rational): removing 10 columns.
Culled 10 columns in 0 ms.
// Phase 1: matrix 72 rows 73 cols 174 entries
Finished phase 1 with 65 SingleSign rule and 0 generalized
[2026-05-22 23:21:02] [INFO ] Computed 18 invariants in 0 ms
Computed 18 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-10230526722767955078.kers
Total runtime 1 ms.
[2026-05-22 23:21:02] [INFO ] Implicit Places using invariants in 44 ms returned []
[2026-05-22 23:21:02] [INFO ] Invariant cache hit.
[2026-05-22 23:21:02] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-22 23:21:02] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 83/388 places, 72/376 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 213 ms. Remains : 83/388 places, 72/376 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F((p0&&F(p1)))||X(X(F(p2))))))'
Stuttering acceptance computed with spot in 176 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : AutoFlight-PT-05b-LTLFireability-03
Stuttering criterion allowed to conclude after 39 steps with 1 reset in 1 ms.
FORMULA AutoFlight-PT-05b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-05b-LTLFireability-03 finished in 425 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||G(p1)) U !p2))))'
Support contains 3 out of 388 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 388/388 places, 376/376 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 379 transition count 367
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 379 transition count 367
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 22 place count 375 transition count 363
Iterating global reduction 0 with 4 rules applied. Total rules applied 26 place count 375 transition count 363
Applied a total of 26 rules in 22 ms. Remains 375 /388 variables (removed 13) and now considering 363/376 (removed 13) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1550417280692880843.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17045065102322013641.kers'
[2026-05-22 23:21:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1550417280692880843.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17045065102322013641.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 363 rows 375 cols 886 entries
Finished phase 1 with 334 SingleSign rule and 7 generalized
[2026-05-22 23:21:03] [INFO ] Computed 34 invariants in 1 ms
Computed 34 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17045065102322013641.kers
Total runtime 1 ms.
[2026-05-22 23:21:03] [INFO ] Implicit Places using invariants in 213 ms returned []
[2026-05-22 23:21:03] [INFO ] Invariant cache hit.
[2026-05-22 23:21:03] [INFO ] Implicit Places using invariants and state equation in 203 ms returned []
Implicit Place search using SMT with State Equation took 421 ms to find 0 implicit places.
Running 362 sub problems to find dead transitions.
[2026-05-22 23:21:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/374 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 1 (OVERLAPS) 1/375 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/375 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/375 variables, 20/54 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/375 variables, 20/74 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/375 variables, 20/94 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/375 variables, 7/101 constraints. Problems are: Problem set: 0 solved, 362 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 375/738 variables, and 116 constraints, problems are : Problem set: 0 solved, 362 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/375 constraints, PredecessorRefiner: 362/362 constraints, Known Traps: 82/82 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 362 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/374 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 1 (OVERLAPS) 1/375 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/375 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/375 variables, 82/116 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/375 variables, 20/136 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/375 variables, 14/150 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/375 variables, 3/153 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/375 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 8 (OVERLAPS) 363/738 variables, 375/528 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/738 variables, 362/890 constraints. Problems are: Problem set: 0 solved, 362 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 738/738 variables, and 894 constraints, problems are : Problem set: 0 solved, 362 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 375/375 constraints, PredecessorRefiner: 362/362 constraints, Known Traps: 123/123 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60059ms problems are : Problem set: 0 solved, 362 unsolved
Search for dead transitions found 0 dead transitions in 60060ms
Starting structural reductions in LTL mode, iteration 1 : 375/388 places, 363/376 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60529 ms. Remains : 375/388 places, 363/376 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||G(p1)) U !p2))))'
Stuttering acceptance computed with spot in 198 ms :[p2, p2, p2, true, (NOT p1)]
Running random walk in product with property : AutoFlight-PT-05b-LTLFireability-06
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-05b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-05b-LTLFireability-06 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' '!((F(G(p0))&&(G(p1)||G((p2&&X(p2))))))'
Support contains 3 out of 388 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 388/388 places, 376/376 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 130 transitions
Trivial Post-agglo rules discarded 130 transitions
Performed 130 trivial Post agglomeration. Transition count delta: 130
Iterating post reduction 0 with 130 rules applied. Total rules applied 130 place count 387 transition count 245
Reduce places removed 130 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 142 rules applied. Total rules applied 272 place count 257 transition count 233
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 280 place count 249 transition count 233
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 49 Pre rules applied. Total rules applied 280 place count 249 transition count 184
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 3 with 98 rules applied. Total rules applied 378 place count 200 transition count 184
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 385 place count 193 transition count 177
Iterating global reduction 3 with 7 rules applied. Total rules applied 392 place count 193 transition count 177
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 392 place count 193 transition count 175
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 396 place count 191 transition count 175
Performed 71 Post agglomeration using F-continuation condition with reduction of 10 identical transitions.
Deduced a syphon composed of 71 places in 0 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 3 with 142 rules applied. Total rules applied 538 place count 120 transition count 94
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 540 place count 119 transition count 94
Applied a total of 540 rules in 39 ms. Remains 119 /388 variables (removed 269) and now considering 94/376 (removed 282) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14054929792503788944.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10003687470470819218.kers'
[2026-05-22 23:22:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14054929792503788944.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10003687470470819218.kers]
Culling duplicate invariants (modulo rational): removing 7 columns.
Culled 7 columns in 0 ms.
// Phase 1: matrix 94 rows 112 cols 298 entries
Finished phase 1 with 78 SingleSign rule and 7 generalized
[2026-05-22 23:22:03] [INFO ] Computed 34 invariants in 0 ms
Computed 34 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-10003687470470819218.kers
Total runtime 0 ms.
[2026-05-22 23:22:03] [INFO ] Implicit Places using invariants in 118 ms returned [41, 42, 43, 46, 50, 51, 52, 53, 70, 87, 93, 99, 105, 111, 118]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 120 ms to find 15 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 104/388 places, 94/376 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 104 transition count 87
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 97 transition count 87
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 20 place count 91 transition count 81
Iterating global reduction 2 with 6 rules applied. Total rules applied 26 place count 91 transition count 81
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 27 place count 90 transition count 80
Iterating global reduction 2 with 1 rules applied. Total rules applied 28 place count 90 transition count 80
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 29 place count 89 transition count 79
Iterating global reduction 2 with 1 rules applied. Total rules applied 30 place count 89 transition count 79
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 31 place count 88 transition count 78
Iterating global reduction 2 with 1 rules applied. Total rules applied 32 place count 88 transition count 78
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 33 place count 87 transition count 77
Iterating global reduction 2 with 1 rules applied. Total rules applied 34 place count 87 transition count 77
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 35 place count 86 transition count 76
Iterating global reduction 2 with 1 rules applied. Total rules applied 36 place count 86 transition count 76
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 38 place count 85 transition count 75
Applied a total of 38 rules in 11 ms. Remains 85 /104 variables (removed 19) and now considering 75/94 (removed 19) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15293080675219999688.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9565943300682974309.kers'
[2026-05-22 23:22:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15293080675219999688.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9565943300682974309.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 75 rows 85 cols 218 entries
Finished phase 1 with 66 SingleSign rule and 0 generalized
[2026-05-22 23:22:03] [INFO ] Computed 19 invariants in 0 ms
Computed 19 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-9565943300682974309.kers
Total runtime 0 ms.
[2026-05-22 23:22:03] [INFO ] Implicit Places using invariants in 56 ms returned []
[2026-05-22 23:22:03] [INFO ] Invariant cache hit.
[2026-05-22 23:22:04] [INFO ] State equation strengthened by 17 read => feed constraints.
[2026-05-22 23:22:04] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 85/388 places, 75/376 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 317 ms. Remains : 85/388 places, 75/376 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))&&(G(p1)||G((p2&&X(p2))))))'
Stuttering acceptance computed with spot in 157 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (NOT p0), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : AutoFlight-PT-05b-LTLFireability-08
Stuttering criterion allowed to conclude after 26 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-05b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-05b-LTLFireability-08 finished in 498 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(G(p0)))))'
Support contains 3 out of 388 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 388/388 places, 376/376 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 380 transition count 368
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 380 transition count 368
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 20 place count 376 transition count 364
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 376 transition count 364
Applied a total of 24 rules in 17 ms. Remains 376 /388 variables (removed 12) and now considering 364/376 (removed 12) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1521975648763639799.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8784994304472106676.kers'
[2026-05-22 23:22:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1521975648763639799.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8784994304472106676.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 364 rows 376 cols 888 entries
Finished phase 1 with 335 SingleSign rule and 7 generalized
[2026-05-22 23:22:04] [INFO ] Computed 34 invariants in 1 ms
Computed 34 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8784994304472106676.kers
Total runtime 2 ms.
[2026-05-22 23:22:04] [INFO ] Implicit Places using invariants in 111 ms returned []
[2026-05-22 23:22:04] [INFO ] Invariant cache hit.
[2026-05-22 23:22:04] [INFO ] Implicit Places using invariants and state equation in 241 ms returned []
Implicit Place search using SMT with State Equation took 366 ms to find 0 implicit places.
Running 363 sub problems to find dead transitions.
[2026-05-22 23:22:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/375 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 1 (OVERLAPS) 1/376 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/376 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/376 variables, 20/54 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/376 variables, 20/74 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/376 variables, 20/94 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/376 variables, 11/105 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/376 variables, 4/109 constraints. Problems are: Problem set: 0 solved, 363 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 376/740 variables, and 111 constraints, problems are : Problem set: 0 solved, 363 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/376 constraints, PredecessorRefiner: 363/363 constraints, Known Traps: 77/77 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 363 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/375 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 1 (OVERLAPS) 1/376 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/376 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/376 variables, 77/111 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/376 variables, 15/126 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/376 variables, 8/134 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/376 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 363 unsolved
SMT process timed out in 60071ms, After SMT, problems are : Problem set: 0 solved, 363 unsolved
Search for dead transitions found 0 dead transitions in 60073ms
Starting structural reductions in LTL mode, iteration 1 : 376/388 places, 364/376 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60458 ms. Remains : 376/388 places, 364/376 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(G(p0)))))'
Stuttering acceptance computed with spot in 250 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-05b-LTLFireability-09
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-05b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-05b-LTLFireability-09 finished in 60748 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(X(X(p0)))||G(p1)))))'
Support contains 2 out of 388 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 388/388 places, 376/376 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 381 transition count 369
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 381 transition count 369
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 378 transition count 366
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 378 transition count 366
Applied a total of 20 rules in 45 ms. Remains 378 /388 variables (removed 10) and now considering 366/376 (removed 10) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7263997831937177505.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18331521289017453239.kers'
[2026-05-22 23:23:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7263997831937177505.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18331521289017453239.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 366 rows 378 cols 892 entries
Finished phase 1 with 337 SingleSign rule and 7 generalized
[2026-05-22 23:23:05] [INFO ] Computed 34 invariants in 4 ms
Computed 34 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-18331521289017453239.kers
Total runtime 6 ms.
[2026-05-22 23:23:05] [INFO ] Implicit Places using invariants in 231 ms returned []
[2026-05-22 23:23:05] [INFO ] Invariant cache hit.
[2026-05-22 23:23:05] [INFO ] Implicit Places using invariants and state equation in 325 ms returned []
Implicit Place search using SMT with State Equation took 567 ms to find 0 implicit places.
Running 365 sub problems to find dead transitions.
[2026-05-22 23:23:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/377 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 1 (OVERLAPS) 1/378 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/378 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/378 variables, 20/54 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/378 variables, 20/74 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/378 variables, 20/94 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/378 variables, 16/110 constraints. Problems are: Problem set: 0 solved, 365 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 378/744 variables, and 110 constraints, problems are : Problem set: 0 solved, 365 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/378 constraints, PredecessorRefiner: 365/365 constraints, Known Traps: 76/76 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 365 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/377 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 1 (OVERLAPS) 1/378 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/378 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/378 variables, 76/110 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/378 variables, 20/130 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/378 variables, 20/150 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/378 variables, 9/159 constraints. Problems are: Problem set: 0 solved, 365 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 378/744 variables, and 161 constraints, problems are : Problem set: 0 solved, 365 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/378 constraints, PredecessorRefiner: 0/365 constraints, Known Traps: 127/127 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60068ms problems are : Problem set: 0 solved, 365 unsolved
Search for dead transitions found 0 dead transitions in 60071ms
Starting structural reductions in LTL mode, iteration 1 : 378/388 places, 366/376 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60685 ms. Remains : 378/388 places, 366/376 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(X(X(p0)))||G(p1)))))'
Stuttering acceptance computed with spot in 596 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), true, (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : AutoFlight-PT-05b-LTLFireability-10
Product exploration explored 100000 steps with 16666 reset in 184 ms.
Product exploration explored 100000 steps with 16666 reset in 144 ms.
Computed a total of 94 stabilizing places and 94 stable transitions
Computed a total of 94 stabilizing places and 94 stable transitions
Knowledge based reduction with 2 factoid took 108 ms. Reduced automaton from 11 states, 16 edges and 2 AP (stutter sensitive) to 10 states, 14 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (160 resets) in 514 ms. (77 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (14 resets) in 111 ms. (357 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (15 resets) in 76 ms. (519 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (14 resets) in 76 ms. (519 steps per ms) remains 3/3 properties
[2026-05-22 23:24:06] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 36/38 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 338/376 variables, 31/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/376 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 2/378 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/378 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 366/744 variables, 378/412 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/744 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/744 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 744/744 variables, and 412 constraints, problems are : Problem set: 0 solved, 3 unsolved in 315 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 378/378 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 36/38 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 338/376 variables, 31/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/376 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 2/378 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/378 variables, 5/39 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/378 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 366/744 variables, 378/417 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/744 variables, 3/420 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/744 variables, 2/422 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/744 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/744 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 744/744 variables, and 422 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1819 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 378/378 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2138ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 373 ms.
Support contains 2 out of 378 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 378/378 places, 366/366 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 131 transitions
Trivial Post-agglo rules discarded 131 transitions
Performed 131 trivial Post agglomeration. Transition count delta: 131
Iterating post reduction 0 with 131 rules applied. Total rules applied 131 place count 378 transition count 235
Reduce places removed 131 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 146 rules applied. Total rules applied 277 place count 247 transition count 220
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 287 place count 237 transition count 220
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 47 Pre rules applied. Total rules applied 287 place count 237 transition count 173
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 381 place count 190 transition count 173
Performed 75 Post agglomeration using F-continuation condition with reduction of 10 identical transitions.
Deduced a syphon composed of 75 places in 0 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 3 with 150 rules applied. Total rules applied 531 place count 115 transition count 88
Free-agglomeration rule applied 20 times.
Iterating global reduction 3 with 20 rules applied. Total rules applied 551 place count 115 transition count 68
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 3 with 20 rules applied. Total rules applied 571 place count 95 transition count 68
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 572 place count 94 transition count 67
Reduce places removed 23 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 4 with 56 rules applied. Total rules applied 628 place count 71 transition count 34
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 5 with 33 rules applied. Total rules applied 661 place count 38 transition count 34
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 12 Pre rules applied. Total rules applied 661 place count 38 transition count 22
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 6 with 24 rules applied. Total rules applied 685 place count 26 transition count 22
Applied a total of 685 rules in 14 ms. Remains 26 /378 variables (removed 352) and now considering 22/366 (removed 344) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 26/378 places, 22/366 transitions.
RANDOM walk for 1058 steps (0 resets) in 7 ms. (132 steps per ms) remains 0/3 properties
Knowledge based reduction with 2 factoid took 85 ms. Reduced automaton from 10 states, 14 edges and 2 AP (stutter sensitive) to 10 states, 14 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 539 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p0), true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Knowledge-based reduction took 3499 ms.
Stuttering acceptance computed with spot in 542 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p0), true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 378 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 378/378 places, 366/366 transitions.
Applied a total of 0 rules in 17 ms. Remains 378 /378 variables (removed 0) and now considering 366/366 (removed 0) transitions.
[2026-05-22 23:24:10] [INFO ] Invariant cache hit.
[2026-05-22 23:24:10] [INFO ] Implicit Places using invariants in 184 ms returned []
[2026-05-22 23:24:10] [INFO ] Invariant cache hit.
[2026-05-22 23:24:11] [INFO ] Implicit Places using invariants and state equation in 255 ms returned []
Implicit Place search using SMT with State Equation took 441 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 458 ms. Remains : 378/378 places, 366/366 transitions.
Computed a total of 94 stabilizing places and 94 stable transitions
Computed a total of 94 stabilizing places and 94 stable transitions
Knowledge based reduction with 1 factoid took 63 ms. Reduced automaton from 10 states, 14 edges and 2 AP (stutter sensitive) to 10 states, 14 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (160 resets) in 186 ms. (213 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (14 resets) in 51 ms. (769 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (13 resets) in 54 ms. (727 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (15 resets) in 42 ms. (930 steps per ms) remains 3/3 properties
[2026-05-22 23:24:11] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 36/38 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 338/376 variables, 31/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/376 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 2/378 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/378 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 366/744 variables, 378/412 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/744 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/744 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 744/744 variables, and 412 constraints, problems are : Problem set: 0 solved, 3 unsolved in 240 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 378/378 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 36/38 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 338/376 variables, 31/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/376 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 2/378 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/378 variables, 5/39 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/378 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 366/744 variables, 378/417 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/744 variables, 3/420 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/744 variables, 2/422 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/744 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/744 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 744/744 variables, and 422 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1607 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 378/378 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1851ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 365 ms.
Support contains 2 out of 378 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 378/378 places, 366/366 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 131 transitions
Trivial Post-agglo rules discarded 131 transitions
Performed 131 trivial Post agglomeration. Transition count delta: 131
Iterating post reduction 0 with 131 rules applied. Total rules applied 131 place count 378 transition count 235
Reduce places removed 131 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 146 rules applied. Total rules applied 277 place count 247 transition count 220
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 287 place count 237 transition count 220
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 47 Pre rules applied. Total rules applied 287 place count 237 transition count 173
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 381 place count 190 transition count 173
Performed 75 Post agglomeration using F-continuation condition with reduction of 10 identical transitions.
Deduced a syphon composed of 75 places in 0 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 3 with 150 rules applied. Total rules applied 531 place count 115 transition count 88
Free-agglomeration rule applied 20 times.
Iterating global reduction 3 with 20 rules applied. Total rules applied 551 place count 115 transition count 68
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 3 with 20 rules applied. Total rules applied 571 place count 95 transition count 68
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 572 place count 94 transition count 67
Reduce places removed 23 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 4 with 56 rules applied. Total rules applied 628 place count 71 transition count 34
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 5 with 33 rules applied. Total rules applied 661 place count 38 transition count 34
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 12 Pre rules applied. Total rules applied 661 place count 38 transition count 22
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 6 with 24 rules applied. Total rules applied 685 place count 26 transition count 22
Applied a total of 685 rules in 12 ms. Remains 26 /378 variables (removed 352) and now considering 22/366 (removed 344) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 26/378 places, 22/366 transitions.
RANDOM walk for 847 steps (0 resets) in 4 ms. (169 steps per ms) remains 0/3 properties
Knowledge based reduction with 1 factoid took 88 ms. Reduced automaton from 10 states, 14 edges and 2 AP (stutter sensitive) to 10 states, 14 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 527 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p0), true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Knowledge-based reduction took 3032 ms.
Stuttering acceptance computed with spot in 496 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p0), true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 494 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p0), true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 16666 reset in 127 ms.
Product exploration explored 100000 steps with 16666 reset in 137 ms.
Spot run failed in 140 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin4768785556191594966
[2026-05-22 23:24:15] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4768785556191594966
Running compilation step : cd /tmp/ltsmin4768785556191594966;'/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 739 ms.
Running link step : cd /tmp/ltsmin4768785556191594966;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin4768785556191594966;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased737059868018532564.hoa' '--buchi-type=spotba'
LTSmin run took 56 ms.
FORMULA AutoFlight-PT-05b-LTLFireability-10 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property AutoFlight-PT-05b-LTLFireability-10 finished in 71510 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)||(X(!p1) U (p1 U p2)))))'
Support contains 3 out of 388 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 388/388 places, 376/376 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 380 transition count 368
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 380 transition count 368
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 20 place count 376 transition count 364
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 376 transition count 364
Applied a total of 24 rules in 27 ms. Remains 376 /388 variables (removed 12) and now considering 364/376 (removed 12) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8666049540029718740.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2080057283966521395.kers'
[2026-05-22 23:24:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8666049540029718740.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2080057283966521395.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 364 rows 376 cols 888 entries
Finished phase 1 with 335 SingleSign rule and 7 generalized
[2026-05-22 23:24:16] [INFO ] Computed 34 invariants in 4 ms
Computed 34 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-2080057283966521395.kers
Total runtime 5 ms.
[2026-05-22 23:24:16] [INFO ] Implicit Places using invariants in 191 ms returned []
[2026-05-22 23:24:16] [INFO ] Invariant cache hit.
[2026-05-22 23:24:17] [INFO ] Implicit Places using invariants and state equation in 373 ms returned []
Implicit Place search using SMT with State Equation took 567 ms to find 0 implicit places.
Running 363 sub problems to find dead transitions.
[2026-05-22 23:24:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/375 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 1 (OVERLAPS) 1/376 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/376 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/376 variables, 20/54 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/376 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/376 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 363 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 6 (INCLUDED_ONLY) 0/376 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 363 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 376/740 variables, and 82 constraints, problems are : Problem set: 0 solved, 363 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/376 constraints, PredecessorRefiner: 363/363 constraints, Known Traps: 48/48 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 363 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/375 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 1 (OVERLAPS) 1/376 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/376 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/376 variables, 48/82 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/376 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/376 variables, 20/122 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/376 variables, 12/134 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/376 variables, 4/138 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/376 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/376 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 363 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 376/740 variables, and 143 constraints, problems are : Problem set: 0 solved, 363 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/376 constraints, PredecessorRefiner: 0/363 constraints, Known Traps: 109/109 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60066ms problems are : Problem set: 0 solved, 363 unsolved
Search for dead transitions found 0 dead transitions in 60067ms
Starting structural reductions in LTL mode, iteration 1 : 376/388 places, 364/376 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60664 ms. Remains : 376/388 places, 364/376 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)||(X(!p1) U (p1 U p2)))))'
Stuttering acceptance computed with spot in 371 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-05b-LTLFireability-12
Product exploration explored 100000 steps with 3476 reset in 216 ms.
Product exploration explored 100000 steps with 3432 reset in 240 ms.
Computed a total of 92 stabilizing places and 92 stable transitions
Computed a total of 92 stabilizing places and 92 stable transitions
Detected a total of 92/376 stabilizing places and 92/364 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge based reduction with 14 factoid took 92 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
RANDOM walk for 801 steps (0 resets) in 11 ms. (66 steps per ms) remains 0/5 properties
Knowledge based reduction with 14 factoid took 143 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 137 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1))]
[2026-05-22 23:25:18] [INFO ] Invariant cache hit.
[2026-05-22 23:25:18] [INFO ] [Real]Absence check using 33 positive place invariants in 17 ms returned sat
[2026-05-22 23:25:18] [INFO ] [Real]Absence check using 33 positive and 1 generalized place invariants in 5 ms returned sat
[2026-05-22 23:25:19] [INFO ] [Real]Absence check using state equation in 647 ms returned sat
[2026-05-22 23:25:19] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 23:25:19] [INFO ] [Nat]Absence check using 33 positive place invariants in 15 ms returned sat
[2026-05-22 23:25:19] [INFO ] [Nat]Absence check using 33 positive and 1 generalized place invariants in 3 ms returned sat
[2026-05-22 23:25:19] [INFO ] [Nat]Absence check using state equation in 345 ms returned sat
[2026-05-22 23:25:19] [INFO ] Computed and/alt/rep : 363/518/363 causal constraints (skipped 0 transitions) in 13 ms.
[2026-05-22 23:25:23] [INFO ] Added : 328 causal constraints over 66 iterations in 3451 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Knowledge-based reduction took 5263 ms.
Stuttering acceptance computed with spot in 146 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1))]
Support contains 3 out of 376 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 376/376 places, 364/364 transitions.
Applied a total of 0 rules in 7 ms. Remains 376 /376 variables (removed 0) and now considering 364/364 (removed 0) transitions.
[2026-05-22 23:25:23] [INFO ] Invariant cache hit.
[2026-05-22 23:25:23] [INFO ] Implicit Places using invariants in 122 ms returned []
[2026-05-22 23:25:23] [INFO ] Invariant cache hit.
[2026-05-22 23:25:23] [INFO ] Implicit Places using invariants and state equation in 302 ms returned []
Implicit Place search using SMT with State Equation took 427 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 434 ms. Remains : 376/376 places, 364/364 transitions.
Computed a total of 92 stabilizing places and 92 stable transitions
Computed a total of 92 stabilizing places and 92 stable transitions
Detected a total of 92/376 stabilizing places and 92/364 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge based reduction with 8 factoid took 60 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
RANDOM walk for 828 steps (0 resets) in 6 ms. (118 steps per ms) remains 0/5 properties
Knowledge based reduction with 8 factoid took 108 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 155 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1))]
[2026-05-22 23:25:24] [INFO ] Invariant cache hit.
[2026-05-22 23:25:24] [INFO ] [Real]Absence check using 33 positive place invariants in 17 ms returned sat
[2026-05-22 23:25:24] [INFO ] [Real]Absence check using 33 positive and 1 generalized place invariants in 17 ms returned sat
[2026-05-22 23:25:25] [INFO ] [Real]Absence check using state equation in 607 ms returned sat
[2026-05-22 23:25:25] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 23:25:25] [INFO ] [Nat]Absence check using 33 positive place invariants in 16 ms returned sat
[2026-05-22 23:25:25] [INFO ] [Nat]Absence check using 33 positive and 1 generalized place invariants in 3 ms returned sat
[2026-05-22 23:25:25] [INFO ] [Nat]Absence check using state equation in 384 ms returned sat
[2026-05-22 23:25:25] [INFO ] Computed and/alt/rep : 363/518/363 causal constraints (skipped 0 transitions) in 24 ms.
[2026-05-22 23:25:29] [INFO ] Added : 328 causal constraints over 66 iterations in 3599 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Knowledge-based reduction took 5403 ms.
Stuttering acceptance computed with spot in 257 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1))]
Stuttering acceptance computed with spot in 250 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1))]
Product exploration explored 100000 steps with 3484 reset in 176 ms.
Product exploration explored 100000 steps with 3567 reset in 135 ms.
Spot run failed in 84 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin1955847504213409467
[2026-05-22 23:25:30] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1955847504213409467
Running compilation step : cd /tmp/ltsmin1955847504213409467;'/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 601 ms.
Running link step : cd /tmp/ltsmin1955847504213409467;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 69 ms.
Running LTSmin : cd /tmp/ltsmin1955847504213409467;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased18252805879192505401.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 376 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 376/376 places, 364/364 transitions.
Applied a total of 0 rules in 16 ms. Remains 376 /376 variables (removed 0) and now considering 364/364 (removed 0) transitions.
[2026-05-22 23:25:45] [INFO ] Invariant cache hit.
[2026-05-22 23:25:45] [INFO ] Implicit Places using invariants in 151 ms returned []
[2026-05-22 23:25:45] [INFO ] Invariant cache hit.
[2026-05-22 23:25:45] [INFO ] Implicit Places using invariants and state equation in 332 ms returned []
Implicit Place search using SMT with State Equation took 486 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 503 ms. Remains : 376/376 places, 364/364 transitions.
Built C files in :
/tmp/ltsmin8233314463892162658
[2026-05-22 23:25:45] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8233314463892162658
Running compilation step : cd /tmp/ltsmin8233314463892162658;'/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 613 ms.
Running link step : cd /tmp/ltsmin8233314463892162658;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin8233314463892162658;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased14236649518062700651.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-22 23:26:00] [INFO ] Flatten gal took : 13 ms
[2026-05-22 23:26:00] [INFO ] Flatten gal took : 12 ms
[2026-05-22 23:26:00] [INFO ] Time to serialize gal into /tmp/LTL16382635303781095584.gal : 4 ms
[2026-05-22 23:26:00] [INFO ] Time to serialize properties into /tmp/LTL10779214370686578818.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16382635303781095584.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16444195088321038210.hoa' '-atoms' '/tmp/LTL10779214370686578818.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL10779214370686578818.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16444195088321038210.hoa
Detected timeout of ITS tools.
[2026-05-22 23:26:15] [INFO ] Flatten gal took : 24 ms
[2026-05-22 23:26:16] [INFO ] Flatten gal took : 17 ms
[2026-05-22 23:26:16] [INFO ] Time to serialize gal into /tmp/LTL10369646356856651377.gal : 4 ms
[2026-05-22 23:26:16] [INFO ] Time to serialize properties into /tmp/LTL12227806561583932108.ltl : 10 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10369646356856651377.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12227806561583932108.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X((F("(p312==1)"))||((X("(p228!=1)"))U(("(p228==1)")U("(p38==1)"))))))
Formula 0 simplified : X(G!"(p312==1)" & (X!"(p228!=1)" R (!"(p228==1)" R !"(p38==1)")))
Detected timeout of ITS tools.
[2026-05-22 23:26:31] [INFO ] Flatten gal took : 29 ms
[2026-05-22 23:26:31] [INFO ] Applying decomposition
[2026-05-22 23:26:31] [INFO ] Flatten gal took : 25 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph17732270507565055581.txt' '-o' '/tmp/graph17732270507565055581.bin' '-w' '/tmp/graph17732270507565055581.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph17732270507565055581.bin' '-l' '-1' '-v' '-w' '/tmp/graph17732270507565055581.weights' '-q' '0' '-e' '0.001'
[2026-05-22 23:26:31] [INFO ] Decomposing Gal with order
[2026-05-22 23:26:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 23:26:31] [INFO ] Removed a total of 71 redundant transitions.
[2026-05-22 23:26:31] [INFO ] Flatten gal took : 117 ms
[2026-05-22 23:26:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2026-05-22 23:26:31] [INFO ] Time to serialize gal into /tmp/LTL2754690359150568499.gal : 5 ms
[2026-05-22 23:26:31] [INFO ] Time to serialize properties into /tmp/LTL3192230720350769008.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2754690359150568499.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3192230720350769008.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X((F("(i19.i0.u89.p312==1)"))||((X("(i1.i0.u63.p228!=1)"))U(("(i1.i0.u63.p228==1)")U("(i3.u16.p38==1)"))))))
Formula 0 simplified : X(G!"(i19.i0.u89.p312==1)" & (X!"(i1.i0.u63.p228!=1)" R (!"(i1.i0.u63.p228==1)" R !"(i3.u16.p38==1)")))
Reverse transition relation is NOT exact ! Due to transitions t129, t132, t145, t148, t172, t175, t193, t200, t223, t246, t261, t268, t284, t363, t364, t36...939
Computing Next relation with stutter on 800 deadlock states
Detected timeout of ITS tools.
Treatment of property AutoFlight-PT-05b-LTLFireability-12 finished in 149978 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((X(p0)&&((F(p1)||X(p2)) U (G((F(p1)||X(p2)))||(p3&&(F(p1)||X(p2))))))))'
Support contains 4 out of 388 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 388/388 places, 376/376 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 380 transition count 368
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 380 transition count 368
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 19 place count 377 transition count 365
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 377 transition count 365
Applied a total of 22 rules in 18 ms. Remains 377 /388 variables (removed 11) and now considering 365/376 (removed 11) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4363543287441361068.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14132707019021847836.kers'
[2026-05-22 23:26:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4363543287441361068.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14132707019021847836.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 365 rows 377 cols 890 entries
Finished phase 1 with 336 SingleSign rule and 7 generalized
[2026-05-22 23:26:46] [INFO ] Computed 34 invariants in 1 ms
Computed 34 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-14132707019021847836.kers
Total runtime 2 ms.
[2026-05-22 23:26:46] [INFO ] Implicit Places using invariants in 150 ms returned []
[2026-05-22 23:26:46] [INFO ] Invariant cache hit.
[2026-05-22 23:26:46] [INFO ] Implicit Places using invariants and state equation in 224 ms returned []
Implicit Place search using SMT with State Equation took 397 ms to find 0 implicit places.
Running 364 sub problems to find dead transitions.
[2026-05-22 23:26:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/376 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 1 (OVERLAPS) 1/377 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/377 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/377 variables, 20/54 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/377 variables, 5/59 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/377 variables, 9/68 constraints. Problems are: Problem set: 0 solved, 364 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 377/742 variables, and 69 constraints, problems are : Problem set: 0 solved, 364 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/377 constraints, PredecessorRefiner: 364/364 constraints, Known Traps: 35/35 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 364 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/376 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 1 (OVERLAPS) 1/377 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/377 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/377 variables, 35/69 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/377 variables, 20/89 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/377 variables, 11/100 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/377 variables, 15/115 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/377 variables, 2/117 constraints. Problems are: Problem set: 0 solved, 364 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 377/742 variables, and 117 constraints, problems are : Problem set: 0 solved, 364 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/377 constraints, PredecessorRefiner: 0/364 constraints, Known Traps: 83/83 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60056ms problems are : Problem set: 0 solved, 364 unsolved
Search for dead transitions found 0 dead transitions in 60057ms
Starting structural reductions in LTL mode, iteration 1 : 377/388 places, 365/376 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60473 ms. Remains : 377/388 places, 365/376 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((X(p0)&&((F(p1)||X(p2)) U (G((F(p1)||X(p2)))||(p3&&(F(p1)||X(p2))))))))'
Stuttering acceptance computed with spot in 290 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) p2), false]
Running random walk in product with property : AutoFlight-PT-05b-LTLFireability-15
Product exploration explored 100000 steps with 1292 reset in 179 ms.
Product exploration explored 100000 steps with 1332 reset in 191 ms.
Computed a total of 93 stabilizing places and 93 stable transitions
Computed a total of 93 stabilizing places and 93 stable transitions
Detected a total of 93/377 stabilizing places and 93/365 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/4 atomic propositions.
Knowledge based reduction with 23 factoid took 162 ms. Reduced automaton from 6 states, 16 edges and 4 AP (stutter sensitive) to 6 states, 15 edges and 4 AP (stutter sensitive).
RANDOM walk for 7248 steps (27 resets) in 28 ms. (249 steps per ms) remains 0/12 properties
Knowledge based reduction with 23 factoid took 633 ms. Reduced automaton from 6 states, 15 edges and 4 AP (stutter sensitive) to 6 states, 15 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 373 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) p2), false]
[2026-05-22 23:27:48] [INFO ] Invariant cache hit.
[2026-05-22 23:27:49] [INFO ] [Real]Absence check using 33 positive place invariants in 15 ms returned sat
[2026-05-22 23:27:49] [INFO ] [Real]Absence check using 33 positive and 1 generalized place invariants in 4 ms returned sat
[2026-05-22 23:27:49] [INFO ] [Real]Absence check using state equation in 489 ms returned sat
[2026-05-22 23:27:49] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 23:27:49] [INFO ] [Nat]Absence check using 33 positive place invariants in 14 ms returned sat
[2026-05-22 23:27:49] [INFO ] [Nat]Absence check using 33 positive and 1 generalized place invariants in 5 ms returned sat
[2026-05-22 23:27:50] [INFO ] [Nat]Absence check using state equation in 294 ms returned sat
[2026-05-22 23:27:50] [INFO ] Computed and/alt/rep : 364/519/364 causal constraints (skipped 0 transitions) in 24 ms.
[2026-05-22 23:27:53] [INFO ] Added : 338 causal constraints over 68 iterations in 2989 ms. Result :sat
Could not prove EG (NOT p0)
Knowledge-based reduction took 5404 ms.
Stuttering acceptance computed with spot in 412 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) p2), false]
Support contains 4 out of 377 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 377/377 places, 365/365 transitions.
Applied a total of 0 rules in 16 ms. Remains 377 /377 variables (removed 0) and now considering 365/365 (removed 0) transitions.
[2026-05-22 23:27:53] [INFO ] Invariant cache hit.
[2026-05-22 23:27:53] [INFO ] Implicit Places using invariants in 207 ms returned []
[2026-05-22 23:27:53] [INFO ] Invariant cache hit.
[2026-05-22 23:27:54] [INFO ] Implicit Places using invariants and state equation in 312 ms returned []
Implicit Place search using SMT with State Equation took 520 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 539 ms. Remains : 377/377 places, 365/365 transitions.
Computed a total of 93 stabilizing places and 93 stable transitions
Computed a total of 93 stabilizing places and 93 stable transitions
Detected a total of 93/377 stabilizing places and 93/365 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/4 atomic propositions.
Knowledge based reduction with 16 factoid took 78 ms. Reduced automaton from 6 states, 15 edges and 4 AP (stutter sensitive) to 6 states, 15 edges and 4 AP (stutter sensitive).
RANDOM walk for 10725 steps (41 resets) in 34 ms. (306 steps per ms) remains 0/12 properties
Knowledge based reduction with 16 factoid took 753 ms. Reduced automaton from 6 states, 15 edges and 4 AP (stutter sensitive) to 6 states, 15 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 397 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) p2), false]
[2026-05-22 23:27:55] [INFO ] Invariant cache hit.
[2026-05-22 23:27:55] [INFO ] [Real]Absence check using 33 positive place invariants in 17 ms returned sat
[2026-05-22 23:27:55] [INFO ] [Real]Absence check using 33 positive and 1 generalized place invariants in 5 ms returned sat
[2026-05-22 23:27:55] [INFO ] [Real]Absence check using state equation in 493 ms returned sat
[2026-05-22 23:27:56] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 23:27:56] [INFO ] [Nat]Absence check using 33 positive place invariants in 14 ms returned sat
[2026-05-22 23:27:56] [INFO ] [Nat]Absence check using 33 positive and 1 generalized place invariants in 3 ms returned sat
[2026-05-22 23:27:56] [INFO ] [Nat]Absence check using state equation in 268 ms returned sat
[2026-05-22 23:27:56] [INFO ] Computed and/alt/rep : 364/519/364 causal constraints (skipped 0 transitions) in 24 ms.
[2026-05-22 23:27:59] [INFO ] Added : 338 causal constraints over 68 iterations in 2680 ms. Result :sat
Could not prove EG (NOT p0)
Knowledge-based reduction took 5122 ms.
Stuttering acceptance computed with spot in 379 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) p2), false]
Stuttering acceptance computed with spot in 263 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) p2), false]
Product exploration explored 100000 steps with 1326 reset in 160 ms.
Product exploration explored 100000 steps with 1298 reset in 150 ms.
Spot run failed in 85 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin8699247292087815227
[2026-05-22 23:28:00] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8699247292087815227
Running compilation step : cd /tmp/ltsmin8699247292087815227;'/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 587 ms.
Running link step : cd /tmp/ltsmin8699247292087815227;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 68 ms.
Running LTSmin : cd /tmp/ltsmin8699247292087815227;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased17352538538456355120.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 377 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 377/377 places, 365/365 transitions.
Applied a total of 0 rules in 6 ms. Remains 377 /377 variables (removed 0) and now considering 365/365 (removed 0) transitions.
[2026-05-22 23:28:15] [INFO ] Invariant cache hit.
[2026-05-22 23:28:15] [INFO ] Implicit Places using invariants in 116 ms returned []
[2026-05-22 23:28:15] [INFO ] Invariant cache hit.
[2026-05-22 23:28:15] [INFO ] Implicit Places using invariants and state equation in 278 ms returned []
Implicit Place search using SMT with State Equation took 395 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 402 ms. Remains : 377/377 places, 365/365 transitions.
Built C files in :
/tmp/ltsmin7839275126413700494
[2026-05-22 23:28:15] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7839275126413700494
Running compilation step : cd /tmp/ltsmin7839275126413700494;'/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 539 ms.
Running link step : cd /tmp/ltsmin7839275126413700494;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin7839275126413700494;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased16616781646207345856.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-22 23:28:30] [INFO ] Flatten gal took : 29 ms
[2026-05-22 23:28:30] [INFO ] Flatten gal took : 20 ms
[2026-05-22 23:28:30] [INFO ] Time to serialize gal into /tmp/LTL12054602021626332828.gal : 4 ms
[2026-05-22 23:28:30] [INFO ] Time to serialize properties into /tmp/LTL732594227735519117.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12054602021626332828.gal' '-t' 'CGAL' '-hoa' '/tmp/aut18195233376046056901.hoa' '-atoms' '/tmp/LTL732594227735519117.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL732594227735519117.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut18195233376046056901.hoa
Detected timeout of ITS tools.
[2026-05-22 23:28:45] [INFO ] Flatten gal took : 8 ms
[2026-05-22 23:28:45] [INFO ] Flatten gal took : 7 ms
[2026-05-22 23:28:45] [INFO ] Time to serialize gal into /tmp/LTL4815045538089220382.gal : 4 ms
[2026-05-22 23:28:45] [INFO ] Time to serialize properties into /tmp/LTL3986540761158759940.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4815045538089220382.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3986540761158759940.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F((X("(p257==1)"))&&(((F("(p12!=1)"))||(X("(p455!=1)")))U((G((F("(p12!=1)"))||(X("(p455!=1)"))))||(("(p163==1)")&&((F("(p12!=1)"))|...179
Formula 0 simplified : G(X!"(p257==1)" | (!"(p163==1)" U (G!"(p12!=1)" & X!"(p455!=1)")))
Detected timeout of ITS tools.
[2026-05-22 23:29:00] [INFO ] Flatten gal took : 25 ms
[2026-05-22 23:29:00] [INFO ] Applying decomposition
[2026-05-22 23:29:00] [INFO ] Flatten gal took : 21 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph8442925359776310812.txt' '-o' '/tmp/graph8442925359776310812.bin' '-w' '/tmp/graph8442925359776310812.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph8442925359776310812.bin' '-l' '-1' '-v' '-w' '/tmp/graph8442925359776310812.weights' '-q' '0' '-e' '0.001'
[2026-05-22 23:29:00] [INFO ] Decomposing Gal with order
[2026-05-22 23:29:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 23:29:01] [INFO ] Removed a total of 71 redundant transitions.
[2026-05-22 23:29:01] [INFO ] Flatten gal took : 25 ms
[2026-05-22 23:29:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2026-05-22 23:29:01] [INFO ] Time to serialize gal into /tmp/LTL14494350951590377682.gal : 5 ms
[2026-05-22 23:29:01] [INFO ] Time to serialize properties into /tmp/LTL11680453681311320288.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14494350951590377682.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11680453681311320288.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((F((X("(i13.u73.p257==1)"))&&(((F("(i12.u6.p12!=1)"))||(X("(i21.u149.p455!=1)")))U((G((F("(i12.u6.p12!=1)"))||(X("(i21.u149.p455!=1)...243
Formula 0 simplified : G(X!"(i13.u73.p257==1)" | (!"(i12.u48.p163==1)" U (G!"(i12.u6.p12!=1)" & X!"(i21.u149.p455!=1)")))
Reverse transition relation is NOT exact ! Due to transitions t116, t119, t132, t145, t172, t175, t200, t216, t223, t239, t246, t261, t284, t363, t364, t36...853
Computing Next relation with stutter on 800 deadlock states
Detected timeout of ITS tools.
Treatment of property AutoFlight-PT-05b-LTLFireability-15 finished in 149622 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)||(X(!p1) U (p1 U p2)))))'
Spot run failed in 85 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
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((X(p0)&&((F(p1)||X(p2)) U (G((F(p1)||X(p2)))||(p3&&(F(p1)||X(p2))))))))'
Spot run failed in 45 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
[2026-05-22 23:29:16] [INFO ] Flatten gal took : 21 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin571910941437335528
[2026-05-22 23:29:16] [INFO ] Computing symmetric may disable matrix : 376 transitions.
[2026-05-22 23:29:16] [INFO ] Applying decomposition
[2026-05-22 23:29:16] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 23:29:16] [INFO ] Computing symmetric may enable matrix : 376 transitions.
[2026-05-22 23:29:16] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 23:29:16] [INFO ] Flatten gal took : 26 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph2287763927601240141.txt' '-o' '/tmp/graph2287763927601240141.bin' '-w' '/tmp/graph2287763927601240141.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph2287763927601240141.bin' '-l' '-1' '-v' '-w' '/tmp/graph2287763927601240141.weights' '-q' '0' '-e' '0.001'
[2026-05-22 23:29:16] [INFO ] Decomposing Gal with order
[2026-05-22 23:29:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 23:29:16] [INFO ] Computing Do-Not-Accords matrix : 376 transitions.
[2026-05-22 23:29:16] [INFO ] Computation of Completed DNA matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 23:29:16] [INFO ] Built C files in 107ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin571910941437335528
Running compilation step : cd /tmp/ltsmin571910941437335528;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '360' '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'
[2026-05-22 23:29:16] [INFO ] Removed a total of 64 redundant transitions.
[2026-05-22 23:29:16] [INFO ] Flatten gal took : 22 ms
[2026-05-22 23:29:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2026-05-22 23:29:16] [INFO ] Time to serialize gal into /tmp/LTLFireability7506091641606031226.gal : 4 ms
[2026-05-22 23:29:16] [INFO ] Time to serialize properties into /tmp/LTLFireability11118317413858816155.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability7506091641606031226.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability11118317413858816155.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 2 LTL properties
Checking formula 0 : !((X((F("(i19.u91.p312==1)"))||((X("(i1.u62.p228!=1)"))U(("(i1.u62.p228==1)")U("(i5.u16.p38==1)"))))))
Formula 0 simplified : X(G!"(i19.u91.p312==1)" & (X!"(i1.u62.p228!=1)" R (!"(i1.u62.p228==1)" R !"(i5.u16.p38==1)")))
Compilation finished in 750 ms.
Running link step : cd /tmp/ltsmin571910941437335528;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 69 ms.
Running LTSmin : cd /tmp/ltsmin571910941437335528;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' 'X((<>((LTLAPp0==true))||(X(!(LTLAPp1==true)) U ((LTLAPp1==true) U (LTLAPp2==true)))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t129, t145, t172, t175, t200, t216, t223, t246, t268, t284, t363, t364, t365, t366, t367, t36...979
Computing Next relation with stutter on 800 deadlock states
170 unique states visited
170 strongly connected components in search stack
170 transitions explored
170 items max in DFS search stack
3035 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,30.3923,904696,1,0,2.22531e+06,330,4772,3.20425e+06,190,1112,3527453
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA AutoFlight-PT-05b-LTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((F((X("(i0.u73.p257==1)"))&&(((F("(i10.u5.p12!=1)"))||(X("(i22.u153.p455!=1)")))U((G((F("(i10.u5.p12!=1)"))||(X("(i22.u153.p455!=1)"...242
Formula 1 simplified : G(X!"(i0.u73.p257==1)" | (!"(i10.u45.p163==1)" U (G!"(i10.u5.p12!=1)" & X!"(i22.u153.p455!=1)")))
Computing Next relation with stutter on 800 deadlock states
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin571910941437335528;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' 'X((<>((LTLAPp0==true))||(X(!(LTLAPp1==true)) U ((LTLAPp1==true) U (LTLAPp2==true)))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin571910941437335528;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' '<>((X((LTLAPp3==true))&&((<>((LTLAPp4==true))||X((LTLAPp5==true))) U ([]((<>((LTLAPp4==true))||X((LTLAPp5==true))))||((LTLAPp6==true)&&(<>((LTLAPp4==true))||X((LTLAPp5==true))))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2026-05-22 23:52:24] [INFO ] Applying decomposition
[2026-05-22 23:52:24] [INFO ] Flatten gal took : 13 ms
[2026-05-22 23:52:24] [INFO ] Decomposing Gal with order
[2026-05-22 23:52:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 23:52:24] [INFO ] Removed a total of 12 redundant transitions.
[2026-05-22 23:52:24] [INFO ] Flatten gal took : 12 ms
[2026-05-22 23:52:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 54 labels/synchronizations in 26 ms.
[2026-05-22 23:52:24] [INFO ] Time to serialize gal into /tmp/LTLFireability3867676382653383192.gal : 6 ms
[2026-05-22 23:52:24] [INFO ] Time to serialize properties into /tmp/LTLFireability11969014860328185090.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability3867676382653383192.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability11969014860328185090.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F((X("(i0.i0.i0.i0.i0.i0.u44.p257==1)"))&&(((F("(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u71.p12!=1)"))||(X("(i1.i0.i0.u62.p455!=1)")))U((G((...391
Formula 0 simplified : G(X!"(i0.i0.i0.i0.i0.i0.u44.p257==1)" | (!"(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u35.p163==1)" U (G!"(i0.i0.i0.i0.i0.i0.i0.i...207
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin571910941437335528;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' '<>((X((LTLAPp3==true))&&((<>((LTLAPp4==true))||X((LTLAPp5==true))) U ([]((<>((LTLAPp4==true))||X((LTLAPp5==true))))||((LTLAPp6==true)&&(<>((LTLAPp4==true))||X((LTLAPp5==true))))))))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 14400 s
Running LTSmin : cd /tmp/ltsmin571910941437335528;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' '<>((X((LTLAPp3==true))&&((<>((LTLAPp4==true))||X((LTLAPp5==true))) U ([]((<>((LTLAPp4==true))||X((LTLAPp5==true))))||((LTLAPp6==true)&&(<>((LTLAPp4==true))||X((LTLAPp5==true))))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2026-05-23 00:15:57] [INFO ] Flatten gal took : 341 ms
[2026-05-23 00:15:58] [INFO ] Input system was already deterministic with 376 transitions.
[2026-05-23 00:15:58] [INFO ] Transformed 388 places.
[2026-05-23 00:15:58] [INFO ] Transformed 376 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2026-05-23 00:15:58] [INFO ] Time to serialize gal into /tmp/LTLFireability6239523846897019651.gal : 9 ms
[2026-05-23 00:15:58] [INFO ] Time to serialize properties into /tmp/LTLFireability13693752793713087670.ltl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability6239523846897019651.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability13693752793713087670.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...343
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F((X("(p257==1)"))&&(((F("(p12!=1)"))||(X("(p455!=1)")))U((G((F("(p12!=1)"))||(X("(p455!=1)"))))||(("(p163==1)")&&((F("(p12!=1)"))|...179
Formula 0 simplified : G(X!"(p257==1)" | (!"(p163==1)" U (G!"(p12!=1)" & X!"(p455!=1)")))

BK_TIME_CONFINEMENT_REACHED

--------------------
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-05b"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5973"
echo " Executing tool itstools"
echo " Input is AutoFlight-PT-05b, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r002-oct2-177944366400516"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' 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 ;