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.r338-smll-178021499100084.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 ErlangenMainframeV1-PT-bP05C05, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r338-smll-178021499100084
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 960K
-rw-r--r-- 1 mcc users 7.5K May 27 08:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 27 08:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 27 08:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K May 27 08:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 27 10:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 27 10:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 27 10:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K May 27 10:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 26 18:17 NewModel
-rw-r--r-- 1 mcc users 9.0K May 27 08:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 90K May 27 08:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K May 27 08:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K May 27 08:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 27 10:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 27 10:32 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 26 18:17 equiv_col
-rw-r--r-- 1 mcc users 8 May 26 18:17 instance
-rw-r--r-- 1 mcc users 6 May 26 18:17 iscolored
-rw-r--r-- 1 mcc users 544K May 26 18:17 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 ErlangenMainframeV1-PT-bP05C05-LTLFireability-00
FORMULA_NAME ErlangenMainframeV1-PT-bP05C05-LTLFireability-01
FORMULA_NAME ErlangenMainframeV1-PT-bP05C05-LTLFireability-02
FORMULA_NAME ErlangenMainframeV1-PT-bP05C05-LTLFireability-03
FORMULA_NAME ErlangenMainframeV1-PT-bP05C05-LTLFireability-04
FORMULA_NAME ErlangenMainframeV1-PT-bP05C05-LTLFireability-05
FORMULA_NAME ErlangenMainframeV1-PT-bP05C05-LTLFireability-06
FORMULA_NAME ErlangenMainframeV1-PT-bP05C05-LTLFireability-07
FORMULA_NAME ErlangenMainframeV1-PT-bP05C05-LTLFireability-08
FORMULA_NAME ErlangenMainframeV1-PT-bP05C05-LTLFireability-09
FORMULA_NAME ErlangenMainframeV1-PT-bP05C05-LTLFireability-10
FORMULA_NAME ErlangenMainframeV1-PT-bP05C05-LTLFireability-11
FORMULA_NAME ErlangenMainframeV1-PT-bP05C05-LTLFireability-12
FORMULA_NAME ErlangenMainframeV1-PT-bP05C05-LTLFireability-13
FORMULA_NAME ErlangenMainframeV1-PT-bP05C05-LTLFireability-14
FORMULA_NAME ErlangenMainframeV1-PT-bP05C05-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1780266775339

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ErlangenMainframeV1-PT-bP05C05
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-31 22:32:57] [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-31 22:32:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-31 22:32:58] [INFO ] Load time of PNML (sax parser for PT used): 262 ms
[2026-05-31 22:32:58] [INFO ] Transformed 253 places.
[2026-05-31 22:32:58] [INFO ] Transformed 1011 transitions.
[2026-05-31 22:32:58] [INFO ] Found NUPN structural information;
[2026-05-31 22:32:58] [INFO ] Parsed PT model containing 253 places and 1011 transitions and 10468 arcs in 479 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA ErlangenMainframeV1-PT-bP05C05-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV1-PT-bP05C05-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 46 out of 253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 253/253 places, 1011/1011 transitions.
Discarding 57 places :
Symmetric choice reduction at 0 with 57 rule applications. Total rules 57 place count 196 transition count 954
Iterating global reduction 0 with 57 rules applied. Total rules applied 114 place count 196 transition count 954
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 145 place count 165 transition count 923
Iterating global reduction 0 with 31 rules applied. Total rules applied 176 place count 165 transition count 923
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 179 place count 162 transition count 920
Iterating global reduction 0 with 3 rules applied. Total rules applied 182 place count 162 transition count 920
Applied a total of 182 rules in 159 ms. Remains 162 /253 variables (removed 91) and now considering 920/1011 (removed 91) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5413142435607252616.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12066658257872494053.kers'
[2026-05-31 22:32:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5413142435607252616.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12066658257872494053.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 920 rows 162 cols 10286 entries
Finished phase 1 with 143 SingleSign rule and 3 generalized
[2026-05-31 22:32:59] [INFO ] Computed 16 invariants in 7 ms
Computed 16 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-12066658257872494053.kers
Total runtime 12 ms.
[2026-05-31 22:32:59] [INFO ] Implicit Places using invariants in 506 ms returned []
[2026-05-31 22:32:59] [INFO ] Invariant cache hit.
[2026-05-31 22:33:00] [INFO ] Implicit Places using invariants and state equation in 951 ms returned []
Implicit Place search using SMT with State Equation took 1569 ms to find 0 implicit places.
Running 919 sub problems to find dead transitions.
[2026-05-31 22:33:00] [INFO ] Invariant cache hit.
Excessive predecessor constraint size, skipping predecessor.
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 919 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/161 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 919 unsolved
At refinement iteration 2 (OVERLAPS) 1/162 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 919 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 3 (INCLUDED_ONLY) 0/162 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 919 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 162/1082 variables, and 18 constraints, problems are : Problem set: 0 solved, 919 unsolved in 30072 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/162 constraints, PredecessorRefiner: 919/174 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 919 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 919 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/161 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 919 unsolved
At refinement iteration 2 (OVERLAPS) 1/162 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 919 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/162 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 919 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 919 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 162/1082 variables, and 19 constraints, problems are : Problem set: 0 solved, 919 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/162 constraints, PredecessorRefiner: 745/174 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62223ms problems are : Problem set: 0 solved, 919 unsolved
Search for dead transitions found 0 dead transitions in 62290ms
Starting structural reductions in LTL mode, iteration 1 : 162/253 places, 920/1011 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64111 ms. Remains : 162/253 places, 920/1011 transitions.
Starting structural reductions in LTL mode, iteration 0 : 162/162 places, 920/920 transitions.
Applied a total of 0 rules in 13 ms. Remains 162 /162 variables (removed 0) and now considering 920/920 (removed 0) transitions.
[2026-05-31 22:34:02] [INFO ] Invariant cache hit.
[2026-05-31 22:34:02] [INFO ] Implicit Places using invariants in 123 ms returned []
[2026-05-31 22:34:02] [INFO ] Invariant cache hit.
[2026-05-31 22:34:03] [INFO ] Implicit Places using invariants and state equation in 597 ms returned []
Implicit Place search using SMT with State Equation took 723 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 738 ms. Remains : 162/162 places, 920/920 transitions.
Support contains 46 out of 162 places after structural reductions.
[2026-05-31 22:34:04] [INFO ] Flatten gal took : 276 ms
[2026-05-31 22:34:04] [INFO ] Flatten gal took : 169 ms
[2026-05-31 22:34:04] [INFO ] Input system was already deterministic with 920 transitions.
RANDOM walk for 40000 steps (8 resets) in 4384 ms. (9 steps per ms) remains 25/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 82 ms. (48 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (8 resets) in 25 ms. (153 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 32 ms. (121 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 41 ms. (95 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 24/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 34 ms. (114 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (8 resets) in 28 ms. (138 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 24/24 properties
[2026-05-31 22:34:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 40/71 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (OVERLAPS) 69/140 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 24 unsolved
Problem AtomicPropp28 is UNSAT
At refinement iteration 5 (OVERLAPS) 22/162 variables, 5/16 constraints. Problems are: Problem set: 1 solved, 23 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 0/16 constraints. Problems are: Problem set: 1 solved, 23 unsolved
At refinement iteration 7 (OVERLAPS) 920/1082 variables, 162/178 constraints. Problems are: Problem set: 1 solved, 23 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1082 variables, 0/178 constraints. Problems are: Problem set: 1 solved, 23 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1082/1082 variables, and 178 constraints, problems are : Problem set: 1 solved, 23 unsolved in 5009 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 162/162 constraints, PredecessorRefiner: 24/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 23 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 23 unsolved
At refinement iteration 1 (OVERLAPS) 40/71 variables, 7/7 constraints. Problems are: Problem set: 1 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 23 unsolved
At refinement iteration 3 (OVERLAPS) 69/140 variables, 4/11 constraints. Problems are: Problem set: 1 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 0/11 constraints. Problems are: Problem set: 1 solved, 23 unsolved
At refinement iteration 5 (OVERLAPS) 22/162 variables, 5/16 constraints. Problems are: Problem set: 1 solved, 23 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 0/16 constraints. Problems are: Problem set: 1 solved, 23 unsolved
At refinement iteration 7 (OVERLAPS) 920/1082 variables, 162/178 constraints. Problems are: Problem set: 1 solved, 23 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1082 variables, 0/178 constraints. Problems are: Problem set: 1 solved, 23 unsolved
At refinement iteration 9 (OVERLAPS) 0/1082 variables, 0/178 constraints. Problems are: Problem set: 1 solved, 23 unsolved
No progress, stopping.
Error getting values : (error "Timeout of Z3 solver reached")
After SMT solving in domain Int declared 1082/1082 variables, and 178 constraints, problems are : Problem set: 1 solved, 23 unsolved in 5010 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 162/162 constraints, PredecessorRefiner: 23/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10132ms problems are : Problem set: 1 solved, 23 unsolved
Fused 23 Parikh solutions to 13 different solutions.
Parikh walk visited 12 properties in 1285 ms.
Support contains 27 out of 162 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 162/162 places, 920/920 transitions.
Graph (trivial) has 120 edges and 162 vertex of which 9 / 162 are part of one of the 4 SCC in 7 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 30 place count 157 transition count 881
Reduce places removed 29 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 50 rules applied. Total rules applied 80 place count 128 transition count 860
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 92 place count 116 transition count 860
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 92 place count 116 transition count 850
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 112 place count 106 transition count 850
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 119 place count 99 transition count 694
Iterating global reduction 3 with 7 rules applied. Total rules applied 126 place count 99 transition count 694
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 126 place count 99 transition count 693
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 128 place count 98 transition count 693
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 170 place count 77 transition count 672
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 173 place count 74 transition count 665
Iterating global reduction 3 with 3 rules applied. Total rules applied 176 place count 74 transition count 665
Performed 7 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 190 place count 67 transition count 691
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 202 place count 67 transition count 679
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 204 place count 65 transition count 673
Iterating global reduction 4 with 2 rules applied. Total rules applied 206 place count 65 transition count 673
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 216 place count 65 transition count 663
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 218 place count 64 transition count 676
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 219 place count 64 transition count 675
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 227 place count 64 transition count 667
Free-agglomeration rule applied 3 times.
Iterating global reduction 6 with 3 rules applied. Total rules applied 230 place count 64 transition count 664
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 233 place count 61 transition count 664
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 234 place count 61 transition count 663
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 235 place count 61 transition count 669
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 238 place count 60 transition count 667
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 8 with 13 rules applied. Total rules applied 251 place count 60 transition count 654
Partial Post-agglomeration rule applied 5 times.
Drop transitions (Partial Post agglomeration) removed 5 transitions
Iterating global reduction 8 with 5 rules applied. Total rules applied 256 place count 60 transition count 654
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 8 with 5 rules applied. Total rules applied 261 place count 60 transition count 649
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 262 place count 59 transition count 648
Applied a total of 262 rules in 469 ms. Remains 59 /162 variables (removed 103) and now considering 648/920 (removed 272) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 469 ms. Remains : 59/162 places, 648/920 transitions.
RANDOM walk for 40000 steps (8 resets) in 2921 ms. (13 steps per ms) remains 9/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 395 ms. (101 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (8 resets) in 404 ms. (98 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 181 ms. (219 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 359 ms. (111 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 103 ms. (384 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (8 resets) in 323 ms. (123 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 267 ms. (149 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (8 resets) in 108 ms. (366 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40001 steps (8 resets) in 258 ms. (154 steps per ms) remains 9/9 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1651614014336408153.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15030019887911499674.kers'
[2026-05-31 22:34:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1651614014336408153.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15030019887911499674.kers]
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 1 ms.
// Phase 1: matrix 648 rows 56 cols 8259 entries
Finished phase 1 with 40 SingleSign rule and 3 generalized
[2026-05-31 22:34:19] [INFO ] Computed 16 invariants in 5 ms
Computed 16 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-15030019887911499674.kers
Total runtime 8 ms.
[2026-05-31 22:34:19] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 12/37 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 15/52 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 3/55 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 645/700 variables, 55/69 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/700 variables, 17/86 constraints. Problems are: Problem set: 0 solved, 9 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/700 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 7/707 variables, 4/90 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/707 variables, 2/92 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/707 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/707 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (OVERLAPS) 0/707 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 707/707 variables, and 93 constraints, problems are : Problem set: 0 solved, 9 unsolved in 1615 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 59/59 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 9/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 12/37 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 15/52 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 3/55 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 645/700 variables, 55/69 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/700 variables, 17/86 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/700 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 7/707 variables, 4/90 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/707 variables, 2/92 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/707 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/707 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (OVERLAPS) 0/707 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 707/707 variables, and 93 constraints, problems are : Problem set: 0 solved, 9 unsolved in 1866 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 59/59 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 9/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3551ms problems are : Problem set: 0 solved, 9 unsolved
Parikh walk visited 7 properties in 1290 ms.
Support contains 13 out of 59 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 59/59 places, 648/648 transitions.
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 0 place count 59 transition count 644
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 55 transition count 644
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 52 transition count 568
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 52 transition count 568
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 51 transition count 406
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 51 transition count 406
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 49 transition count 406
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 49 transition count 404
Free-agglomeration rule applied 4 times.
Iterating global reduction 0 with 4 rules applied. Total rules applied 26 place count 49 transition count 400
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 30 place count 45 transition count 400
Applied a total of 30 rules in 78 ms. Remains 45 /59 variables (removed 14) and now considering 400/648 (removed 248) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 78 ms. Remains : 45/59 places, 400/648 transitions.
RANDOM walk for 40000 steps (8 resets) in 2314 ms. (17 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 134 ms. (296 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 203 ms. (196 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 268363 steps, run visited all 2 properties in 852 ms. (steps per millisecond=314 )
Probabilistic random walk after 268363 steps, saw 39147 distinct states, run finished after 861 ms. (steps per millisecond=311 ) properties seen :2
FORMULA ErlangenMainframeV1-PT-bP05C05-LTLFireability-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
Computed a total of 16 stabilizing places and 16 stable transitions
FORMULA ErlangenMainframeV1-PT-bP05C05-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(!(p0 U p1))&&!(X(G(p2)) U !X(p2))))'
Support contains 11 out of 162 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 162/162 places, 920/920 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 156 transition count 898
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 156 transition count 898
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 153 transition count 895
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 153 transition count 895
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 150 transition count 892
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 150 transition count 892
Applied a total of 24 rules in 31 ms. Remains 150 /162 variables (removed 12) and now considering 892/920 (removed 28) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1593419567590243849.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-845560144793659966.kers'
[2026-05-31 22:34:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1593419567590243849.kers, --Pflows, --basisKERS=/tmp/petrispot-output-845560144793659966.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 892 rows 150 cols 10154 entries
Finished phase 1 with 131 SingleSign rule and 3 generalized
[2026-05-31 22:34:26] [INFO ] Computed 16 invariants in 6 ms
Computed 16 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-845560144793659966.kers
Total runtime 10 ms.
[2026-05-31 22:34:27] [INFO ] Implicit Places using invariants in 371 ms returned []
[2026-05-31 22:34:27] [INFO ] Invariant cache hit.
[2026-05-31 22:34:27] [INFO ] Implicit Places using invariants and state equation in 647 ms returned []
Implicit Place search using SMT with State Equation took 1021 ms to find 0 implicit places.
Running 891 sub problems to find dead transitions.
[2026-05-31 22:34:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 891 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 891 unsolved
At refinement iteration 2 (OVERLAPS) 1/150 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 891 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 3 (INCLUDED_ONLY) 0/150 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 891 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 150/1042 variables, and 18 constraints, problems are : Problem set: 0 solved, 891 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/150 constraints, PredecessorRefiner: 891/146 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 891 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 891 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 891 unsolved
At refinement iteration 2 (OVERLAPS) 1/150 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 891 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/150 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 891 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/150 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 891 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 150/1042 variables, and 19 constraints, problems are : Problem set: 0 solved, 891 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/150 constraints, PredecessorRefiner: 745/146 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61391ms problems are : Problem set: 0 solved, 891 unsolved
Search for dead transitions found 0 dead transitions in 61399ms
Starting structural reductions in LTL mode, iteration 1 : 150/162 places, 892/920 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62460 ms. Remains : 150/162 places, 892/920 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(!(p0 U p1))&&!(X(G(p2)) U !X(p2))))'
Stuttering acceptance computed with spot in 509 ms :[(OR (NOT p2) p1), p1, (NOT p2), true]
Running random walk in product with property : ErlangenMainframeV1-PT-bP05C05-LTLFireability-00
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 3 ms.
FORMULA ErlangenMainframeV1-PT-bP05C05-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV1-PT-bP05C05-LTLFireability-00 finished in 63212 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)||X((G(!p1)||(!p1&&F(p0))))))'
Support contains 10 out of 162 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 162/162 places, 920/920 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 146 transition count 656
Ensure Unique test removed 3 places
Iterating global reduction 0 with 19 rules applied. Total rules applied 35 place count 143 transition count 656
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 41 place count 137 transition count 382
Ensure Unique test removed 1 places
Iterating global reduction 0 with 7 rules applied. Total rules applied 48 place count 136 transition count 382
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 51 place count 133 transition count 379
Iterating global reduction 0 with 3 rules applied. Total rules applied 54 place count 133 transition count 379
Applied a total of 54 rules in 26 ms. Remains 133 /162 variables (removed 29) and now considering 379/920 (removed 541) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-590034634083533228.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-143231569214957458.kers'
[2026-05-31 22:35:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-590034634083533228.kers, --Pflows, --basisKERS=/tmp/petrispot-output-143231569214957458.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 379 rows 133 cols 2600 entries
Finished phase 1 with 120 SingleSign rule and 1 generalized
[2026-05-31 22:35:29] [INFO ] Computed 12 invariants in 3 ms
Computed 12 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-143231569214957458.kers
Total runtime 4 ms.
[2026-05-31 22:35:30] [INFO ] Implicit Places using invariants in 166 ms returned [42]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 179 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 132/162 places, 379/920 transitions.
Applied a total of 0 rules in 4 ms. Remains 132 /132 variables (removed 0) and now considering 379/379 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 210 ms. Remains : 132/162 places, 379/920 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)||X((G(p1)||(p1&&F(p0))))))'
Stuttering acceptance computed with spot in 315 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : ErlangenMainframeV1-PT-bP05C05-LTLFireability-01
Product exploration explored 100000 steps with 50000 reset in 402 ms.
Product exploration explored 100000 steps with 50000 reset in 221 ms.
Computed a total of 16 stabilizing places and 16 stable transitions
Computed a total of 16 stabilizing places and 16 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 10 factoid took 17 ms. Proved property starting from automaton with 7 states, 13 edges and 2 AP (stutter sensitive
Knowledge-based reduction took 28 ms.
FORMULA ErlangenMainframeV1-PT-bP05C05-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ErlangenMainframeV1-PT-bP05C05-LTLFireability-01 finished in 1258 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 4 out of 162 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 162/162 places, 920/920 transitions.
Graph (trivial) has 134 edges and 162 vertex of which 9 / 162 are part of one of the 4 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 26 place count 156 transition count 888
Reduce places removed 25 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 46 rules applied. Total rules applied 72 place count 131 transition count 867
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 84 place count 119 transition count 867
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 84 place count 119 transition count 856
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 106 place count 108 transition count 856
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 120 place count 94 transition count 594
Ensure Unique test removed 4 places
Iterating global reduction 3 with 18 rules applied. Total rules applied 138 place count 90 transition count 594
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 138 place count 90 transition count 593
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 140 place count 89 transition count 593
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 150 place count 79 transition count 110
Ensure Unique test removed 1 places
Iterating global reduction 3 with 11 rules applied. Total rules applied 161 place count 78 transition count 110
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 166 place count 73 transition count 100
Iterating global reduction 3 with 5 rules applied. Total rules applied 171 place count 73 transition count 100
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 172 place count 72 transition count 98
Iterating global reduction 3 with 1 rules applied. Total rules applied 173 place count 72 transition count 98
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 215 place count 51 transition count 77
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 218 place count 48 transition count 70
Iterating global reduction 3 with 3 rules applied. Total rules applied 221 place count 48 transition count 70
Performed 13 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 247 place count 35 transition count 88
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 261 place count 35 transition count 74
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 264 place count 32 transition count 68
Iterating global reduction 4 with 3 rules applied. Total rules applied 267 place count 32 transition count 68
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 4 with 11 rules applied. Total rules applied 278 place count 32 transition count 57
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 280 place count 31 transition count 63
Drop transitions (Redundant composition of simpler transitions.) removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 5 with 15 rules applied. Total rules applied 295 place count 31 transition count 48
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 296 place count 30 transition count 47
Applied a total of 296 rules in 139 ms. Remains 30 /162 variables (removed 132) and now considering 47/920 (removed 873) transitions.
[2026-05-31 22:35:31] [INFO ] Flow matrix only has 37 transitions (discarded 10 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18222492492007630891.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14190024227393826988.kers'
[2026-05-31 22:35:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18222492492007630891.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14190024227393826988.kers]
Normalized transition count is 36 out of 37 initially.
Culling duplicate invariants (modulo rational): removing 6 columns.
Culled 6 columns in 0 ms.
// Phase 1: matrix 36 rows 24 cols 121 entries
Finished phase 1 with 19 SingleSign rule and 0 generalized
[2026-05-31 22:35:31] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-14190024227393826988.kers
Total runtime 2 ms.
[2026-05-31 22:35:31] [INFO ] Implicit Places using invariants in 52 ms returned []
[2026-05-31 22:35:31] [INFO ] Flow matrix only has 37 transitions (discarded 10 similar events)
[2026-05-31 22:35:31] [INFO ] Invariant cache hit.
[2026-05-31 22:35:31] [INFO ] State equation strengthened by 3 read => feed constraints.
[2026-05-31 22:35:31] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
[2026-05-31 22:35:31] [INFO ] Redundant transitions in 21 ms returned []
Running 34 sub problems to find dead transitions.
[2026-05-31 22:35:31] [INFO ] Flow matrix only has 37 transitions (discarded 10 similar events)
[2026-05-31 22:35:31] [INFO ] Invariant cache hit.
[2026-05-31 22:35:31] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 2 (OVERLAPS) 5/30 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 4 (OVERLAPS) 36/66 variables, 30/41 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 3/44 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 7 (OVERLAPS) 0/66 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 34 unsolved
No progress, stopping.
After SMT solving in domain Real declared 66/67 variables, and 44 constraints, problems are : Problem set: 0 solved, 34 unsolved in 691 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 30/30 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 34/34 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 34 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 2 (OVERLAPS) 5/30 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 4 (OVERLAPS) 36/66 variables, 30/41 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 3/44 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 34/78 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/66 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 8 (OVERLAPS) 0/66 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 34 unsolved
No progress, stopping.
After SMT solving in domain Int declared 66/67 variables, and 78 constraints, problems are : Problem set: 0 solved, 34 unsolved in 1156 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 30/30 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 34/34 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1859ms problems are : Problem set: 0 solved, 34 unsolved
Search for dead transitions found 0 dead transitions in 1859ms
Starting structural reductions in SI_LTL mode, iteration 1 : 30/162 places, 47/920 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2150 ms. Remains : 30/162 places, 47/920 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : ErlangenMainframeV1-PT-bP05C05-LTLFireability-02
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ErlangenMainframeV1-PT-bP05C05-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV1-PT-bP05C05-LTLFireability-02 finished in 2225 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 7 out of 162 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 162/162 places, 920/920 transitions.
Graph (trivial) has 132 edges and 162 vertex of which 9 / 162 are part of one of the 4 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 27 place count 156 transition count 887
Reduce places removed 26 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 47 rules applied. Total rules applied 74 place count 130 transition count 866
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 86 place count 118 transition count 866
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 86 place count 118 transition count 856
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 106 place count 108 transition count 856
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 120 place count 94 transition count 594
Ensure Unique test removed 4 places
Iterating global reduction 3 with 18 rules applied. Total rules applied 138 place count 90 transition count 594
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 138 place count 90 transition count 593
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 140 place count 89 transition count 593
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 145 place count 84 transition count 202
Ensure Unique test removed 1 places
Iterating global reduction 3 with 6 rules applied. Total rules applied 151 place count 83 transition count 202
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 154 place count 80 transition count 166
Iterating global reduction 3 with 3 rules applied. Total rules applied 157 place count 80 transition count 166
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 158 place count 79 transition count 164
Iterating global reduction 3 with 1 rules applied. Total rules applied 159 place count 79 transition count 164
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 209 place count 54 transition count 139
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 212 place count 51 transition count 132
Iterating global reduction 3 with 3 rules applied. Total rules applied 215 place count 51 transition count 132
Performed 9 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 233 place count 42 transition count 150
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 245 place count 42 transition count 138
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 247 place count 40 transition count 134
Iterating global reduction 4 with 2 rules applied. Total rules applied 249 place count 40 transition count 134
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 259 place count 40 transition count 124
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 261 place count 39 transition count 137
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 271 place count 39 transition count 127
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 273 place count 39 transition count 127
Applied a total of 273 rules in 115 ms. Remains 39 /162 variables (removed 123) and now considering 127/920 (removed 793) transitions.
[2026-05-31 22:35:33] [INFO ] Flow matrix only has 116 transitions (discarded 11 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14858502450743676897.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17902828976174750875.kers'
[2026-05-31 22:35:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14858502450743676897.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17902828976174750875.kers]
Normalized transition count is 115 out of 116 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 115 rows 39 cols 1136 entries
Finished phase 1 with 28 SingleSign rule and 0 generalized
[2026-05-31 22:35:33] [INFO ] Computed 11 invariants in 1 ms
Computed 11 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17902828976174750875.kers
Total runtime 2 ms.
[2026-05-31 22:35:33] [INFO ] Implicit Places using invariants in 97 ms returned []
[2026-05-31 22:35:33] [INFO ] Flow matrix only has 116 transitions (discarded 11 similar events)
[2026-05-31 22:35:33] [INFO ] Invariant cache hit.
[2026-05-31 22:35:33] [INFO ] State equation strengthened by 11 read => feed constraints.
[2026-05-31 22:35:33] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 241 ms to find 0 implicit places.
[2026-05-31 22:35:33] [INFO ] Redundant transitions in 6 ms returned []
Running 119 sub problems to find dead transitions.
[2026-05-31 22:35:33] [INFO ] Flow matrix only has 116 transitions (discarded 11 similar events)
[2026-05-31 22:35:33] [INFO ] Invariant cache hit.
[2026-05-31 22:35:33] [INFO ] State equation strengthened by 11 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (OVERLAPS) 1/39 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (OVERLAPS) 115/154 variables, 39/50 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 10/60 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/154 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (OVERLAPS) 1/155 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/155 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 9 (OVERLAPS) 0/155 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Real declared 155/155 variables, and 62 constraints, problems are : Problem set: 0 solved, 119 unsolved in 7358 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 39/39 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 119 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (OVERLAPS) 1/39 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (OVERLAPS) 115/154 variables, 39/51 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/154 variables, 10/61 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 119/180 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/154 variables, 2/182 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/154 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 9 (OVERLAPS) 1/155 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/155 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 11 (OVERLAPS) 0/155 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Int declared 155/155 variables, and 183 constraints, problems are : Problem set: 0 solved, 119 unsolved in 21699 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 39/39 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 29222ms problems are : Problem set: 0 solved, 119 unsolved
Search for dead transitions found 0 dead transitions in 29223ms
Starting structural reductions in SI_LTL mode, iteration 1 : 39/162 places, 127/920 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 29594 ms. Remains : 39/162 places, 127/920 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : ErlangenMainframeV1-PT-bP05C05-LTLFireability-04
Product exploration explored 100000 steps with 0 reset in 480 ms.
Product exploration explored 100000 steps with 0 reset in 454 ms.
Computed a total of 2 stabilizing places and 9 stable transitions
Computed a total of 2 stabilizing places and 9 stable transitions
Knowledge based reduction with 3 factoid took 52 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
RANDOM walk for 40000 steps (8 resets) in 708 ms. (56 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (8 resets) in 454 ms. (87 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 16984 steps, run visited all 1 properties in 72 ms. (steps per millisecond=235 )
Probabilistic random walk after 16984 steps, saw 5129 distinct states, run finished after 73 ms. (steps per millisecond=232 ) properties seen :1
Knowledge based reduction with 3 factoid took 58 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Knowledge-based reduction took 573 ms.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Support contains 7 out of 39 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 39/39 places, 127/127 transitions.
Applied a total of 0 rules in 4 ms. Remains 39 /39 variables (removed 0) and now considering 127/127 (removed 0) transitions.
[2026-05-31 22:36:04] [INFO ] Flow matrix only has 116 transitions (discarded 11 similar events)
[2026-05-31 22:36:04] [INFO ] Invariant cache hit.
[2026-05-31 22:36:04] [INFO ] Implicit Places using invariants in 48 ms returned []
[2026-05-31 22:36:04] [INFO ] Flow matrix only has 116 transitions (discarded 11 similar events)
[2026-05-31 22:36:04] [INFO ] Invariant cache hit.
[2026-05-31 22:36:04] [INFO ] State equation strengthened by 11 read => feed constraints.
[2026-05-31 22:36:04] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 193 ms to find 0 implicit places.
[2026-05-31 22:36:04] [INFO ] Redundant transitions in 3 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 209 ms. Remains : 39/39 places, 127/127 transitions.
Computed a total of 2 stabilizing places and 9 stable transitions
Computed a total of 2 stabilizing places and 9 stable transitions
Knowledge based reduction with 3 factoid took 62 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
RANDOM walk for 40000 steps (8 resets) in 603 ms. (66 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (8 resets) in 350 ms. (113 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 16984 steps, run visited all 1 properties in 50 ms. (steps per millisecond=339 )
Probabilistic random walk after 16984 steps, saw 5129 distinct states, run finished after 51 ms. (steps per millisecond=333 ) properties seen :1
Knowledge based reduction with 3 factoid took 66 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Knowledge-based reduction took 509 ms.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 474 ms.
Product exploration explored 100000 steps with 0 reset in 421 ms.
Built C files in :
/tmp/ltsmin16207710864768802184
[2026-05-31 22:36:06] [INFO ] Computing symmetric may disable matrix : 127 transitions.
[2026-05-31 22:36:06] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-31 22:36:06] [INFO ] Computing symmetric may enable matrix : 127 transitions.
[2026-05-31 22:36:06] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-31 22:36:06] [INFO ] Computing Do-Not-Accords matrix : 127 transitions.
[2026-05-31 22:36:06] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-31 22:36:06] [INFO ] Built C files in 53ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16207710864768802184
Running compilation step : cd /tmp/ltsmin16207710864768802184;'/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 817 ms.
Running link step : cd /tmp/ltsmin16207710864768802184;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 67 ms.
Running LTSmin : cd /tmp/ltsmin16207710864768802184;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased9242406350505915005.hoa' '--buchi-type=spotba'
LTSmin run took 2626 ms.
FORMULA ErlangenMainframeV1-PT-bP05C05-LTLFireability-04 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ErlangenMainframeV1-PT-bP05C05-LTLFireability-04 finished in 36529 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U p1)||(F(p2) U (G(p0) U p3)))))'
Support contains 18 out of 162 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 162/162 places, 920/920 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 151 transition count 702
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 151 transition count 702
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 26 place count 147 transition count 683
Iterating global reduction 0 with 4 rules applied. Total rules applied 30 place count 147 transition count 683
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 32 place count 145 transition count 681
Iterating global reduction 0 with 2 rules applied. Total rules applied 34 place count 145 transition count 681
Applied a total of 34 rules in 13 ms. Remains 145 /162 variables (removed 17) and now considering 681/920 (removed 239) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8852228772650191007.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3729931701150139989.kers'
[2026-05-31 22:36:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8852228772650191007.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3729931701150139989.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 681 rows 145 cols 7622 entries
Finished phase 1 with 127 SingleSign rule and 2 generalized
[2026-05-31 22:36:09] [INFO ] Computed 16 invariants in 5 ms
Computed 16 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-3729931701150139989.kers
Total runtime 7 ms.
[2026-05-31 22:36:10] [INFO ] Implicit Places using invariants in 144 ms returned []
[2026-05-31 22:36:10] [INFO ] Invariant cache hit.
[2026-05-31 22:36:10] [INFO ] Implicit Places using invariants and state equation in 486 ms returned []
Implicit Place search using SMT with State Equation took 635 ms to find 0 implicit places.
Running 680 sub problems to find dead transitions.
[2026-05-31 22:36:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 680 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/144 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 680 unsolved
At refinement iteration 2 (OVERLAPS) 1/145 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 680 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/145 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 680 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 145/826 variables, and 17 constraints, problems are : Problem set: 0 solved, 680 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/145 constraints, PredecessorRefiner: 680/146 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 680 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 680 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/144 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 680 unsolved
At refinement iteration 2 (OVERLAPS) 1/145 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 680 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/145 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 680 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/145 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 680 unsolved
At refinement iteration 5 (OVERLAPS) 681/826 variables, 145/162 constraints. Problems are: Problem set: 0 solved, 680 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/826 variables, 146/308 constraints. Problems are: Problem set: 0 solved, 680 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 826/826 variables, and 310 constraints, problems are : Problem set: 0 solved, 680 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 145/145 constraints, PredecessorRefiner: 680/146 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60978ms problems are : Problem set: 0 solved, 680 unsolved
Search for dead transitions found 0 dead transitions in 60982ms
Starting structural reductions in LTL mode, iteration 1 : 145/162 places, 681/920 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61633 ms. Remains : 145/162 places, 681/920 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U p1)||(F(p2) U (G(p0) U p3)))))'
Stuttering acceptance computed with spot in 321 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (NOT p2), (NOT p3), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : ErlangenMainframeV1-PT-bP05C05-LTLFireability-05
Product exploration explored 100000 steps with 50000 reset in 139 ms.
Product exploration explored 100000 steps with 50000 reset in 153 ms.
Computed a total of 16 stabilizing places and 16 stable transitions
Computed a total of 16 stabilizing places and 16 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 21 factoid took 19 ms. Proved property starting from automaton with 6 states, 13 edges and 4 AP (stutter sensitive
Knowledge-based reduction took 27 ms.
FORMULA ErlangenMainframeV1-PT-bP05C05-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ErlangenMainframeV1-PT-bP05C05-LTLFireability-05 finished in 62334 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(X(X(p0))) U ((X(X(X(p0)))&&G(!p1))||X(X(X(G(p0)))))) U (G((X(X(X(p0))) U ((X(X(X(p0)))&&G(!p1))||X(X(X(G(p0)))))))||(!p2&&(X(X(X(p0))) U ((X(X(X(p0)))&&G(!p1))||X(X(X(G(p0))))))))))'
Support contains 12 out of 162 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 162/162 places, 920/920 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 146 transition count 656
Ensure Unique test removed 3 places
Iterating global reduction 0 with 19 rules applied. Total rules applied 35 place count 143 transition count 656
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 41 place count 137 transition count 382
Ensure Unique test removed 1 places
Iterating global reduction 0 with 7 rules applied. Total rules applied 48 place count 136 transition count 382
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 51 place count 133 transition count 379
Iterating global reduction 0 with 3 rules applied. Total rules applied 54 place count 133 transition count 379
Applied a total of 54 rules in 10 ms. Remains 133 /162 variables (removed 29) and now considering 379/920 (removed 541) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5753242147910353260.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18304977672109798922.kers'
[2026-05-31 22:37:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5753242147910353260.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18304977672109798922.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 379 rows 133 cols 2600 entries
Finished phase 1 with 120 SingleSign rule and 1 generalized
[2026-05-31 22:37:12] [INFO ] Computed 12 invariants in 4 ms
Computed 12 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-18304977672109798922.kers
Total runtime 5 ms.
[2026-05-31 22:37:12] [INFO ] Implicit Places using invariants in 129 ms returned [41]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 131 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 132/162 places, 379/920 transitions.
Applied a total of 0 rules in 1 ms. Remains 132 /132 variables (removed 0) and now considering 379/379 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 142 ms. Remains : 132/162 places, 379/920 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(X(X(p0))) U (X(X(X(G(p0))))||(X(X(X(p0)))&&G(!p1)))) U (G((X(X(X(p0))) U ((X(X(X(p0)))&&G(!p1))||X(X(X(G(p0)))))))||(!p2&&(X(X(X(p0))) U ((X(X(X(p0)))&&G(!p1))||X(X(X(G(p0))))))))))'
Stuttering acceptance computed with spot in 519 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) p1), (NOT p0), (AND (NOT p0) p1), (AND p1 (NOT p0)), (NOT p0), true, (AND p1 (NOT p0)), (AND p1 p0)]
Running random walk in product with property : ErlangenMainframeV1-PT-bP05C05-LTLFireability-07
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA ErlangenMainframeV1-PT-bP05C05-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV1-PT-bP05C05-LTLFireability-07 finished in 795 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X((X(p0)||p1)) U p2) U ((F(p1) U X(p3))||p1)))'
Support contains 17 out of 162 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 162/162 places, 920/920 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 151 transition count 702
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 151 transition count 702
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 26 place count 147 transition count 683
Iterating global reduction 0 with 4 rules applied. Total rules applied 30 place count 147 transition count 683
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 33 place count 144 transition count 680
Iterating global reduction 0 with 3 rules applied. Total rules applied 36 place count 144 transition count 680
Applied a total of 36 rules in 12 ms. Remains 144 /162 variables (removed 18) and now considering 680/920 (removed 240) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14276059973913754858.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-320917285350353111.kers'
[2026-05-31 22:37:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14276059973913754858.kers, --Pflows, --basisKERS=/tmp/petrispot-output-320917285350353111.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 680 rows 144 cols 7620 entries
Finished phase 1 with 126 SingleSign rule and 2 generalized
[2026-05-31 22:37:13] [INFO ] Computed 16 invariants in 8 ms
Computed 16 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-320917285350353111.kers
Total runtime 10 ms.
[2026-05-31 22:37:13] [INFO ] Implicit Places using invariants in 180 ms returned []
[2026-05-31 22:37:13] [INFO ] Invariant cache hit.
[2026-05-31 22:37:13] [INFO ] Implicit Places using invariants and state equation in 500 ms returned []
Implicit Place search using SMT with State Equation took 685 ms to find 0 implicit places.
Running 679 sub problems to find dead transitions.
[2026-05-31 22:37:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 2 (OVERLAPS) 1/144 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/144 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 679 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 144/824 variables, and 17 constraints, problems are : Problem set: 0 solved, 679 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/144 constraints, PredecessorRefiner: 679/145 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 679 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 2 (OVERLAPS) 1/144 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/144 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 5 (OVERLAPS) 680/824 variables, 144/161 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/824 variables, 145/306 constraints. Problems are: Problem set: 0 solved, 679 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 824/824 variables, and 310 constraints, problems are : Problem set: 0 solved, 679 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 144/144 constraints, PredecessorRefiner: 679/145 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60963ms problems are : Problem set: 0 solved, 679 unsolved
Search for dead transitions found 0 dead transitions in 60968ms
Starting structural reductions in LTL mode, iteration 1 : 144/162 places, 680/920 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61669 ms. Remains : 144/162 places, 680/920 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X((X(p0)||p1)) U p2) U ((F(p1) U X(p3))||p1)))'
Stuttering acceptance computed with spot in 554 ms :[(AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p3)), (NOT p1), (AND (NOT p1) (NOT p3)), (NOT p3)]
Running random walk in product with property : ErlangenMainframeV1-PT-bP05C05-LTLFireability-09
Product exploration explored 100000 steps with 0 reset in 1476 ms.
Stack based approach found an accepted trace after 36 steps with 0 reset with depth 37 and stack size 37 in 1 ms.
FORMULA ErlangenMainframeV1-PT-bP05C05-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property ErlangenMainframeV1-PT-bP05C05-LTLFireability-09 finished in 63790 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(G((((!p0&&X(!p0)) U (G((!p0&&X(!p0)))||(X(!p0)&&p1))) U X(X(p2))))))'
Support contains 11 out of 162 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 162/162 places, 920/920 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 147 transition count 657
Ensure Unique test removed 3 places
Iterating global reduction 0 with 18 rules applied. Total rules applied 33 place count 144 transition count 657
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 39 place count 138 transition count 383
Ensure Unique test removed 1 places
Iterating global reduction 0 with 7 rules applied. Total rules applied 46 place count 137 transition count 383
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 51 place count 132 transition count 376
Iterating global reduction 0 with 5 rules applied. Total rules applied 56 place count 132 transition count 376
Applied a total of 56 rules in 14 ms. Remains 132 /162 variables (removed 30) and now considering 376/920 (removed 544) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10472223916003506889.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4357443649389862966.kers'
[2026-05-31 22:38:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10472223916003506889.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4357443649389862966.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 376 rows 132 cols 2594 entries
Finished phase 1 with 119 SingleSign rule and 1 generalized
[2026-05-31 22:38:16] [INFO ] Computed 12 invariants in 2 ms
Computed 12 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-4357443649389862966.kers
Total runtime 3 ms.
[2026-05-31 22:38:16] [INFO ] Implicit Places using invariants in 95 ms returned [41]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 97 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 131/162 places, 376/920 transitions.
Applied a total of 0 rules in 2 ms. Remains 131 /131 variables (removed 0) and now considering 376/376 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 113 ms. Remains : 131/162 places, 376/920 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(G((((!p0&&X(!p0)) U (G((!p0&&X(!p0)))||(X(!p0)&&p1))) U X(X(p2))))))'
Stuttering acceptance computed with spot in 643 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (AND p0 (NOT p2) p1), (NOT p2), true, (AND p0 (NOT p2)), (AND p0 p1 (NOT p2)), (AND (NOT p2) p0), (AND p0 (NOT p2) p1), (NOT p2), (NOT p2), p0, (AND p0 p1)]
Running random walk in product with property : ErlangenMainframeV1-PT-bP05C05-LTLFireability-10
Product exploration explored 100000 steps with 20027 reset in 283 ms.
Product exploration explored 100000 steps with 20043 reset in 210 ms.
Computed a total of 16 stabilizing places and 16 stable transitions
Computed a total of 16 stabilizing places and 16 stable transitions
Knowledge based reduction with 11 factoid took 145 ms. Reduced automaton from 15 states, 28 edges and 3 AP (stutter sensitive) to 15 states, 28 edges and 3 AP (stutter sensitive).
Reduction of identical properties reduced properties to check from 10 to 9
RANDOM walk for 40000 steps (8 resets) in 641 ms. (62 steps per ms) remains 7/9 properties
BEST_FIRST walk for 40002 steps (8 resets) in 554 ms. (72 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (8 resets) in 772 ms. (51 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (8 resets) in 829 ms. (48 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (8 resets) in 266 ms. (149 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (8 resets) in 186 ms. (213 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (8 resets) in 159 ms. (250 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (8 resets) in 213 ms. (186 steps per ms) remains 7/7 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15488510345000421445.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4624240783059701765.kers'
[2026-05-31 22:38:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15488510345000421445.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4624240783059701765.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 376 rows 131 cols 2377 entries
Finished phase 1 with 120 SingleSign rule and 0 generalized
[2026-05-31 22:38:19] [INFO ] Computed 11 invariants in 1 ms
Computed 11 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-4624240783059701765.kers
Total runtime 3 ms.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 81/92 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 39/131 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/131 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/131 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 376/507 variables, 131/144 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/507 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 0/507 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 507/507 variables, and 144 constraints, problems are : Problem set: 0 solved, 7 unsolved in 1268 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 131/131 constraints, PredecessorRefiner: 7/0 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 81/92 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 39/131 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/131 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/131 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/131 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 376/507 variables, 131/146 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/507 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 0/507 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 507/507 variables, and 146 constraints, problems are : Problem set: 0 solved, 7 unsolved in 1218 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 131/131 constraints, PredecessorRefiner: 7/0 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2514ms problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 2 different solutions.
Finished Parikh walk after 59 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=29 )
Parikh walk visited 7 properties in 123 ms.
Knowledge based reduction with 11 factoid took 267 ms. Reduced automaton from 15 states, 28 edges and 3 AP (stutter sensitive) to 15 states, 28 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 667 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (AND p0 (NOT p2) p1), (NOT p2), true, (AND p0 (NOT p2)), (AND p0 p1 (NOT p2)), (AND (NOT p2) p0), (AND p0 (NOT p2) p1), (NOT p2), (NOT p2), p0, (AND p0 p1)]
Knowledge-based reduction took 4899 ms.
Stuttering acceptance computed with spot in 707 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (AND p0 (NOT p2) p1), (NOT p2), true, (AND p0 (NOT p2)), (AND p0 p1 (NOT p2)), (AND (NOT p2) p0), (AND p0 (NOT p2) p1), (NOT p2), (NOT p2), p0, (AND p0 p1)]
Support contains 11 out of 131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 376/376 transitions.
Applied a total of 0 rules in 2 ms. Remains 131 /131 variables (removed 0) and now considering 376/376 (removed 0) transitions.
[2026-05-31 22:38:23] [INFO ] Invariant cache hit.
[2026-05-31 22:38:23] [INFO ] Implicit Places using invariants in 118 ms returned []
[2026-05-31 22:38:23] [INFO ] Invariant cache hit.
[2026-05-31 22:38:24] [INFO ] Implicit Places using invariants and state equation in 279 ms returned []
Implicit Place search using SMT with State Equation took 399 ms to find 0 implicit places.
Running 375 sub problems to find dead transitions.
[2026-05-31 22:38:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 1 (OVERLAPS) 1/131 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/131 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 4 (OVERLAPS) 376/507 variables, 131/143 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/507 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 375 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 507/507 variables, and 143 constraints, problems are : Problem set: 0 solved, 375 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 131/131 constraints, PredecessorRefiner: 375/375 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 375 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 1 (OVERLAPS) 1/131 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/131 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 4 (OVERLAPS) 376/507 variables, 131/143 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/507 variables, 375/518 constraints. Problems are: Problem set: 0 solved, 375 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 507/507 variables, and 529 constraints, problems are : Problem set: 0 solved, 375 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 131/131 constraints, PredecessorRefiner: 375/375 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60712ms problems are : Problem set: 0 solved, 375 unsolved
Search for dead transitions found 0 dead transitions in 60714ms
Finished structural reductions in LTL mode , in 1 iterations and 61116 ms. Remains : 131/131 places, 376/376 transitions.
Computed a total of 16 stabilizing places and 16 stable transitions
Computed a total of 16 stabilizing places and 16 stable transitions
Knowledge based reduction with 11 factoid took 140 ms. Reduced automaton from 15 states, 28 edges and 3 AP (stutter sensitive) to 15 states, 28 edges and 3 AP (stutter sensitive).
Reduction of identical properties reduced properties to check from 10 to 9
RANDOM walk for 40000 steps (8 resets) in 494 ms. (80 steps per ms) remains 7/9 properties
BEST_FIRST walk for 40002 steps (8 resets) in 320 ms. (124 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (8 resets) in 371 ms. (107 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 429 ms. (93 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 382 ms. (104 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 285 ms. (139 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (8 resets) in 273 ms. (145 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (8 resets) in 330 ms. (120 steps per ms) remains 7/7 properties
[2026-05-31 22:39:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 81/92 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 39/131 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/131 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/131 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 376/507 variables, 131/144 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/507 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 0/507 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 507/507 variables, and 144 constraints, problems are : Problem set: 0 solved, 7 unsolved in 1446 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 131/131 constraints, PredecessorRefiner: 7/0 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 81/92 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 39/131 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/131 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/131 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/131 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 376/507 variables, 131/146 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/507 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 0/507 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 507/507 variables, and 146 constraints, problems are : Problem set: 0 solved, 7 unsolved in 1259 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 131/131 constraints, PredecessorRefiner: 7/0 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2728ms problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 2 different solutions.
Finished Parikh walk after 59 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=29 )
Parikh walk visited 7 properties in 118 ms.
Knowledge based reduction with 11 factoid took 327 ms. Reduced automaton from 15 states, 28 edges and 3 AP (stutter sensitive) to 15 states, 28 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 785 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (AND p0 (NOT p2) p1), (NOT p2), true, (AND p0 (NOT p2)), (AND p0 p1 (NOT p2)), (AND (NOT p2) p0), (AND p0 (NOT p2) p1), (NOT p2), (NOT p2), p0, (AND p0 p1)]
Knowledge-based reduction took 5133 ms.
Stuttering acceptance computed with spot in 770 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (AND p0 (NOT p2) p1), (NOT p2), true, (AND p0 (NOT p2)), (AND p0 p1 (NOT p2)), (AND (NOT p2) p0), (AND p0 (NOT p2) p1), (NOT p2), (NOT p2), p0, (AND p0 p1)]
Stuttering acceptance computed with spot in 763 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (AND p0 (NOT p2) p1), (NOT p2), true, (AND p0 (NOT p2)), (AND p0 p1 (NOT p2)), (AND (NOT p2) p0), (AND p0 (NOT p2) p1), (NOT p2), (NOT p2), p0, (AND p0 p1)]
Product exploration explored 100000 steps with 20045 reset in 194 ms.
Product exploration explored 100000 steps with 20021 reset in 206 ms.
Spot run failed in 161 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/ltsmin9573035863399764077
[2026-05-31 22:39:32] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9573035863399764077
Running compilation step : cd /tmp/ltsmin9573035863399764077;'/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 1744 ms.
Running link step : cd /tmp/ltsmin9573035863399764077;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin9573035863399764077;'/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/stateBased3560989010429057224.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 11 out of 131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 376/376 transitions.
Applied a total of 0 rules in 2 ms. Remains 131 /131 variables (removed 0) and now considering 376/376 (removed 0) transitions.
[2026-05-31 22:39:47] [INFO ] Invariant cache hit.
[2026-05-31 22:39:47] [INFO ] Implicit Places using invariants in 85 ms returned []
[2026-05-31 22:39:47] [INFO ] Invariant cache hit.
[2026-05-31 22:39:47] [INFO ] Implicit Places using invariants and state equation in 196 ms returned []
Implicit Place search using SMT with State Equation took 283 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 285 ms. Remains : 131/131 places, 376/376 transitions.
Built C files in :
/tmp/ltsmin16754086656579460934
[2026-05-31 22:39:47] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16754086656579460934
Running compilation step : cd /tmp/ltsmin16754086656579460934;'/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 1288 ms.
Running link step : cd /tmp/ltsmin16754086656579460934;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin16754086656579460934;'/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/stateBased1397056875224499347.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-31 22:40:02] [INFO ] Flatten gal took : 54 ms
[2026-05-31 22:40:02] [INFO ] Flatten gal took : 40 ms
[2026-05-31 22:40:02] [INFO ] Time to serialize gal into /tmp/LTL10835712229483407084.gal : 19 ms
[2026-05-31 22:40:02] [INFO ] Time to serialize properties into /tmp/LTL6086759785202117854.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10835712229483407084.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11960598630351279059.hoa' '-atoms' '/tmp/LTL6086759785202117854.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...319
Loading property file /tmp/LTL6086759785202117854.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11960598630351279059.hoa
Detected timeout of ITS tools.
[2026-05-31 22:40:17] [INFO ] Flatten gal took : 26 ms
[2026-05-31 22:40:17] [INFO ] Flatten gal took : 43 ms
[2026-05-31 22:40:18] [INFO ] Time to serialize gal into /tmp/LTL764099892167052306.gal : 16 ms
[2026-05-31 22:40:18] [INFO ] Time to serialize properties into /tmp/LTL4944109876029245422.ltl : 9 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/LTL764099892167052306.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4944109876029245422.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...274
Read 1 LTL properties
Checking formula 0 : !((X(G((((!("((((p16==1)&&(p31==1))&&((p50==1)&&(p80==1)))&&(((p88==1)&&(p139==1))&&(p235==1)))"))&&(X(!("((((p16==1)&&(p31==1))&&((p5...706
Formula 0 simplified : XF((("((((p16==1)&&(p31==1))&&((p50==1)&&(p80==1)))&&(((p88==1)&&(p139==1))&&(p235==1)))" | X"((((p16==1)&&(p31==1))&&((p50==1)&&(p8...490
Detected timeout of ITS tools.
[2026-05-31 22:40:33] [INFO ] Flatten gal took : 21 ms
[2026-05-31 22:40:33] [INFO ] Applying decomposition
[2026-05-31 22:40:33] [INFO ] Flatten gal took : 21 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph7578253449650288665.txt' '-o' '/tmp/graph7578253449650288665.bin' '-w' '/tmp/graph7578253449650288665.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph7578253449650288665.bin' '-l' '-1' '-v' '-w' '/tmp/graph7578253449650288665.weights' '-q' '0' '-e' '0.001'
[2026-05-31 22:40:33] [INFO ] Decomposing Gal with order
[2026-05-31 22:40:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-31 22:40:33] [INFO ] Removed a total of 106 redundant transitions.
[2026-05-31 22:40:33] [INFO ] Flatten gal took : 119 ms
[2026-05-31 22:40:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 12 ms.
[2026-05-31 22:40:33] [INFO ] Time to serialize gal into /tmp/LTL4924601842306864753.gal : 9 ms
[2026-05-31 22:40:33] [INFO ] Time to serialize properties into /tmp/LTL14890701543018741319.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/LTL4924601842306864753.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14890701543018741319.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...255
Read 1 LTL properties
Checking formula 0 : !((X(G((((!("((((u18.p16==1)&&(u18.p31==1))&&((u18.p50==1)&&(u18.p80==1)))&&(((u18.p88==1)&&(u18.p139==1))&&(u18.p235==1)))"))&&(X(!("...912
Formula 0 simplified : XF((("((((u18.p16==1)&&(u18.p31==1))&&((u18.p50==1)&&(u18.p80==1)))&&(((u18.p88==1)&&(u18.p139==1))&&(u18.p235==1)))" | X"((((u18.p1...640
Detected timeout of ITS tools.
Treatment of property ErlangenMainframeV1-PT-bP05C05-LTLFireability-10 finished in 151640 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(p1))))'
Support contains 10 out of 162 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 162/162 places, 920/920 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 149 transition count 675
Ensure Unique test removed 3 places
Iterating global reduction 0 with 16 rules applied. Total rules applied 29 place count 146 transition count 675
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 34 place count 141 transition count 284
Ensure Unique test removed 1 places
Iterating global reduction 0 with 6 rules applied. Total rules applied 40 place count 140 transition count 284
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 42 place count 138 transition count 250
Iterating global reduction 0 with 2 rules applied. Total rules applied 44 place count 138 transition count 250
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 137 transition count 248
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 137 transition count 248
Applied a total of 46 rules in 11 ms. Remains 137 /162 variables (removed 25) and now considering 248/920 (removed 672) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3294289745294643401.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8010756889150541412.kers'
[2026-05-31 22:40:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3294289745294643401.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8010756889150541412.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 248 rows 137 cols 1198 entries
Finished phase 1 with 124 SingleSign rule and 1 generalized
[2026-05-31 22:40:48] [INFO ] Computed 12 invariants in 1 ms
Computed 12 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8010756889150541412.kers
Total runtime 2 ms.
[2026-05-31 22:40:48] [INFO ] Implicit Places using invariants in 94 ms returned [37]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 95 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 136/162 places, 248/920 transitions.
Applied a total of 0 rules in 1 ms. Remains 136 /136 variables (removed 0) and now considering 248/248 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 108 ms. Remains : 136/162 places, 248/920 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(p1))))'
Stuttering acceptance computed with spot in 116 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ErlangenMainframeV1-PT-bP05C05-LTLFireability-11
Product exploration explored 100000 steps with 0 reset in 431 ms.
Stack based approach found an accepted trace after 47 steps with 0 reset with depth 48 and stack size 48 in 0 ms.
FORMULA ErlangenMainframeV1-PT-bP05C05-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property ErlangenMainframeV1-PT-bP05C05-LTLFireability-11 finished in 687 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(p0))&&F(p1))))'
Support contains 9 out of 162 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 162/162 places, 920/920 transitions.
Graph (trivial) has 136 edges and 162 vertex of which 11 / 162 are part of one of the 5 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 28 place count 155 transition count 885
Reduce places removed 27 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 45 rules applied. Total rules applied 73 place count 128 transition count 867
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 82 place count 119 transition count 867
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 82 place count 119 transition count 859
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 98 place count 111 transition count 859
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 106 place count 103 transition count 637
Iterating global reduction 3 with 8 rules applied. Total rules applied 114 place count 103 transition count 637
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 114 place count 103 transition count 636
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 116 place count 102 transition count 636
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 121 place count 97 transition count 214
Iterating global reduction 3 with 5 rules applied. Total rules applied 126 place count 97 transition count 214
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 127 place count 96 transition count 212
Iterating global reduction 3 with 1 rules applied. Total rules applied 128 place count 96 transition count 212
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 3 with 62 rules applied. Total rules applied 190 place count 65 transition count 181
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 192 place count 63 transition count 171
Iterating global reduction 3 with 2 rules applied. Total rules applied 194 place count 63 transition count 171
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -31
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 206 place count 57 transition count 202
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 216 place count 57 transition count 192
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 217 place count 56 transition count 190
Iterating global reduction 4 with 1 rules applied. Total rules applied 218 place count 56 transition count 190
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 219 place count 56 transition count 189
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 5 with 5 rules applied. Total rules applied 224 place count 56 transition count 184
Applied a total of 224 rules in 92 ms. Remains 56 /162 variables (removed 106) and now considering 184/920 (removed 736) transitions.
[2026-05-31 22:40:49] [INFO ] Flow matrix only has 171 transitions (discarded 13 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16810434526742308538.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5863296980899259145.kers'
[2026-05-31 22:40:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16810434526742308538.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5863296980899259145.kers]
Normalized transition count is 170 out of 171 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 170 rows 56 cols 1614 entries
Finished phase 1 with 38 SingleSign rule and 2 generalized
[2026-05-31 22:40:49] [INFO ] Computed 16 invariants in 3 ms
Computed 16 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-5863296980899259145.kers
Total runtime 4 ms.
[2026-05-31 22:40:49] [INFO ] Implicit Places using invariants in 121 ms returned []
[2026-05-31 22:40:49] [INFO ] Flow matrix only has 171 transitions (discarded 13 similar events)
[2026-05-31 22:40:49] [INFO ] Invariant cache hit.
[2026-05-31 22:40:49] [INFO ] State equation strengthened by 18 read => feed constraints.
[2026-05-31 22:40:49] [INFO ] Implicit Places using invariants and state equation in 245 ms returned []
Implicit Place search using SMT with State Equation took 368 ms to find 0 implicit places.
[2026-05-31 22:40:49] [INFO ] Redundant transitions in 12 ms returned []
Running 180 sub problems to find dead transitions.
[2026-05-31 22:40:49] [INFO ] Flow matrix only has 171 transitions (discarded 13 similar events)
[2026-05-31 22:40:49] [INFO ] Invariant cache hit.
[2026-05-31 22:40:49] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/55 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 2 (OVERLAPS) 1/56 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 4 (OVERLAPS) 170/226 variables, 56/72 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/226 variables, 17/89 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/226 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 7 (OVERLAPS) 1/227 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/227 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 9 (OVERLAPS) 0/227 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 180 unsolved
No progress, stopping.
After SMT solving in domain Real declared 227/227 variables, and 90 constraints, problems are : Problem set: 0 solved, 180 unsolved in 12387 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 56/56 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 180/180 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 180 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/55 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 2 (OVERLAPS) 1/56 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 4 (OVERLAPS) 170/226 variables, 56/72 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/226 variables, 17/89 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/226 variables, 180/269 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/226 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 8 (OVERLAPS) 1/227 variables, 1/270 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/227 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 10 (OVERLAPS) 0/227 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 180 unsolved
No progress, stopping.
After SMT solving in domain Int declared 227/227 variables, and 270 constraints, problems are : Problem set: 0 solved, 180 unsolved in 25540 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 56/56 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 180/180 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 38141ms problems are : Problem set: 0 solved, 180 unsolved
Search for dead transitions found 0 dead transitions in 38142ms
Starting structural reductions in SI_LTL mode, iteration 1 : 56/162 places, 184/920 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 38628 ms. Remains : 56/162 places, 184/920 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(p0))&&F(p1))))'
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ErlangenMainframeV1-PT-bP05C05-LTLFireability-12
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA ErlangenMainframeV1-PT-bP05C05-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV1-PT-bP05C05-LTLFireability-12 finished in 38780 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 162 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 162/162 places, 920/920 transitions.
Graph (trivial) has 139 edges and 162 vertex of which 11 / 162 are part of one of the 5 SCC in 2 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 28 place count 155 transition count 885
Reduce places removed 27 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 48 rules applied. Total rules applied 76 place count 128 transition count 864
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 88 place count 116 transition count 864
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 88 place count 116 transition count 855
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 106 place count 107 transition count 855
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 119 place count 94 transition count 594
Ensure Unique test removed 4 places
Iterating global reduction 3 with 17 rules applied. Total rules applied 136 place count 90 transition count 594
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 146 place count 80 transition count 111
Ensure Unique test removed 1 places
Iterating global reduction 3 with 11 rules applied. Total rules applied 157 place count 79 transition count 111
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 162 place count 74 transition count 101
Iterating global reduction 3 with 5 rules applied. Total rules applied 167 place count 74 transition count 101
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 168 place count 73 transition count 99
Iterating global reduction 3 with 1 rules applied. Total rules applied 169 place count 73 transition count 99
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 219 place count 48 transition count 74
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 221 place count 46 transition count 68
Iterating global reduction 3 with 2 rules applied. Total rules applied 223 place count 46 transition count 68
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 247 place count 34 transition count 75
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 254 place count 34 transition count 68
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 257 place count 31 transition count 62
Iterating global reduction 4 with 3 rules applied. Total rules applied 260 place count 31 transition count 62
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 265 place count 31 transition count 57
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 269 place count 29 transition count 74
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 5 with 21 rules applied. Total rules applied 290 place count 29 transition count 53
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 291 place count 28 transition count 52
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 292 place count 27 transition count 52
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 6 with 5 rules applied. Total rules applied 297 place count 27 transition count 47
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 6 with 2 rules applied. Total rules applied 299 place count 27 transition count 45
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 301 place count 25 transition count 45
Applied a total of 301 rules in 54 ms. Remains 25 /162 variables (removed 137) and now considering 45/920 (removed 875) transitions.
[2026-05-31 22:41:28] [INFO ] Flow matrix only has 37 transitions (discarded 8 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9954485047492605565.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5518955986601292863.kers'
[2026-05-31 22:41:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9954485047492605565.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5518955986601292863.kers]
Normalized transition count is 36 out of 37 initially.
Culling duplicate invariants (modulo rational): removing 7 columns.
Culled 7 columns in 0 ms.
// Phase 1: matrix 36 rows 18 cols 89 entries
Finished phase 1 with 15 SingleSign rule and 0 generalized
[2026-05-31 22:41:28] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5518955986601292863.kers
Total runtime 1 ms.
[2026-05-31 22:41:28] [INFO ] Implicit Places using invariants in 46 ms returned []
[2026-05-31 22:41:28] [INFO ] Flow matrix only has 37 transitions (discarded 8 similar events)
[2026-05-31 22:41:28] [INFO ] Invariant cache hit.
[2026-05-31 22:41:28] [INFO ] State equation strengthened by 3 read => feed constraints.
[2026-05-31 22:41:28] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
[2026-05-31 22:41:28] [INFO ] Redundant transitions in 1 ms returned []
Running 23 sub problems to find dead transitions.
[2026-05-31 22:41:28] [INFO ] Flow matrix only has 37 transitions (discarded 8 similar events)
[2026-05-31 22:41:28] [INFO ] Invariant cache hit.
[2026-05-31 22:41:28] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (OVERLAPS) 3/25 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (OVERLAPS) 36/61 variables, 25/35 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 3/38 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/61 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 7 (OVERLAPS) 0/61 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Real declared 61/62 variables, and 38 constraints, problems are : Problem set: 0 solved, 23 unsolved in 576 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 25/25 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 23 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (OVERLAPS) 3/25 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (OVERLAPS) 36/61 variables, 25/35 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 3/38 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/61 variables, 23/61 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/61 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 8 (OVERLAPS) 0/61 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Int declared 61/62 variables, and 61 constraints, problems are : Problem set: 0 solved, 23 unsolved in 461 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 25/25 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1044ms problems are : Problem set: 0 solved, 23 unsolved
Search for dead transitions found 0 dead transitions in 1045ms
Starting structural reductions in SI_LTL mode, iteration 1 : 25/162 places, 45/920 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1244 ms. Remains : 25/162 places, 45/920 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 104 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ErlangenMainframeV1-PT-bP05C05-LTLFireability-14
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 0 ms.
FORMULA ErlangenMainframeV1-PT-bP05C05-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV1-PT-bP05C05-LTLFireability-14 finished in 1383 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((F(p0) U p1)&&G(p0))))'
Support contains 13 out of 162 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 162/162 places, 920/920 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 151 transition count 702
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 151 transition count 702
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 28 place count 145 transition count 413
Iterating global reduction 0 with 6 rules applied. Total rules applied 34 place count 145 transition count 413
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 37 place count 142 transition count 410
Iterating global reduction 0 with 3 rules applied. Total rules applied 40 place count 142 transition count 410
Applied a total of 40 rules in 20 ms. Remains 142 /162 variables (removed 20) and now considering 410/920 (removed 510) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15192544603476249210.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9281892326723615213.kers'
[2026-05-31 22:41:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15192544603476249210.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9281892326723615213.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 410 rows 142 cols 3840 entries
Finished phase 1 with 124 SingleSign rule and 2 generalized
[2026-05-31 22:41:29] [INFO ] Computed 16 invariants in 5 ms
Computed 16 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-9281892326723615213.kers
Total runtime 7 ms.
[2026-05-31 22:41:29] [INFO ] Implicit Places using invariants in 175 ms returned []
[2026-05-31 22:41:29] [INFO ] Invariant cache hit.
[2026-05-31 22:41:29] [INFO ] Implicit Places using invariants and state equation in 408 ms returned []
Implicit Place search using SMT with State Equation took 600 ms to find 0 implicit places.
Running 409 sub problems to find dead transitions.
[2026-05-31 22:41:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/141 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 2 (OVERLAPS) 1/142 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 5 (OVERLAPS) 410/552 variables, 142/159 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/552 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 409 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 552/552 variables, and 159 constraints, problems are : Problem set: 0 solved, 409 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 142/142 constraints, PredecessorRefiner: 409/161 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 409 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/141 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 2 (OVERLAPS) 1/142 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 5 (OVERLAPS) 410/552 variables, 142/159 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/552 variables, 161/320 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/552 variables, 5/325 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/552 variables, 3/328 constraints. Problems are: Problem set: 0 solved, 409 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 552/552 variables, and 328 constraints, problems are : Problem set: 0 solved, 409 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 142/142 constraints, PredecessorRefiner: 409/161 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60471ms problems are : Problem set: 0 solved, 409 unsolved
Search for dead transitions found 0 dead transitions in 60474ms
Starting structural reductions in LTL mode, iteration 1 : 142/162 places, 410/920 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61096 ms. Remains : 142/162 places, 410/920 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((F(p0) U p1)&&G(p0))))'
Stuttering acceptance computed with spot in 126 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ErlangenMainframeV1-PT-bP05C05-LTLFireability-15
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ErlangenMainframeV1-PT-bP05C05-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV1-PT-bP05C05-LTLFireability-15 finished in 61258 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(G((((!p0&&X(!p0)) U (G((!p0&&X(!p0)))||(X(!p0)&&p1))) U X(X(p2))))))'
Spot run failed in 85 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
[2026-05-31 22:42:30] [INFO ] Flatten gal took : 82 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin13242544570914281249
[2026-05-31 22:42:30] [INFO ] Computing symmetric may disable matrix : 920 transitions.
[2026-05-31 22:42:30] [INFO ] Applying decomposition
[2026-05-31 22:42:30] [INFO ] Computation of Complete disable matrix. took 122 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-31 22:42:30] [INFO ] Flatten gal took : 96 ms
[2026-05-31 22:42:31] [INFO ] Computing symmetric may enable matrix : 920 transitions.
[2026-05-31 22:42:31] [INFO ] Computation of Complete enable matrix. took 37 ms. Total solver calls (SAT/UNSAT): 0(0/0)
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/graph441845921908268785.txt' '-o' '/tmp/graph441845921908268785.bin' '-w' '/tmp/graph441845921908268785.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph441845921908268785.bin' '-l' '-1' '-v' '-w' '/tmp/graph441845921908268785.weights' '-q' '0' '-e' '0.001'
[2026-05-31 22:42:31] [INFO ] Decomposing Gal with order
[2026-05-31 22:42:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-31 22:42:31] [INFO ] Computing Do-Not-Accords matrix : 920 transitions.
[2026-05-31 22:42:31] [INFO ] Computation of Completed DNA matrix. took 74 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-31 22:42:31] [INFO ] Built C files in 651ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13242544570914281249
Running compilation step : cd /tmp/ltsmin13242544570914281249;'/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'
[2026-05-31 22:42:31] [INFO ] Removed a total of 900 redundant transitions.
[2026-05-31 22:42:31] [INFO ] Flatten gal took : 349 ms
[2026-05-31 22:42:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 644 labels/synchronizations in 57 ms.
[2026-05-31 22:42:31] [INFO ] Time to serialize gal into /tmp/LTLFireability9715985579211689626.gal : 15 ms
[2026-05-31 22:42:31] [INFO ] Time to serialize properties into /tmp/LTLFireability14525352415350059493.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/LTLFireability9715985579211689626.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability14525352415350059493.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(G((((!("((((u13.p16==1)&&(u14.p31==1))&&((u14.p50==1)&&(u14.p80==1)))&&(((u14.p88==1)&&(u14.p139==1))&&(u14.p235==1)))"))&&(X(!("...912
Formula 0 simplified : XF((("((((u13.p16==1)&&(u14.p31==1))&&((u14.p50==1)&&(u14.p80==1)))&&(((u14.p88==1)&&(u14.p139==1))&&(u14.p235==1)))" | X"((((u13.p1...640
Compilation finished in 6695 ms.
Running link step : cd /tmp/ltsmin13242544570914281249;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 71 ms.
Running LTSmin : cd /tmp/ltsmin13242544570914281249;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' 'X([]((((!(LTLAPp0==true)&&X(!(LTLAPp0==true))) U ([]((!(LTLAPp0==true)&&X(!(LTLAPp0==true))))||(X(!(LTLAPp0==true))&&(LTLAPp1==true)))) U X(X((LTLAPp2==true))))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t2, t13, t20, t74, t657, t659, t668, t669, t705, t706, t713, t714, t718, t723, t725, t726, t7...700
Detected timeout of ITS tools.
[2026-05-31 23:05:43] [INFO ] Applying decomposition
[2026-05-31 23:05:43] [INFO ] Flatten gal took : 59 ms
[2026-05-31 23:05:43] [INFO ] Decomposing Gal with order
[2026-05-31 23:05:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-31 23:05:43] [INFO ] Removed a total of 4925 redundant transitions.
[2026-05-31 23:05:43] [INFO ] Flatten gal took : 162 ms
[2026-05-31 23:05:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 188 labels/synchronizations in 54 ms.
[2026-05-31 23:05:43] [INFO ] Time to serialize gal into /tmp/LTLFireability478548134432008461.gal : 6 ms
[2026-05-31 23:05:43] [INFO ] Time to serialize properties into /tmp/LTLFireability16936383222265896894.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/LTLFireability478548134432008461.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability16936383222265896894.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...276
Read 1 LTL properties
Checking formula 0 : !((X(G((((!("((((i0.i0.i0.i0.i0.u6.p16==1)&&(i0.i0.i0.i0.i0.u7.p31==1))&&((i0.i0.i0.i0.u8.p50==1)&&(i0.i0.i0.u9.p80==1)))&&(((i0.i0.u1...1346
Formula 0 simplified : XF((("((((i0.i0.i0.i0.i0.u6.p16==1)&&(i0.i0.i0.i0.i0.u7.p31==1))&&((i0.i0.i0.i0.u8.p50==1)&&(i0.i0.i0.u9.p80==1)))&&(((i0.i0.u10.p88...950
Reverse transition relation is NOT exact ! Due to transitions i0.t736, i0.i0.u10.t96, i0.i0.u10.t623, i0.i0.u10.t624, i0.i0.i0.t97, i0.i0.i0.u9.t101, i0.i0...720
31 unique states visited
31 strongly connected components in search stack
32 transitions explored
31 items max in DFS search stack
62 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,0.653504,38304,1,0,30171,12342,2684,88681,1407,63545,48103
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ErlangenMainframeV1-PT-bP05C05-LTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 1966700 ms.

BK_STOP 1780268744557

--------------------
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="ErlangenMainframeV1-PT-bP05C05"
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 ErlangenMainframeV1-PT-bP05C05, 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 r338-smll-178021499100084"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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