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-177961074400740.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-10, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r146-tall-177961074400740
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 9.7K Mar 7 17:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Mar 7 17:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Mar 7 17:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K Mar 7 17:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.4K Mar 15 10:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Mar 15 10:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.4K Mar 15 10:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 15 10:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.4K Mar 7 17:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 60K Mar 7 17:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Mar 7 17:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K Mar 7 17:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Mar 15 10:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Mar 15 10:49 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 136K 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-10-LTLFireability-00
FORMULA_NAME HirschbergSinclair-PT-10-LTLFireability-01
FORMULA_NAME HirschbergSinclair-PT-10-LTLFireability-02
FORMULA_NAME HirschbergSinclair-PT-10-LTLFireability-03
FORMULA_NAME HirschbergSinclair-PT-10-LTLFireability-04
FORMULA_NAME HirschbergSinclair-PT-10-LTLFireability-05
FORMULA_NAME HirschbergSinclair-PT-10-LTLFireability-06
FORMULA_NAME HirschbergSinclair-PT-10-LTLFireability-07
FORMULA_NAME HirschbergSinclair-PT-10-LTLFireability-08
FORMULA_NAME HirschbergSinclair-PT-10-LTLFireability-09
FORMULA_NAME HirschbergSinclair-PT-10-LTLFireability-10
FORMULA_NAME HirschbergSinclair-PT-10-LTLFireability-11
FORMULA_NAME HirschbergSinclair-PT-10-LTLFireability-12
FORMULA_NAME HirschbergSinclair-PT-10-LTLFireability-13
FORMULA_NAME HirschbergSinclair-PT-10-LTLFireability-14
FORMULA_NAME HirschbergSinclair-PT-10-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779749994899

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-10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-25 22:59:56] [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:59:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 22:59:56] [INFO ] Load time of PNML (sax parser for PT used): 70 ms
[2026-05-25 22:59:56] [INFO ] Transformed 260 places.
[2026-05-25 22:59:56] [INFO ] Transformed 236 transitions.
[2026-05-25 22:59:56] [INFO ] Parsed PT model containing 260 places and 236 transitions and 721 arcs in 160 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 3 formulas.
FORMULA HirschbergSinclair-PT-10-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-10-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-10-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 41 out of 260 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 260/260 places, 236/236 transitions.
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 250 transition count 236
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 16 place count 244 transition count 230
Iterating global reduction 1 with 6 rules applied. Total rules applied 22 place count 244 transition count 230
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 27 place count 239 transition count 225
Iterating global reduction 1 with 5 rules applied. Total rules applied 32 place count 239 transition count 225
Applied a total of 32 rules in 59 ms. Remains 239 /260 variables (removed 21) and now considering 225/236 (removed 11) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-181848827031523467.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9798471930858546817.kers'
[2026-05-25 22:59:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-181848827031523467.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9798471930858546817.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 225 rows 239 cols 675 entries
Finished phase 1 with 221 SingleSign rule and 4 generalized
[2026-05-25 22:59:56] [INFO ] Computed 14 invariants in 1 ms
Computed 14 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-9798471930858546817.kers
Total runtime 2 ms.
[2026-05-25 22:59:56] [INFO ] Implicit Places using invariants in 284 ms returned []
[2026-05-25 22:59:56] [INFO ] Invariant cache hit.
[2026-05-25 22:59:57] [INFO ] Implicit Places using invariants and state equation in 526 ms returned []
Implicit Place search using SMT with State Equation took 862 ms to find 0 implicit places.
Running 215 sub problems to find dead transitions.
[2026-05-25 22:59:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/229 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/229 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (OVERLAPS) 10/239 variables, 11/14 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/239 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (OVERLAPS) 225/464 variables, 239/253 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/464 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 6 (OVERLAPS) 0/464 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 215 unsolved
No progress, stopping.
After SMT solving in domain Real declared 464/464 variables, and 253 constraints, problems are : Problem set: 0 solved, 215 unsolved in 19600 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 239/239 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 215 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/229 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/229 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (OVERLAPS) 10/239 variables, 11/14 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/239 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (OVERLAPS) 225/464 variables, 239/253 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/464 variables, 215/468 constraints. Problems are: Problem set: 0 solved, 215 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 464/464 variables, and 468 constraints, problems are : Problem set: 0 solved, 215 unsolved in 30031 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 239/239 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 49710ms problems are : Problem set: 0 solved, 215 unsolved
Search for dead transitions found 0 dead transitions in 49721ms
Starting structural reductions in LTL mode, iteration 1 : 239/260 places, 225/236 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50680 ms. Remains : 239/260 places, 225/236 transitions.
Starting structural reductions in LTL mode, iteration 0 : 239/239 places, 225/225 transitions.
Applied a total of 0 rules in 6 ms. Remains 239 /239 variables (removed 0) and now considering 225/225 (removed 0) transitions.
[2026-05-25 23:00:47] [INFO ] Invariant cache hit.
[2026-05-25 23:00:47] [INFO ] Implicit Places using invariants in 162 ms returned []
[2026-05-25 23:00:47] [INFO ] Invariant cache hit.
[2026-05-25 23:00:47] [INFO ] Implicit Places using invariants and state equation in 505 ms returned []
Implicit Place search using SMT with State Equation took 668 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 674 ms. Remains : 239/239 places, 225/225 transitions.
Support contains 41 out of 239 places after structural reductions.
[2026-05-25 23:00:48] [INFO ] Flatten gal took : 39 ms
[2026-05-25 23:00:48] [INFO ] Flatten gal took : 18 ms
[2026-05-25 23:00:48] [INFO ] Input system was already deterministic with 225 transitions.
Reduction of identical properties reduced properties to check from 33 to 32
RANDOM walk for 1152 steps (1 resets) in 117 ms. (9 steps per ms) remains 0/32 properties
Computed a total of 239 stabilizing places and 225 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 239 transition count 225
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(X(F((F(p1)&&p0))))))'
Support contains 2 out of 239 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 239/239 places, 225/225 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 234 transition count 220
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 234 transition count 220
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 14 place count 230 transition count 216
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 230 transition count 216
Applied a total of 18 rules in 17 ms. Remains 230 /239 variables (removed 9) and now considering 216/225 (removed 9) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3486662294135921209.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2098492232676887902.kers'
[2026-05-25 23:00:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3486662294135921209.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2098492232676887902.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 216 rows 230 cols 652 entries
Finished phase 1 with 212 SingleSign rule and 4 generalized
[2026-05-25 23:00:48] [INFO ] Computed 14 invariants in 0 ms
Computed 14 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2098492232676887902.kers
Total runtime 1 ms.
[2026-05-25 23:00:48] [INFO ] Implicit Places using invariants in 88 ms returned []
[2026-05-25 23:00:48] [INFO ] Invariant cache hit.
[2026-05-25 23:00:49] [INFO ] Implicit Places using invariants and state equation in 971 ms returned []
Implicit Place search using SMT with State Equation took 1062 ms to find 0 implicit places.
Running 206 sub problems to find dead transitions.
[2026-05-25 23:00:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/220 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/220 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 2 (OVERLAPS) 10/230 variables, 11/14 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/230 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 4 (OVERLAPS) 216/446 variables, 230/244 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/446 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 6 (OVERLAPS) 0/446 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 206 unsolved
No progress, stopping.
After SMT solving in domain Real declared 446/446 variables, and 244 constraints, problems are : Problem set: 0 solved, 206 unsolved in 17512 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 230/230 constraints, PredecessorRefiner: 206/206 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 206 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/220 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/220 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 2 (OVERLAPS) 10/230 variables, 11/14 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/230 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 4 (OVERLAPS) 216/446 variables, 230/244 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/446 variables, 206/450 constraints. Problems are: Problem set: 0 solved, 206 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 446/446 variables, and 450 constraints, problems are : Problem set: 0 solved, 206 unsolved in 30024 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 230/230 constraints, PredecessorRefiner: 206/206 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 47563ms problems are : Problem set: 0 solved, 206 unsolved
Search for dead transitions found 0 dead transitions in 47570ms
Starting structural reductions in LTL mode, iteration 1 : 230/239 places, 216/225 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48652 ms. Remains : 230/239 places, 216/225 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(F((F(p1)&&p0))))))'
Stuttering acceptance computed with spot in 355 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : HirschbergSinclair-PT-10-LTLFireability-00
Stuttering criterion allowed to conclude after 54403 steps with 257 reset in 203 ms.
FORMULA HirschbergSinclair-PT-10-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-10-LTLFireability-00 finished in 49284 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)||X(p2))) U (p0||X(X(p3))))))'
Support contains 5 out of 239 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 239/239 places, 225/225 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 234 transition count 220
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 234 transition count 220
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 14 place count 230 transition count 216
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 230 transition count 216
Applied a total of 18 rules in 22 ms. Remains 230 /239 variables (removed 9) and now considering 216/225 (removed 9) transitions.
[2026-05-25 23:01:38] [INFO ] Invariant cache hit.
[2026-05-25 23:01:38] [INFO ] Implicit Places using invariants in 92 ms returned []
[2026-05-25 23:01:38] [INFO ] Invariant cache hit.
[2026-05-25 23:01:39] [INFO ] Implicit Places using invariants and state equation in 975 ms returned []
Implicit Place search using SMT with State Equation took 1069 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 230/239 places, 216/225 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1091 ms. Remains : 230/239 places, 216/225 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)||X(p2))) U (p0||X(X(p3))))))'
Stuttering acceptance computed with spot in 242 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : HirschbergSinclair-PT-10-LTLFireability-01
Product exploration explored 100000 steps with 3250 reset in 245 ms.
Product exploration explored 100000 steps with 3277 reset in 276 ms.
Computed a total of 230 stabilizing places and 216 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 230 transition count 216
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 false by K+ with min(phi)
Knowledge based reduction with 13 factoid took 31 ms. Proved property starting from automaton with 5 states, 9 edges and 4 AP (stutter sensitive
Knowledge-based reduction took 124 ms.
FORMULA HirschbergSinclair-PT-10-LTLFireability-01 FALSE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-10-LTLFireability-01 finished in 2042 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0||(X(G(p1))&&F(p2))))))'
Support contains 4 out of 239 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 239/239 places, 225/225 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 234 transition count 220
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 234 transition count 220
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 14 place count 230 transition count 216
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 230 transition count 216
Applied a total of 18 rules in 14 ms. Remains 230 /239 variables (removed 9) and now considering 216/225 (removed 9) transitions.
[2026-05-25 23:01:40] [INFO ] Invariant cache hit.
[2026-05-25 23:01:40] [INFO ] Implicit Places using invariants in 87 ms returned []
[2026-05-25 23:01:40] [INFO ] Invariant cache hit.
[2026-05-25 23:01:41] [INFO ] Implicit Places using invariants and state equation in 955 ms returned []
Implicit Place search using SMT with State Equation took 1046 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 230/239 places, 216/225 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1061 ms. Remains : 230/239 places, 216/225 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0||(X(G(p1))&&F(p2))))))'
Stuttering acceptance computed with spot in 248 ms :[(NOT p1), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true]
Running random walk in product with property : HirschbergSinclair-PT-10-LTLFireability-02
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA HirschbergSinclair-PT-10-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-10-LTLFireability-02 finished in 1351 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(!(p0 U (!(F(p0) U p1)&&(p0 U p2))))))'
Support contains 6 out of 239 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 239/239 places, 225/225 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 235 transition count 221
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 235 transition count 221
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 232 transition count 218
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 232 transition count 218
Applied a total of 14 rules in 14 ms. Remains 232 /239 variables (removed 7) and now considering 218/225 (removed 7) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8811647341461183122.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7579854917889536578.kers'
[2026-05-25 23:01:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8811647341461183122.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7579854917889536578.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 218 rows 232 cols 658 entries
Finished phase 1 with 214 SingleSign rule and 4 generalized
[2026-05-25 23:01:41] [INFO ] Computed 14 invariants in 1 ms
Computed 14 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7579854917889536578.kers
Total runtime 1 ms.
[2026-05-25 23:01:41] [INFO ] Implicit Places using invariants in 88 ms returned []
[2026-05-25 23:01:41] [INFO ] Invariant cache hit.
[2026-05-25 23:01:42] [INFO ] Implicit Places using invariants and state equation in 751 ms returned []
Implicit Place search using SMT with State Equation took 841 ms to find 0 implicit places.
Running 208 sub problems to find dead transitions.
[2026-05-25 23:01:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/222 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/222 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 10/232 variables, 11/14 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (OVERLAPS) 218/450 variables, 232/246 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/450 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 6 (OVERLAPS) 0/450 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 208 unsolved
No progress, stopping.
After SMT solving in domain Real declared 450/450 variables, and 246 constraints, problems are : Problem set: 0 solved, 208 unsolved in 17652 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 208 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/222 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/222 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 10/232 variables, 11/14 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (OVERLAPS) 218/450 variables, 232/246 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/450 variables, 208/454 constraints. Problems are: Problem set: 0 solved, 208 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 450/450 variables, and 454 constraints, problems are : Problem set: 0 solved, 208 unsolved in 30034 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 47715ms problems are : Problem set: 0 solved, 208 unsolved
Search for dead transitions found 0 dead transitions in 47716ms
Starting structural reductions in LTL mode, iteration 1 : 232/239 places, 218/225 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48573 ms. Remains : 232/239 places, 218/225 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(!(p0 U (!(F(p0) U p1)&&(p0 U p2))))))'
Stuttering acceptance computed with spot in 248 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2), (NOT p0), (NOT p1)]
Running random walk in product with property : HirschbergSinclair-PT-10-LTLFireability-03
Product exploration explored 100000 steps with 33333 reset in 158 ms.
Product exploration explored 100000 steps with 33333 reset in 163 ms.
Computed a total of 232 stabilizing places and 218 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 232 transition count 218
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 8 factoid took 12 ms. Proved property starting from automaton with 5 states, 8 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 70 ms.
FORMULA HirschbergSinclair-PT-10-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-10-LTLFireability-03 finished in 49253 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&&(p0 U (!p1||G(p0)))))))'
Support contains 1 out of 239 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 : 239/239 places, 225/225 transitions.
Reduce places removed 9 places and 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 87 transitions
Trivial Post-agglo rules discarded 87 transitions
Performed 87 trivial Post agglomeration. Transition count delta: 87
Iterating post reduction 0 with 87 rules applied. Total rules applied 87 place count 230 transition count 129
Reduce places removed 87 places and 0 transitions.
Iterating post reduction 1 with 87 rules applied. Total rules applied 174 place count 143 transition count 129
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 179 place count 138 transition count 124
Iterating global reduction 2 with 5 rules applied. Total rules applied 184 place count 138 transition count 124
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 185 place count 138 transition count 123
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 186 place count 137 transition count 123
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 187 place count 136 transition count 122
Iterating global reduction 4 with 1 rules applied. Total rules applied 188 place count 136 transition count 122
Applied a total of 188 rules in 26 ms. Remains 136 /239 variables (removed 103) and now considering 122/225 (removed 103) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13236587719096587047.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14575806395849352319.kers'
[2026-05-25 23:02:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13236587719096587047.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14575806395849352319.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 122 rows 136 cols 276 entries
Finished phase 1 with 118 SingleSign rule and 4 generalized
[2026-05-25 23:02:30] [INFO ] Computed 14 invariants in 0 ms
Computed 14 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-14575806395849352319.kers
Total runtime 2 ms.
[2026-05-25 23:02:30] [INFO ] Implicit Places using invariants in 87 ms returned []
[2026-05-25 23:02:30] [INFO ] Invariant cache hit.
[2026-05-25 23:02:31] [INFO ] Implicit Places using invariants and state equation in 313 ms returned []
Implicit Place search using SMT with State Equation took 402 ms to find 0 implicit places.
[2026-05-25 23:02:31] [INFO ] Redundant transitions in 2 ms returned []
Running 106 sub problems to find dead transitions.
[2026-05-25 23:02:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (OVERLAPS) 3/123 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (OVERLAPS) 109/232 variables, 123/137 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/232 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (OVERLAPS) 0/232 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Real declared 232/258 variables, and 137 constraints, problems are : Problem set: 0 solved, 106 unsolved in 4434 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 123/136 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 106 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (OVERLAPS) 3/123 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (OVERLAPS) 109/232 variables, 123/137 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/232 variables, 106/243 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/232 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (OVERLAPS) 0/232 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Int declared 232/258 variables, and 243 constraints, problems are : Problem set: 0 solved, 106 unsolved in 11143 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 123/136 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 15599ms problems are : Problem set: 0 solved, 106 unsolved
Search for dead transitions found 0 dead transitions in 15599ms
Starting structural reductions in SI_LTL mode, iteration 1 : 136/239 places, 122/225 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 16035 ms. Remains : 136/239 places, 122/225 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&&(p0 U (!p1||G(p0)))))))'
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-10-LTLFireability-04
Product exploration explored 100000 steps with 752 reset in 139 ms.
Product exploration explored 100000 steps with 752 reset in 164 ms.
Computed a total of 136 stabilizing places and 122 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 136 transition count 122
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 4 factoid took 10 ms. Proved property starting from automaton with 1 states, 2 edges and 1 AP (stutter insensitive
Knowledge-based reduction took 62 ms.
FORMULA HirschbergSinclair-PT-10-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-10-LTLFireability-04 finished in 16464 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0||(p1 U G(!p1)))) U X(X(p2))))'
Support contains 3 out of 239 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 239/239 places, 225/225 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 235 transition count 221
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 235 transition count 221
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 232 transition count 218
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 232 transition count 218
Applied a total of 14 rules in 7 ms. Remains 232 /239 variables (removed 7) and now considering 218/225 (removed 7) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1735803667620496621.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12156898919512242642.kers'
[2026-05-25 23:02:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1735803667620496621.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12156898919512242642.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 218 rows 232 cols 657 entries
Finished phase 1 with 214 SingleSign rule and 4 generalized
[2026-05-25 23:02:47] [INFO ] Computed 14 invariants in 0 ms
Computed 14 P flows in 10 ms.
Exported basis to /tmp/petrispot-output-12156898919512242642.kers
Total runtime 11 ms.
[2026-05-25 23:02:47] [INFO ] Implicit Places using invariants in 237 ms returned []
[2026-05-25 23:02:47] [INFO ] Invariant cache hit.
[2026-05-25 23:02:48] [INFO ] Implicit Places using invariants and state equation in 1025 ms returned []
Implicit Place search using SMT with State Equation took 1274 ms to find 0 implicit places.
Running 208 sub problems to find dead transitions.
[2026-05-25 23:02:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/222 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/222 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 10/232 variables, 11/14 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (OVERLAPS) 218/450 variables, 232/246 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/450 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 6 (OVERLAPS) 0/450 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 208 unsolved
No progress, stopping.
After SMT solving in domain Real declared 450/450 variables, and 246 constraints, problems are : Problem set: 0 solved, 208 unsolved in 17800 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 208 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/222 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/222 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 10/232 variables, 11/14 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (OVERLAPS) 218/450 variables, 232/246 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/450 variables, 208/454 constraints. Problems are: Problem set: 0 solved, 208 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 450/450 variables, and 454 constraints, problems are : Problem set: 0 solved, 208 unsolved in 30022 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 47852ms problems are : Problem set: 0 solved, 208 unsolved
Search for dead transitions found 0 dead transitions in 47854ms
Starting structural reductions in LTL mode, iteration 1 : 232/239 places, 218/225 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49141 ms. Remains : 232/239 places, 218/225 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0||(p1 U G(!p1)))) U X(X(p2))))'
Stuttering acceptance computed with spot in 629 ms :[(OR (NOT p2) (AND (NOT p0) p1)), p1, p1, (AND p1 (NOT p0)), (NOT p2), (NOT p2), true, (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (OR (NOT p2) p1), (OR (NOT p2) p1)]
Running random walk in product with property : HirschbergSinclair-PT-10-LTLFireability-06
Product exploration explored 100000 steps with 33333 reset in 167 ms.
Product exploration explored 100000 steps with 33333 reset in 168 ms.
Computed a total of 232 stabilizing places and 218 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 232 transition count 218
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 16 factoid took 10 ms. Proved property starting from automaton with 15 states, 39 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 86 ms.
FORMULA HirschbergSinclair-PT-10-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-10-LTLFireability-06 finished in 50258 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((p1&&X(p2)))))) U G(p3)) U p4)))'
Support contains 7 out of 239 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 239/239 places, 225/225 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 236 transition count 222
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 236 transition count 222
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 234 transition count 220
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 234 transition count 220
Applied a total of 10 rules in 15 ms. Remains 234 /239 variables (removed 5) and now considering 220/225 (removed 5) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9101013306061412617.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17517783780238286438.kers'
[2026-05-25 23:03:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9101013306061412617.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17517783780238286438.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 220 rows 234 cols 662 entries
Finished phase 1 with 216 SingleSign rule and 4 generalized
[2026-05-25 23:03:37] [INFO ] Computed 14 invariants in 0 ms
Computed 14 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17517783780238286438.kers
Total runtime 1 ms.
[2026-05-25 23:03:37] [INFO ] Implicit Places using invariants in 88 ms returned []
[2026-05-25 23:03:37] [INFO ] Invariant cache hit.
[2026-05-25 23:03:38] [INFO ] Implicit Places using invariants and state equation in 1140 ms returned []
Implicit Place search using SMT with State Equation took 1230 ms to find 0 implicit places.
Running 210 sub problems to find dead transitions.
[2026-05-25 23:03:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/224 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/224 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 2 (OVERLAPS) 10/234 variables, 11/14 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/234 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 4 (OVERLAPS) 220/454 variables, 234/248 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/454 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 6 (OVERLAPS) 0/454 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 210 unsolved
No progress, stopping.
After SMT solving in domain Real declared 454/454 variables, and 248 constraints, problems are : Problem set: 0 solved, 210 unsolved in 18175 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 234/234 constraints, PredecessorRefiner: 210/210 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 210 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/224 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/224 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 2 (OVERLAPS) 10/234 variables, 11/14 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/234 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 4 (OVERLAPS) 220/454 variables, 234/248 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/454 variables, 210/458 constraints. Problems are: Problem set: 0 solved, 210 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 454/454 variables, and 458 constraints, problems are : Problem set: 0 solved, 210 unsolved in 30024 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 234/234 constraints, PredecessorRefiner: 210/210 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 48218ms problems are : Problem set: 0 solved, 210 unsolved
Search for dead transitions found 0 dead transitions in 48219ms
Starting structural reductions in LTL mode, iteration 1 : 234/239 places, 220/225 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49466 ms. Remains : 234/239 places, 220/225 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((p1&&X(p2)))))) U G(p3)) U p4)))'
Stuttering acceptance computed with spot in 478 ms :[(NOT p4), (NOT p4), (OR (NOT p0) (NOT p2) (NOT p1)), (NOT p3), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Running random walk in product with property : HirschbergSinclair-PT-10-LTLFireability-08
Stuttering criterion allowed to conclude after 236 steps with 0 reset in 1 ms.
FORMULA HirschbergSinclair-PT-10-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-10-LTLFireability-08 finished in 50038 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(X(X(((p0 U !(!p0 U p1))||F(p2)))))))'
Support contains 4 out of 239 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 239/239 places, 225/225 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 234 transition count 220
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 234 transition count 220
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 14 place count 230 transition count 216
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 230 transition count 216
Applied a total of 18 rules in 18 ms. Remains 230 /239 variables (removed 9) and now considering 216/225 (removed 9) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16402408165858879990.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17683290175236734606.kers'
[2026-05-25 23:04:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16402408165858879990.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17683290175236734606.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 216 rows 230 cols 652 entries
Finished phase 1 with 212 SingleSign rule and 4 generalized
[2026-05-25 23:04:27] [INFO ] Computed 14 invariants in 0 ms
Computed 14 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17683290175236734606.kers
Total runtime 1 ms.
[2026-05-25 23:04:27] [INFO ] Implicit Places using invariants in 96 ms returned []
[2026-05-25 23:04:27] [INFO ] Invariant cache hit.
[2026-05-25 23:04:28] [INFO ] Implicit Places using invariants and state equation in 983 ms returned []
Implicit Place search using SMT with State Equation took 1081 ms to find 0 implicit places.
Running 206 sub problems to find dead transitions.
[2026-05-25 23:04:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/220 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/220 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 2 (OVERLAPS) 10/230 variables, 11/14 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/230 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 4 (OVERLAPS) 216/446 variables, 230/244 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/446 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 6 (OVERLAPS) 0/446 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 206 unsolved
No progress, stopping.
After SMT solving in domain Real declared 446/446 variables, and 244 constraints, problems are : Problem set: 0 solved, 206 unsolved in 17523 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 230/230 constraints, PredecessorRefiner: 206/206 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 206 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/220 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/220 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 2 (OVERLAPS) 10/230 variables, 11/14 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/230 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 4 (OVERLAPS) 216/446 variables, 230/244 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/446 variables, 206/450 constraints. Problems are: Problem set: 0 solved, 206 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 446/446 variables, and 450 constraints, problems are : Problem set: 0 solved, 206 unsolved in 30017 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 230/230 constraints, PredecessorRefiner: 206/206 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 47559ms problems are : Problem set: 0 solved, 206 unsolved
Search for dead transitions found 0 dead transitions in 47560ms
Starting structural reductions in LTL mode, iteration 1 : 230/239 places, 216/225 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48661 ms. Remains : 230/239 places, 216/225 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(X(X(((p0 U !(!p0 U p1))||F(p2)))))))'
Stuttering acceptance computed with spot in 158 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Running random walk in product with property : HirschbergSinclair-PT-10-LTLFireability-09
Product exploration explored 100000 steps with 1356 reset in 191 ms.
Product exploration explored 100000 steps with 1358 reset in 201 ms.
Computed a total of 230 stabilizing places and 216 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 230 transition count 216
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 4 factoid took 11 ms. Proved property starting from automaton with 4 states, 5 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 83 ms.
FORMULA HirschbergSinclair-PT-10-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-10-LTLFireability-09 finished in 49332 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 239 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 239/239 places, 225/225 transitions.
Reduce places removed 10 places and 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 0 with 98 rules applied. Total rules applied 98 place count 229 transition count 117
Reduce places removed 98 places and 0 transitions.
Iterating post reduction 1 with 98 rules applied. Total rules applied 196 place count 131 transition count 117
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 201 place count 126 transition count 112
Iterating global reduction 2 with 5 rules applied. Total rules applied 206 place count 126 transition count 112
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 207 place count 126 transition count 111
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 208 place count 125 transition count 111
Applied a total of 208 rules in 18 ms. Remains 125 /239 variables (removed 114) and now considering 111/225 (removed 114) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8978957063491457825.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14843287747284685413.kers'
[2026-05-25 23:05:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8978957063491457825.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14843287747284685413.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 111 rows 125 cols 232 entries
Finished phase 1 with 107 SingleSign rule and 4 generalized
[2026-05-25 23:05:16] [INFO ] Computed 14 invariants in 0 ms
Computed 14 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-14843287747284685413.kers
Total runtime 1 ms.
[2026-05-25 23:05:16] [INFO ] Implicit Places using invariants in 91 ms returned []
[2026-05-25 23:05:16] [INFO ] Invariant cache hit.
[2026-05-25 23:05:17] [INFO ] Implicit Places using invariants and state equation in 266 ms returned []
Implicit Place search using SMT with State Equation took 359 ms to find 0 implicit places.
[2026-05-25 23:05:17] [INFO ] Redundant transitions in 2 ms returned []
Running 92 sub problems to find dead transitions.
[2026-05-25 23:05:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 2 (OVERLAPS) 2/108 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 4 (OVERLAPS) 94/202 variables, 108/122 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/202 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 6 (OVERLAPS) 0/202 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Real declared 202/236 variables, and 122 constraints, problems are : Problem set: 0 solved, 92 unsolved in 3296 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 108/125 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 92 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 2 (OVERLAPS) 2/108 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 4 (OVERLAPS) 94/202 variables, 108/122 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/202 variables, 92/214 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/202 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 7 (OVERLAPS) 0/202 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Int declared 202/236 variables, and 214 constraints, problems are : Problem set: 0 solved, 92 unsolved in 4918 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 108/125 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8218ms problems are : Problem set: 0 solved, 92 unsolved
Search for dead transitions found 0 dead transitions in 8218ms
Starting structural reductions in SI_LTL mode, iteration 1 : 125/239 places, 111/225 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8604 ms. Remains : 125/239 places, 111/225 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-10-LTLFireability-11
Product exploration explored 100000 steps with 883 reset in 96 ms.
Product exploration explored 100000 steps with 882 reset in 102 ms.
Computed a total of 125 stabilizing places and 111 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 125 transition count 111
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 4 factoid took 48 ms. Proved property starting from automaton with 2 states, 3 edges and 1 AP (stutter insensitive
Knowledge-based reduction took 97 ms.
FORMULA HirschbergSinclair-PT-10-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-10-LTLFireability-11 finished in 9018 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||G((p1&&X((p1 U (!p2||G(p1)))))))))))'
Support contains 2 out of 239 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 239/239 places, 225/225 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 235 transition count 221
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 235 transition count 221
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 231 transition count 217
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 231 transition count 217
Applied a total of 16 rules in 15 ms. Remains 231 /239 variables (removed 8) and now considering 217/225 (removed 8) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7652494972519791093.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1321778228487157088.kers'
[2026-05-25 23:05:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7652494972519791093.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1321778228487157088.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 217 rows 231 cols 655 entries
Finished phase 1 with 213 SingleSign rule and 4 generalized
[2026-05-25 23:05:25] [INFO ] Computed 14 invariants in 2 ms
Computed 14 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-1321778228487157088.kers
Total runtime 4 ms.
[2026-05-25 23:05:25] [INFO ] Implicit Places using invariants in 94 ms returned []
[2026-05-25 23:05:25] [INFO ] Invariant cache hit.
[2026-05-25 23:05:26] [INFO ] Implicit Places using invariants and state equation in 1022 ms returned []
Implicit Place search using SMT with State Equation took 1121 ms to find 0 implicit places.
Running 207 sub problems to find dead transitions.
[2026-05-25 23:05:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/221 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/221 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 2 (OVERLAPS) 10/231 variables, 11/14 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/231 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 4 (OVERLAPS) 217/448 variables, 231/245 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/448 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 6 (OVERLAPS) 0/448 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 207 unsolved
No progress, stopping.
After SMT solving in domain Real declared 448/448 variables, and 245 constraints, problems are : Problem set: 0 solved, 207 unsolved in 17844 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 231/231 constraints, PredecessorRefiner: 207/207 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 207 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/221 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/221 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 2 (OVERLAPS) 10/231 variables, 11/14 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/231 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 4 (OVERLAPS) 217/448 variables, 231/245 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/448 variables, 207/452 constraints. Problems are: Problem set: 0 solved, 207 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 448/448 variables, and 452 constraints, problems are : Problem set: 0 solved, 207 unsolved in 30022 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 231/231 constraints, PredecessorRefiner: 207/207 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 47886ms problems are : Problem set: 0 solved, 207 unsolved
Search for dead transitions found 0 dead transitions in 47887ms
Starting structural reductions in LTL mode, iteration 1 : 231/239 places, 217/225 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49024 ms. Remains : 231/239 places, 217/225 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||G((p1&&X((p1 U (!p2||G(p1)))))))))))'
Stuttering acceptance computed with spot in 182 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : HirschbergSinclair-PT-10-LTLFireability-12
Product exploration explored 100000 steps with 424 reset in 152 ms.
Product exploration explored 100000 steps with 424 reset in 155 ms.
Computed a total of 231 stabilizing places and 217 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 231 transition count 217
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 7 factoid took 60 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (168 resets) in 403 ms. (99 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (36 resets) in 124 ms. (320 steps per ms) remains 1/1 properties
[2026-05-25 23:06:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 173/175 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 38/213 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/213 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf1 is UNSAT
After SMT solving in domain Real declared 430/448 variables, and 227 constraints, problems are : Problem set: 1 solved, 0 unsolved in 110 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 213/231 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 114ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge based reduction with 8 factoid took 102 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 195 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Knowledge-based reduction took 706 ms.
Stuttering acceptance computed with spot in 169 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 231 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 231/231 places, 217/217 transitions.
Applied a total of 0 rules in 6 ms. Remains 231 /231 variables (removed 0) and now considering 217/217 (removed 0) transitions.
[2026-05-25 23:06:16] [INFO ] Invariant cache hit.
[2026-05-25 23:06:16] [INFO ] Implicit Places using invariants in 90 ms returned []
[2026-05-25 23:06:16] [INFO ] Invariant cache hit.
[2026-05-25 23:06:17] [INFO ] Implicit Places using invariants and state equation in 1032 ms returned []
Implicit Place search using SMT with State Equation took 1125 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 1132 ms. Remains : 231/231 places, 217/217 transitions.
Computed a total of 231 stabilizing places and 217 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 231 transition count 217
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 56 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
RANDOM walk for 822 steps (0 resets) in 12 ms. (63 steps per ms) remains 0/2 properties
Knowledge based reduction with 4 factoid took 76 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 168 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Knowledge-based reduction took 381 ms.
Stuttering acceptance computed with spot in 179 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 177 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 424 reset in 140 ms.
Product exploration explored 100000 steps with 424 reset in 227 ms.
Spot run failed in 70 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/ltsmin6197363982917294947
[2026-05-25 23:06:18] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6197363982917294947
Running compilation step : cd /tmp/ltsmin6197363982917294947;'/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 462 ms.
Running link step : cd /tmp/ltsmin6197363982917294947;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin6197363982917294947;'/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/stateBased11543425245973932217.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 231 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 231/231 places, 217/217 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 230 transition count 216
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 230 transition count 216
Applied a total of 2 rules in 11 ms. Remains 230 /231 variables (removed 1) and now considering 216/217 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1210373951312651924.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14876367852936925313.kers'
[2026-05-25 23:06:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1210373951312651924.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14876367852936925313.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 216 rows 230 cols 652 entries
Finished phase 1 with 212 SingleSign rule and 4 generalized
[2026-05-25 23:06:33] [INFO ] Computed 14 invariants in 1 ms
Computed 14 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-14876367852936925313.kers
Total runtime 1 ms.
[2026-05-25 23:06:33] [INFO ] Implicit Places using invariants in 90 ms returned []
[2026-05-25 23:06:33] [INFO ] Invariant cache hit.
[2026-05-25 23:06:34] [INFO ] Implicit Places using invariants and state equation in 1060 ms returned []
Implicit Place search using SMT with State Equation took 1154 ms to find 0 implicit places.
Running 206 sub problems to find dead transitions.
[2026-05-25 23:06:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/220 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/220 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 2 (OVERLAPS) 10/230 variables, 11/14 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/230 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 4 (OVERLAPS) 216/446 variables, 230/244 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/446 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 6 (OVERLAPS) 0/446 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 206 unsolved
No progress, stopping.
After SMT solving in domain Real declared 446/446 variables, and 244 constraints, problems are : Problem set: 0 solved, 206 unsolved in 17729 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 230/230 constraints, PredecessorRefiner: 206/206 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 206 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/220 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/220 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 2 (OVERLAPS) 10/230 variables, 11/14 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/230 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 4 (OVERLAPS) 216/446 variables, 230/244 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/446 variables, 206/450 constraints. Problems are: Problem set: 0 solved, 206 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 446/446 variables, and 450 constraints, problems are : Problem set: 0 solved, 206 unsolved in 30015 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 230/230 constraints, PredecessorRefiner: 206/206 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 47762ms problems are : Problem set: 0 solved, 206 unsolved
Search for dead transitions found 0 dead transitions in 47763ms
Starting structural reductions in LTL mode, iteration 1 : 230/231 places, 216/217 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48929 ms. Remains : 230/231 places, 216/217 transitions.
Built C files in :
/tmp/ltsmin15095258710487153723
[2026-05-25 23:07:22] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15095258710487153723
Running compilation step : cd /tmp/ltsmin15095258710487153723;'/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 353 ms.
Running link step : cd /tmp/ltsmin15095258710487153723;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin15095258710487153723;'/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/stateBased4826906014682957175.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-25 23:07:37] [INFO ] Flatten gal took : 13 ms
[2026-05-25 23:07:37] [INFO ] Flatten gal took : 17 ms
[2026-05-25 23:07:37] [INFO ] Time to serialize gal into /tmp/LTL3461891637012448956.gal : 4 ms
[2026-05-25 23:07:37] [INFO ] Time to serialize properties into /tmp/LTL3486261327575516847.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3461891637012448956.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9705720834382153941.hoa' '-atoms' '/tmp/LTL3486261327575516847.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL3486261327575516847.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9705720834382153941.hoa
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t11, t13, t15, t17, t19, t23, t25, t29, t31, t33, t35...305
Computing Next relation with stutter on 2.34375e+07 deadlock states
Detected timeout of ITS tools.
[2026-05-25 23:07:52] [INFO ] Flatten gal took : 10 ms
[2026-05-25 23:07:52] [INFO ] Flatten gal took : 10 ms
[2026-05-25 23:07:52] [INFO ] Time to serialize gal into /tmp/LTL6752912445989414263.gal : 2 ms
[2026-05-25 23:07:52] [INFO ] Time to serialize properties into /tmp/LTL10276530610299496751.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6752912445989414263.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10276530610299496751.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(G(("(rcv_right_election_10_4_6_4<1)")||(G(("(rcv_right_election_10_2_1_9<1)")&&(X(("(rcv_right_election_10_2_1_9<1)")U((!("((ne...250
Formula 0 simplified : XXF(!"(rcv_right_election_10_4_6_4<1)" & F(!"(rcv_right_election_10_2_1_9<1)" | X(!"(rcv_right_election_10_2_1_9<1)" M "((newmsg8>=1...193
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t11, t13, t15, t17, t19, t23, t25, t29, t31, t33, t35...305
Computing Next relation with stutter on 2.8125e+07 deadlock states
Detected timeout of ITS tools.
[2026-05-25 23:08:07] [INFO ] Flatten gal took : 11 ms
[2026-05-25 23:08:07] [INFO ] Applying decomposition
[2026-05-25 23:08:07] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph7768289351741287871.txt' '-o' '/tmp/graph7768289351741287871.bin' '-w' '/tmp/graph7768289351741287871.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph7768289351741287871.bin' '-l' '-1' '-v' '-w' '/tmp/graph7768289351741287871.weights' '-q' '0' '-e' '0.001'
[2026-05-25 23:08:07] [INFO ] Decomposing Gal with order
[2026-05-25 23:08:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 23:08:07] [INFO ] Removed a total of 30 redundant transitions.
[2026-05-25 23:08:08] [INFO ] Flatten gal took : 237 ms
[2026-05-25 23:08:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2026-05-25 23:08:08] [INFO ] Time to serialize gal into /tmp/LTL17544136880433769683.gal : 4 ms
[2026-05-25 23:08:08] [INFO ] Time to serialize properties into /tmp/LTL10399045711867675023.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17544136880433769683.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10399045711867675023.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X(X(G(("(i7.u2.rcv_right_election_10_4_6_4<1)")||(G(("(i1.u7.rcv_right_election_10_2_1_9<1)")&&(X(("(i1.u7.rcv_right_election_10_2_...286
Formula 0 simplified : XXF(!"(i7.u2.rcv_right_election_10_4_6_4<1)" & F(!"(i1.u7.rcv_right_election_10_2_1_9<1)" | X(!"(i1.u7.rcv_right_election_10_2_1_9<1...223
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t8, t9, t15, t19, t31, t214, t224, i0.t39, i0.u4.t33, i0.u5.t37, ...383
Computing Next relation with stutter on 2.8125e+07 deadlock states
Detected timeout of ITS tools.
Treatment of property HirschbergSinclair-PT-10-LTLFireability-12 finished in 177430 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||X(F((p0&&F(p1)))))))'
Support contains 1 out of 239 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 : 239/239 places, 225/225 transitions.
Reduce places removed 9 places and 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 86 transitions
Trivial Post-agglo rules discarded 86 transitions
Performed 86 trivial Post agglomeration. Transition count delta: 86
Iterating post reduction 0 with 86 rules applied. Total rules applied 86 place count 230 transition count 130
Reduce places removed 86 places and 0 transitions.
Iterating post reduction 1 with 86 rules applied. Total rules applied 172 place count 144 transition count 130
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 177 place count 139 transition count 125
Iterating global reduction 2 with 5 rules applied. Total rules applied 182 place count 139 transition count 125
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 183 place count 139 transition count 124
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 184 place count 138 transition count 124
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 185 place count 137 transition count 123
Iterating global reduction 4 with 1 rules applied. Total rules applied 186 place count 137 transition count 123
Applied a total of 186 rules in 22 ms. Remains 137 /239 variables (removed 102) and now considering 123/225 (removed 102) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11192781675748064570.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13524311191965820950.kers'
[2026-05-25 23:08:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11192781675748064570.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13524311191965820950.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 123 rows 137 cols 280 entries
Finished phase 1 with 119 SingleSign rule and 4 generalized
[2026-05-25 23:08:23] [INFO ] Computed 14 invariants in 0 ms
Computed 14 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-13524311191965820950.kers
Total runtime 8 ms.
[2026-05-25 23:08:23] [INFO ] Implicit Places using invariants in 238 ms returned []
[2026-05-25 23:08:23] [INFO ] Invariant cache hit.
[2026-05-25 23:08:23] [INFO ] Implicit Places using invariants and state equation in 296 ms returned []
Implicit Place search using SMT with State Equation took 535 ms to find 0 implicit places.
[2026-05-25 23:08:23] [INFO ] Redundant transitions in 3 ms returned []
Running 106 sub problems to find dead transitions.
[2026-05-25 23:08:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (OVERLAPS) 1/121 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (OVERLAPS) 107/228 variables, 121/135 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/228 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (OVERLAPS) 0/228 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Real declared 228/260 variables, and 135 constraints, problems are : Problem set: 0 solved, 106 unsolved in 4767 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 121/137 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 106 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (OVERLAPS) 1/121 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (OVERLAPS) 107/228 variables, 121/135 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/228 variables, 106/241 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/228 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (OVERLAPS) 0/228 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Int declared 228/260 variables, and 241 constraints, problems are : Problem set: 0 solved, 106 unsolved in 19142 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 121/137 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 23917ms problems are : Problem set: 0 solved, 106 unsolved
Search for dead transitions found 0 dead transitions in 23918ms
Starting structural reductions in SI_LTL mode, iteration 1 : 137/239 places, 123/225 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 24487 ms. Remains : 137/239 places, 123/225 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||X(F((p0&&F(p1)))))))'
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-10-LTLFireability-13
Stuttering criterion allowed to conclude after 7873 steps with 71 reset in 14 ms.
FORMULA HirschbergSinclair-PT-10-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-10-LTLFireability-13 finished in 24577 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((G(p1)||p0))))'
Support contains 3 out of 239 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 239/239 places, 225/225 transitions.
Reduce places removed 9 places and 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 89 transitions
Trivial Post-agglo rules discarded 89 transitions
Performed 89 trivial Post agglomeration. Transition count delta: 89
Iterating post reduction 0 with 89 rules applied. Total rules applied 89 place count 230 transition count 127
Reduce places removed 89 places and 0 transitions.
Iterating post reduction 1 with 89 rules applied. Total rules applied 178 place count 141 transition count 127
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 183 place count 136 transition count 122
Iterating global reduction 2 with 5 rules applied. Total rules applied 188 place count 136 transition count 122
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 189 place count 136 transition count 121
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 190 place count 135 transition count 121
Applied a total of 190 rules in 12 ms. Remains 135 /239 variables (removed 104) and now considering 121/225 (removed 104) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15135319056005939351.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2696143016802383106.kers'
[2026-05-25 23:08:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15135319056005939351.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2696143016802383106.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 121 rows 135 cols 272 entries
Finished phase 1 with 117 SingleSign rule and 4 generalized
[2026-05-25 23:08:47] [INFO ] Computed 14 invariants in 0 ms
Computed 14 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-2696143016802383106.kers
Total runtime 1 ms.
[2026-05-25 23:08:47] [INFO ] Implicit Places using invariants in 96 ms returned []
[2026-05-25 23:08:47] [INFO ] Invariant cache hit.
[2026-05-25 23:08:48] [INFO ] Implicit Places using invariants and state equation in 291 ms returned []
Implicit Place search using SMT with State Equation took 388 ms to find 0 implicit places.
[2026-05-25 23:08:48] [INFO ] Redundant transitions in 2 ms returned []
Running 105 sub problems to find dead transitions.
[2026-05-25 23:08:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/119 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (OVERLAPS) 3/122 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (OVERLAPS) 108/230 variables, 122/136 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/230 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (OVERLAPS) 0/230 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Real declared 230/256 variables, and 136 constraints, problems are : Problem set: 0 solved, 105 unsolved in 4165 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 122/135 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 105 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/119 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (OVERLAPS) 3/122 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (OVERLAPS) 108/230 variables, 122/136 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/230 variables, 105/241 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/230 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (OVERLAPS) 0/230 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Int declared 230/256 variables, and 241 constraints, problems are : Problem set: 0 solved, 105 unsolved in 9440 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 122/135 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 13614ms problems are : Problem set: 0 solved, 105 unsolved
Search for dead transitions found 0 dead transitions in 13615ms
Starting structural reductions in SI_LTL mode, iteration 1 : 135/239 places, 121/225 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 14023 ms. Remains : 135/239 places, 121/225 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((G(p1)||p0))))'
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : HirschbergSinclair-PT-10-LTLFireability-14
Product exploration explored 100000 steps with 759 reset in 120 ms.
Product exploration explored 100000 steps with 758 reset in 113 ms.
Computed a total of 135 stabilizing places and 121 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 135 transition count 121
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 15 ms. Proved property starting from automaton with 2 states, 4 edges and 2 AP (stutter insensitive
Knowledge-based reduction took 68 ms.
FORMULA HirschbergSinclair-PT-10-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-10-LTLFireability-14 finished in 14430 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0||X((X((p1||F(p2))) U (p0&&X((p1||F(p2))))))) U p3))'
Support contains 6 out of 239 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 239/239 places, 225/225 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 235 transition count 221
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 235 transition count 221
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 232 transition count 218
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 232 transition count 218
Applied a total of 14 rules in 20 ms. Remains 232 /239 variables (removed 7) and now considering 218/225 (removed 7) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5278951288231074788.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2373945152241452884.kers'
[2026-05-25 23:09:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5278951288231074788.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2373945152241452884.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 218 rows 232 cols 657 entries
Finished phase 1 with 214 SingleSign rule and 4 generalized
[2026-05-25 23:09:02] [INFO ] Computed 14 invariants in 1 ms
Computed 14 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2373945152241452884.kers
Total runtime 1 ms.
[2026-05-25 23:09:02] [INFO ] Implicit Places using invariants in 97 ms returned []
[2026-05-25 23:09:02] [INFO ] Invariant cache hit.
[2026-05-25 23:09:03] [INFO ] Implicit Places using invariants and state equation in 924 ms returned []
Implicit Place search using SMT with State Equation took 1034 ms to find 0 implicit places.
Running 208 sub problems to find dead transitions.
[2026-05-25 23:09:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/222 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/222 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 10/232 variables, 11/14 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (OVERLAPS) 218/450 variables, 232/246 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/450 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 6 (OVERLAPS) 0/450 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 208 unsolved
No progress, stopping.
After SMT solving in domain Real declared 450/450 variables, and 246 constraints, problems are : Problem set: 0 solved, 208 unsolved in 17717 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 208 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/222 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/222 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 10/232 variables, 11/14 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (OVERLAPS) 218/450 variables, 232/246 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/450 variables, 208/454 constraints. Problems are: Problem set: 0 solved, 208 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 450/450 variables, and 454 constraints, problems are : Problem set: 0 solved, 208 unsolved in 30024 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 47773ms problems are : Problem set: 0 solved, 208 unsolved
Search for dead transitions found 0 dead transitions in 47774ms
Starting structural reductions in LTL mode, iteration 1 : 232/239 places, 218/225 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48829 ms. Remains : 232/239 places, 218/225 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0||X((X((p1||F(p2))) U (p0&&X((p1||F(p2))))))) U p3))'
Stuttering acceptance computed with spot in 183 ms :[(NOT p3), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : HirschbergSinclair-PT-10-LTLFireability-15
Product exploration explored 100000 steps with 989 reset in 166 ms.
Product exploration explored 100000 steps with 989 reset in 178 ms.
Computed a total of 232 stabilizing places and 218 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 232 transition count 218
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 14 factoid took 81 ms. Reduced automaton from 4 states, 6 edges and 4 AP (stutter sensitive) to 4 states, 6 edges and 4 AP (stutter sensitive).
RANDOM walk for 715 steps (0 resets) in 11 ms. (59 steps per ms) remains 0/6 properties
Knowledge based reduction with 14 factoid took 168 ms. Reduced automaton from 4 states, 6 edges and 4 AP (stutter sensitive) to 4 states, 6 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 157 ms :[(NOT p3), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1)), (NOT p2)]
[2026-05-25 23:09:52] [INFO ] Invariant cache hit.
[2026-05-25 23:09:52] [INFO ] [Real]Absence check using 0 positive and 14 generalized place invariants in 10 ms returned sat
[2026-05-25 23:09:52] [INFO ] [Real]Absence check using state equation in 758 ms returned sat
[2026-05-25 23:09:52] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 23:09:53] [INFO ] [Nat]Absence check using 0 positive and 14 generalized place invariants in 9 ms returned sat
[2026-05-25 23:09:54] [INFO ] [Nat]Absence check using state equation in 1748 ms returned sat
[2026-05-25 23:09:54] [INFO ] Computed and/alt/rep : 101/105/101 causal constraints (skipped 107 transitions) in 13 ms.
[2026-05-25 23:09:55] [INFO ] Added : 21 causal constraints over 5 iterations in 699 ms. Result :sat
Could not prove EG (NOT p3)
Knowledge-based reduction took 3947 ms.
Stuttering acceptance computed with spot in 159 ms :[(NOT p3), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1)), (NOT p2)]
Support contains 6 out of 232 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 232/232 places, 218/218 transitions.
Applied a total of 0 rules in 11 ms. Remains 232 /232 variables (removed 0) and now considering 218/218 (removed 0) transitions.
[2026-05-25 23:09:55] [INFO ] Invariant cache hit.
[2026-05-25 23:09:55] [INFO ] Implicit Places using invariants in 87 ms returned []
[2026-05-25 23:09:55] [INFO ] Invariant cache hit.
[2026-05-25 23:09:56] [INFO ] Implicit Places using invariants and state equation in 923 ms returned []
Implicit Place search using SMT with State Equation took 1012 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 1025 ms. Remains : 232/232 places, 218/218 transitions.
Computed a total of 232 stabilizing places and 218 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 232 transition count 218
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 14 factoid took 63 ms. Reduced automaton from 4 states, 6 edges and 4 AP (stutter sensitive) to 4 states, 6 edges and 4 AP (stutter sensitive).
RANDOM walk for 683 steps (0 resets) in 11 ms. (56 steps per ms) remains 0/6 properties
Knowledge based reduction with 14 factoid took 152 ms. Reduced automaton from 4 states, 6 edges and 4 AP (stutter sensitive) to 4 states, 6 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 183 ms :[(NOT p3), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1)), (NOT p2)]
[2026-05-25 23:09:57] [INFO ] Invariant cache hit.
[2026-05-25 23:09:57] [INFO ] [Real]Absence check using 0 positive and 14 generalized place invariants in 9 ms returned sat
[2026-05-25 23:09:58] [INFO ] [Real]Absence check using state equation in 777 ms returned sat
[2026-05-25 23:09:58] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 23:09:58] [INFO ] [Nat]Absence check using 0 positive and 14 generalized place invariants in 10 ms returned sat
[2026-05-25 23:09:59] [INFO ] [Nat]Absence check using state equation in 1748 ms returned sat
[2026-05-25 23:10:00] [INFO ] Computed and/alt/rep : 101/105/101 causal constraints (skipped 107 transitions) in 13 ms.
[2026-05-25 23:10:00] [INFO ] Added : 21 causal constraints over 5 iterations in 683 ms. Result :sat
Could not prove EG (NOT p3)
Knowledge-based reduction took 3927 ms.
Stuttering acceptance computed with spot in 177 ms :[(NOT p3), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1)), (NOT p2)]
Stuttering acceptance computed with spot in 190 ms :[(NOT p3), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1)), (NOT p2)]
Product exploration explored 100000 steps with 991 reset in 177 ms.
Product exploration explored 100000 steps with 988 reset in 178 ms.
Spot run failed in 48 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/ltsmin15323420201907758736
[2026-05-25 23:10:01] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15323420201907758736
Running compilation step : cd /tmp/ltsmin15323420201907758736;'/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 344 ms.
Running link step : cd /tmp/ltsmin15323420201907758736;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin15323420201907758736;'/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/stateBased14948590236842688834.hoa' '--buchi-type=spotba'
LTSmin run took 3822 ms.
FORMULA HirschbergSinclair-PT-10-LTLFireability-15 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property HirschbergSinclair-PT-10-LTLFireability-15 finished in 63491 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||G((p1&&X((p1 U (!p2||G(p1)))))))))))'
Spot run failed in 36 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
[2026-05-25 23:10:05] [INFO ] Flatten gal took : 10 ms
Using solver Z3 to compute partial order matrices.
[2026-05-25 23:10:05] [INFO ] Applying decomposition
Built C files in :
/tmp/ltsmin17605831465439022387
[2026-05-25 23:10:05] [INFO ] Computing symmetric may disable matrix : 225 transitions.
[2026-05-25 23:10:05] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 23:10:05] [INFO ] Computing symmetric may enable matrix : 225 transitions.
[2026-05-25 23:10:05] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 23:10:05] [INFO ] Computing Do-Not-Accords matrix : 225 transitions.
[2026-05-25 23:10:05] [INFO ] Flatten gal took : 35 ms
[2026-05-25 23:10:05] [INFO ] Computation of Completed DNA matrix. took 25 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 23:10:05] [INFO ] Built C files in 62ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17605831465439022387
Running compilation step : cd /tmp/ltsmin17605831465439022387;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '720' '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'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph17619682089501186920.txt' '-o' '/tmp/graph17619682089501186920.bin' '-w' '/tmp/graph17619682089501186920.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph17619682089501186920.bin' '-l' '-1' '-v' '-w' '/tmp/graph17619682089501186920.weights' '-q' '0' '-e' '0.001'
[2026-05-25 23:10:05] [INFO ] Decomposing Gal with order
[2026-05-25 23:10:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 23:10:05] [INFO ] Removed a total of 18 redundant transitions.
[2026-05-25 23:10:05] [INFO ] Flatten gal took : 27 ms
[2026-05-25 23:10:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 16 ms.
[2026-05-25 23:10:05] [INFO ] Time to serialize gal into /tmp/LTLFireability6094021640976706831.gal : 3 ms
[2026-05-25 23:10:05] [INFO ] Time to serialize properties into /tmp/LTLFireability13850543659842075519.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability6094021640976706831.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability13850543659842075519.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(X(G(("(i3.u10.rcv_right_election_10_4_6_4<1)")||(G(("(i4.u7.rcv_right_election_10_2_1_9<1)")&&(X(("(i4.u7.rcv_right_election_10_2...287
Formula 0 simplified : XXF(!"(i3.u10.rcv_right_election_10_4_6_4<1)" & F(!"(i4.u7.rcv_right_election_10_2_1_9<1)" | X(!"(i4.u7.rcv_right_election_10_2_1_9<...224
Compilation finished in 532 ms.
Running link step : cd /tmp/ltsmin17605831465439022387;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin17605831465439022387;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' 'X(X([]((!(LTLAPp0==true)||[](((LTLAPp1==true)&&X(((LTLAPp1==true) U (!(LTLAPp2==true)||[]((LTLAPp1==true)))))))))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t5, t6, t7, t8, t9, t46, t214, t224, u3.t29, u3.t35, i0.u1.t13, i1.u4.t33, i1.u12...416
Computing Next relation with stutter on 6.48e+07 deadlock states
Detected timeout of ITS tools.
[2026-05-25 23:33:30] [INFO ] Flatten gal took : 103 ms
[2026-05-25 23:33:30] [INFO ] Time to serialize gal into /tmp/LTLFireability15189893861779580718.gal : 99 ms
[2026-05-25 23:33:30] [INFO ] Time to serialize properties into /tmp/LTLFireability13014864979736841632.ltl : 19 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability15189893861779580718.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability13014864979736841632.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...299
Read 1 LTL properties
Checking formula 0 : !((X(X(G(("(rcv_right_election_10_4_6_4<1)")||(G(("(rcv_right_election_10_2_1_9<1)")&&(X(("(rcv_right_election_10_2_1_9<1)")U((!("((ne...250
Formula 0 simplified : XXF(!"(rcv_right_election_10_4_6_4<1)" & F(!"(rcv_right_election_10_2_1_9<1)" | X(!"(rcv_right_election_10_2_1_9<1)" M "((newmsg8>=1...193
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t11, t13, t15, t17, t21, t23, t27, t29, t31, t33, t35...310
Computing Next relation with stutter on 6.48e+07 deadlock states
3927 unique states visited
0 strongly connected components in search stack
4148 transitions explored
237 items max in DFS search stack
45230 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,452.339,2939384,1,0,5690,1.4542e+07,23,5201,3178,2.01806e+07,12809
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA HirschbergSinclair-PT-10-LTLFireability-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 2492676 ms.

BK_STOP 1779752490014

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

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