Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r146-tall-177961074400732.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5973
Executing tool itstools
Input is HirschbergSinclair-PT-05, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r146-tall-177961074400732
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 620K
-rw-r--r-- 1 mcc users 9.7K Mar 7 17:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Mar 7 17:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Mar 7 17:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K Mar 7 17:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.5K Mar 15 10:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Mar 15 10:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.4K Mar 15 10:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 15 10:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Mar 7 17:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 89K Mar 7 17:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 17K Mar 7 17:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 105K Mar 7 17:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Mar 15 10:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Mar 15 10:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 157K 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 HirschbergSinclair-PT-05-LTLFireability-00
FORMULA_NAME HirschbergSinclair-PT-05-LTLFireability-01
FORMULA_NAME HirschbergSinclair-PT-05-LTLFireability-02
FORMULA_NAME HirschbergSinclair-PT-05-LTLFireability-03
FORMULA_NAME HirschbergSinclair-PT-05-LTLFireability-04
FORMULA_NAME HirschbergSinclair-PT-05-LTLFireability-05
FORMULA_NAME HirschbergSinclair-PT-05-LTLFireability-06
FORMULA_NAME HirschbergSinclair-PT-05-LTLFireability-07
FORMULA_NAME HirschbergSinclair-PT-05-LTLFireability-08
FORMULA_NAME HirschbergSinclair-PT-05-LTLFireability-09
FORMULA_NAME HirschbergSinclair-PT-05-LTLFireability-10
FORMULA_NAME HirschbergSinclair-PT-05-LTLFireability-11
FORMULA_NAME HirschbergSinclair-PT-05-LTLFireability-12
FORMULA_NAME HirschbergSinclair-PT-05-LTLFireability-13
FORMULA_NAME HirschbergSinclair-PT-05-LTLFireability-14
FORMULA_NAME HirschbergSinclair-PT-05-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779749754535

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HirschbergSinclair-PT-05
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-25 22:55:55] [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-25 22:55:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 22:55:55] [INFO ] Load time of PNML (sax parser for PT used): 67 ms
[2026-05-25 22:55:55] [INFO ] Transformed 124 places.
[2026-05-25 22:55:55] [INFO ] Transformed 111 transitions.
[2026-05-25 22:55:55] [INFO ] Parsed PT model containing 124 places and 111 transitions and 340 arcs in 157 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
FORMULA HirschbergSinclair-PT-05-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-05-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-05-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-05-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-05-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-05-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 111/111 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 119 transition count 111
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 8 place count 116 transition count 108
Iterating global reduction 1 with 3 rules applied. Total rules applied 11 place count 116 transition count 108
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 115 transition count 107
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 115 transition count 107
Applied a total of 13 rules in 43 ms. Remains 115 /124 variables (removed 9) and now considering 107/111 (removed 4) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3234959758642240519.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7077836876755313344.kers'
[2026-05-25 22:55:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3234959758642240519.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7077836876755313344.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 107 rows 115 cols 322 entries
Finished phase 1 with 104 SingleSign rule and 3 generalized
[2026-05-25 22:55:56] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7077836876755313344.kers
Total runtime 1 ms.
[2026-05-25 22:55:56] [INFO ] Implicit Places using invariants in 207 ms returned []
[2026-05-25 22:55:56] [INFO ] Invariant cache hit.
[2026-05-25 22:55:56] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 383 ms to find 0 implicit places.
Running 102 sub problems to find dead transitions.
[2026-05-25 22:55:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/110 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (OVERLAPS) 5/115 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/115 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (OVERLAPS) 107/222 variables, 115/123 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/222 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (OVERLAPS) 0/222 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Real declared 222/222 variables, and 123 constraints, problems are : Problem set: 0 solved, 102 unsolved in 4307 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 115/115 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 102 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/110 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (OVERLAPS) 5/115 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/115 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (OVERLAPS) 107/222 variables, 115/123 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/222 variables, 102/225 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/222 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (OVERLAPS) 0/222 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Int declared 222/222 variables, and 225 constraints, problems are : Problem set: 0 solved, 102 unsolved in 30014 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 115/115 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 34384ms problems are : Problem set: 0 solved, 102 unsolved
Search for dead transitions found 0 dead transitions in 34396ms
Starting structural reductions in LTL mode, iteration 1 : 115/124 places, 107/111 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34865 ms. Remains : 115/124 places, 107/111 transitions.
Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 107/107 transitions.
Applied a total of 0 rules in 5 ms. Remains 115 /115 variables (removed 0) and now considering 107/107 (removed 0) transitions.
[2026-05-25 22:56:30] [INFO ] Invariant cache hit.
[2026-05-25 22:56:30] [INFO ] Implicit Places using invariants in 54 ms returned []
[2026-05-25 22:56:30] [INFO ] Invariant cache hit.
[2026-05-25 22:56:30] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 174 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 179 ms. Remains : 115/115 places, 107/107 transitions.
Support contains 30 out of 115 places after structural reductions.
[2026-05-25 22:56:31] [INFO ] Flatten gal took : 26 ms
[2026-05-25 22:56:31] [INFO ] Flatten gal took : 11 ms
[2026-05-25 22:56:31] [INFO ] Input system was already deterministic with 107 transitions.
Support contains 29 out of 115 places (down from 30) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 24 to 23
RANDOM walk for 517 steps (1 resets) in 52 ms. (9 steps per ms) remains 0/23 properties
Computed a total of 115 stabilizing places and 107 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 115 transition count 107
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
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((!p1 U p2))||G(p3)||p0)))'
Support contains 5 out of 115 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 107/107 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 112 transition count 104
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 112 transition count 104
Applied a total of 6 rules in 10 ms. Remains 112 /115 variables (removed 3) and now considering 104/107 (removed 3) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13115965050419089339.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1377989037823168439.kers'
[2026-05-25 22:56:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13115965050419089339.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1377989037823168439.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 104 rows 112 cols 314 entries
Finished phase 1 with 101 SingleSign rule and 3 generalized
[2026-05-25 22:56:31] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-1377989037823168439.kers
Total runtime 1 ms.
[2026-05-25 22:56:31] [INFO ] Implicit Places using invariants in 54 ms returned []
[2026-05-25 22:56:31] [INFO ] Invariant cache hit.
[2026-05-25 22:56:31] [INFO ] Implicit Places using invariants and state equation in 170 ms returned []
Implicit Place search using SMT with State Equation took 225 ms to find 0 implicit places.
Running 99 sub problems to find dead transitions.
[2026-05-25 22:56:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (OVERLAPS) 5/112 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 4 (OVERLAPS) 104/216 variables, 112/120 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/216 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 6 (OVERLAPS) 0/216 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Real declared 216/216 variables, and 120 constraints, problems are : Problem set: 0 solved, 99 unsolved in 3725 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 112/112 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 99 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (OVERLAPS) 5/112 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 4 (OVERLAPS) 104/216 variables, 112/120 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/216 variables, 99/219 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/216 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 7 (OVERLAPS) 0/216 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Int declared 216/216 variables, and 219 constraints, problems are : Problem set: 0 solved, 99 unsolved in 24586 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 112/112 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 28335ms problems are : Problem set: 0 solved, 99 unsolved
Search for dead transitions found 0 dead transitions in 28336ms
Starting structural reductions in LTL mode, iteration 1 : 112/115 places, 104/107 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28573 ms. Remains : 112/115 places, 104/107 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((!p1 U p2))||G(p3)||p0)))'
Stuttering acceptance computed with spot in 353 ms :[true, (NOT p2), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p3)]
Running random walk in product with property : HirschbergSinclair-PT-05-LTLFireability-00
Product exploration explored 100000 steps with 50000 reset in 168 ms.
Product exploration explored 100000 steps with 50000 reset in 130 ms.
Computed a total of 112 stabilizing places and 104 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 112 transition count 104
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge based reduction with 13 factoid took 168 ms. Proved property starting from automaton with 6 states, 12 edges and 4 AP (stutter sensitive
Knowledge-based reduction took 220 ms.
FORMULA HirschbergSinclair-PT-05-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-05-LTLFireability-00 finished in 29524 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(X(F(p1)))&&(F(p2) U p3))))))'
Support contains 6 out of 115 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 107/107 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 112 transition count 104
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 112 transition count 104
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 111 transition count 103
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 111 transition count 103
Applied a total of 8 rules in 13 ms. Remains 111 /115 variables (removed 4) and now considering 103/107 (removed 4) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14480946427055764717.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17631349560281408981.kers'
[2026-05-25 22:57:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14480946427055764717.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17631349560281408981.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 103 rows 111 cols 311 entries
Finished phase 1 with 100 SingleSign rule and 3 generalized
[2026-05-25 22:57:01] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-17631349560281408981.kers
Total runtime 0 ms.
[2026-05-25 22:57:01] [INFO ] Implicit Places using invariants in 49 ms returned []
[2026-05-25 22:57:01] [INFO ] Invariant cache hit.
[2026-05-25 22:57:01] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 207 ms to find 0 implicit places.
Running 98 sub problems to find dead transitions.
[2026-05-25 22:57:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (OVERLAPS) 5/111 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (OVERLAPS) 103/214 variables, 111/119 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/214 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (OVERLAPS) 0/214 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Real declared 214/214 variables, and 119 constraints, problems are : Problem set: 0 solved, 98 unsolved in 3588 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 111/111 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 98 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (OVERLAPS) 5/111 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (OVERLAPS) 103/214 variables, 111/119 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/214 variables, 98/217 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/214 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (OVERLAPS) 0/214 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Int declared 214/214 variables, and 217 constraints, problems are : Problem set: 0 solved, 98 unsolved in 26994 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 111/111 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 30595ms problems are : Problem set: 0 solved, 98 unsolved
Search for dead transitions found 0 dead transitions in 30596ms
Starting structural reductions in LTL mode, iteration 1 : 111/115 places, 103/107 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30817 ms. Remains : 111/115 places, 103/107 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(X(F(p1)))&&(F(p2) U p3))))))'
Stuttering acceptance computed with spot in 340 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) p3 (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : HirschbergSinclair-PT-05-LTLFireability-01
Product exploration explored 100000 steps with 18594 reset in 175 ms.
Product exploration explored 100000 steps with 18732 reset in 244 ms.
Computed a total of 111 stabilizing places and 103 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 111 transition count 103
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge based reduction with 16 factoid took 101 ms. Reduced automaton from 8 states, 11 edges and 4 AP (stutter sensitive) to 8 states, 10 edges and 4 AP (stutter sensitive).
RANDOM walk for 244 steps (0 resets) in 10 ms. (22 steps per ms) remains 0/10 properties
Knowledge based reduction with 16 factoid took 185 ms. Reduced automaton from 8 states, 10 edges and 4 AP (stutter sensitive) to 8 states, 10 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 370 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) p3 (NOT p1)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
[2026-05-25 22:57:33] [INFO ] Invariant cache hit.
[2026-05-25 22:57:33] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 4 ms returned sat
[2026-05-25 22:57:33] [INFO ] [Real]Absence check using state equation in 152 ms returned sat
[2026-05-25 22:57:33] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 22:57:33] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 4 ms returned sat
[2026-05-25 22:57:33] [INFO ] [Nat]Absence check using state equation in 165 ms returned sat
[2026-05-25 22:57:33] [INFO ] Computed and/alt/rep : 48/51/48 causal constraints (skipped 50 transitions) in 7 ms.
[2026-05-25 22:57:34] [INFO ] Added : 16 causal constraints over 4 iterations in 150 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p3))
[2026-05-25 22:57:34] [INFO ] Invariant cache hit.
[2026-05-25 22:57:34] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 3 ms returned sat
[2026-05-25 22:57:34] [INFO ] [Real]Absence check using state equation in 148 ms returned sat
[2026-05-25 22:57:34] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 22:57:34] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 3 ms returned sat
[2026-05-25 22:57:34] [INFO ] [Nat]Absence check using state equation in 179 ms returned sat
[2026-05-25 22:57:34] [INFO ] Computed and/alt/rep : 48/51/48 causal constraints (skipped 50 transitions) in 8 ms.
[2026-05-25 22:57:34] [INFO ] Added : 17 causal constraints over 4 iterations in 156 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Knowledge-based reduction took 1946 ms.
Stuttering acceptance computed with spot in 348 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) p3 (NOT p1)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Support contains 6 out of 111 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 103/103 transitions.
Applied a total of 0 rules in 3 ms. Remains 111 /111 variables (removed 0) and now considering 103/103 (removed 0) transitions.
[2026-05-25 22:57:34] [INFO ] Invariant cache hit.
[2026-05-25 22:57:35] [INFO ] Implicit Places using invariants in 48 ms returned []
[2026-05-25 22:57:35] [INFO ] Invariant cache hit.
[2026-05-25 22:57:35] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 202 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 207 ms. Remains : 111/111 places, 103/103 transitions.
Computed a total of 111 stabilizing places and 103 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 111 transition count 103
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge based reduction with 10 factoid took 83 ms. Reduced automaton from 8 states, 10 edges and 4 AP (stutter sensitive) to 8 states, 10 edges and 4 AP (stutter sensitive).
RANDOM walk for 250 steps (0 resets) in 10 ms. (22 steps per ms) remains 0/10 properties
Knowledge based reduction with 10 factoid took 211 ms. Reduced automaton from 8 states, 10 edges and 4 AP (stutter sensitive) to 8 states, 10 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 324 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) p3 (NOT p1)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
[2026-05-25 22:57:35] [INFO ] Invariant cache hit.
[2026-05-25 22:57:35] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 5 ms returned sat
[2026-05-25 22:57:36] [INFO ] [Real]Absence check using state equation in 148 ms returned sat
[2026-05-25 22:57:36] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 22:57:36] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 4 ms returned sat
[2026-05-25 22:57:36] [INFO ] [Nat]Absence check using state equation in 166 ms returned sat
[2026-05-25 22:57:36] [INFO ] Computed and/alt/rep : 48/51/48 causal constraints (skipped 50 transitions) in 7 ms.
[2026-05-25 22:57:36] [INFO ] Added : 16 causal constraints over 4 iterations in 140 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p3))
[2026-05-25 22:57:36] [INFO ] Invariant cache hit.
[2026-05-25 22:57:36] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 4 ms returned sat
[2026-05-25 22:57:36] [INFO ] [Real]Absence check using state equation in 145 ms returned sat
[2026-05-25 22:57:36] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 22:57:36] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 3 ms returned sat
[2026-05-25 22:57:36] [INFO ] [Nat]Absence check using state equation in 184 ms returned sat
[2026-05-25 22:57:36] [INFO ] Computed and/alt/rep : 48/51/48 causal constraints (skipped 50 transitions) in 8 ms.
[2026-05-25 22:57:37] [INFO ] Added : 17 causal constraints over 4 iterations in 163 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Knowledge-based reduction took 1875 ms.
Stuttering acceptance computed with spot in 360 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) p3 (NOT p1)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 315 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) p3 (NOT p1)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 15411 reset in 129 ms.
Product exploration explored 100000 steps with 15479 reset in 153 ms.
Spot run failed in 73 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/ltsmin11201843617614209718
[2026-05-25 22:57:38] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11201843617614209718
Running compilation step : cd /tmp/ltsmin11201843617614209718;'/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 281 ms.
Running link step : cd /tmp/ltsmin11201843617614209718;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin11201843617614209718;'/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/stateBased16259828546621705559.hoa' '--buchi-type=spotba'
LTSmin run took 4313 ms.
FORMULA HirschbergSinclair-PT-05-LTLFireability-01 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property HirschbergSinclair-PT-05-LTLFireability-01 finished in 41761 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 1 out of 115 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 107/107 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 111 transition count 103
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 111 transition count 103
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 109 transition count 101
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 109 transition count 101
Applied a total of 12 rules in 7 ms. Remains 109 /115 variables (removed 6) and now considering 101/107 (removed 6) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13309994100790797686.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7845524414972446570.kers'
[2026-05-25 22:57:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13309994100790797686.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7845524414972446570.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 101 rows 109 cols 306 entries
Finished phase 1 with 98 SingleSign rule and 3 generalized
[2026-05-25 22:57:42] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-7845524414972446570.kers
Total runtime 0 ms.
[2026-05-25 22:57:42] [INFO ] Implicit Places using invariants in 49 ms returned []
[2026-05-25 22:57:42] [INFO ] Invariant cache hit.
[2026-05-25 22:57:43] [INFO ] Implicit Places using invariants and state equation in 184 ms returned []
Implicit Place search using SMT with State Equation took 235 ms to find 0 implicit places.
Running 96 sub problems to find dead transitions.
[2026-05-25 22:57:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (OVERLAPS) 5/109 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (OVERLAPS) 101/210 variables, 109/117 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/210 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (OVERLAPS) 0/210 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Real declared 210/210 variables, and 117 constraints, problems are : Problem set: 0 solved, 96 unsolved in 3593 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 109/109 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 96 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (OVERLAPS) 5/109 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (OVERLAPS) 101/210 variables, 109/117 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/210 variables, 96/213 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/210 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (OVERLAPS) 0/210 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Int declared 210/210 variables, and 213 constraints, problems are : Problem set: 0 solved, 96 unsolved in 26947 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 109/109 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 30558ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 30558ms
Starting structural reductions in LTL mode, iteration 1 : 109/115 places, 101/107 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30801 ms. Remains : 109/115 places, 101/107 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : HirschbergSinclair-PT-05-LTLFireability-02
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA HirschbergSinclair-PT-05-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-05-LTLFireability-02 finished in 30925 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(((X(X(p0)) U ((p1&&X(X(p0)))||X(X(G(p0))))) U (G((X(X(p0)) U ((p1&&X(X(p0)))||X(X(G(p0))))))||(!p2&&(X(X(p0)) U ((p1&&X(X(p0)))||X(X(G(p0)))))))))))'
Support contains 4 out of 115 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 107/107 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 111 transition count 103
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 111 transition count 103
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 109 transition count 101
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 109 transition count 101
Applied a total of 12 rules in 11 ms. Remains 109 /115 variables (removed 6) and now considering 101/107 (removed 6) transitions.
[2026-05-25 22:58:13] [INFO ] Invariant cache hit.
[2026-05-25 22:58:13] [INFO ] Implicit Places using invariants in 45 ms returned []
[2026-05-25 22:58:13] [INFO ] Invariant cache hit.
[2026-05-25 22:58:13] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 212 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 109/115 places, 101/107 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 223 ms. Remains : 109/115 places, 101/107 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(((X(X(p0)) U (X(X(G(p0)))||(p1&&X(X(p0))))) U (G((X(X(p0)) U ((p1&&X(X(p0)))||X(X(G(p0))))))||(!p2&&(X(X(p0)) U ((p1&&X(X(p0)))||X(X(G(p0)))))))))))'
Stuttering acceptance computed with spot in 231 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Running random walk in product with property : HirschbergSinclair-PT-05-LTLFireability-03
Entered a terminal (fully accepting) state of product in 104 steps with 20 reset in 1 ms.
FORMULA HirschbergSinclair-PT-05-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-05-LTLFireability-03 finished in 496 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((X(F(p0))||G(p1)||(X(X(!p0))&&F(p2)))))'
Support contains 5 out of 115 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 115/115 places, 107/107 transitions.
Reduce places removed 3 places and 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 112 transition count 79
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 50 place count 87 transition count 79
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 53 place count 84 transition count 76
Iterating global reduction 2 with 3 rules applied. Total rules applied 56 place count 84 transition count 76
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 57 place count 83 transition count 75
Iterating global reduction 2 with 1 rules applied. Total rules applied 58 place count 83 transition count 75
Applied a total of 58 rules in 16 ms. Remains 83 /115 variables (removed 32) and now considering 75/107 (removed 32) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11197559235174724550.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14788832257496692017.kers'
[2026-05-25 22:58:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11197559235174724550.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14788832257496692017.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 75 rows 83 cols 201 entries
Finished phase 1 with 72 SingleSign rule and 3 generalized
[2026-05-25 22:58:14] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-14788832257496692017.kers
Total runtime 0 ms.
[2026-05-25 22:58:14] [INFO ] Implicit Places using invariants in 45 ms returned []
[2026-05-25 22:58:14] [INFO ] Invariant cache hit.
[2026-05-25 22:58:14] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
[2026-05-25 22:58:14] [INFO ] Redundant transitions in 2 ms returned []
Running 71 sub problems to find dead transitions.
[2026-05-25 22:58:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/79 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 2 (OVERLAPS) 2/81 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 4 (OVERLAPS) 73/154 variables, 81/89 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/154 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 6 (OVERLAPS) 0/154 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Real declared 154/158 variables, and 89 constraints, problems are : Problem set: 0 solved, 71 unsolved in 2023 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 81/83 constraints, PredecessorRefiner: 71/71 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 71 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/79 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 2 (OVERLAPS) 2/81 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 4 (OVERLAPS) 73/154 variables, 81/89 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/154 variables, 71/160 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 7 (OVERLAPS) 0/154 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Int declared 154/158 variables, and 160 constraints, problems are : Problem set: 0 solved, 71 unsolved in 7066 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 81/83 constraints, PredecessorRefiner: 71/71 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9107ms problems are : Problem set: 0 solved, 71 unsolved
Search for dead transitions found 0 dead transitions in 9108ms
Starting structural reductions in SI_LTL mode, iteration 1 : 83/115 places, 75/107 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9278 ms. Remains : 83/115 places, 75/107 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((X(F(p0))||G(p1)||(X(X(!p0))&&F(p2)))))'
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : HirschbergSinclair-PT-05-LTLFireability-06
Product exploration explored 100000 steps with 33426 reset in 105 ms.
Product exploration explored 100000 steps with 33389 reset in 119 ms.
Computed a total of 83 stabilizing places and 75 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 83 transition count 75
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 10 factoid took 10 ms. Proved property starting from automaton with 2 states, 3 edges and 3 AP (stutter insensitive
Knowledge-based reduction took 54 ms.
FORMULA HirschbergSinclair-PT-05-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-05-LTLFireability-06 finished in 9665 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&((p1&&X(X(p1))) U (G((p1&&X(X(p1))))||(X(X(p1))&&p2)))))'
Support contains 4 out of 115 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 107/107 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 111 transition count 103
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 111 transition count 103
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 109 transition count 101
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 109 transition count 101
Applied a total of 12 rules in 8 ms. Remains 109 /115 variables (removed 6) and now considering 101/107 (removed 6) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3307531851091304787.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5180492835830395539.kers'
[2026-05-25 22:58:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3307531851091304787.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5180492835830395539.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 101 rows 109 cols 306 entries
Finished phase 1 with 98 SingleSign rule and 3 generalized
[2026-05-25 22:58:23] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5180492835830395539.kers
Total runtime 1 ms.
[2026-05-25 22:58:23] [INFO ] Implicit Places using invariants in 49 ms returned []
[2026-05-25 22:58:23] [INFO ] Invariant cache hit.
[2026-05-25 22:58:24] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 213 ms to find 0 implicit places.
Running 96 sub problems to find dead transitions.
[2026-05-25 22:58:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (OVERLAPS) 5/109 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (OVERLAPS) 101/210 variables, 109/117 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/210 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (OVERLAPS) 0/210 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Real declared 210/210 variables, and 117 constraints, problems are : Problem set: 0 solved, 96 unsolved in 3611 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 109/109 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 96 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (OVERLAPS) 5/109 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (OVERLAPS) 101/210 variables, 109/117 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/210 variables, 96/213 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/210 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (OVERLAPS) 0/210 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Int declared 210/210 variables, and 213 constraints, problems are : Problem set: 0 solved, 96 unsolved in 26765 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 109/109 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 30386ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 30386ms
Starting structural reductions in LTL mode, iteration 1 : 109/115 places, 101/107 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30608 ms. Remains : 109/115 places, 101/107 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&((p1&&X(X(p1))) U (G((p1&&X(X(p1))))||(X(X(p1))&&p2)))))'
Stuttering acceptance computed with spot in 235 ms :[(OR (NOT p1) (NOT p0)), true, (NOT p0), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : HirschbergSinclair-PT-05-LTLFireability-08
Product exploration explored 100000 steps with 33333 reset in 112 ms.
Product exploration explored 100000 steps with 33333 reset in 108 ms.
Computed a total of 109 stabilizing places and 101 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 109 transition count 101
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge based reduction with 16 factoid took 58 ms. Proved property starting from automaton with 6 states, 11 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 106 ms.
FORMULA HirschbergSinclair-PT-05-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-05-LTLFireability-08 finished in 31194 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G((p1&&F(!p0)))))))'
Support contains 3 out of 115 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 115/115 places, 107/107 transitions.
Reduce places removed 5 places and 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 41 rules applied. Total rules applied 41 place count 110 transition count 61
Reduce places removed 41 places and 0 transitions.
Iterating post reduction 1 with 41 rules applied. Total rules applied 82 place count 69 transition count 61
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 86 place count 65 transition count 57
Iterating global reduction 2 with 4 rules applied. Total rules applied 90 place count 65 transition count 57
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 2 rules applied. Total rules applied 92 place count 65 transition count 55
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 94 place count 63 transition count 55
Applied a total of 94 rules in 15 ms. Remains 63 /115 variables (removed 52) and now considering 55/107 (removed 52) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3275259055683677417.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12608218870740001482.kers'
[2026-05-25 22:58:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3275259055683677417.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12608218870740001482.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 55 rows 63 cols 122 entries
Finished phase 1 with 52 SingleSign rule and 3 generalized
[2026-05-25 22:58:55] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-12608218870740001482.kers
Total runtime 0 ms.
[2026-05-25 22:58:55] [INFO ] Implicit Places using invariants in 88 ms returned []
[2026-05-25 22:58:55] [INFO ] Invariant cache hit.
[2026-05-25 22:58:55] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 163 ms to find 0 implicit places.
[2026-05-25 22:58:55] [INFO ] Redundant transitions in 1 ms returned []
Running 46 sub problems to find dead transitions.
[2026-05-25 22:58:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 2 (OVERLAPS) 2/56 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 4 (OVERLAPS) 48/104 variables, 56/64 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/104 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 6 (OVERLAPS) 0/104 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Real declared 104/118 variables, and 64 constraints, problems are : Problem set: 0 solved, 46 unsolved in 909 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 56/63 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 46 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 2 (OVERLAPS) 2/56 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 4 (OVERLAPS) 48/104 variables, 56/64 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/104 variables, 46/110 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/104 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 7 (OVERLAPS) 0/104 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Int declared 104/118 variables, and 110 constraints, problems are : Problem set: 0 solved, 46 unsolved in 1524 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 56/63 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2436ms problems are : Problem set: 0 solved, 46 unsolved
Search for dead transitions found 0 dead transitions in 2436ms
Starting structural reductions in SI_LTL mode, iteration 1 : 63/115 places, 55/107 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2619 ms. Remains : 63/115 places, 55/107 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G((p1&&F(!p0)))))))'
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : HirschbergSinclair-PT-05-LTLFireability-10
Product exploration explored 100000 steps with 1670 reset in 165 ms.
Product exploration explored 100000 steps with 1670 reset in 195 ms.
Computed a total of 63 stabilizing places and 55 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 63 transition count 55
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 11 factoid took 14 ms. Proved property starting from automaton with 2 states, 4 edges and 2 AP (stutter insensitive
Knowledge-based reduction took 48 ms.
FORMULA HirschbergSinclair-PT-05-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-05-LTLFireability-10 finished in 3140 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&&(p1||(p2 U G(!p0)))))))'
Support contains 2 out of 115 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 115/115 places, 107/107 transitions.
Reduce places removed 4 places and 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 111 transition count 71
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 64 place count 79 transition count 71
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 68 place count 75 transition count 67
Iterating global reduction 2 with 4 rules applied. Total rules applied 72 place count 75 transition count 67
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 2 rules applied. Total rules applied 74 place count 75 transition count 65
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 76 place count 73 transition count 65
Applied a total of 76 rules in 12 ms. Remains 73 /115 variables (removed 42) and now considering 65/107 (removed 42) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2987387081036228188.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8624638052925153060.kers'
[2026-05-25 22:58:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2987387081036228188.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8624638052925153060.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 65 rows 73 cols 162 entries
Finished phase 1 with 62 SingleSign rule and 3 generalized
[2026-05-25 22:58:58] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-8624638052925153060.kers
Total runtime 0 ms.
[2026-05-25 22:58:58] [INFO ] Implicit Places using invariants in 47 ms returned []
[2026-05-25 22:58:58] [INFO ] Invariant cache hit.
[2026-05-25 22:58:58] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 128 ms to find 0 implicit places.
[2026-05-25 22:58:58] [INFO ] Redundant transitions in 0 ms returned []
Running 58 sub problems to find dead transitions.
[2026-05-25 22:58:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (OVERLAPS) 2/68 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (OVERLAPS) 60/128 variables, 68/76 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (OVERLAPS) 2/130 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 8 (OVERLAPS) 0/130 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Real declared 130/138 variables, and 77 constraints, problems are : Problem set: 0 solved, 58 unsolved in 1701 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 69/73 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 58 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (OVERLAPS) 2/68 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (OVERLAPS) 60/128 variables, 68/76 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 47/123 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 7 (OVERLAPS) 2/130 variables, 1/124 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/130 variables, 11/135 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/130 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 10 (OVERLAPS) 0/130 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Int declared 130/138 variables, and 135 constraints, problems are : Problem set: 0 solved, 58 unsolved in 4911 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 69/73 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6618ms problems are : Problem set: 0 solved, 58 unsolved
Search for dead transitions found 0 dead transitions in 6618ms
Starting structural reductions in SI_LTL mode, iteration 1 : 73/115 places, 65/107 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6765 ms. Remains : 73/115 places, 65/107 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&&(p1||(p2 U G(!p0)))))))'
Stuttering acceptance computed with spot in 40 ms :[(OR (NOT p1) (NOT p0))]
Running random walk in product with property : HirschbergSinclair-PT-05-LTLFireability-11
Stuttering criterion allowed to conclude after 70 steps with 0 reset in 1 ms.
FORMULA HirschbergSinclair-PT-05-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-05-LTLFireability-11 finished in 6836 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 3 out of 115 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 107/107 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 111 transition count 103
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 111 transition count 103
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 109 transition count 101
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 109 transition count 101
Applied a total of 12 rules in 8 ms. Remains 109 /115 variables (removed 6) and now considering 101/107 (removed 6) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17945249722907125436.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13580643759223841954.kers'
[2026-05-25 22:59:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17945249722907125436.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13580643759223841954.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 101 rows 109 cols 306 entries
Finished phase 1 with 98 SingleSign rule and 3 generalized
[2026-05-25 22:59:05] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13580643759223841954.kers
Total runtime 1 ms.
[2026-05-25 22:59:05] [INFO ] Implicit Places using invariants in 54 ms returned []
[2026-05-25 22:59:05] [INFO ] Invariant cache hit.
[2026-05-25 22:59:05] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 229 ms to find 0 implicit places.
Running 96 sub problems to find dead transitions.
[2026-05-25 22:59:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (OVERLAPS) 5/109 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (OVERLAPS) 101/210 variables, 109/117 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/210 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (OVERLAPS) 0/210 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Real declared 210/210 variables, and 117 constraints, problems are : Problem set: 0 solved, 96 unsolved in 3693 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 109/109 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 96 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (OVERLAPS) 5/109 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (OVERLAPS) 101/210 variables, 109/117 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/210 variables, 96/213 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/210 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (OVERLAPS) 0/210 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Int declared 210/210 variables, and 213 constraints, problems are : Problem set: 0 solved, 96 unsolved in 26663 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 109/109 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 30367ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 30368ms
Starting structural reductions in LTL mode, iteration 1 : 109/115 places, 101/107 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30605 ms. Remains : 109/115 places, 101/107 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Stuttering acceptance computed with spot in 127 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-05-LTLFireability-14
Entered a terminal (fully accepting) state of product in 98 steps with 0 reset in 1 ms.
FORMULA HirschbergSinclair-PT-05-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-05-LTLFireability-14 finished in 30757 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 3 out of 115 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 115/115 places, 107/107 transitions.
Reduce places removed 4 places and 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 111 transition count 69
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 68 place count 77 transition count 69
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 72 place count 73 transition count 65
Iterating global reduction 2 with 4 rules applied. Total rules applied 76 place count 73 transition count 65
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 2 rules applied. Total rules applied 78 place count 73 transition count 63
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 80 place count 71 transition count 63
Applied a total of 80 rules in 14 ms. Remains 71 /115 variables (removed 44) and now considering 63/107 (removed 44) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11598720970643668928.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12704393979704342038.kers'
[2026-05-25 22:59:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11598720970643668928.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12704393979704342038.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 63 rows 71 cols 154 entries
Finished phase 1 with 60 SingleSign rule and 3 generalized
[2026-05-25 22:59:35] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-12704393979704342038.kers
Total runtime 0 ms.
[2026-05-25 22:59:35] [INFO ] Implicit Places using invariants in 48 ms returned []
[2026-05-25 22:59:35] [INFO ] Invariant cache hit.
[2026-05-25 22:59:35] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 123 ms to find 0 implicit places.
[2026-05-25 22:59:36] [INFO ] Redundant transitions in 1 ms returned []
Running 56 sub problems to find dead transitions.
[2026-05-25 22:59:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 2 (OVERLAPS) 2/66 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 4 (OVERLAPS) 58/124 variables, 66/74 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 6 (OVERLAPS) 2/126 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 8 (OVERLAPS) 0/126 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Real declared 126/134 variables, and 75 constraints, problems are : Problem set: 0 solved, 56 unsolved in 1595 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 67/71 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 56 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 2 (OVERLAPS) 2/66 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 4 (OVERLAPS) 58/124 variables, 66/74 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 45/119 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 7 (OVERLAPS) 2/126 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/126 variables, 11/131 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/126 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 10 (OVERLAPS) 0/126 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Int declared 126/134 variables, and 131 constraints, problems are : Problem set: 0 solved, 56 unsolved in 3541 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 67/71 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5139ms problems are : Problem set: 0 solved, 56 unsolved
Search for dead transitions found 0 dead transitions in 5139ms
Starting structural reductions in SI_LTL mode, iteration 1 : 71/115 places, 63/107 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5281 ms. Remains : 71/115 places, 63/107 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-05-LTLFireability-15
Product exploration explored 100000 steps with 3027 reset in 125 ms.
Product exploration explored 100000 steps with 3025 reset in 132 ms.
Computed a total of 71 stabilizing places and 63 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 71 transition count 63
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge based reduction with 4 factoid took 53 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
RANDOM walk for 137 steps (0 resets) in 5 ms. (22 steps per ms) remains 0/1 properties
Knowledge based reduction with 4 factoid took 60 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
[2026-05-25 22:59:41] [INFO ] Invariant cache hit.
[2026-05-25 22:59:41] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 3 ms returned sat
[2026-05-25 22:59:41] [INFO ] [Real]Absence check using state equation in 88 ms returned sat
[2026-05-25 22:59:41] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 22:59:41] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 2 ms returned sat
[2026-05-25 22:59:41] [INFO ] [Nat]Absence check using state equation in 81 ms returned sat
[2026-05-25 22:59:41] [INFO ] Computed and/alt/rep : 46/51/46 causal constraints (skipped 10 transitions) in 3 ms.
[2026-05-25 22:59:42] [INFO ] Added : 42 causal constraints over 9 iterations in 121 ms. Result :sat
Could not prove EG (NOT p0)
Knowledge-based reduction took 571 ms.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Support contains 3 out of 71 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 71/71 places, 63/63 transitions.
Applied a total of 0 rules in 3 ms. Remains 71 /71 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2026-05-25 22:59:42] [INFO ] Invariant cache hit.
[2026-05-25 22:59:42] [INFO ] Implicit Places using invariants in 42 ms returned []
[2026-05-25 22:59:42] [INFO ] Invariant cache hit.
[2026-05-25 22:59:42] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
[2026-05-25 22:59:42] [INFO ] Redundant transitions in 1 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 124 ms. Remains : 71/71 places, 63/63 transitions.
Computed a total of 71 stabilizing places and 63 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 71 transition count 63
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge based reduction with 4 factoid took 50 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
RANDOM walk for 138 steps (0 resets) in 6 ms. (19 steps per ms) remains 0/1 properties
Knowledge based reduction with 4 factoid took 52 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
[2026-05-25 22:59:42] [INFO ] Invariant cache hit.
[2026-05-25 22:59:42] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 3 ms returned sat
[2026-05-25 22:59:42] [INFO ] [Real]Absence check using state equation in 89 ms returned sat
[2026-05-25 22:59:42] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 22:59:42] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 2 ms returned sat
[2026-05-25 22:59:42] [INFO ] [Nat]Absence check using state equation in 84 ms returned sat
[2026-05-25 22:59:42] [INFO ] Computed and/alt/rep : 46/51/46 causal constraints (skipped 10 transitions) in 3 ms.
[2026-05-25 22:59:42] [INFO ] Added : 42 causal constraints over 9 iterations in 121 ms. Result :sat
Could not prove EG (NOT p0)
Knowledge-based reduction took 560 ms.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Product exploration explored 100000 steps with 3022 reset in 92 ms.
Product exploration explored 100000 steps with 3024 reset in 97 ms.
Built C files in :
/tmp/ltsmin2968879721889667431
[2026-05-25 22:59:43] [INFO ] Computing symmetric may disable matrix : 63 transitions.
[2026-05-25 22:59:43] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 22:59:43] [INFO ] Computing symmetric may enable matrix : 63 transitions.
[2026-05-25 22:59:43] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 22:59:43] [INFO ] Computing Do-Not-Accords matrix : 63 transitions.
[2026-05-25 22:59:43] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 22:59:43] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2968879721889667431
Running compilation step : cd /tmp/ltsmin2968879721889667431;'/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 165 ms.
Running link step : cd /tmp/ltsmin2968879721889667431;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin2968879721889667431;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11708083393651872596.hoa' '--buchi-type=spotba'
LTSmin run took 102 ms.
FORMULA HirschbergSinclair-PT-05-LTLFireability-15 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property HirschbergSinclair-PT-05-LTLFireability-15 finished in 7535 ms.
All properties solved by simple procedures.
Total runtime 227788 ms.

BK_STOP 1779749983749

--------------------
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="HirschbergSinclair-PT-05"
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 HirschbergSinclair-PT-05, 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 r146-tall-177961074400732"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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