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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 508K
-rw-r--r-- 1 mcc users 6.5K May 27 09:32 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K May 27 09:32 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 27 09:32 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K May 27 09:32 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 27 10:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 27 10:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 27 10:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 27 10:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 26 18:17 NewModel
-rw-r--r-- 1 mcc users 9.8K May 27 09:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 100K May 27 09:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K May 27 09:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K May 27 09:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 27 10:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 27 10:41 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 105K 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 ErlangenMainframeV2-PT-bP03C03-LTLFireability-00
FORMULA_NAME ErlangenMainframeV2-PT-bP03C03-LTLFireability-01
FORMULA_NAME ErlangenMainframeV2-PT-bP03C03-LTLFireability-02
FORMULA_NAME ErlangenMainframeV2-PT-bP03C03-LTLFireability-03
FORMULA_NAME ErlangenMainframeV2-PT-bP03C03-LTLFireability-04
FORMULA_NAME ErlangenMainframeV2-PT-bP03C03-LTLFireability-05
FORMULA_NAME ErlangenMainframeV2-PT-bP03C03-LTLFireability-06
FORMULA_NAME ErlangenMainframeV2-PT-bP03C03-LTLFireability-07
FORMULA_NAME ErlangenMainframeV2-PT-bP03C03-LTLFireability-08
FORMULA_NAME ErlangenMainframeV2-PT-bP03C03-LTLFireability-09
FORMULA_NAME ErlangenMainframeV2-PT-bP03C03-LTLFireability-10
FORMULA_NAME ErlangenMainframeV2-PT-bP03C03-LTLFireability-11
FORMULA_NAME ErlangenMainframeV2-PT-bP03C03-LTLFireability-12
FORMULA_NAME ErlangenMainframeV2-PT-bP03C03-LTLFireability-13
FORMULA_NAME ErlangenMainframeV2-PT-bP03C03-LTLFireability-14
FORMULA_NAME ErlangenMainframeV2-PT-bP03C03-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1780372278279

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ErlangenMainframeV2-PT-bP03C03
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-06-02 03:51:20] [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-06-02 03:51:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-06-02 03:51:21] [INFO ] Load time of PNML (sax parser for PT used): 187 ms
[2026-06-02 03:51:21] [INFO ] Transformed 219 places.
[2026-06-02 03:51:21] [INFO ] Transformed 331 transitions.
[2026-06-02 03:51:21] [INFO ] Found NUPN structural information;
[2026-06-02 03:51:21] [INFO ] Parsed PT model containing 219 places and 331 transitions and 1585 arcs in 404 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 22 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA ErlangenMainframeV2-PT-bP03C03-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV2-PT-bP03C03-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 52 out of 219 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 331/331 transitions.
Discarding 46 places :
Symmetric choice reduction at 0 with 46 rule applications. Total rules 46 place count 173 transition count 285
Iterating global reduction 0 with 46 rules applied. Total rules applied 92 place count 173 transition count 285
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 108 place count 157 transition count 269
Iterating global reduction 0 with 16 rules applied. Total rules applied 124 place count 157 transition count 269
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 125 place count 156 transition count 268
Iterating global reduction 0 with 1 rules applied. Total rules applied 126 place count 156 transition count 268
Applied a total of 126 rules in 104 ms. Remains 156 /219 variables (removed 63) and now considering 268/331 (removed 63) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10296756688863098751.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5958396205412587044.kers'
[2026-06-02 03:51:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10296756688863098751.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5958396205412587044.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 268 rows 156 cols 1459 entries
Finished phase 1 with 139 SingleSign rule and 3 generalized
[2026-06-02 03:51:21] [INFO ] Computed 14 invariants in 3 ms
Computed 14 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-5958396205412587044.kers
Total runtime 5 ms.
[2026-06-02 03:51:22] [INFO ] Implicit Places using invariants in 457 ms returned []
[2026-06-02 03:51:22] [INFO ] Invariant cache hit.
[2026-06-02 03:51:22] [INFO ] Implicit Places using invariants and state equation in 328 ms returned []
Implicit Place search using SMT with State Equation took 858 ms to find 0 implicit places.
Running 267 sub problems to find dead transitions.
[2026-06-02 03:51:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 2 (OVERLAPS) 1/156 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 5/19 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 5 (OVERLAPS) 268/424 variables, 156/175 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/424 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 7 (OVERLAPS) 0/424 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 267 unsolved
No progress, stopping.
After SMT solving in domain Real declared 424/424 variables, and 175 constraints, problems are : Problem set: 0 solved, 267 unsolved in 23138 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 267/267 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 267 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 2 (OVERLAPS) 1/156 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 5/19 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 5 (OVERLAPS) 268/424 variables, 156/175 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/424 variables, 267/442 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/424 variables, 12/454 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/424 variables, 1/455 constraints. Problems are: Problem set: 0 solved, 267 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 424/424 variables, and 457 constraints, problems are : Problem set: 0 solved, 267 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 267/267 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 53597ms problems are : Problem set: 0 solved, 267 unsolved
Search for dead transitions found 0 dead transitions in 53620ms
Starting structural reductions in LTL mode, iteration 1 : 156/219 places, 268/331 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54639 ms. Remains : 156/219 places, 268/331 transitions.
Starting structural reductions in LTL mode, iteration 0 : 156/156 places, 268/268 transitions.
Applied a total of 0 rules in 8 ms. Remains 156 /156 variables (removed 0) and now considering 268/268 (removed 0) transitions.
[2026-06-02 03:52:16] [INFO ] Invariant cache hit.
[2026-06-02 03:52:16] [INFO ] Implicit Places using invariants in 80 ms returned []
[2026-06-02 03:52:16] [INFO ] Invariant cache hit.
[2026-06-02 03:52:16] [INFO ] Implicit Places using invariants and state equation in 248 ms returned []
Implicit Place search using SMT with State Equation took 330 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 339 ms. Remains : 156/156 places, 268/268 transitions.
Support contains 52 out of 156 places after structural reductions.
[2026-06-02 03:52:17] [INFO ] Flatten gal took : 131 ms
[2026-06-02 03:52:17] [INFO ] Flatten gal took : 68 ms
[2026-06-02 03:52:17] [INFO ] Input system was already deterministic with 268 transitions.
Reduction of identical properties reduced properties to check from 35 to 34
RANDOM walk for 40000 steps (8 resets) in 3238 ms. (12 steps per ms) remains 11/34 properties
BEST_FIRST walk for 40000 steps (8 resets) in 468 ms. (85 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40000 steps (8 resets) in 277 ms. (143 steps per ms) remains 10/11 properties
BEST_FIRST walk for 40000 steps (8 resets) in 354 ms. (112 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (8 resets) in 305 ms. (130 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (8 resets) in 356 ms. (112 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (8 resets) in 462 ms. (86 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (8 resets) in 280 ms. (142 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (8 resets) in 415 ms. (96 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 286 ms. (139 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (8 resets) in 384 ms. (103 steps per ms) remains 10/10 properties
[2026-06-02 03:52:19] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 55/79 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 53/132 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 24/156 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/156 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/156 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 268/424 variables, 156/172 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/424 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/424 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (OVERLAPS) 0/424 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 424/424 variables, and 173 constraints, problems are : Problem set: 0 solved, 10 unsolved in 1412 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem AtomicPropp8 is UNSAT
At refinement iteration 1 (OVERLAPS) 55/79 variables, 7/7 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 2/9 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 53/132 variables, 3/12 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 1/13 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 0/13 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 24/156 variables, 4/17 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/156 variables, 0/17 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 268/424 variables, 156/173 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/424 variables, 9/182 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/424 variables, 6/188 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/424 variables, 1/189 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/424 variables, 0/189 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 14 (OVERLAPS) 0/424 variables, 0/189 constraints. Problems are: Problem set: 1 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 424/424 variables, and 189 constraints, problems are : Problem set: 1 solved, 9 unsolved in 3371 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 9/10 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 4822ms problems are : Problem set: 1 solved, 9 unsolved
Parikh walk visited 3 properties in 7409 ms.
Support contains 18 out of 156 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 268/268 transitions.
Graph (trivial) has 128 edges and 156 vertex of which 10 / 156 are part of one of the 4 SCC in 7 ms
Free SCC test removed 6 places
Drop transitions (Empty/Sink Transition effects.) removed 11 transitions
Reduce isomorphic transitions removed 11 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 150 transition count 228
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 121 transition count 207
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 92 place count 109 transition count 207
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 109 transition count 197
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 99 transition count 197
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 124 place count 87 transition count 177
Iterating global reduction 3 with 12 rules applied. Total rules applied 136 place count 87 transition count 177
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 136 place count 87 transition count 173
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 144 place count 83 transition count 173
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 146 place count 81 transition count 163
Iterating global reduction 3 with 2 rules applied. Total rules applied 148 place count 81 transition count 163
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 186 place count 62 transition count 144
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 189 place count 59 transition count 137
Iterating global reduction 3 with 3 rules applied. Total rules applied 192 place count 59 transition count 137
Performed 7 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 206 place count 52 transition count 161
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 218 place count 52 transition count 149
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 220 place count 50 transition count 143
Iterating global reduction 4 with 2 rules applied. Total rules applied 222 place count 50 transition count 143
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 232 place count 50 transition count 133
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 234 place count 49 transition count 146
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 235 place count 49 transition count 145
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 243 place count 49 transition count 137
Free-agglomeration rule applied 5 times.
Iterating global reduction 6 with 5 rules applied. Total rules applied 248 place count 49 transition count 132
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 253 place count 44 transition count 132
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 256 place count 44 transition count 129
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 257 place count 44 transition count 135
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 260 place count 43 transition count 133
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 273 place count 43 transition count 120
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 274 place count 43 transition count 120
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 275 place count 43 transition count 119
Applied a total of 275 rules in 153 ms. Remains 43 /156 variables (removed 113) and now considering 119/268 (removed 149) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 153 ms. Remains : 43/156 places, 119/268 transitions.
RANDOM walk for 40000 steps (8 resets) in 703 ms. (56 steps per ms) remains 0/6 properties
FORMULA ErlangenMainframeV2-PT-bP03C03-LTLFireability-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA ErlangenMainframeV2-PT-bP03C03-LTLFireability-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
Computed a total of 18 stabilizing places and 18 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((X(X(X(!p0)))&&F(p1))||X(X(X(G(!p0)))))))'
Support contains 11 out of 156 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 156/156 places, 268/268 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 137 transition count 221
Ensure Unique test removed 2 places
Iterating global reduction 0 with 21 rules applied. Total rules applied 40 place count 135 transition count 221
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 46 place count 129 transition count 215
Iterating global reduction 0 with 6 rules applied. Total rules applied 52 place count 129 transition count 215
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 56 place count 125 transition count 203
Ensure Unique test removed 1 places
Iterating global reduction 0 with 5 rules applied. Total rules applied 61 place count 124 transition count 203
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 63 place count 122 transition count 201
Iterating global reduction 0 with 2 rules applied. Total rules applied 65 place count 122 transition count 201
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 67 place count 120 transition count 199
Iterating global reduction 0 with 2 rules applied. Total rules applied 69 place count 120 transition count 199
Applied a total of 69 rules in 30 ms. Remains 120 /156 variables (removed 36) and now considering 199/268 (removed 69) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8069698416441997351.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3256351130765260615.kers'
[2026-06-02 03:52:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8069698416441997351.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3256351130765260615.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 199 rows 120 cols 872 entries
Finished phase 1 with 108 SingleSign rule and 1 generalized
[2026-06-02 03:52:32] [INFO ] Computed 11 invariants in 2 ms
Computed 11 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-3256351130765260615.kers
Total runtime 3 ms.
[2026-06-02 03:52:33] [INFO ] Implicit Places using invariants in 114 ms returned [28]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 117 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 119/156 places, 199/268 transitions.
Applied a total of 0 rules in 4 ms. Remains 119 /119 variables (removed 0) and now considering 199/199 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 152 ms. Remains : 119/156 places, 199/268 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(X(G(p0))))||(X(X(X(p0)))&&F(p1)))))'
Stuttering acceptance computed with spot in 757 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), true, (NOT p1)]
Running random walk in product with property : ErlangenMainframeV2-PT-bP03C03-LTLFireability-00
Product exploration explored 100000 steps with 20000 reset in 457 ms.
Product exploration explored 100000 steps with 20000 reset in 183 ms.
Computed a total of 15 stabilizing places and 15 stable transitions
Computed a total of 15 stabilizing places and 15 stable transitions
Knowledge based reduction with 3 factoid took 63 ms. Reduced automaton from 10 states, 12 edges and 2 AP (stutter sensitive) to 6 states, 6 edges and 1 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 203 ms. (196 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (8 resets) in 219 ms. (181 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1683526 steps, run timeout after 3001 ms. (steps per millisecond=560 ) properties seen :0 out of 1
Probabilistic random walk after 1683526 steps, saw 295307 distinct states, run finished after 3006 ms. (steps per millisecond=560 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4995566652199215563.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2330126382155367317.kers'
[2026-06-02 03:52:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4995566652199215563.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2330126382155367317.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 199 rows 119 cols 817 entries
Finished phase 1 with 109 SingleSign rule and 0 generalized
[2026-06-02 03:52:37] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2330126382155367317.kers
Total runtime 1 ms.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 50/60 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 59/119 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 199/318 variables, 119/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/318 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/318 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 318/318 variables, and 129 constraints, problems are : Problem set: 0 solved, 1 unsolved in 189 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 119/119 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 50/60 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 59/119 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 199/318 variables, 119/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/318 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/318 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/318 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/318 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 318/318 variables, and 131 constraints, problems are : Problem set: 0 solved, 1 unsolved in 424 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 119/119 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 625ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 199 steps, including 3 resets, run visited all 1 properties in 2 ms. (steps per millisecond=99 )
Parikh walk visited 1 properties in 8 ms.
Knowledge based reduction with 3 factoid took 72 ms. Reduced automaton from 6 states, 6 edges and 1 AP (stutter sensitive) to 6 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 244 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
Knowledge-based reduction took 4173 ms.
Stuttering acceptance computed with spot in 265 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
Support contains 10 out of 119 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 119/119 places, 199/199 transitions.
Applied a total of 0 rules in 3 ms. Remains 119 /119 variables (removed 0) and now considering 199/199 (removed 0) transitions.
[2026-06-02 03:52:38] [INFO ] Invariant cache hit.
[2026-06-02 03:52:39] [INFO ] Implicit Places using invariants in 98 ms returned []
[2026-06-02 03:52:39] [INFO ] Invariant cache hit.
[2026-06-02 03:52:39] [INFO ] Implicit Places using invariants and state equation in 187 ms returned []
Implicit Place search using SMT with State Equation took 289 ms to find 0 implicit places.
Running 198 sub problems to find dead transitions.
[2026-06-02 03:52:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (OVERLAPS) 1/119 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (OVERLAPS) 199/318 variables, 119/129 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/318 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (OVERLAPS) 0/318 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Real declared 318/318 variables, and 129 constraints, problems are : Problem set: 0 solved, 198 unsolved in 13238 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 119/119 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 198 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (OVERLAPS) 1/119 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (OVERLAPS) 199/318 variables, 119/129 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/318 variables, 198/327 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/318 variables, 1/328 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/318 variables, 2/330 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/318 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 198 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 318/318 variables, and 330 constraints, problems are : Problem set: 0 solved, 198 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 119/119 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 43345ms problems are : Problem set: 0 solved, 198 unsolved
Search for dead transitions found 0 dead transitions in 43346ms
Finished structural reductions in LTL mode , in 1 iterations and 43641 ms. Remains : 119/119 places, 199/199 transitions.
Computed a total of 15 stabilizing places and 15 stable transitions
Computed a total of 15 stabilizing places and 15 stable transitions
Knowledge based reduction with 1 factoid took 76 ms. Reduced automaton from 6 states, 6 edges and 1 AP (stutter sensitive) to 6 states, 6 edges and 1 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 341 ms. (116 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (8 resets) in 192 ms. (207 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1588518 steps, run timeout after 3001 ms. (steps per millisecond=529 ) properties seen :0 out of 1
Probabilistic random walk after 1588518 steps, saw 277136 distinct states, run finished after 3006 ms. (steps per millisecond=528 ) properties seen :0
[2026-06-02 03:53:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 50/60 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 59/119 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 199/318 variables, 119/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/318 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/318 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 318/318 variables, and 129 constraints, problems are : Problem set: 0 solved, 1 unsolved in 184 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 119/119 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 50/60 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 59/119 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 199/318 variables, 119/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/318 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/318 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/318 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/318 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 318/318 variables, and 131 constraints, problems are : Problem set: 0 solved, 1 unsolved in 353 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 119/119 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 545ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 492 steps, including 9 resets, run visited all 1 properties in 3 ms. (steps per millisecond=164 )
Parikh walk visited 1 properties in 3 ms.
Knowledge based reduction with 1 factoid took 73 ms. Reduced automaton from 6 states, 6 edges and 1 AP (stutter sensitive) to 6 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 236 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
Knowledge-based reduction took 4101 ms.
Stuttering acceptance computed with spot in 256 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
Stuttering acceptance computed with spot in 270 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
Product exploration explored 100000 steps with 20000 reset in 140 ms.
Product exploration explored 100000 steps with 20000 reset in 153 ms.
Spot run failed in 159 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/ltsmin13717272341310487495
[2026-06-02 03:53:27] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13717272341310487495
Running compilation step : cd /tmp/ltsmin13717272341310487495;'/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 1090 ms.
Running link step : cd /tmp/ltsmin13717272341310487495;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 78 ms.
Running LTSmin : cd /tmp/ltsmin13717272341310487495;'/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/stateBased7900635489483834790.hoa' '--buchi-type=spotba'
LTSmin run took 87 ms.
FORMULA ErlangenMainframeV2-PT-bP03C03-LTLFireability-00 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ErlangenMainframeV2-PT-bP03C03-LTLFireability-00 finished in 56266 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(((F(p0)&&X(p1)) U (!p0||X(p2)))) U (p1&&X(((F(p0)&&X(p1)) U (!p0||X(p2))))))))'
Support contains 3 out of 156 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 156/156 places, 268/268 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 140 transition count 224
Ensure Unique test removed 2 places
Iterating global reduction 0 with 18 rules applied. Total rules applied 34 place count 138 transition count 224
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 42 place count 130 transition count 172
Iterating global reduction 0 with 8 rules applied. Total rules applied 50 place count 130 transition count 172
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 55 place count 125 transition count 159
Iterating global reduction 0 with 5 rules applied. Total rules applied 60 place count 125 transition count 159
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 124 transition count 158
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 124 transition count 158
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 123 transition count 157
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 123 transition count 157
Applied a total of 64 rules in 21 ms. Remains 123 /156 variables (removed 33) and now considering 157/268 (removed 111) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11329200333434165214.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18252340678023231210.kers'
[2026-06-02 03:53:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11329200333434165214.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18252340678023231210.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 157 rows 123 cols 465 entries
Finished phase 1 with 109 SingleSign rule and 2 generalized
[2026-06-02 03:53:29] [INFO ] Computed 12 invariants in 1 ms
Computed 12 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-18252340678023231210.kers
Total runtime 2 ms.
[2026-06-02 03:53:29] [INFO ] Implicit Places using invariants in 119 ms returned [28]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 120 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 122/156 places, 157/268 transitions.
Applied a total of 0 rules in 2 ms. Remains 122 /122 variables (removed 0) and now considering 157/157 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 145 ms. Remains : 122/156 places, 157/268 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(((F(p0)&&X(p1)) U (!p0||X(p2)))) U (p1&&X(((F(p0)&&X(p1)) U (!p0||X(p2))))))))'
Stuttering acceptance computed with spot in 261 ms :[(OR (NOT p1) (AND p0 (NOT p2))), (OR (NOT p1) (AND p0 (NOT p2))), (AND p0 (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), true]
Running random walk in product with property : ErlangenMainframeV2-PT-bP03C03-LTLFireability-01
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA ErlangenMainframeV2-PT-bP03C03-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV2-PT-bP03C03-LTLFireability-01 finished in 468 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&&(F(p1)||G(p2))))))'
Support contains 2 out of 156 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 156/156 places, 268/268 transitions.
Graph (trivial) has 134 edges and 156 vertex of which 12 / 156 are part of one of the 5 SCC in 1 ms
Free SCC test removed 7 places
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 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 148 transition count 232
Reduce places removed 27 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 1 with 46 rules applied. Total rules applied 74 place count 121 transition count 213
Reduce places removed 11 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 12 rules applied. Total rules applied 86 place count 110 transition count 212
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 89 place count 109 transition count 210
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 90 place count 108 transition count 210
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 8 Pre rules applied. Total rules applied 90 place count 108 transition count 202
Deduced a syphon composed of 8 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 17 rules applied. Total rules applied 107 place count 99 transition count 202
Discarding 14 places :
Symmetric choice reduction at 5 with 14 rule applications. Total rules 121 place count 85 transition count 160
Ensure Unique test removed 2 places
Iterating global reduction 5 with 16 rules applied. Total rules applied 137 place count 83 transition count 160
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 137 place count 83 transition count 157
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 143 place count 80 transition count 157
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 151 place count 72 transition count 97
Ensure Unique test removed 1 places
Iterating global reduction 5 with 9 rules applied. Total rules applied 160 place count 71 transition count 97
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 164 place count 67 transition count 89
Iterating global reduction 5 with 4 rules applied. Total rules applied 168 place count 67 transition count 89
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 169 place count 66 transition count 87
Iterating global reduction 5 with 1 rules applied. Total rules applied 170 place count 66 transition count 87
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 5 with 44 rules applied. Total rules applied 214 place count 44 transition count 65
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 217 place count 41 transition count 58
Iterating global reduction 5 with 3 rules applied. Total rules applied 220 place count 41 transition count 58
Performed 8 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 236 place count 33 transition count 77
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 5 with 12 rules applied. Total rules applied 248 place count 33 transition count 65
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 249 place count 32 transition count 63
Iterating global reduction 6 with 1 rules applied. Total rules applied 250 place count 32 transition count 63
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 256 place count 32 transition count 57
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 7 with 7 rules applied. Total rules applied 263 place count 32 transition count 50
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 265 place count 31 transition count 60
Applied a total of 265 rules in 86 ms. Remains 31 /156 variables (removed 125) and now considering 60/268 (removed 208) transitions.
[2026-06-02 03:53:29] [INFO ] Flow matrix only has 52 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-11395428394013285219.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11424345577713072867.kers'
[2026-06-02 03:53:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11395428394013285219.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11424345577713072867.kers]
Normalized transition count is 51 out of 52 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 51 rows 30 cols 250 entries
Finished phase 1 with 21 SingleSign rule and 0 generalized
[2026-06-02 03:53:29] [INFO ] Computed 10 invariants in 1 ms
Computed 10 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-11424345577713072867.kers
Total runtime 2 ms.
[2026-06-02 03:53:29] [INFO ] Implicit Places using invariants in 59 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 61 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 30/156 places, 60/268 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -22
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 4 place count 28 transition count 82
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 16 place count 28 transition count 70
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 27 transition count 68
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 27 transition count 68
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 30 place count 27 transition count 56
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 2 with 11 rules applied. Total rules applied 41 place count 27 transition count 45
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 42 place count 26 transition count 44
Applied a total of 42 rules in 20 ms. Remains 26 /30 variables (removed 4) and now considering 44/60 (removed 16) transitions.
[2026-06-02 03:53:29] [INFO ] Flow matrix only has 35 transitions (discarded 9 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4955426266427474641.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13190320536837620787.kers'
[2026-06-02 03:53:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4955426266427474641.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13190320536837620787.kers]
Normalized transition count is 34 out of 35 initially.
Culling duplicate invariants (modulo rational): removing 6 columns.
Culled 6 columns in 0 ms.
// Phase 1: matrix 34 rows 20 cols 82 entries
Finished phase 1 with 17 SingleSign rule and 0 generalized
[2026-06-02 03:53:29] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13190320536837620787.kers
Total runtime 1 ms.
[2026-06-02 03:53:29] [INFO ] Implicit Places using invariants in 54 ms returned []
[2026-06-02 03:53:29] [INFO ] Flow matrix only has 35 transitions (discarded 9 similar events)
[2026-06-02 03:53:29] [INFO ] Invariant cache hit.
[2026-06-02 03:53:29] [INFO ] State equation strengthened by 3 read => feed constraints.
[2026-06-02 03:53:29] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 136 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 26/156 places, 44/268 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 306 ms. Remains : 26/156 places, 44/268 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&&(F(p1)||G(p2))))))'
Stuttering acceptance computed with spot in 182 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ErlangenMainframeV2-PT-bP03C03-LTLFireability-03
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA ErlangenMainframeV2-PT-bP03C03-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV2-PT-bP03C03-LTLFireability-03 finished in 537 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 5 out of 156 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 156/156 places, 268/268 transitions.
Graph (trivial) has 138 edges and 156 vertex of which 12 / 156 are part of one of the 5 SCC in 1 ms
Free SCC test removed 7 places
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 29 place count 148 transition count 231
Reduce places removed 28 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 49 rules applied. Total rules applied 78 place count 120 transition count 210
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 90 place count 108 transition count 210
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 90 place count 108 transition count 202
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 106 place count 100 transition count 202
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 119 place count 87 transition count 168
Iterating global reduction 3 with 13 rules applied. Total rules applied 132 place count 87 transition count 168
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 132 place count 87 transition count 165
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 138 place count 84 transition count 165
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 143 place count 79 transition count 121
Iterating global reduction 3 with 5 rules applied. Total rules applied 148 place count 79 transition count 121
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 149 place count 78 transition count 113
Iterating global reduction 3 with 1 rules applied. Total rules applied 150 place count 78 transition count 113
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 204 place count 51 transition count 86
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 207 place count 48 transition count 79
Iterating global reduction 3 with 3 rules applied. Total rules applied 210 place count 48 transition count 79
Performed 6 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
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 222 place count 42 transition count 97
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 234 place count 42 transition count 85
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 236 place count 40 transition count 81
Iterating global reduction 4 with 2 rules applied. Total rules applied 238 place count 40 transition count 81
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 248 place count 40 transition count 71
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 250 place count 39 transition count 84
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 5 with 11 rules applied. Total rules applied 261 place count 39 transition count 73
Applied a total of 261 rules in 53 ms. Remains 39 /156 variables (removed 117) and now considering 73/268 (removed 195) transitions.
[2026-06-02 03:53:30] [INFO ] Flow matrix only has 65 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-12072333794515389667.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5306769141359988603.kers'
[2026-06-02 03:53:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12072333794515389667.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5306769141359988603.kers]
Normalized transition count is 64 out of 65 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 64 rows 38 cols 422 entries
Finished phase 1 with 23 SingleSign rule and 2 generalized
[2026-06-02 03:53:30] [INFO ] Computed 14 invariants in 1 ms
Computed 14 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5306769141359988603.kers
Total runtime 1 ms.
[2026-06-02 03:53:30] [INFO ] Implicit Places using invariants in 88 ms returned []
[2026-06-02 03:53:30] [INFO ] Flow matrix only has 65 transitions (discarded 8 similar events)
[2026-06-02 03:53:30] [INFO ] Invariant cache hit.
[2026-06-02 03:53:30] [INFO ] State equation strengthened by 18 read => feed constraints.
[2026-06-02 03:53:30] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 226 ms to find 0 implicit places.
[2026-06-02 03:53:30] [INFO ] Redundant transitions in 2 ms returned []
Running 65 sub problems to find dead transitions.
[2026-06-02 03:53:30] [INFO ] Flow matrix only has 65 transitions (discarded 8 similar events)
[2026-06-02 03:53:30] [INFO ] Invariant cache hit.
[2026-06-02 03:53:30] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (OVERLAPS) 1/39 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (OVERLAPS) 64/103 variables, 39/54 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/103 variables, 17/71 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/103 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 8 (OVERLAPS) 1/104 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/104 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 10 (OVERLAPS) 0/104 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Real declared 104/104 variables, and 72 constraints, problems are : Problem set: 0 solved, 65 unsolved in 3418 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 39/39 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 65 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (OVERLAPS) 1/39 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (OVERLAPS) 64/103 variables, 39/54 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/103 variables, 17/71 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/103 variables, 65/136 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/103 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 9 (OVERLAPS) 1/104 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/104 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 11 (OVERLAPS) 0/104 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Int declared 104/104 variables, and 137 constraints, problems are : Problem set: 0 solved, 65 unsolved in 4825 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 39/39 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8280ms problems are : Problem set: 0 solved, 65 unsolved
Search for dead transitions found 0 dead transitions in 8281ms
Starting structural reductions in SI_LTL mode, iteration 1 : 39/156 places, 73/268 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8570 ms. Remains : 39/156 places, 73/268 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 57 ms :[(NOT p0)]
Running random walk in product with property : ErlangenMainframeV2-PT-bP03C03-LTLFireability-04
Product exploration explored 100000 steps with 0 reset in 237 ms.
Product exploration explored 100000 steps with 0 reset in 245 ms.
Computed a total of 1 stabilizing places and 8 stable transitions
Computed a total of 1 stabilizing places and 8 stable transitions
Knowledge based reduction with 3 factoid took 72 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 (1775 resets) in 375 ms. (106 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (338 resets) in 108 ms. (366 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 54061 steps, run visited all 1 properties in 111 ms. (steps per millisecond=487 )
Probabilistic random walk after 54061 steps, saw 11458 distinct states, run finished after 120 ms. (steps per millisecond=450 ) properties seen :1
Knowledge based reduction with 3 factoid took 57 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 37 ms :[(NOT p0)]
Knowledge-based reduction took 424 ms.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Support contains 5 out of 39 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 39/39 places, 73/73 transitions.
Applied a total of 0 rules in 4 ms. Remains 39 /39 variables (removed 0) and now considering 73/73 (removed 0) transitions.
[2026-06-02 03:53:39] [INFO ] Flow matrix only has 65 transitions (discarded 8 similar events)
[2026-06-02 03:53:39] [INFO ] Invariant cache hit.
[2026-06-02 03:53:39] [INFO ] Implicit Places using invariants in 72 ms returned []
[2026-06-02 03:53:39] [INFO ] Flow matrix only has 65 transitions (discarded 8 similar events)
[2026-06-02 03:53:39] [INFO ] Invariant cache hit.
[2026-06-02 03:53:39] [INFO ] State equation strengthened by 18 read => feed constraints.
[2026-06-02 03:53:39] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 175 ms to find 0 implicit places.
[2026-06-02 03:53:39] [INFO ] Redundant transitions in 2 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 187 ms. Remains : 39/39 places, 73/73 transitions.
Computed a total of 1 stabilizing places and 8 stable transitions
Computed a total of 1 stabilizing places and 8 stable transitions
Knowledge based reduction with 3 factoid took 71 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 (1784 resets) in 296 ms. (134 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (334 resets) in 92 ms. (430 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 54061 steps, run visited all 1 properties in 100 ms. (steps per millisecond=540 )
Probabilistic random walk after 54061 steps, saw 11458 distinct states, run finished after 100 ms. (steps per millisecond=540 ) properties seen :1
Knowledge based reduction with 3 factoid took 82 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 51 ms :[(NOT p0)]
Knowledge-based reduction took 432 ms.
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 55 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 106 ms.
Product exploration explored 100000 steps with 0 reset in 221 ms.
Built C files in :
/tmp/ltsmin5797613570898016016
[2026-06-02 03:53:40] [INFO ] Computing symmetric may disable matrix : 73 transitions.
[2026-06-02 03:53:40] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-06-02 03:53:40] [INFO ] Computing symmetric may enable matrix : 73 transitions.
[2026-06-02 03:53:40] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-06-02 03:53:40] [INFO ] Computing Do-Not-Accords matrix : 73 transitions.
[2026-06-02 03:53:40] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-06-02 03:53:40] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5797613570898016016
Running compilation step : cd /tmp/ltsmin5797613570898016016;'/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 310 ms.
Running link step : cd /tmp/ltsmin5797613570898016016;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin5797613570898016016;'/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/stateBased17321862223441239391.hoa' '--buchi-type=spotba'
LTSmin run took 368 ms.
FORMULA ErlangenMainframeV2-PT-bP03C03-LTLFireability-04 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ErlangenMainframeV2-PT-bP03C03-LTLFireability-04 finished in 11450 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U G(p1))&&F(p2)&&X((p3||F(G(p2))))))'
Support contains 9 out of 156 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 156/156 places, 268/268 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 139 transition count 223
Ensure Unique test removed 2 places
Iterating global reduction 0 with 19 rules applied. Total rules applied 36 place count 137 transition count 223
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 43 place count 130 transition count 188
Iterating global reduction 0 with 7 rules applied. Total rules applied 50 place count 130 transition count 188
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 54 place count 126 transition count 176
Iterating global reduction 0 with 4 rules applied. Total rules applied 58 place count 126 transition count 176
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 60 place count 124 transition count 174
Iterating global reduction 0 with 2 rules applied. Total rules applied 62 place count 124 transition count 174
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 64 place count 122 transition count 172
Iterating global reduction 0 with 2 rules applied. Total rules applied 66 place count 122 transition count 172
Applied a total of 66 rules in 6 ms. Remains 122 /156 variables (removed 34) and now considering 172/268 (removed 96) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4499398454261401756.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3220427397226222507.kers'
[2026-06-02 03:53:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4499398454261401756.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3220427397226222507.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 172 rows 122 cols 639 entries
Finished phase 1 with 108 SingleSign rule and 2 generalized
[2026-06-02 03:53:41] [INFO ] Computed 12 invariants in 1 ms
Computed 12 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3220427397226222507.kers
Total runtime 1 ms.
[2026-06-02 03:53:41] [INFO ] Implicit Places using invariants in 94 ms returned [30]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 96 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 121/156 places, 172/268 transitions.
Applied a total of 0 rules in 1 ms. Remains 121 /121 variables (removed 0) and now considering 172/172 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 103 ms. Remains : 121/156 places, 172/268 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U G(p1))&&F(p2)&&X((p3||F(G(p2))))))'
Stuttering acceptance computed with spot in 342 ms :[(OR (NOT p1) (NOT p2)), true, (NOT p1), (NOT p1), (NOT p2), (AND (NOT p3) (NOT p2)), (NOT p2)]
Running random walk in product with property : ErlangenMainframeV2-PT-bP03C03-LTLFireability-05
Product exploration explored 100000 steps with 1 reset in 190 ms.
Stack based approach found an accepted trace after 84 steps with 0 reset with depth 85 and stack size 85 in 1 ms.
FORMULA ErlangenMainframeV2-PT-bP03C03-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property ErlangenMainframeV2-PT-bP03C03-LTLFireability-05 finished in 712 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(((F(G(p1))||p0) U X(p2)))||(p2 U p3)))'
Support contains 9 out of 156 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 156/156 places, 268/268 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 140 transition count 224
Ensure Unique test removed 2 places
Iterating global reduction 0 with 18 rules applied. Total rules applied 34 place count 138 transition count 224
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 41 place count 131 transition count 189
Iterating global reduction 0 with 7 rules applied. Total rules applied 48 place count 131 transition count 189
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 52 place count 127 transition count 173
Ensure Unique test removed 1 places
Iterating global reduction 0 with 5 rules applied. Total rules applied 57 place count 126 transition count 173
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 58 place count 125 transition count 172
Iterating global reduction 0 with 1 rules applied. Total rules applied 59 place count 125 transition count 172
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 60 place count 124 transition count 171
Iterating global reduction 0 with 1 rules applied. Total rules applied 61 place count 124 transition count 171
Applied a total of 61 rules in 6 ms. Remains 124 /156 variables (removed 32) and now considering 171/268 (removed 97) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2439989710881219011.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-317856206475971280.kers'
[2026-06-02 03:53:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2439989710881219011.kers, --Pflows, --basisKERS=/tmp/petrispot-output-317856206475971280.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 171 rows 124 cols 566 entries
Finished phase 1 with 112 SingleSign rule and 1 generalized
[2026-06-02 03:53:42] [INFO ] Computed 11 invariants in 1 ms
Computed 11 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-317856206475971280.kers
Total runtime 2 ms.
[2026-06-02 03:53:42] [INFO ] Implicit Places using invariants in 108 ms returned [26]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 110 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 123/156 places, 171/268 transitions.
Applied a total of 0 rules in 2 ms. Remains 123 /123 variables (removed 0) and now considering 171/171 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 118 ms. Remains : 123/156 places, 171/268 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(((F(G(p1))||p0) U X(p2)))||(p2 U p3)))'
Stuttering acceptance computed with spot in 314 ms :[(AND (NOT p2) (NOT p3)), false, (AND (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p3) (NOT p2) (NOT p1)), (NOT p1)]
Running random walk in product with property : ErlangenMainframeV2-PT-bP03C03-LTLFireability-06
Product exploration explored 100000 steps with 0 reset in 181 ms.
Stack based approach found an accepted trace after 98 steps with 0 reset with depth 99 and stack size 99 in 0 ms.
FORMULA ErlangenMainframeV2-PT-bP03C03-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property ErlangenMainframeV2-PT-bP03C03-LTLFireability-06 finished in 677 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))||G(p2)||F(p0)))'
Support contains 6 out of 156 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 156/156 places, 268/268 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 138 transition count 222
Ensure Unique test removed 2 places
Iterating global reduction 0 with 20 rules applied. Total rules applied 38 place count 136 transition count 222
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 47 place count 127 transition count 169
Iterating global reduction 0 with 9 rules applied. Total rules applied 56 place count 127 transition count 169
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 62 place count 121 transition count 153
Iterating global reduction 0 with 6 rules applied. Total rules applied 68 place count 121 transition count 153
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 71 place count 118 transition count 149
Iterating global reduction 0 with 3 rules applied. Total rules applied 74 place count 118 transition count 149
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 76 place count 116 transition count 147
Iterating global reduction 0 with 2 rules applied. Total rules applied 78 place count 116 transition count 147
Applied a total of 78 rules in 6 ms. Remains 116 /156 variables (removed 40) and now considering 147/268 (removed 121) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9048407749774177351.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17079070696219996931.kers'
[2026-06-02 03:53:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9048407749774177351.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17079070696219996931.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 147 rows 116 cols 429 entries
Finished phase 1 with 102 SingleSign rule and 2 generalized
[2026-06-02 03:53:42] [INFO ] Computed 12 invariants in 1 ms
Computed 12 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17079070696219996931.kers
Total runtime 2 ms.
[2026-06-02 03:53:43] [INFO ] Implicit Places using invariants in 96 ms returned [27]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 98 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 115/156 places, 147/268 transitions.
Applied a total of 0 rules in 0 ms. Remains 115 /115 variables (removed 0) and now considering 147/147 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 104 ms. Remains : 115/156 places, 147/268 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))||G(p2)||F(p0)))'
Stuttering acceptance computed with spot in 250 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ErlangenMainframeV2-PT-bP03C03-LTLFireability-08
Product exploration explored 100000 steps with 0 reset in 196 ms.
Product exploration explored 100000 steps with 0 reset in 387 ms.
Computed a total of 15 stabilizing places and 15 stable transitions
Computed a total of 15 stabilizing places and 15 stable transitions
Knowledge based reduction with 11 factoid took 61 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 12 edges and 3 AP (stutter insensitive).
RANDOM walk for 40000 steps (8 resets) in 370 ms. (107 steps per ms) remains 3/10 properties
BEST_FIRST walk for 40000 steps (8 resets) in 199 ms. (200 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40000 steps (8 resets) in 226 ms. (176 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40000 steps (8 resets) in 134 ms. (296 steps per ms) remains 3/3 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2471328836690654327.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10043968722409069859.kers'
[2026-06-02 03:53:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2471328836690654327.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10043968722409069859.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 147 rows 115 cols 423 entries
Finished phase 1 with 102 SingleSign rule and 2 generalized
[2026-06-02 03:53:44] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10043968722409069859.kers
Total runtime 1 ms.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 25/31 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 66/97 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 18/115 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/115 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 147/262 variables, 115/126 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/262 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/262 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 262/262 variables, and 126 constraints, problems are : Problem set: 0 solved, 3 unsolved in 167 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 115/115 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 25/31 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 66/97 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 18/115 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/115 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 147/262 variables, 115/126 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/262 variables, 3/129 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/262 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/262 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 262/262 variables, and 129 constraints, problems are : Problem set: 0 solved, 3 unsolved in 270 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 115/115 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 451ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 459 ms.
Support contains 6 out of 115 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 115/115 places, 147/147 transitions.
Graph (trivial) has 103 edges and 115 vertex of which 9 / 115 are part of one of the 4 SCC in 0 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 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 110 transition count 120
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 26 rules applied. Total rules applied 44 place count 93 transition count 111
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 50 place count 87 transition count 111
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 17 Pre rules applied. Total rules applied 50 place count 87 transition count 94
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 84 place count 70 transition count 94
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 122 place count 51 transition count 75
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 128 place count 51 transition count 69
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 131 place count 48 transition count 62
Iterating global reduction 4 with 3 rules applied. Total rules applied 134 place count 48 transition count 62
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 4 with 18 rules applied. Total rules applied 152 place count 39 transition count 89
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 164 place count 39 transition count 77
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 166 place count 37 transition count 71
Iterating global reduction 5 with 2 rules applied. Total rules applied 168 place count 37 transition count 71
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 178 place count 37 transition count 61
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 6 with 2 rules applied. Total rules applied 180 place count 36 transition count 74
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 181 place count 36 transition count 73
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 7 with 10 rules applied. Total rules applied 191 place count 36 transition count 63
Free-agglomeration rule applied 3 times.
Iterating global reduction 7 with 3 rules applied. Total rules applied 194 place count 36 transition count 60
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 197 place count 33 transition count 60
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 199 place count 33 transition count 58
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 8 with 1 rules applied. Total rules applied 200 place count 33 transition count 64
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 8 with 3 rules applied. Total rules applied 203 place count 32 transition count 62
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 9 with 13 rules applied. Total rules applied 216 place count 32 transition count 49
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 217 place count 31 transition count 48
Applied a total of 217 rules in 37 ms. Remains 31 /115 variables (removed 84) and now considering 48/147 (removed 99) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 31/115 places, 48/147 transitions.
RANDOM walk for 36804 steps (8 resets) in 151 ms. (242 steps per ms) remains 0/3 properties
Knowledge based reduction with 11 factoid took 217 ms. Reduced automaton from 5 states, 12 edges and 3 AP (stutter insensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 238 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0)]
Knowledge-based reduction took 1856 ms.
Stuttering acceptance computed with spot in 238 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0)]
Support contains 5 out of 115 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 115/115 places, 147/147 transitions.
Graph (trivial) has 103 edges and 115 vertex of which 9 / 115 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 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 109 transition count 125
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 24 rules applied. Total rules applied 40 place count 94 transition count 116
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 46 place count 88 transition count 116
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 46 place count 88 transition count 100
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 78 place count 72 transition count 100
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 118 place count 52 transition count 80
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 124 place count 52 transition count 74
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 127 place count 49 transition count 67
Iterating global reduction 4 with 3 rules applied. Total rules applied 130 place count 49 transition count 67
Performed 8 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 146 place count 41 transition count 85
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 158 place count 41 transition count 73
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 160 place count 39 transition count 69
Iterating global reduction 5 with 2 rules applied. Total rules applied 162 place count 39 transition count 69
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 172 place count 39 transition count 59
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 6 with 2 rules applied. Total rules applied 174 place count 38 transition count 72
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 6 with 9 rules applied. Total rules applied 183 place count 38 transition count 63
Applied a total of 183 rules in 26 ms. Remains 38 /115 variables (removed 77) and now considering 63/147 (removed 84) transitions.
[2026-06-02 03:53:46] [INFO ] Flow matrix only has 60 transitions (discarded 3 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15558236519935460019.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11399105299100983654.kers'
[2026-06-02 03:53:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15558236519935460019.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11399105299100983654.kers]
Normalized transition count is 59 out of 60 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 59 rows 38 cols 278 entries
Finished phase 1 with 25 SingleSign rule and 2 generalized
[2026-06-02 03:53:46] [INFO ] Computed 11 invariants in 1 ms
Computed 11 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-11399105299100983654.kers
Total runtime 1 ms.
[2026-06-02 03:53:46] [INFO ] Implicit Places using invariants in 71 ms returned [28]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 73 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 37/115 places, 63/147 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 36 transition count 62
Applied a total of 2 rules in 3 ms. Remains 36 /37 variables (removed 1) and now considering 62/63 (removed 1) transitions.
[2026-06-02 03:53:46] [INFO ] Flow matrix only has 59 transitions (discarded 3 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7733608387661301170.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7410416028227498362.kers'
[2026-06-02 03:53:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7733608387661301170.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7410416028227498362.kers]
Normalized transition count is 58 out of 59 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 58 rows 36 cols 270 entries
Finished phase 1 with 26 SingleSign rule and 0 generalized
[2026-06-02 03:53:46] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-7410416028227498362.kers
Total runtime 1 ms.
[2026-06-02 03:53:46] [INFO ] Implicit Places using invariants in 60 ms returned []
[2026-06-02 03:53:46] [INFO ] Flow matrix only has 59 transitions (discarded 3 similar events)
[2026-06-02 03:53:46] [INFO ] Invariant cache hit.
[2026-06-02 03:53:46] [INFO ] State equation strengthened by 15 read => feed constraints.
[2026-06-02 03:53:46] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 156 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 36/115 places, 62/147 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 258 ms. Remains : 36/115 places, 62/147 transitions.
Computed a total of 4 stabilizing places and 11 stable transitions
Computed a total of 4 stabilizing places and 11 stable transitions
Knowledge based reduction with 13 factoid took 81 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
RANDOM walk for 40000 steps (8 resets) in 175 ms. (227 steps per ms) remains 0/6 properties
Knowledge based reduction with 13 factoid took 145 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 251 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0)]
Knowledge-based reduction took 542 ms.
Stuttering acceptance computed with spot in 231 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0)]
Stuttering acceptance computed with spot in 226 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 212 ms.
Product exploration explored 100000 steps with 0 reset in 243 ms.
Built C files in :
/tmp/ltsmin514254124162115226
[2026-06-02 03:53:47] [INFO ] Computing symmetric may disable matrix : 62 transitions.
[2026-06-02 03:53:47] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-06-02 03:53:47] [INFO ] Computing symmetric may enable matrix : 62 transitions.
[2026-06-02 03:53:47] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-06-02 03:53:47] [INFO ] Computing Do-Not-Accords matrix : 62 transitions.
[2026-06-02 03:53:47] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-06-02 03:53:47] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin514254124162115226
Running compilation step : cd /tmp/ltsmin514254124162115226;'/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 275 ms.
Running link step : cd /tmp/ltsmin514254124162115226;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin514254124162115226;'/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/stateBased16470594951757908031.hoa' '--buchi-type=spotba'
LTSmin run took 33 ms.
FORMULA ErlangenMainframeV2-PT-bP03C03-LTLFireability-08 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ErlangenMainframeV2-PT-bP03C03-LTLFireability-08 finished in 5213 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((G(p0)||((F(p1) U p2)&&F(p3)))))'
Support contains 10 out of 156 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 156/156 places, 268/268 transitions.
Graph (trivial) has 125 edges and 156 vertex of which 10 / 156 are part of one of the 4 SCC in 0 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 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 149 transition count 235
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 124 transition count 214
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 84 place count 112 transition count 214
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 84 place count 112 transition count 204
Deduced a syphon composed of 10 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 21 rules applied. Total rules applied 105 place count 101 transition count 204
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 119 place count 87 transition count 162
Ensure Unique test removed 2 places
Iterating global reduction 3 with 16 rules applied. Total rules applied 135 place count 85 transition count 162
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 135 place count 85 transition count 160
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 139 place count 83 transition count 160
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 144 place count 78 transition count 122
Ensure Unique test removed 1 places
Iterating global reduction 3 with 6 rules applied. Total rules applied 150 place count 77 transition count 122
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 152 place count 75 transition count 112
Iterating global reduction 3 with 2 rules applied. Total rules applied 154 place count 75 transition count 112
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 198 place count 53 transition count 90
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 201 place count 50 transition count 80
Iterating global reduction 3 with 3 rules applied. Total rules applied 204 place count 50 transition count 80
Performed 6 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
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 216 place count 44 transition count 106
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 224 place count 44 transition count 98
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 4 with 12 rules applied. Total rules applied 236 place count 44 transition count 86
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 238 place count 44 transition count 86
Applied a total of 238 rules in 18 ms. Remains 44 /156 variables (removed 112) and now considering 86/268 (removed 182) transitions.
[2026-06-02 03:53:48] [INFO ] Flow matrix only has 78 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-17471791957963281572.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-626645218585003950.kers'
[2026-06-02 03:53:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17471791957963281572.kers, --Pflows, --basisKERS=/tmp/petrispot-output-626645218585003950.kers]
Normalized transition count is 77 out of 78 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 77 rows 44 cols 458 entries
Finished phase 1 with 34 SingleSign rule and 0 generalized
[2026-06-02 03:53:48] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-626645218585003950.kers
Total runtime 1 ms.
[2026-06-02 03:53:48] [INFO ] Implicit Places using invariants in 56 ms returned []
[2026-06-02 03:53:48] [INFO ] Flow matrix only has 78 transitions (discarded 8 similar events)
[2026-06-02 03:53:48] [INFO ] Invariant cache hit.
[2026-06-02 03:53:48] [INFO ] State equation strengthened by 7 read => feed constraints.
[2026-06-02 03:53:48] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
[2026-06-02 03:53:48] [INFO ] Redundant transitions in 1 ms returned []
Running 78 sub problems to find dead transitions.
[2026-06-02 03:53:48] [INFO ] Flow matrix only has 78 transitions (discarded 8 similar events)
[2026-06-02 03:53:48] [INFO ] Invariant cache hit.
[2026-06-02 03:53:48] [INFO ] State equation strengthened by 7 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (OVERLAPS) 1/44 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (OVERLAPS) 77/121 variables, 44/54 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 6/60 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (OVERLAPS) 1/122 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 8 (OVERLAPS) 0/122 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 61 constraints, problems are : Problem set: 0 solved, 78 unsolved in 3047 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 44/44 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 78 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (OVERLAPS) 1/44 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (OVERLAPS) 77/121 variables, 44/54 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 6/60 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 78/138 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 2/140 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/121 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 8 (OVERLAPS) 1/122 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 10 (OVERLAPS) 0/122 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 141 constraints, problems are : Problem set: 0 solved, 78 unsolved in 6973 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 44/44 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 10044ms problems are : Problem set: 0 solved, 78 unsolved
Search for dead transitions found 0 dead transitions in 10044ms
Starting structural reductions in SI_LTL mode, iteration 1 : 44/156 places, 86/268 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10242 ms. Remains : 44/156 places, 86/268 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((G(p0)||((F(p1) U p2)&&F(p3)))))'
Stuttering acceptance computed with spot in 194 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (NOT p1), (NOT p2), (NOT p3), (AND (NOT p1) (NOT p0) p2)]
Running random walk in product with property : ErlangenMainframeV2-PT-bP03C03-LTLFireability-09
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 1 ms.
FORMULA ErlangenMainframeV2-PT-bP03C03-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV2-PT-bP03C03-LTLFireability-09 finished in 10473 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||X(X(!p1)))) U ((!p2&&X((p0||X(X(!p1)))))||X(G((p0||X(X(!p1))))))))'
Support contains 9 out of 156 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 156/156 places, 268/268 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 142 transition count 246
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 142 transition count 246
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 32 place count 138 transition count 242
Iterating global reduction 0 with 4 rules applied. Total rules applied 36 place count 138 transition count 242
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 40 place count 134 transition count 222
Iterating global reduction 0 with 4 rules applied. Total rules applied 44 place count 134 transition count 222
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 47 place count 131 transition count 202
Iterating global reduction 0 with 3 rules applied. Total rules applied 50 place count 131 transition count 202
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 52 place count 129 transition count 200
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 129 transition count 200
Applied a total of 54 rules in 7 ms. Remains 129 /156 variables (removed 27) and now considering 200/268 (removed 68) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17176148333412726223.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11897924795318794912.kers'
[2026-06-02 03:53:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17176148333412726223.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11897924795318794912.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 200 rows 129 cols 995 entries
Finished phase 1 with 112 SingleSign rule and 3 generalized
[2026-06-02 03:53:58] [INFO ] Computed 14 invariants in 1 ms
Computed 14 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-11897924795318794912.kers
Total runtime 1 ms.
[2026-06-02 03:53:58] [INFO ] Implicit Places using invariants in 86 ms returned []
[2026-06-02 03:53:58] [INFO ] Invariant cache hit.
[2026-06-02 03:53:58] [INFO ] Implicit Places using invariants and state equation in 162 ms returned []
Implicit Place search using SMT with State Equation took 250 ms to find 0 implicit places.
Running 199 sub problems to find dead transitions.
[2026-06-02 03:53:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/128 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 2 (OVERLAPS) 1/129 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 4 (OVERLAPS) 200/329 variables, 129/143 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/329 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 6 (OVERLAPS) 0/329 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 199 unsolved
No progress, stopping.
After SMT solving in domain Real declared 329/329 variables, and 143 constraints, problems are : Problem set: 0 solved, 199 unsolved in 15458 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 129/129 constraints, PredecessorRefiner: 199/199 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 199 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/128 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 2 (OVERLAPS) 1/129 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 4 (OVERLAPS) 200/329 variables, 129/143 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/329 variables, 199/342 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/329 variables, 1/343 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/329 variables, 1/344 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/329 variables, 1/345 constraints. Problems are: Problem set: 0 solved, 199 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 329/329 variables, and 345 constraints, problems are : Problem set: 0 solved, 199 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 129/129 constraints, PredecessorRefiner: 199/199 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 45535ms problems are : Problem set: 0 solved, 199 unsolved
Search for dead transitions found 0 dead transitions in 45536ms
Starting structural reductions in LTL mode, iteration 1 : 129/156 places, 200/268 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45795 ms. Remains : 129/156 places, 200/268 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||X(X(!p1)))) U (X(G((p0||X(X(!p1)))))||(!p2&&X((p0||X(X(!p1))))))))'
Stuttering acceptance computed with spot in 294 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), p1, p1, true, (AND (NOT p0) p1), (AND p1 (NOT p0)), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Running random walk in product with property : ErlangenMainframeV2-PT-bP03C03-LTLFireability-10
Product exploration explored 100000 steps with 50000 reset in 74 ms.
Product exploration explored 100000 steps with 50000 reset in 91 ms.
Computed a total of 17 stabilizing places and 17 stable transitions
Computed a total of 17 stabilizing places and 17 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 11 factoid took 18 ms. Proved property starting from automaton with 9 states, 17 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 28 ms.
FORMULA ErlangenMainframeV2-PT-bP03C03-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ErlangenMainframeV2-PT-bP03C03-LTLFireability-10 finished in 46329 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 156 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 156/156 places, 268/268 transitions.
Graph (trivial) has 137 edges and 156 vertex of which 12 / 156 are part of one of the 5 SCC in 0 ms
Free SCC test removed 7 places
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 29 place count 148 transition count 231
Reduce places removed 28 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 49 rules applied. Total rules applied 78 place count 120 transition count 210
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 90 place count 108 transition count 210
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 90 place count 108 transition count 201
Deduced a syphon composed of 9 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 19 rules applied. Total rules applied 109 place count 98 transition count 201
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 124 place count 83 transition count 158
Ensure Unique test removed 2 places
Iterating global reduction 3 with 17 rules applied. Total rules applied 141 place count 81 transition count 158
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 141 place count 81 transition count 155
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 147 place count 78 transition count 155
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 155 place count 70 transition count 95
Ensure Unique test removed 1 places
Iterating global reduction 3 with 9 rules applied. Total rules applied 164 place count 69 transition count 95
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 168 place count 65 transition count 87
Iterating global reduction 3 with 4 rules applied. Total rules applied 172 place count 65 transition count 87
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 218 place count 42 transition count 64
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 221 place count 39 transition count 57
Iterating global reduction 3 with 3 rules applied. Total rules applied 224 place count 39 transition count 57
Performed 8 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
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 240 place count 31 transition count 75
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 252 place count 31 transition count 63
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 254 place count 29 transition count 59
Iterating global reduction 4 with 2 rules applied. Total rules applied 256 place count 29 transition count 59
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 266 place count 29 transition count 49
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 268 place count 28 transition count 62
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 5 with 14 rules applied. Total rules applied 282 place count 28 transition count 48
Applied a total of 282 rules in 33 ms. Remains 28 /156 variables (removed 128) and now considering 48/268 (removed 220) transitions.
[2026-06-02 03:54:44] [INFO ] Flow matrix only has 41 transitions (discarded 7 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16573674580171884357.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17918436294720174967.kers'
[2026-06-02 03:54:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16573674580171884357.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17918436294720174967.kers]
Normalized transition count is 40 out of 41 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 40 rows 26 cols 174 entries
Finished phase 1 with 18 SingleSign rule and 0 generalized
[2026-06-02 03:54:45] [INFO ] Computed 10 invariants in 1 ms
Computed 10 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17918436294720174967.kers
Total runtime 2 ms.
[2026-06-02 03:54:45] [INFO ] Implicit Places using invariants in 122 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 126 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 27/156 places, 48/268 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -14
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 4 place count 25 transition count 62
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 12 place count 25 transition count 54
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 24 transition count 52
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 24 transition count 52
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 22 place count 24 transition count 44
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 2 with 7 rules applied. Total rules applied 29 place count 24 transition count 37
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 30 place count 23 transition count 36
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 31 place count 22 transition count 36
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 36 place count 22 transition count 31
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 3 with 2 rules applied. Total rules applied 38 place count 22 transition count 29
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 40 place count 20 transition count 29
Applied a total of 40 rules in 10 ms. Remains 20 /27 variables (removed 7) and now considering 29/48 (removed 19) transitions.
[2026-06-02 03:54:45] [INFO ] Flow matrix only has 26 transitions (discarded 3 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12505462792527252883.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15217170260085406031.kers'
[2026-06-02 03:54:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12505462792527252883.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15217170260085406031.kers]
Normalized transition count is 25 out of 26 initially.
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 25 rows 15 cols 59 entries
Finished phase 1 with 12 SingleSign rule and 0 generalized
[2026-06-02 03:54:45] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15217170260085406031.kers
Total runtime 2 ms.
[2026-06-02 03:54:45] [INFO ] Implicit Places using invariants in 52 ms returned []
[2026-06-02 03:54:45] [INFO ] Flow matrix only has 26 transitions (discarded 3 similar events)
[2026-06-02 03:54:45] [INFO ] Invariant cache hit.
[2026-06-02 03:54:45] [INFO ] State equation strengthened by 3 read => feed constraints.
[2026-06-02 03:54:45] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 20/156 places, 29/268 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 289 ms. Remains : 20/156 places, 29/268 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 102 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ErlangenMainframeV2-PT-bP03C03-LTLFireability-11
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ErlangenMainframeV2-PT-bP03C03-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV2-PT-bP03C03-LTLFireability-11 finished in 431 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||F(G(p1))||(p1&&F(p2)))))'
Support contains 7 out of 156 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 156/156 places, 268/268 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 140 transition count 231
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 140 transition count 231
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 40 place count 132 transition count 192
Iterating global reduction 0 with 8 rules applied. Total rules applied 48 place count 132 transition count 192
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 53 place count 127 transition count 171
Iterating global reduction 0 with 5 rules applied. Total rules applied 58 place count 127 transition count 171
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 60 place count 125 transition count 169
Iterating global reduction 0 with 2 rules applied. Total rules applied 62 place count 125 transition count 169
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 64 place count 123 transition count 167
Iterating global reduction 0 with 2 rules applied. Total rules applied 66 place count 123 transition count 167
Applied a total of 66 rules in 17 ms. Remains 123 /156 variables (removed 33) and now considering 167/268 (removed 101) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-619680633961396900.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10217144910509810482.kers'
[2026-06-02 03:54:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-619680633961396900.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10217144910509810482.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 167 rows 123 cols 649 entries
Finished phase 1 with 107 SingleSign rule and 2 generalized
[2026-06-02 03:54:45] [INFO ] Computed 14 invariants in 1 ms
Computed 14 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10217144910509810482.kers
Total runtime 2 ms.
[2026-06-02 03:54:45] [INFO ] Implicit Places using invariants in 126 ms returned []
[2026-06-02 03:54:45] [INFO ] Invariant cache hit.
[2026-06-02 03:54:45] [INFO ] Implicit Places using invariants and state equation in 213 ms returned []
Implicit Place search using SMT with State Equation took 341 ms to find 0 implicit places.
Running 166 sub problems to find dead transitions.
[2026-06-02 03:54:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 2 (OVERLAPS) 1/123 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 4 (OVERLAPS) 167/290 variables, 123/137 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/290 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 6 (OVERLAPS) 0/290 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 166 unsolved
No progress, stopping.
After SMT solving in domain Real declared 290/290 variables, and 137 constraints, problems are : Problem set: 0 solved, 166 unsolved in 12826 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 123/123 constraints, PredecessorRefiner: 166/166 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 166 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 2 (OVERLAPS) 1/123 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 4 (OVERLAPS) 167/290 variables, 123/137 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/290 variables, 166/303 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/290 variables, 1/304 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/290 variables, 1/305 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/290 variables, 2/307 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/290 variables, 2/309 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 11 (OVERLAPS) 0/290 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 166 unsolved
No progress, stopping.
After SMT solving in domain Int declared 290/290 variables, and 309 constraints, problems are : Problem set: 0 solved, 166 unsolved in 27736 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 123/123 constraints, PredecessorRefiner: 166/166 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 40593ms problems are : Problem set: 0 solved, 166 unsolved
Search for dead transitions found 0 dead transitions in 40594ms
Starting structural reductions in LTL mode, iteration 1 : 123/156 places, 167/268 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40955 ms. Remains : 123/156 places, 167/268 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(G(p0))||p1||(p0&&F(p2)))))'
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ErlangenMainframeV2-PT-bP03C03-LTLFireability-13
Product exploration explored 100000 steps with 0 reset in 231 ms.
Stack based approach found an accepted trace after 25 steps with 0 reset with depth 26 and stack size 26 in 1 ms.
FORMULA ErlangenMainframeV2-PT-bP03C03-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property ErlangenMainframeV2-PT-bP03C03-LTLFireability-13 finished in 41372 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((G(p1)||X(G(p2))||p0))))'
Support contains 7 out of 156 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 156/156 places, 268/268 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 140 transition count 231
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 140 transition count 231
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 39 place count 133 transition count 196
Iterating global reduction 0 with 7 rules applied. Total rules applied 46 place count 133 transition count 196
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 50 place count 129 transition count 181
Iterating global reduction 0 with 4 rules applied. Total rules applied 54 place count 129 transition count 181
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 57 place count 126 transition count 171
Iterating global reduction 0 with 3 rules applied. Total rules applied 60 place count 126 transition count 171
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 62 place count 124 transition count 169
Iterating global reduction 0 with 2 rules applied. Total rules applied 64 place count 124 transition count 169
Applied a total of 64 rules in 14 ms. Remains 124 /156 variables (removed 32) and now considering 169/268 (removed 99) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2997982603085965304.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1871207070090815865.kers'
[2026-06-02 03:55:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2997982603085965304.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1871207070090815865.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 169 rows 124 cols 653 entries
Finished phase 1 with 108 SingleSign rule and 2 generalized
[2026-06-02 03:55:26] [INFO ] Computed 14 invariants in 0 ms
Computed 14 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1871207070090815865.kers
Total runtime 1 ms.
[2026-06-02 03:55:26] [INFO ] Implicit Places using invariants in 94 ms returned []
[2026-06-02 03:55:26] [INFO ] Invariant cache hit.
[2026-06-02 03:55:27] [INFO ] Implicit Places using invariants and state equation in 225 ms returned []
Implicit Place search using SMT with State Equation took 321 ms to find 0 implicit places.
Running 168 sub problems to find dead transitions.
[2026-06-02 03:55:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 2 (OVERLAPS) 1/124 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 5 (OVERLAPS) 169/293 variables, 124/140 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/293 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 7 (OVERLAPS) 0/293 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 168 unsolved
No progress, stopping.
After SMT solving in domain Real declared 293/293 variables, and 140 constraints, problems are : Problem set: 0 solved, 168 unsolved in 13491 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 168/168 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 168 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 2 (OVERLAPS) 1/124 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 5 (OVERLAPS) 169/293 variables, 124/140 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/293 variables, 168/308 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/293 variables, 7/315 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/293 variables, 1/316 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/293 variables, 1/317 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/293 variables, 2/319 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/293 variables, 2/321 constraints. Problems are: Problem set: 0 solved, 168 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 293/293 variables, and 321 constraints, problems are : Problem set: 0 solved, 168 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 168/168 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 43545ms problems are : Problem set: 0 solved, 168 unsolved
Search for dead transitions found 0 dead transitions in 43546ms
Starting structural reductions in LTL mode, iteration 1 : 124/156 places, 169/268 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43891 ms. Remains : 124/156 places, 169/268 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((G(p1)||X(G(p2))||p0))))'
Stuttering acceptance computed with spot in 273 ms :[true, (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (NOT p1)]
Running random walk in product with property : ErlangenMainframeV2-PT-bP03C03-LTLFireability-15
Product exploration explored 100000 steps with 0 reset in 258 ms.
Product exploration explored 100000 steps with 0 reset in 267 ms.
Computed a total of 15 stabilizing places and 15 stable transitions
Computed a total of 15 stabilizing places and 15 stable transitions
Knowledge based reduction with 14 factoid took 88 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 6 states, 13 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 215 ms. (185 steps per ms) remains 4/9 properties
BEST_FIRST walk for 40000 steps (8 resets) in 287 ms. (138 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 135 ms. (294 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 166 ms. (239 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40000 steps (8 resets) in 188 ms. (211 steps per ms) remains 3/3 properties
[2026-06-02 03:56:11] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 30/36 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 63/99 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 25/124 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 169/293 variables, 124/138 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/293 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/293 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 293/293 variables, and 138 constraints, problems are : Problem set: 0 solved, 3 unsolved in 260 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 30/36 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 63/99 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 25/124 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 169/293 variables, 124/138 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/293 variables, 3/141 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/293 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/293 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 293/293 variables, and 141 constraints, problems are : Problem set: 0 solved, 3 unsolved in 455 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 722ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 250 steps, including 2 resets, run visited all 1 properties in 2 ms. (steps per millisecond=125 )
Parikh walk visited 3 properties in 19 ms.
Knowledge based reduction with 14 factoid took 228 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 6 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 272 ms :[true, (NOT p2), (AND (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1) (NOT p2))]
Knowledge-based reduction took 1738 ms.
Stuttering acceptance computed with spot in 270 ms :[true, (NOT p2), (AND (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 7 out of 124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 169/169 transitions.
Applied a total of 0 rules in 1 ms. Remains 124 /124 variables (removed 0) and now considering 169/169 (removed 0) transitions.
[2026-06-02 03:56:13] [INFO ] Invariant cache hit.
[2026-06-02 03:56:13] [INFO ] Implicit Places using invariants in 112 ms returned []
[2026-06-02 03:56:13] [INFO ] Invariant cache hit.
[2026-06-02 03:56:13] [INFO ] Implicit Places using invariants and state equation in 221 ms returned []
Implicit Place search using SMT with State Equation took 335 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 337 ms. Remains : 124/124 places, 169/169 transitions.
Computed a total of 15 stabilizing places and 15 stable transitions
Computed a total of 15 stabilizing places and 15 stable transitions
Knowledge based reduction with 14 factoid took 92 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 6 states, 13 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 248 ms. (160 steps per ms) remains 4/9 properties
BEST_FIRST walk for 40000 steps (8 resets) in 274 ms. (145 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 99 ms. (400 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40000 steps (8 resets) in 161 ms. (246 steps per ms) remains 3/3 properties
[2026-06-02 03:56:14] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 30/36 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 63/99 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 25/124 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 169/293 variables, 124/138 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/293 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/293 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 293/293 variables, and 138 constraints, problems are : Problem set: 0 solved, 3 unsolved in 258 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 30/36 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 63/99 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 25/124 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 169/293 variables, 124/138 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/293 variables, 3/141 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/293 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/293 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 293/293 variables, and 141 constraints, problems are : Problem set: 0 solved, 3 unsolved in 510 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 774ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 250 steps, including 2 resets, run visited all 1 properties in 2 ms. (steps per millisecond=125 )
Parikh walk visited 3 properties in 22 ms.
Knowledge based reduction with 14 factoid took 236 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 6 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 277 ms :[true, (NOT p2), (AND (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1) (NOT p2))]
Knowledge-based reduction took 1733 ms.
Stuttering acceptance computed with spot in 276 ms :[true, (NOT p2), (AND (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 279 ms :[true, (NOT p2), (AND (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 0 reset in 257 ms.
Product exploration explored 100000 steps with 0 reset in 266 ms.
Spot run failed in 85 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin17210947491200918113
[2026-06-02 03:56:16] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17210947491200918113
Running compilation step : cd /tmp/ltsmin17210947491200918113;'/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 653 ms.
Running link step : cd /tmp/ltsmin17210947491200918113;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin17210947491200918113;'/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/stateBased8646636041853568041.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 7 out of 124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 169/169 transitions.
Applied a total of 0 rules in 1 ms. Remains 124 /124 variables (removed 0) and now considering 169/169 (removed 0) transitions.
[2026-06-02 03:56:31] [INFO ] Invariant cache hit.
[2026-06-02 03:56:31] [INFO ] Implicit Places using invariants in 78 ms returned []
[2026-06-02 03:56:31] [INFO ] Invariant cache hit.
[2026-06-02 03:56:32] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 224 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 225 ms. Remains : 124/124 places, 169/169 transitions.
Built C files in :
/tmp/ltsmin3647679313456295752
[2026-06-02 03:56:32] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3647679313456295752
Running compilation step : cd /tmp/ltsmin3647679313456295752;'/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 421 ms.
Running link step : cd /tmp/ltsmin3647679313456295752;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin3647679313456295752;'/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/stateBased13083775133609910269.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-06-02 03:56:47] [INFO ] Flatten gal took : 20 ms
[2026-06-02 03:56:47] [INFO ] Flatten gal took : 22 ms
[2026-06-02 03:56:47] [INFO ] Time to serialize gal into /tmp/LTL11303918154966180355.gal : 4 ms
[2026-06-02 03:56:47] [INFO ] Time to serialize properties into /tmp/LTL12916816429511726239.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/LTL11303918154966180355.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4534054635030516876.hoa' '-atoms' '/tmp/LTL12916816429511726239.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/LTL12916816429511726239.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4534054635030516876.hoa
Reverse transition relation is NOT exact ! Due to transitions t13, t21, t22, t24, t32, t60, t65, t80, t85, t93, t101, t105, t107, t108, t109, t112, t114, t...350
Detected timeout of ITS tools.
[2026-06-02 03:57:02] [INFO ] Flatten gal took : 14 ms
[2026-06-02 03:57:02] [INFO ] Flatten gal took : 14 ms
[2026-06-02 03:57:02] [INFO ] Time to serialize gal into /tmp/LTL16403934422616285238.gal : 4 ms
[2026-06-02 03:57:02] [INFO ] Time to serialize properties into /tmp/LTL10726086875797821298.ltl : 6 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/LTL16403934422616285238.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10726086875797821298.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(G(("(((p4==0)||(p26==0))||((p38==0)||(p64==0)))")||((("(p111==0)")||(G("(p203==1)")))||(X(G("(p134==0)"))))))))
Formula 0 simplified : XF(!"(((p4==0)||(p26==0))||((p38==0)||(p64==0)))" & !"(p111==0)" & F!"(p203==1)" & XF!"(p134==0)")
Reverse transition relation is NOT exact ! Due to transitions t13, t21, t22, t24, t32, t60, t65, t80, t85, t93, t101, t105, t107, t108, t109, t112, t114, t...350
Detected timeout of ITS tools.
[2026-06-02 03:57:17] [INFO ] Flatten gal took : 12 ms
[2026-06-02 03:57:17] [INFO ] Applying decomposition
[2026-06-02 03:57:17] [INFO ] Flatten gal took : 11 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/graph11039787722440464616.txt' '-o' '/tmp/graph11039787722440464616.bin' '-w' '/tmp/graph11039787722440464616.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph11039787722440464616.bin' '-l' '-1' '-v' '-w' '/tmp/graph11039787722440464616.weights' '-q' '0' '-e' '0.001'
[2026-06-02 03:57:17] [INFO ] Decomposing Gal with order
[2026-06-02 03:57:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-06-02 03:57:17] [INFO ] Removed a total of 180 redundant transitions.
[2026-06-02 03:57:17] [INFO ] Flatten gal took : 92 ms
[2026-06-02 03:57:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 38 labels/synchronizations in 15 ms.
[2026-06-02 03:57:17] [INFO ] Time to serialize gal into /tmp/LTL7772569657976460561.gal : 7 ms
[2026-06-02 03:57:17] [INFO ] Time to serialize properties into /tmp/LTL8215211997527472335.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/LTL7772569657976460561.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8215211997527472335.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(G(("(((i1.i2.u17.p4==0)||(i1.i2.u17.p26==0))||((i1.i2.u17.p38==0)||(i1.i2.u17.p64==0)))")||((("(i1.i2.u18.p111==0)")||(G("(i7.i1....207
Formula 0 simplified : XF(!"(((i1.i2.u17.p4==0)||(i1.i2.u17.p26==0))||((i1.i2.u17.p38==0)||(i1.i2.u17.p64==0)))" & !"(i1.i2.u18.p111==0)" & F!"(i7.i1.u35.p...191
Reverse transition relation is NOT exact ! Due to transitions t32, t80, t108, t126, i1.i0.t117, i1.i0.t251, i1.i0.t252, i1.i0.u4.t114, i1.i1.t112, i1.i1.t2...447
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
41 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.432473,29440,1,0,24952,1149,2975,44186,739,3639,60647
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ErlangenMainframeV2-PT-bP03C03-LTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property ErlangenMainframeV2-PT-bP03C03-LTLFireability-15 finished in 111392 ms.
All properties solved by simple procedures.
Total runtime 357381 ms.

BK_STOP 1780372638200

--------------------
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="ErlangenMainframeV2-PT-bP03C03"
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 ErlangenMainframeV2-PT-bP03C03, 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-178021499200228"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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