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-178021499100068.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5973
Executing tool itstools
Input is ErlangenMainframeV1-PT-bP03C03, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r338-smll-178021499100068
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 6.9K May 27 08:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K May 27 08:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 27 08:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K May 27 08:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 27 10:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 27 10:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 27 10:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 27 10:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 26 18:17 NewModel
-rw-r--r-- 1 mcc users 9.7K May 27 08:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K May 27 08:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 27 08:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K May 27 08:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 27 10:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 27 10:31 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 96K May 26 18:17 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME ErlangenMainframeV1-PT-bP03C03-LTLFireability-00
FORMULA_NAME ErlangenMainframeV1-PT-bP03C03-LTLFireability-01
FORMULA_NAME ErlangenMainframeV1-PT-bP03C03-LTLFireability-02
FORMULA_NAME ErlangenMainframeV1-PT-bP03C03-LTLFireability-03
FORMULA_NAME ErlangenMainframeV1-PT-bP03C03-LTLFireability-04
FORMULA_NAME ErlangenMainframeV1-PT-bP03C03-LTLFireability-05
FORMULA_NAME ErlangenMainframeV1-PT-bP03C03-LTLFireability-06
FORMULA_NAME ErlangenMainframeV1-PT-bP03C03-LTLFireability-07
FORMULA_NAME ErlangenMainframeV1-PT-bP03C03-LTLFireability-08
FORMULA_NAME ErlangenMainframeV1-PT-bP03C03-LTLFireability-09
FORMULA_NAME ErlangenMainframeV1-PT-bP03C03-LTLFireability-10
FORMULA_NAME ErlangenMainframeV1-PT-bP03C03-LTLFireability-11
FORMULA_NAME ErlangenMainframeV1-PT-bP03C03-LTLFireability-12
FORMULA_NAME ErlangenMainframeV1-PT-bP03C03-LTLFireability-13
FORMULA_NAME ErlangenMainframeV1-PT-bP03C03-LTLFireability-14
FORMULA_NAME ErlangenMainframeV1-PT-bP03C03-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1780261162301

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ErlangenMainframeV1-PT-bP03C03
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-31 20:59:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-31 20:59:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-31 20:59:25] [INFO ] Load time of PNML (sax parser for PT used): 139 ms
[2026-05-31 20:59:25] [INFO ] Transformed 213 places.
[2026-05-31 20:59:25] [INFO ] Transformed 327 transitions.
[2026-05-31 20:59:25] [INFO ] Found NUPN structural information;
[2026-05-31 20:59:25] [INFO ] Parsed PT model containing 213 places and 327 transitions and 1410 arcs in 307 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA ErlangenMainframeV1-PT-bP03C03-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 53 out of 213 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 213/213 places, 327/327 transitions.
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 40 place count 173 transition count 287
Iterating global reduction 0 with 40 rules applied. Total rules applied 80 place count 173 transition count 287
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 99 place count 154 transition count 268
Iterating global reduction 0 with 19 rules applied. Total rules applied 118 place count 154 transition count 268
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 119 place count 153 transition count 267
Iterating global reduction 0 with 1 rules applied. Total rules applied 120 place count 153 transition count 267
Applied a total of 120 rules in 107 ms. Remains 153 /213 variables (removed 60) and now considering 267/327 (removed 60) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7067226772799937770.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8527468277233103761.kers'
[2026-05-31 20:59:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7067226772799937770.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8527468277233103761.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 267 rows 153 cols 1290 entries
Finished phase 1 with 138 SingleSign rule and 3 generalized
[2026-05-31 20:59:25] [INFO ] Computed 12 invariants in 2 ms
Computed 12 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-8527468277233103761.kers
Total runtime 5 ms.
[2026-05-31 20:59:26] [INFO ] Implicit Places using invariants in 452 ms returned []
[2026-05-31 20:59:26] [INFO ] Invariant cache hit.
[2026-05-31 20:59:26] [INFO ] Implicit Places using invariants and state equation in 394 ms returned []
Implicit Place search using SMT with State Equation took 925 ms to find 0 implicit places.
Running 266 sub problems to find dead transitions.
[2026-05-31 20:59:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/152 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 2 (OVERLAPS) 1/153 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 5 (OVERLAPS) 267/420 variables, 153/167 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/420 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 7 (OVERLAPS) 0/420 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 266 unsolved
No progress, stopping.
After SMT solving in domain Real declared 420/420 variables, and 167 constraints, problems are : Problem set: 0 solved, 266 unsolved in 27128 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 266/266 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 266 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/152 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 2 (OVERLAPS) 1/153 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 5 (OVERLAPS) 267/420 variables, 153/167 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/420 variables, 266/433 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/420 variables, 5/438 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/420 variables, 4/442 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/420 variables, 1/443 constraints. Problems are: Problem set: 0 solved, 266 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 420/420 variables, and 443 constraints, problems are : Problem set: 0 solved, 266 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 266/266 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 57656ms problems are : Problem set: 0 solved, 266 unsolved
Search for dead transitions found 0 dead transitions in 57688ms
Starting structural reductions in LTL mode, iteration 1 : 153/213 places, 267/327 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58795 ms. Remains : 153/213 places, 267/327 transitions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 267/267 transitions.
Applied a total of 0 rules in 6 ms. Remains 153 /153 variables (removed 0) and now considering 267/267 (removed 0) transitions.
[2026-05-31 21:00:24] [INFO ] Invariant cache hit.
[2026-05-31 21:00:24] [INFO ] Implicit Places using invariants in 63 ms returned []
[2026-05-31 21:00:24] [INFO ] Invariant cache hit.
[2026-05-31 21:00:24] [INFO ] Implicit Places using invariants and state equation in 207 ms returned []
Implicit Place search using SMT with State Equation took 273 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 280 ms. Remains : 153/153 places, 267/267 transitions.
Support contains 53 out of 153 places after structural reductions.
[2026-05-31 21:00:24] [INFO ] Flatten gal took : 87 ms
[2026-05-31 21:00:25] [INFO ] Flatten gal took : 38 ms
[2026-05-31 21:00:25] [INFO ] Input system was already deterministic with 267 transitions.
RANDOM walk for 40000 steps (8 resets) in 2908 ms. (13 steps per ms) remains 17/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 33 ms. (117 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 40 ms. (97 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 58 ms. (67 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 48 ms. (81 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (8 resets) in 51 ms. (76 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (8 resets) in 25 ms. (153 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (8 resets) in 47 ms. (83 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (8 resets) in 30 ms. (129 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 17/17 properties
[2026-05-31 21:00:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 90/117 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 25/142 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 11/153 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/153 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 267/420 variables, 153/165 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/420 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (OVERLAPS) 0/420 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 420/420 variables, and 165 constraints, problems are : Problem set: 0 solved, 17 unsolved in 1832 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 90/117 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 25/142 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 11/153 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/153 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/153 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (OVERLAPS) 267/420 variables, 153/167 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/420 variables, 17/184 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/420 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 12 (OVERLAPS) 0/420 variables, 1/185 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/420 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 14 (OVERLAPS) 0/420 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 420/420 variables, and 185 constraints, problems are : Problem set: 0 solved, 17 unsolved in 4225 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 6086ms problems are : Problem set: 0 solved, 17 unsolved
Fused 17 Parikh solutions to 16 different solutions.
Parikh walk visited 10 properties in 12615 ms.
Support contains 18 out of 153 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 153/153 places, 267/267 transitions.
Graph (trivial) has 127 edges and 153 vertex of which 9 / 153 are part of one of the 4 SCC in 8 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 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 40 place count 148 transition count 218
Reduce places removed 39 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 58 rules applied. Total rules applied 98 place count 109 transition count 199
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 108 place count 99 transition count 199
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 108 place count 99 transition count 190
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 126 place count 90 transition count 190
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 133 place count 83 transition count 175
Iterating global reduction 3 with 7 rules applied. Total rules applied 140 place count 83 transition count 175
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 140 place count 83 transition count 173
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 144 place count 81 transition count 173
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 146 place count 79 transition count 163
Iterating global reduction 3 with 2 rules applied. Total rules applied 148 place count 79 transition count 163
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 184 place count 61 transition count 145
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 187 place count 58 transition count 138
Iterating global reduction 3 with 3 rules applied. Total rules applied 190 place count 58 transition count 138
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 206 place count 50 transition count 189
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 50 transition count 177
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 219 place count 49 transition count 173
Iterating global reduction 4 with 1 rules applied. Total rules applied 220 place count 49 transition count 173
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 226 place count 49 transition count 167
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 230 place count 49 transition count 163
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 5 with 2 rules applied. Total rules applied 232 place count 48 transition count 173
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 233 place count 48 transition count 172
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 234 place count 47 transition count 172
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 235 place count 47 transition count 182
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 6 with 3 rules applied. Total rules applied 238 place count 46 transition count 180
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 7 with 21 rules applied. Total rules applied 259 place count 46 transition count 159
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 260 place count 45 transition count 158
Applied a total of 260 rules in 136 ms. Remains 45 /153 variables (removed 108) and now considering 158/267 (removed 109) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 137 ms. Remains : 45/153 places, 158/267 transitions.
RANDOM walk for 40000 steps (8 resets) in 667 ms. (59 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (8 resets) in 401 ms. (99 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (8 resets) in 186 ms. (213 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (8 resets) in 224 ms. (177 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (8 resets) in 176 ms. (225 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40002 steps (8 resets) in 189 ms. (210 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (8 resets) in 197 ms. (202 steps per ms) remains 6/6 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13468909261519473892.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5013174568080078946.kers'
[2026-05-31 21:00:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13468909261519473892.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5013174568080078946.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 158 rows 44 cols 1076 entries
Finished phase 1 with 30 SingleSign rule and 3 generalized
[2026-05-31 21:00:45] [INFO ] Computed 12 invariants in 1 ms
Computed 12 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5013174568080078946.kers
Total runtime 2 ms.
[2026-05-31 21:00:45] [INFO ] State equation strengthened by 26 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 15/30 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/38 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 5/43 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 157/200 variables, 43/54 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/200 variables, 24/78 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/200 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 3/203 variables, 2/80 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/203 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/203 variables, 2/83 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/203 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 0/203 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 203/203 variables, and 83 constraints, problems are : Problem set: 0 solved, 6 unsolved in 411 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 45/45 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 15/30 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/38 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 5/43 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 157/200 variables, 43/54 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/200 variables, 24/78 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/200 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/200 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 3/203 variables, 2/81 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/203 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/203 variables, 2/84 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/203 variables, 5/89 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/203 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 0/203 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 203/203 variables, and 89 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1243 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 45/45 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1696ms problems are : Problem set: 0 solved, 6 unsolved
Parikh walk visited 5 properties in 585 ms.
Support contains 5 out of 45 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 45/45 places, 158/158 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 45 transition count 157
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 44 transition count 157
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 8 place count 38 transition count 131
Ensure Unique test removed 3 places
Iterating global reduction 0 with 9 rules applied. Total rules applied 17 place count 35 transition count 131
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 19 place count 33 transition count 101
Iterating global reduction 0 with 2 rules applied. Total rules applied 21 place count 33 transition count 101
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 23 place count 32 transition count 100
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 29 place count 29 transition count 103
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 0 with 7 rules applied. Total rules applied 36 place count 29 transition count 96
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 28 transition count 91
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 28 transition count 91
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 42 place count 28 transition count 87
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 28 transition count 86
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 44 place count 27 transition count 86
Applied a total of 44 rules in 43 ms. Remains 27 /45 variables (removed 18) and now considering 86/158 (removed 72) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 27/45 places, 86/158 transitions.
RANDOM walk for 40000 steps (8 resets) in 1328 ms. (30 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (8 resets) in 686 ms. (58 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 24866 steps, run visited all 1 properties in 86 ms. (steps per millisecond=289 )
Probabilistic random walk after 24866 steps, saw 4689 distinct states, run finished after 95 ms. (steps per millisecond=261 ) properties seen :1
FORMULA ErlangenMainframeV1-PT-bP03C03-LTLFireability-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA ErlangenMainframeV1-PT-bP03C03-LTLFireability-13 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 15 stabilizing places and 15 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0 U X(X((F(p1) U (G(p2)&&X(!p1))))))))'
Support contains 3 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 267/267 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 137 transition count 224
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 137 transition count 224
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 41 place count 128 transition count 172
Ensure Unique test removed 1 places
Iterating global reduction 0 with 10 rules applied. Total rules applied 51 place count 127 transition count 172
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 57 place count 121 transition count 161
Ensure Unique test removed 1 places
Iterating global reduction 0 with 7 rules applied. Total rules applied 64 place count 120 transition count 161
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 67 place count 117 transition count 149
Iterating global reduction 0 with 3 rules applied. Total rules applied 70 place count 117 transition count 149
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 72 place count 115 transition count 147
Iterating global reduction 0 with 2 rules applied. Total rules applied 74 place count 115 transition count 147
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 76 place count 113 transition count 145
Iterating global reduction 0 with 2 rules applied. Total rules applied 78 place count 113 transition count 145
Applied a total of 78 rules in 26 ms. Remains 113 /153 variables (removed 40) and now considering 145/267 (removed 122) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7552935192509679296.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15438189715744455682.kers'
[2026-05-31 21:00:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7552935192509679296.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15438189715744455682.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 145 rows 113 cols 392 entries
Finished phase 1 with 102 SingleSign rule and 1 generalized
[2026-05-31 21:00:49] [INFO ] Computed 10 invariants in 1 ms
Computed 10 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15438189715744455682.kers
Total runtime 1 ms.
[2026-05-31 21:00:49] [INFO ] Implicit Places using invariants in 95 ms returned [21]
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 : 112/153 places, 145/267 transitions.
Applied a total of 0 rules in 7 ms. Remains 112 /112 variables (removed 0) and now considering 145/145 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 133 ms. Remains : 112/153 places, 145/267 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0 U X(X((F(p1) U (G(p2)&&X(!p1))))))))'
Stuttering acceptance computed with spot in 897 ms :[(OR (NOT p2) p1), (OR (NOT p2) p1), (OR (NOT p2) p1), (OR (NOT p2) p1), (NOT p1), (NOT p2), p1, (OR (NOT p2) p1), (OR (NOT p2) p1), (NOT p2), (NOT p2), p1]
Running random walk in product with property : ErlangenMainframeV1-PT-bP03C03-LTLFireability-00
Product exploration explored 100000 steps with 1 reset in 392 ms.
Stack based approach found an accepted trace after 68 steps with 0 reset with depth 69 and stack size 69 in 2 ms.
FORMULA ErlangenMainframeV1-PT-bP03C03-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property ErlangenMainframeV1-PT-bP03C03-LTLFireability-00 finished in 1647 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((X(G(p0))&&(G(p2)||p1)))))'
Support contains 9 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 267/267 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 134 transition count 221
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 134 transition count 221
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 43 place count 129 transition count 215
Ensure Unique test removed 1 places
Iterating global reduction 0 with 6 rules applied. Total rules applied 49 place count 128 transition count 215
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 53 place count 124 transition count 211
Ensure Unique test removed 1 places
Iterating global reduction 0 with 5 rules applied. Total rules applied 58 place count 123 transition count 211
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 60 place count 121 transition count 201
Iterating global reduction 0 with 2 rules applied. Total rules applied 62 place count 121 transition count 201
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 64 place count 119 transition count 199
Iterating global reduction 0 with 2 rules applied. Total rules applied 66 place count 119 transition count 199
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 68 place count 117 transition count 197
Iterating global reduction 0 with 2 rules applied. Total rules applied 70 place count 117 transition count 197
Applied a total of 70 rules in 25 ms. Remains 117 /153 variables (removed 36) and now considering 197/267 (removed 70) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6361032696863328460.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6252110284409970709.kers'
[2026-05-31 21:00:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6361032696863328460.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6252110284409970709.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 197 rows 117 cols 808 entries
Finished phase 1 with 106 SingleSign rule and 1 generalized
[2026-05-31 21:00:51] [INFO ] Computed 10 invariants in 1 ms
Computed 10 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6252110284409970709.kers
Total runtime 2 ms.
[2026-05-31 21:00:51] [INFO ] Implicit Places using invariants in 105 ms returned [25]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 109 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 116/153 places, 197/267 transitions.
Applied a total of 0 rules in 3 ms. Remains 116 /116 variables (removed 0) and now considering 197/197 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 137 ms. Remains : 116/153 places, 197/267 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((X(G(p0))&&(G(p2)||p1)))))'
Stuttering acceptance computed with spot in 263 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (NOT p2)), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : ErlangenMainframeV1-PT-bP03C03-LTLFireability-02
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ErlangenMainframeV1-PT-bP03C03-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV1-PT-bP03C03-LTLFireability-02 finished in 448 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G((p0||X(p0))) U ((p1&&X(p1)) U G(p2))) U p3))'
Support contains 4 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 267/267 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 136 transition count 223
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 136 transition count 223
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 42 place count 128 transition count 172
Ensure Unique test removed 1 places
Iterating global reduction 0 with 9 rules applied. Total rules applied 51 place count 127 transition count 172
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 57 place count 121 transition count 161
Ensure Unique test removed 1 places
Iterating global reduction 0 with 7 rules applied. Total rules applied 64 place count 120 transition count 161
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 66 place count 118 transition count 153
Iterating global reduction 0 with 2 rules applied. Total rules applied 68 place count 118 transition count 153
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 117 transition count 152
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 117 transition count 152
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 116 transition count 151
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 116 transition count 151
Applied a total of 72 rules in 27 ms. Remains 116 /153 variables (removed 37) and now considering 151/267 (removed 116) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1157949933538718016.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6127761938471684762.kers'
[2026-05-31 21:00:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1157949933538718016.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6127761938471684762.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 151 rows 116 cols 420 entries
Finished phase 1 with 105 SingleSign rule and 1 generalized
[2026-05-31 21:00:51] [INFO ] Computed 10 invariants in 2 ms
Computed 10 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-6127761938471684762.kers
Total runtime 3 ms.
[2026-05-31 21:00:51] [INFO ] Implicit Places using invariants in 95 ms returned [20]
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/153 places, 151/267 transitions.
Applied a total of 0 rules in 2 ms. Remains 115 /115 variables (removed 0) and now considering 151/151 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 129 ms. Remains : 115/153 places, 151/267 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G((p0||X(p0))) U ((p1&&X(p1)) U G(p2))) U p3))'
Stuttering acceptance computed with spot in 625 ms :[(NOT p3), (NOT p0), (OR (AND (NOT p0) p2) (AND (NOT p0) p1)), (NOT p2), (AND p2 (NOT p1) (NOT p0)), (AND p2 (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) p1 (NOT p0)), true, (AND p2 (NOT p1)), (NOT p2), (NOT p2)]
Running random walk in product with property : ErlangenMainframeV1-PT-bP03C03-LTLFireability-04
Entered a terminal (fully accepting) state of product in 3 steps with 1 reset in 1 ms.
FORMULA ErlangenMainframeV1-PT-bP03C03-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV1-PT-bP03C03-LTLFireability-04 finished in 877 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 6 out of 153 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 153/153 places, 267/267 transitions.
Graph (trivial) has 133 edges and 153 vertex of which 9 / 153 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 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 37 place count 147 transition count 224
Reduce places removed 36 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 55 rules applied. Total rules applied 92 place count 111 transition count 205
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 102 place count 101 transition count 205
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 102 place count 101 transition count 196
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 120 place count 92 transition count 196
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 131 place count 81 transition count 158
Ensure Unique test removed 1 places
Iterating global reduction 3 with 12 rules applied. Total rules applied 143 place count 80 transition count 158
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 143 place count 80 transition count 156
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 147 place count 78 transition count 156
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 151 place count 74 transition count 126
Ensure Unique test removed 1 places
Iterating global reduction 3 with 5 rules applied. Total rules applied 156 place count 73 transition count 126
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 158 place count 71 transition count 112
Iterating global reduction 3 with 2 rules applied. Total rules applied 160 place count 71 transition count 112
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 200 place count 51 transition count 92
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 204 place count 47 transition count 84
Ensure Unique test removed 1 places
Iterating global reduction 3 with 5 rules applied. Total rules applied 209 place count 46 transition count 84
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 210 place count 45 transition count 76
Iterating global reduction 3 with 1 rules applied. Total rules applied 211 place count 45 transition count 76
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 213 place count 44 transition count 75
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 229 place count 36 transition count 100
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 3 with 13 rules applied. Total rules applied 242 place count 36 transition count 87
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 243 place count 35 transition count 85
Iterating global reduction 4 with 1 rules applied. Total rules applied 244 place count 35 transition count 85
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 250 place count 35 transition count 79
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 253 place count 35 transition count 76
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 5 with 2 rules applied. Total rules applied 255 place count 34 transition count 86
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 257 place count 34 transition count 86
Applied a total of 257 rules in 114 ms. Remains 34 /153 variables (removed 119) and now considering 86/267 (removed 181) transitions.
[2026-05-31 21:00:52] [INFO ] Flow matrix only has 79 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-10917327811724740962.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8502685061643068679.kers'
[2026-05-31 21:00:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10917327811724740962.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8502685061643068679.kers]
Normalized transition count is 78 out of 79 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 78 rows 34 cols 476 entries
Finished phase 1 with 25 SingleSign rule and 0 generalized
[2026-05-31 21:00:52] [INFO ] Computed 9 invariants in 1 ms
Computed 9 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8502685061643068679.kers
Total runtime 2 ms.
[2026-05-31 21:00:52] [INFO ] Implicit Places using invariants in 63 ms returned []
[2026-05-31 21:00:52] [INFO ] Flow matrix only has 79 transitions (discarded 7 similar events)
[2026-05-31 21:00:52] [INFO ] Invariant cache hit.
[2026-05-31 21:00:52] [INFO ] State equation strengthened by 21 read => feed constraints.
[2026-05-31 21:00:52] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 220 ms to find 0 implicit places.
[2026-05-31 21:00:52] [INFO ] Redundant transitions in 3 ms returned []
Running 74 sub problems to find dead transitions.
[2026-05-31 21:00:52] [INFO ] Flow matrix only has 79 transitions (discarded 7 similar events)
[2026-05-31 21:00:52] [INFO ] Invariant cache hit.
[2026-05-31 21:00:52] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (OVERLAPS) 1/34 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (OVERLAPS) 78/112 variables, 34/43 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 20/63 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (OVERLAPS) 1/113 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/113 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 8 (OVERLAPS) 0/113 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Real declared 113/113 variables, and 64 constraints, problems are : Problem set: 0 solved, 74 unsolved in 3212 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 34/34 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 74 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (OVERLAPS) 1/34 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (OVERLAPS) 78/112 variables, 34/43 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 20/63 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 74/137 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/112 variables, 2/139 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/112 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 8 (OVERLAPS) 1/113 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/113 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 10 (OVERLAPS) 0/113 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Int declared 113/113 variables, and 140 constraints, problems are : Problem set: 0 solved, 74 unsolved in 8367 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 34/34 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 11637ms problems are : Problem set: 0 solved, 74 unsolved
Search for dead transitions found 0 dead transitions in 11638ms
Starting structural reductions in SI_LTL mode, iteration 1 : 34/153 places, 86/267 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11985 ms. Remains : 34/153 places, 86/267 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 56 ms :[(NOT p0)]
Running random walk in product with property : ErlangenMainframeV1-PT-bP03C03-LTLFireability-05
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA ErlangenMainframeV1-PT-bP03C03-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV1-PT-bP03C03-LTLFireability-05 finished in 12078 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(p0)&&F(p1)&&F(p2)&&F(p3))))'
Support contains 6 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 267/267 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 135 transition count 222
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 135 transition count 222
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 44 place count 127 transition count 171
Ensure Unique test removed 1 places
Iterating global reduction 0 with 9 rules applied. Total rules applied 53 place count 126 transition count 171
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 59 place count 120 transition count 160
Ensure Unique test removed 1 places
Iterating global reduction 0 with 7 rules applied. Total rules applied 66 place count 119 transition count 160
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 118 transition count 158
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 118 transition count 158
Applied a total of 68 rules in 6 ms. Remains 118 /153 variables (removed 35) and now considering 158/267 (removed 109) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13406474691957909196.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5126570979743502917.kers'
[2026-05-31 21:01:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13406474691957909196.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5126570979743502917.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 158 rows 118 cols 458 entries
Finished phase 1 with 107 SingleSign rule and 1 generalized
[2026-05-31 21:01:04] [INFO ] Computed 10 invariants in 1 ms
Computed 10 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-5126570979743502917.kers
Total runtime 3 ms.
[2026-05-31 21:01:04] [INFO ] Implicit Places using invariants in 82 ms returned [20]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 85 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 117/153 places, 158/267 transitions.
Applied a total of 0 rules in 1 ms. Remains 117 /117 variables (removed 0) and now considering 158/158 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 92 ms. Remains : 117/153 places, 158/267 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(p0)&&F(p1)&&F(p2)&&F(p3))))'
Stuttering acceptance computed with spot in 393 ms :[(OR (NOT p1) (NOT p2) (NOT p3) (NOT p0)), (OR (NOT p3) (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (NOT p1), (NOT p2), (NOT p3), true]
Running random walk in product with property : ErlangenMainframeV1-PT-bP03C03-LTLFireability-06
Product exploration explored 100000 steps with 0 reset in 209 ms.
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ErlangenMainframeV1-PT-bP03C03-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV1-PT-bP03C03-LTLFireability-06 finished in 746 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((G(X(p0)) U p1))||(F((F(p3)&&p2)) U p1))))'
Support contains 11 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 267/267 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 139 transition count 245
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 139 transition count 245
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 32 place count 135 transition count 224
Iterating global reduction 0 with 4 rules applied. Total rules applied 36 place count 135 transition count 224
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 39 place count 132 transition count 216
Iterating global reduction 0 with 3 rules applied. Total rules applied 42 place count 132 transition count 216
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 131 transition count 204
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 131 transition count 204
Applied a total of 44 rules in 10 ms. Remains 131 /153 variables (removed 22) and now considering 204/267 (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-734573438622367434.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9530846323039444400.kers'
[2026-05-31 21:01:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-734573438622367434.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9530846323039444400.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 204 rows 131 cols 834 entries
Finished phase 1 with 116 SingleSign rule and 3 generalized
[2026-05-31 21:01:05] [INFO ] Computed 12 invariants in 1 ms
Computed 12 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-9530846323039444400.kers
Total runtime 2 ms.
[2026-05-31 21:01:05] [INFO ] Implicit Places using invariants in 129 ms returned []
[2026-05-31 21:01:05] [INFO ] Invariant cache hit.
[2026-05-31 21:01:05] [INFO ] Implicit Places using invariants and state equation in 182 ms returned []
Implicit Place search using SMT with State Equation took 314 ms to find 0 implicit places.
Running 203 sub problems to find dead transitions.
[2026-05-31 21:01:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (OVERLAPS) 1/131 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/131 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/131 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 5 (OVERLAPS) 204/335 variables, 131/144 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/335 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 7 (OVERLAPS) 0/335 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 203 unsolved
No progress, stopping.
After SMT solving in domain Real declared 335/335 variables, and 144 constraints, problems are : Problem set: 0 solved, 203 unsolved in 17693 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 131/131 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 203 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (OVERLAPS) 1/131 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/131 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/131 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 5 (OVERLAPS) 204/335 variables, 131/144 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/335 variables, 203/347 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/335 variables, 3/350 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/335 variables, 2/352 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/335 variables, 1/353 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/335 variables, 1/354 constraints. Problems are: Problem set: 0 solved, 203 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 335/335 variables, and 354 constraints, problems are : Problem set: 0 solved, 203 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 131/131 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 47748ms problems are : Problem set: 0 solved, 203 unsolved
Search for dead transitions found 0 dead transitions in 47750ms
Starting structural reductions in LTL mode, iteration 1 : 131/153 places, 204/267 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48076 ms. Remains : 131/153 places, 204/267 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((G(X(p0)) U p1))||(F((F(p3)&&p2)) U p1))))'
Stuttering acceptance computed with spot in 450 ms :[(NOT p1), (OR (AND (NOT p0) p1 (NOT p2)) (AND (NOT p0) p1 (NOT p3))), (NOT p1), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) p1 (NOT p3))), (OR (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (NOT p3), (AND (NOT p3) (NOT p0)), (NOT p1)]
Running random walk in product with property : ErlangenMainframeV1-PT-bP03C03-LTLFireability-07
Product exploration explored 100000 steps with 0 reset in 187 ms.
Stack based approach found an accepted trace after 58 steps with 1 reset with depth 57 and stack size 57 in 1 ms.
FORMULA ErlangenMainframeV1-PT-bP03C03-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property ErlangenMainframeV1-PT-bP03C03-LTLFireability-07 finished in 48810 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((p1&&X(X(F(!p2))))))))'
Support contains 3 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 267/267 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 137 transition count 224
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 137 transition count 224
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 40 place count 129 transition count 173
Ensure Unique test removed 1 places
Iterating global reduction 0 with 9 rules applied. Total rules applied 49 place count 128 transition count 173
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 55 place count 122 transition count 161
Ensure Unique test removed 1 places
Iterating global reduction 0 with 7 rules applied. Total rules applied 62 place count 121 transition count 161
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 64 place count 119 transition count 153
Iterating global reduction 0 with 2 rules applied. Total rules applied 66 place count 119 transition count 153
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 118 transition count 152
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 118 transition count 152
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 117 transition count 151
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 117 transition count 151
Applied a total of 70 rules in 11 ms. Remains 117 /153 variables (removed 36) and now considering 151/267 (removed 116) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5796886254807747672.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2415487276164636291.kers'
[2026-05-31 21:01:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5796886254807747672.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2415487276164636291.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 151 rows 117 cols 420 entries
Finished phase 1 with 106 SingleSign rule and 1 generalized
[2026-05-31 21:01:54] [INFO ] Computed 10 invariants in 4 ms
Computed 10 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-2415487276164636291.kers
Total runtime 5 ms.
[2026-05-31 21:01:54] [INFO ] Implicit Places using invariants in 77 ms returned [19]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 81 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 116/153 places, 151/267 transitions.
Applied a total of 0 rules in 1 ms. Remains 116 /116 variables (removed 0) and now considering 151/151 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 94 ms. Remains : 116/153 places, 151/267 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&&F((p1&&X(X(F(p2))))))))'
Stuttering acceptance computed with spot in 228 ms :[(NOT p2), (NOT p2), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p2) (NOT p1) (NOT p0)), true]
Running random walk in product with property : ErlangenMainframeV1-PT-bP03C03-LTLFireability-08
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ErlangenMainframeV1-PT-bP03C03-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV1-PT-bP03C03-LTLFireability-08 finished in 360 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(p0))&&((!p1 U (p2||G(!p1))) U ((X(F(!p3))&&(!p1 U (p2||G(!p1))))||G((!p1 U (p2||G(!p1))))))))'
Support contains 10 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 267/267 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 135 transition count 222
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 135 transition count 222
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 41 place count 130 transition count 216
Ensure Unique test removed 1 places
Iterating global reduction 0 with 6 rules applied. Total rules applied 47 place count 129 transition count 216
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 51 place count 125 transition count 212
Ensure Unique test removed 1 places
Iterating global reduction 0 with 5 rules applied. Total rules applied 56 place count 124 transition count 212
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 58 place count 122 transition count 202
Iterating global reduction 0 with 2 rules applied. Total rules applied 60 place count 122 transition count 202
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 62 place count 120 transition count 200
Iterating global reduction 0 with 2 rules applied. Total rules applied 64 place count 120 transition count 200
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 66 place count 118 transition count 198
Iterating global reduction 0 with 2 rules applied. Total rules applied 68 place count 118 transition count 198
Applied a total of 68 rules in 21 ms. Remains 118 /153 variables (removed 35) and now considering 198/267 (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-11658828304213037012.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2509899433412956452.kers'
[2026-05-31 21:01:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11658828304213037012.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2509899433412956452.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 198 rows 118 cols 810 entries
Finished phase 1 with 107 SingleSign rule and 1 generalized
[2026-05-31 21:01:54] [INFO ] Computed 10 invariants in 1 ms
Computed 10 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2509899433412956452.kers
Total runtime 2 ms.
[2026-05-31 21:01:54] [INFO ] Implicit Places using invariants in 84 ms returned [25]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 86 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 117/153 places, 198/267 transitions.
Applied a total of 0 rules in 1 ms. Remains 117 /117 variables (removed 0) and now considering 198/198 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 108 ms. Remains : 117/153 places, 198/267 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(p0))&&((!p1 U (p2||G(!p1))) U ((X(F(!p3))&&(!p1 U (p2||G(!p1))))||G((!p1 U (p2||G(!p1))))))))'
Stuttering acceptance computed with spot in 285 ms :[(OR (NOT p0) (AND p1 (NOT p2))), true, (NOT p0), (AND p3 (NOT p2) p1), (AND (NOT p2) p1), (NOT p0), p3]
Running random walk in product with property : ErlangenMainframeV1-PT-bP03C03-LTLFireability-09
Product exploration explored 100000 steps with 39985 reset in 131 ms.
Product exploration explored 100000 steps with 39968 reset in 164 ms.
Computed a total of 15 stabilizing places and 15 stable transitions
Computed a total of 15 stabilizing places and 15 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 16 factoid took 19 ms. Proved property starting from automaton with 7 states, 12 edges and 4 AP (stutter sensitive
Knowledge-based reduction took 34 ms.
FORMULA ErlangenMainframeV1-PT-bP03C03-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ErlangenMainframeV1-PT-bP03C03-LTLFireability-09 finished in 778 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 153 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 153/153 places, 267/267 transitions.
Graph (trivial) has 139 edges and 153 vertex of which 11 / 153 are part of one of the 5 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 37 place count 146 transition count 223
Reduce places removed 36 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 53 rules applied. Total rules applied 90 place count 110 transition count 206
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 99 place count 101 transition count 206
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 99 place count 101 transition count 197
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 117 place count 92 transition count 197
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 127 place count 82 transition count 160
Ensure Unique test removed 1 places
Iterating global reduction 3 with 11 rules applied. Total rules applied 138 place count 81 transition count 160
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 138 place count 81 transition count 158
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 142 place count 79 transition count 158
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 149 place count 72 transition count 100
Ensure Unique test removed 1 places
Iterating global reduction 3 with 8 rules applied. Total rules applied 157 place count 71 transition count 100
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 160 place count 68 transition count 92
Iterating global reduction 3 with 3 rules applied. Total rules applied 163 place count 68 transition count 92
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 209 place count 45 transition count 69
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 213 place count 41 transition count 61
Ensure Unique test removed 1 places
Iterating global reduction 3 with 5 rules applied. Total rules applied 218 place count 40 transition count 61
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 219 place count 39 transition count 59
Iterating global reduction 3 with 1 rules applied. Total rules applied 220 place count 39 transition count 59
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 3 with 2 rules applied. Total rules applied 222 place count 38 transition count 58
Performed 9 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 240 place count 29 transition count 76
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 3 with 13 rules applied. Total rules applied 253 place count 29 transition count 63
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 255 place count 27 transition count 59
Iterating global reduction 4 with 2 rules applied. Total rules applied 257 place count 27 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 267 place count 27 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 269 place count 26 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 283 place count 26 transition count 48
Applied a total of 283 rules in 41 ms. Remains 26 /153 variables (removed 127) and now considering 48/267 (removed 219) transitions.
[2026-05-31 21:01:55] [INFO ] Flow matrix only has 40 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-16581441273642066120.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1315590792562939718.kers'
[2026-05-31 21:01:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16581441273642066120.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1315590792562939718.kers]
Normalized transition count is 39 out of 40 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 39 rows 25 cols 172 entries
Finished phase 1 with 17 SingleSign rule and 0 generalized
[2026-05-31 21:01:55] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1315590792562939718.kers
Total runtime 1 ms.
[2026-05-31 21:01:55] [INFO ] Implicit Places using invariants in 44 ms returned []
[2026-05-31 21:01:55] [INFO ] Flow matrix only has 40 transitions (discarded 8 similar events)
[2026-05-31 21:01:55] [INFO ] Invariant cache hit.
[2026-05-31 21:01:55] [INFO ] State equation strengthened by 16 read => feed constraints.
[2026-05-31 21:01:55] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
[2026-05-31 21:01:55] [INFO ] Redundant transitions in 0 ms returned []
Running 40 sub problems to find dead transitions.
[2026-05-31 21:01:55] [INFO ] Flow matrix only has 40 transitions (discarded 8 similar events)
[2026-05-31 21:01:55] [INFO ] Invariant cache hit.
[2026-05-31 21:01:55] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (OVERLAPS) 1/26 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (OVERLAPS) 39/65 variables, 26/35 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 15/50 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (OVERLAPS) 1/66 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/66 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 8 (OVERLAPS) 0/66 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Real declared 66/66 variables, and 51 constraints, problems are : Problem set: 0 solved, 40 unsolved in 1615 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 26/26 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 40 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (OVERLAPS) 1/26 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (OVERLAPS) 39/65 variables, 26/35 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 15/50 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 40/90 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (OVERLAPS) 1/66 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/66 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 9 (OVERLAPS) 0/66 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Int declared 66/66 variables, and 91 constraints, problems are : Problem set: 0 solved, 40 unsolved in 1521 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 26/26 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3145ms problems are : Problem set: 0 solved, 40 unsolved
Search for dead transitions found 0 dead transitions in 3146ms
Starting structural reductions in SI_LTL mode, iteration 1 : 26/153 places, 48/267 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3314 ms. Remains : 26/153 places, 48/267 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 83 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ErlangenMainframeV1-PT-bP03C03-LTLFireability-10
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA ErlangenMainframeV1-PT-bP03C03-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV1-PT-bP03C03-LTLFireability-10 finished in 3429 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(G(p1))&&p0))))'
Support contains 8 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 267/267 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 135 transition count 230
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 135 transition count 230
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 41 place count 130 transition count 207
Ensure Unique test removed 1 places
Iterating global reduction 0 with 6 rules applied. Total rules applied 47 place count 129 transition count 207
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 51 place count 125 transition count 192
Ensure Unique test removed 1 places
Iterating global reduction 0 with 5 rules applied. Total rules applied 56 place count 124 transition count 192
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 58 place count 122 transition count 175
Iterating global reduction 0 with 2 rules applied. Total rules applied 60 place count 122 transition count 175
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 121 transition count 174
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 121 transition count 174
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 120 transition count 173
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 120 transition count 173
Applied a total of 64 rules in 10 ms. Remains 120 /153 variables (removed 33) and now considering 173/267 (removed 94) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2295665848408722908.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17947479042610871597.kers'
[2026-05-31 21:01:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2295665848408722908.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17947479042610871597.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 173 rows 120 cols 572 entries
Finished phase 1 with 109 SingleSign rule and 1 generalized
[2026-05-31 21:01:58] [INFO ] Computed 10 invariants in 1 ms
Computed 10 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17947479042610871597.kers
Total runtime 1 ms.
[2026-05-31 21:01:58] [INFO ] Implicit Places using invariants in 81 ms returned [23]
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 : 119/153 places, 173/267 transitions.
Applied a total of 0 rules in 1 ms. Remains 119 /119 variables (removed 0) and now considering 173/173 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 110 ms. Remains : 119/153 places, 173/267 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(G(p1))&&p0))))'
Stuttering acceptance computed with spot in 259 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : ErlangenMainframeV1-PT-bP03C03-LTLFireability-11
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ErlangenMainframeV1-PT-bP03C03-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV1-PT-bP03C03-LTLFireability-11 finished in 409 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0&&(p1 U p2)))))'
Support contains 5 out of 153 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 153/153 places, 267/267 transitions.
Graph (trivial) has 135 edges and 153 vertex of which 11 / 153 are part of one of the 5 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 36 place count 146 transition count 224
Reduce places removed 35 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 50 rules applied. Total rules applied 86 place count 111 transition count 209
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 93 place count 104 transition count 209
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 93 place count 104 transition count 201
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 109 place count 96 transition count 201
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 119 place count 86 transition count 164
Ensure Unique test removed 1 places
Iterating global reduction 3 with 11 rules applied. Total rules applied 130 place count 85 transition count 164
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 130 place count 85 transition count 162
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 134 place count 83 transition count 162
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 139 place count 78 transition count 114
Ensure Unique test removed 1 places
Iterating global reduction 3 with 6 rules applied. Total rules applied 145 place count 77 transition count 114
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 148 place count 74 transition count 106
Iterating global reduction 3 with 3 rules applied. Total rules applied 151 place count 74 transition count 106
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 195 place count 52 transition count 84
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 198 place count 49 transition count 73
Ensure Unique test removed 1 places
Iterating global reduction 3 with 4 rules applied. Total rules applied 202 place count 48 transition count 73
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 203 place count 47 transition count 71
Iterating global reduction 3 with 1 rules applied. Total rules applied 204 place count 47 transition count 71
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 206 place count 46 transition count 70
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -40
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 224 place count 37 transition count 110
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 235 place count 37 transition count 99
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 236 place count 36 transition count 97
Iterating global reduction 4 with 1 rules applied. Total rules applied 237 place count 36 transition count 97
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 238 place count 36 transition count 96
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 244 place count 36 transition count 90
Applied a total of 244 rules in 48 ms. Remains 36 /153 variables (removed 117) and now considering 90/267 (removed 177) transitions.
[2026-05-31 21:01:59] [INFO ] Flow matrix only has 81 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-1981573237465260334.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10615299817554834436.kers'
[2026-05-31 21:01:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1981573237465260334.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10615299817554834436.kers]
Normalized transition count is 80 out of 81 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 80 rows 35 cols 373 entries
Finished phase 1 with 27 SingleSign rule and 0 generalized
[2026-05-31 21:01:59] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10615299817554834436.kers
Total runtime 1 ms.
[2026-05-31 21:01:59] [INFO ] Implicit Places using invariants in 60 ms returned []
[2026-05-31 21:01:59] [INFO ] Flow matrix only has 81 transitions (discarded 9 similar events)
[2026-05-31 21:01:59] [INFO ] Invariant cache hit.
[2026-05-31 21:01:59] [INFO ] State equation strengthened by 16 read => feed constraints.
[2026-05-31 21:01:59] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 173 ms to find 0 implicit places.
[2026-05-31 21:01:59] [INFO ] Redundant transitions in 3 ms returned []
Running 85 sub problems to find dead transitions.
[2026-05-31 21:01:59] [INFO ] Flow matrix only has 81 transitions (discarded 9 similar events)
[2026-05-31 21:01:59] [INFO ] Invariant cache hit.
[2026-05-31 21:01:59] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (OVERLAPS) 1/36 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 3 (OVERLAPS) 80/116 variables, 36/45 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 15/60 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 6 (OVERLAPS) 1/117 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 8 (OVERLAPS) 0/117 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Real declared 117/117 variables, and 61 constraints, problems are : Problem set: 0 solved, 85 unsolved in 4362 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 36/36 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 85 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (OVERLAPS) 1/36 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 3 (OVERLAPS) 80/116 variables, 36/45 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 15/60 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 85/145 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 7 (OVERLAPS) 1/117 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/117 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 9 (OVERLAPS) 0/117 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Int declared 117/117 variables, and 146 constraints, problems are : Problem set: 0 solved, 85 unsolved in 5732 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 36/36 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10121ms problems are : Problem set: 0 solved, 85 unsolved
Search for dead transitions found 0 dead transitions in 10122ms
Starting structural reductions in SI_LTL mode, iteration 1 : 36/153 places, 90/267 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10354 ms. Remains : 36/153 places, 90/267 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0&&(p1 U p2)))))'
Stuttering acceptance computed with spot in 78 ms :[(OR (NOT p0) (NOT p2)), (NOT p2)]
Running random walk in product with property : ErlangenMainframeV1-PT-bP03C03-LTLFireability-12
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA ErlangenMainframeV1-PT-bP03C03-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV1-PT-bP03C03-LTLFireability-12 finished in 10461 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||(p0&&F((p1&&X(F((F(!p0)&&p2))))))))'
Support contains 5 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 267/267 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 135 transition count 222
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 135 transition count 222
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 45 place count 126 transition count 170
Ensure Unique test removed 1 places
Iterating global reduction 0 with 10 rules applied. Total rules applied 55 place count 125 transition count 170
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 63 place count 117 transition count 156
Ensure Unique test removed 1 places
Iterating global reduction 0 with 9 rules applied. Total rules applied 72 place count 116 transition count 156
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 73 place count 115 transition count 154
Iterating global reduction 0 with 1 rules applied. Total rules applied 74 place count 115 transition count 154
Applied a total of 74 rules in 5 ms. Remains 115 /153 variables (removed 38) and now considering 154/267 (removed 113) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9153228730246013822.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1558619055412726621.kers'
[2026-05-31 21:02:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9153228730246013822.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1558619055412726621.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 154 rows 115 cols 450 entries
Finished phase 1 with 104 SingleSign rule and 1 generalized
[2026-05-31 21:02:09] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-1558619055412726621.kers
Total runtime 4 ms.
[2026-05-31 21:02:09] [INFO ] Implicit Places using invariants in 65 ms returned [19]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 75 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 114/153 places, 154/267 transitions.
Applied a total of 0 rules in 1 ms. Remains 114 /114 variables (removed 0) and now considering 154/154 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 81 ms. Remains : 114/153 places, 154/267 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||(p0&&F((p1&&X(F((F(!p0)&&p2))))))))'
Stuttering acceptance computed with spot in 235 ms :[p0, (OR (NOT p2) p0), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), true, (OR (NOT p1) (NOT p2) p0)]
Running random walk in product with property : ErlangenMainframeV1-PT-bP03C03-LTLFireability-14
Product exploration explored 100000 steps with 0 reset in 99 ms.
Stack based approach found an accepted trace after 132 steps with 0 reset with depth 133 and stack size 129 in 1 ms.
FORMULA ErlangenMainframeV1-PT-bP03C03-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property ErlangenMainframeV1-PT-bP03C03-LTLFireability-14 finished in 448 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(p0)&&(p1||X(G(p0))||G(p2)))))'
Support contains 11 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 267/267 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 135 transition count 225
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 135 transition count 225
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 41 place count 130 transition count 203
Iterating global reduction 0 with 5 rules applied. Total rules applied 46 place count 130 transition count 203
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 50 place count 126 transition count 198
Iterating global reduction 0 with 4 rules applied. Total rules applied 54 place count 126 transition count 198
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 56 place count 124 transition count 188
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 124 transition count 188
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 60 place count 122 transition count 186
Iterating global reduction 0 with 2 rules applied. Total rules applied 62 place count 122 transition count 186
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 64 place count 120 transition count 184
Iterating global reduction 0 with 2 rules applied. Total rules applied 66 place count 120 transition count 184
Applied a total of 66 rules in 11 ms. Remains 120 /153 variables (removed 33) and now considering 184/267 (removed 83) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7708947474134187663.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1546901320380131225.kers'
[2026-05-31 21:02:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7708947474134187663.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1546901320380131225.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 184 rows 120 cols 790 entries
Finished phase 1 with 106 SingleSign rule and 2 generalized
[2026-05-31 21:02:10] [INFO ] Computed 12 invariants in 1 ms
Computed 12 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1546901320380131225.kers
Total runtime 2 ms.
[2026-05-31 21:02:10] [INFO ] Implicit Places using invariants in 80 ms returned []
[2026-05-31 21:02:10] [INFO ] Invariant cache hit.
[2026-05-31 21:02:10] [INFO ] Implicit Places using invariants and state equation in 187 ms returned []
Implicit Place search using SMT with State Equation took 270 ms to find 0 implicit places.
Running 183 sub problems to find dead transitions.
[2026-05-31 21:02:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/119 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 2 (OVERLAPS) 1/120 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 5 (OVERLAPS) 184/304 variables, 120/133 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/304 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 7 (OVERLAPS) 0/304 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 183 unsolved
No progress, stopping.
After SMT solving in domain Real declared 304/304 variables, and 133 constraints, problems are : Problem set: 0 solved, 183 unsolved in 14966 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 120/120 constraints, PredecessorRefiner: 183/183 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 183 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/119 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 2 (OVERLAPS) 1/120 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 5 (OVERLAPS) 184/304 variables, 120/133 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/304 variables, 183/316 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/304 variables, 5/321 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/304 variables, 1/322 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/304 variables, 1/323 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/304 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 183 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 304/304 variables, and 323 constraints, problems are : Problem set: 0 solved, 183 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 120/120 constraints, PredecessorRefiner: 183/183 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 45015ms problems are : Problem set: 0 solved, 183 unsolved
Search for dead transitions found 0 dead transitions in 45016ms
Starting structural reductions in LTL mode, iteration 1 : 120/153 places, 184/267 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45299 ms. Remains : 120/153 places, 184/267 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(p0)&&(X(G(p0))||G(p1)||p2))))'
Stuttering acceptance computed with spot in 306 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : ErlangenMainframeV1-PT-bP03C03-LTLFireability-15
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ErlangenMainframeV1-PT-bP03C03-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV1-PT-bP03C03-LTLFireability-15 finished in 45646 ms.
All properties solved by simple procedures.
Total runtime 210780 ms.

BK_STOP 1780261375680

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ErlangenMainframeV1-PT-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 ErlangenMainframeV1-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-178021499100068"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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