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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 7.6K May 27 08:42 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K May 27 08:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K May 27 08:41 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K May 27 08:41 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K May 27 10:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K 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 19K May 27 10:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 26 18:17 NewModel
-rw-r--r-- 1 mcc users 12K May 27 08:42 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 121K May 27 08:42 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K May 27 08:42 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K May 27 08:42 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 64K 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-bP02C02-LTLFireability-00
FORMULA_NAME ErlangenMainframeV1-PT-bP02C02-LTLFireability-01
FORMULA_NAME ErlangenMainframeV1-PT-bP02C02-LTLFireability-02
FORMULA_NAME ErlangenMainframeV1-PT-bP02C02-LTLFireability-03
FORMULA_NAME ErlangenMainframeV1-PT-bP02C02-LTLFireability-04
FORMULA_NAME ErlangenMainframeV1-PT-bP02C02-LTLFireability-05
FORMULA_NAME ErlangenMainframeV1-PT-bP02C02-LTLFireability-06
FORMULA_NAME ErlangenMainframeV1-PT-bP02C02-LTLFireability-07
FORMULA_NAME ErlangenMainframeV1-PT-bP02C02-LTLFireability-08
FORMULA_NAME ErlangenMainframeV1-PT-bP02C02-LTLFireability-09
FORMULA_NAME ErlangenMainframeV1-PT-bP02C02-LTLFireability-10
FORMULA_NAME ErlangenMainframeV1-PT-bP02C02-LTLFireability-11
FORMULA_NAME ErlangenMainframeV1-PT-bP02C02-LTLFireability-12
FORMULA_NAME ErlangenMainframeV1-PT-bP02C02-LTLFireability-13
FORMULA_NAME ErlangenMainframeV1-PT-bP02C02-LTLFireability-14
FORMULA_NAME ErlangenMainframeV1-PT-bP02C02-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1780260563104

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-bP02C02
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-31 20:49:25] [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:49:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-31 20:49:25] [INFO ] Load time of PNML (sax parser for PT used): 116 ms
[2026-05-31 20:49:25] [INFO ] Transformed 193 places.
[2026-05-31 20:49:25] [INFO ] Transformed 255 transitions.
[2026-05-31 20:49:25] [INFO ] Found NUPN structural information;
[2026-05-31 20:49:25] [INFO ] Parsed PT model containing 193 places and 255 transitions and 805 arcs in 269 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ErlangenMainframeV1-PT-bP02C02-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV1-PT-bP02C02-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV1-PT-bP02C02-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 37 out of 193 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 255/255 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 36 place count 157 transition count 219
Iterating global reduction 0 with 36 rules applied. Total rules applied 72 place count 157 transition count 219
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 84 place count 145 transition count 207
Iterating global reduction 0 with 12 rules applied. Total rules applied 96 place count 145 transition count 207
Applied a total of 96 rules in 69 ms. Remains 145 /193 variables (removed 48) and now considering 207/255 (removed 48) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1915651506308286769.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10077418793334624000.kers'
[2026-05-31 20:49:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1915651506308286769.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10077418793334624000.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 207 rows 145 cols 709 entries
Finished phase 1 with 132 SingleSign rule and 3 generalized
[2026-05-31 20:49:25] [INFO ] Computed 10 invariants in 1 ms
Computed 10 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-10077418793334624000.kers
Total runtime 2 ms.
[2026-05-31 20:49:26] [INFO ] Implicit Places using invariants in 349 ms returned []
[2026-05-31 20:49:26] [INFO ] Invariant cache hit.
[2026-05-31 20:49:26] [INFO ] Implicit Places using invariants and state equation in 280 ms returned []
Implicit Place search using SMT with State Equation took 681 ms to find 0 implicit places.
Running 206 sub problems to find dead transitions.
[2026-05-31 20:49:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/144 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 2 (OVERLAPS) 1/145 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/145 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/145 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 5 (OVERLAPS) 207/352 variables, 145/158 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/352 variables, 2/160 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/352 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 8 (OVERLAPS) 0/352 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 206 unsolved
No progress, stopping.
After SMT solving in domain Real declared 352/352 variables, and 160 constraints, problems are : Problem set: 0 solved, 206 unsolved in 20852 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 145/145 constraints, PredecessorRefiner: 206/206 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 206 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/144 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 2 (OVERLAPS) 1/145 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/145 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/145 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/145 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 8 (OVERLAPS) 207/352 variables, 145/166 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/352 variables, 206/372 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/352 variables, 2/374 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/352 variables, 1/375 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/352 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 206 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 352/352 variables, and 375 constraints, problems are : Problem set: 0 solved, 206 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 145/145 constraints, PredecessorRefiner: 206/206 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 51046ms problems are : Problem set: 0 solved, 206 unsolved
Search for dead transitions found 0 dead transitions in 51066ms
Starting structural reductions in LTL mode, iteration 1 : 145/193 places, 207/255 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51868 ms. Remains : 145/193 places, 207/255 transitions.
Starting structural reductions in LTL mode, iteration 0 : 145/145 places, 207/207 transitions.
Applied a total of 0 rules in 7 ms. Remains 145 /145 variables (removed 0) and now considering 207/207 (removed 0) transitions.
[2026-05-31 20:50:17] [INFO ] Invariant cache hit.
[2026-05-31 20:50:17] [INFO ] Implicit Places using invariants in 114 ms returned []
[2026-05-31 20:50:17] [INFO ] Invariant cache hit.
[2026-05-31 20:50:17] [INFO ] Implicit Places using invariants and state equation in 218 ms returned []
Implicit Place search using SMT with State Equation took 335 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 342 ms. Remains : 145/145 places, 207/207 transitions.
Support contains 37 out of 145 places after structural reductions.
[2026-05-31 20:50:18] [INFO ] Flatten gal took : 91 ms
[2026-05-31 20:50:18] [INFO ] Flatten gal took : 44 ms
[2026-05-31 20:50:18] [INFO ] Input system was already deterministic with 207 transitions.
RANDOM walk for 40000 steps (8 resets) in 2149 ms. (18 steps per ms) remains 5/30 properties
BEST_FIRST walk for 40000 steps (8 resets) in 693 ms. (57 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40001 steps (8 resets) in 105 ms. (377 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (8 resets) in 111 ms. (357 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40000 steps (8 resets) in 135 ms. (294 steps per ms) remains 3/3 properties
[2026-05-31 20:50:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 45/54 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 80/134 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 11/145 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 207/352 variables, 145/155 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/352 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/352 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 352/352 variables, and 155 constraints, problems are : Problem set: 0 solved, 3 unsolved in 348 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 145/145 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 45/54 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 80/134 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 11/145 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 207/352 variables, 145/155 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/352 variables, 3/158 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/352 variables, 2/160 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/352 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/352 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 352/352 variables, and 160 constraints, problems are : Problem set: 0 solved, 3 unsolved in 553 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 145/145 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 909ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 2 properties in 350 ms.
Support contains 3 out of 145 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 145/145 places, 207/207 transitions.
Graph (trivial) has 137 edges and 145 vertex of which 11 / 145 are part of one of the 5 SCC in 10 ms
Free SCC test removed 6 places
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Reduce isomorphic transitions removed 12 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 139 transition count 159
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 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 57 rules applied. Total rules applied 94 place count 103 transition count 138
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 106 place count 91 transition count 138
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 106 place count 91 transition count 128
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 126 place count 81 transition count 128
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 136 place count 71 transition count 116
Iterating global reduction 3 with 10 rules applied. Total rules applied 146 place count 71 transition count 116
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 146 place count 71 transition count 112
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 154 place count 67 transition count 112
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 160 place count 61 transition count 81
Iterating global reduction 3 with 6 rules applied. Total rules applied 166 place count 61 transition count 81
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 167 place count 60 transition count 77
Iterating global reduction 3 with 1 rules applied. Total rules applied 168 place count 60 transition count 77
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 206 place count 41 transition count 58
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 208 place count 39 transition count 55
Iterating global reduction 3 with 2 rules applied. Total rules applied 210 place count 39 transition count 55
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -20
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 226 place count 31 transition count 75
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 238 place count 31 transition count 63
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 241 place count 28 transition count 50
Iterating global reduction 4 with 3 rules applied. Total rules applied 244 place count 28 transition count 50
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 249 place count 28 transition count 45
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 253 place count 26 transition count 59
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 254 place count 26 transition count 58
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 6 with 16 rules applied. Total rules applied 270 place count 26 transition count 42
Free-agglomeration rule applied 5 times.
Iterating global reduction 6 with 5 rules applied. Total rules applied 275 place count 26 transition count 37
Reduce places removed 5 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 10 rules applied. Total rules applied 285 place count 21 transition count 32
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 286 place count 21 transition count 31
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 287 place count 20 transition count 30
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 288 place count 19 transition count 30
Applied a total of 288 rules in 123 ms. Remains 19 /145 variables (removed 126) and now considering 30/207 (removed 177) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 123 ms. Remains : 19/145 places, 30/207 transitions.
RANDOM walk for 451 steps (7 resets) in 26 ms. (16 steps per ms) remains 0/1 properties
Computed a total of 17 stabilizing places and 17 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(X(p0))) U ((X(X(X(p0)))&&(p1 U (p2||G(p1))))||X(X(X(G(p0)))))))'
Support contains 4 out of 145 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 145/145 places, 207/207 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 133 transition count 192
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 133 transition count 192
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 32 place count 125 transition count 167
Ensure Unique test removed 1 places
Iterating global reduction 0 with 9 rules applied. Total rules applied 41 place count 124 transition count 167
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 46 place count 119 transition count 157
Iterating global reduction 0 with 5 rules applied. Total rules applied 51 place count 119 transition count 157
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 53 place count 117 transition count 150
Iterating global reduction 0 with 2 rules applied. Total rules applied 55 place count 117 transition count 150
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 56 place count 116 transition count 149
Iterating global reduction 0 with 1 rules applied. Total rules applied 57 place count 116 transition count 149
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 58 place count 115 transition count 148
Iterating global reduction 0 with 1 rules applied. Total rules applied 59 place count 115 transition count 148
Applied a total of 59 rules in 30 ms. Remains 115 /145 variables (removed 30) and now considering 148/207 (removed 59) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12400629258534222164.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6590226741952347894.kers'
[2026-05-31 20:50:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12400629258534222164.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6590226741952347894.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 148 rows 115 cols 400 entries
Finished phase 1 with 105 SingleSign rule and 1 generalized
[2026-05-31 20:50:21] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6590226741952347894.kers
Total runtime 1 ms.
[2026-05-31 20:50:21] [INFO ] Implicit Places using invariants in 63 ms returned [13]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 67 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 114/145 places, 148/207 transitions.
Applied a total of 0 rules in 2 ms. Remains 114 /114 variables (removed 0) and now considering 148/148 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 99 ms. Remains : 114/145 places, 148/207 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(X(p0))) U (X(X(X(G(p0))))||(X(X(X(p0)))&&(p1 U (p2||G(p1)))))))'
Stuttering acceptance computed with spot in 599 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p0), (NOT p0), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2) (NOT p1)), true, (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) p0)]
Running random walk in product with property : ErlangenMainframeV1-PT-bP02C02-LTLFireability-00
Entered a terminal (fully accepting) state of product in 20 steps with 3 reset in 3 ms.
FORMULA ErlangenMainframeV1-PT-bP02C02-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV1-PT-bP02C02-LTLFireability-00 finished in 831 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(p0))||G(p1)))))'
Support contains 2 out of 145 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 145/145 places, 207/207 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 130 transition count 189
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 130 transition count 189
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 41 place count 119 transition count 161
Ensure Unique test removed 1 places
Iterating global reduction 0 with 12 rules applied. Total rules applied 53 place count 118 transition count 161
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 59 place count 112 transition count 150
Iterating global reduction 0 with 6 rules applied. Total rules applied 65 place count 112 transition count 150
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 69 place count 108 transition count 137
Iterating global reduction 0 with 4 rules applied. Total rules applied 73 place count 108 transition count 137
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 75 place count 106 transition count 135
Iterating global reduction 0 with 2 rules applied. Total rules applied 77 place count 106 transition count 135
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 79 place count 104 transition count 133
Iterating global reduction 0 with 2 rules applied. Total rules applied 81 place count 104 transition count 133
Applied a total of 81 rules in 15 ms. Remains 104 /145 variables (removed 41) and now considering 133/207 (removed 74) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4219549023978822950.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8919745753724006185.kers'
[2026-05-31 20:50:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4219549023978822950.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8919745753724006185.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 133 rows 104 cols 354 entries
Finished phase 1 with 94 SingleSign rule and 1 generalized
[2026-05-31 20:50:22] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8919745753724006185.kers
Total runtime 1 ms.
[2026-05-31 20:50:22] [INFO ] Implicit Places using invariants in 63 ms returned [13]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 65 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 103/145 places, 133/207 transitions.
Applied a total of 0 rules in 1 ms. Remains 103 /103 variables (removed 0) and now considering 133/133 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 81 ms. Remains : 103/145 places, 133/207 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(p0))||G(p1)))))'
Stuttering acceptance computed with spot in 148 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ErlangenMainframeV1-PT-bP02C02-LTLFireability-01
Product exploration explored 100000 steps with 0 reset in 323 ms.
Stack based approach found an accepted trace after 100 steps with 0 reset with depth 101 and stack size 96 in 1 ms.
FORMULA ErlangenMainframeV1-PT-bP02C02-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property ErlangenMainframeV1-PT-bP02C02-LTLFireability-01 finished in 599 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(F(p0)) U (F(p0)&&G(!p1)))))'
Support contains 4 out of 145 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 145/145 places, 207/207 transitions.
Graph (trivial) has 132 edges and 145 vertex of which 11 / 145 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 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 32 place count 138 transition count 168
Reduce places removed 31 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 1 with 50 rules applied. Total rules applied 82 place count 107 transition count 149
Reduce places removed 11 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 12 rules applied. Total rules applied 94 place count 96 transition count 148
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 97 place count 95 transition count 146
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 98 place count 94 transition count 146
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 10 Pre rules applied. Total rules applied 98 place count 94 transition count 136
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 5 with 20 rules applied. Total rules applied 118 place count 84 transition count 136
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 129 place count 73 transition count 123
Iterating global reduction 5 with 11 rules applied. Total rules applied 140 place count 73 transition count 123
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 140 place count 73 transition count 120
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 146 place count 70 transition count 120
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 152 place count 64 transition count 89
Iterating global reduction 5 with 6 rules applied. Total rules applied 158 place count 64 transition count 89
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 159 place count 63 transition count 85
Iterating global reduction 5 with 1 rules applied. Total rules applied 160 place count 63 transition count 85
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 5 with 38 rules applied. Total rules applied 198 place count 44 transition count 66
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 200 place count 42 transition count 63
Iterating global reduction 5 with 2 rules applied. Total rules applied 202 place count 42 transition count 63
Performed 7 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 216 place count 35 transition count 84
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 5 with 13 rules applied. Total rules applied 229 place count 35 transition count 71
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 231 place count 33 transition count 67
Iterating global reduction 6 with 2 rules applied. Total rules applied 233 place count 33 transition count 67
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 6 with 10 rules applied. Total rules applied 243 place count 33 transition count 57
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 7 with 2 rules applied. Total rules applied 245 place count 32 transition count 70
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 7 with 13 rules applied. Total rules applied 258 place count 32 transition count 57
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 259 place count 31 transition count 56
Applied a total of 259 rules in 57 ms. Remains 31 /145 variables (removed 114) and now considering 56/207 (removed 151) transitions.
[2026-05-31 20:50:23] [INFO ] Flow matrix only has 49 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-14316958636357841893.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8619560748152271011.kers'
[2026-05-31 20:50:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14316958636357841893.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8619560748152271011.kers]
Normalized transition count is 48 out of 49 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 48 rows 29 cols 194 entries
Finished phase 1 with 19 SingleSign rule and 2 generalized
[2026-05-31 20:50:23] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8619560748152271011.kers
Total runtime 1 ms.
[2026-05-31 20:50:23] [INFO ] Implicit Places using invariants in 54 ms returned []
[2026-05-31 20:50:23] [INFO ] Flow matrix only has 49 transitions (discarded 7 similar events)
[2026-05-31 20:50:23] [INFO ] Invariant cache hit.
[2026-05-31 20:50:23] [INFO ] State equation strengthened by 6 read => feed constraints.
[2026-05-31 20:50:23] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 128 ms to find 0 implicit places.
[2026-05-31 20:50:23] [INFO ] Redundant transitions in 1 ms returned []
Running 34 sub problems to find dead transitions.
[2026-05-31 20:50:23] [INFO ] Flow matrix only has 49 transitions (discarded 7 similar events)
[2026-05-31 20:50:23] [INFO ] Invariant cache hit.
[2026-05-31 20:50:23] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 3 (OVERLAPS) 5/31 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 5 (OVERLAPS) 48/79 variables, 31/41 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/79 variables, 6/47 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/79 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 8 (OVERLAPS) 0/79 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 34 unsolved
No progress, stopping.
After SMT solving in domain Real declared 79/80 variables, and 47 constraints, problems are : Problem set: 0 solved, 34 unsolved in 921 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 31/31 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 34/34 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 34 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 3 (OVERLAPS) 5/31 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 5 (OVERLAPS) 48/79 variables, 31/41 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/79 variables, 6/47 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/79 variables, 34/81 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/79 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 9 (OVERLAPS) 0/79 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 34 unsolved
No progress, stopping.
After SMT solving in domain Int declared 79/80 variables, and 81 constraints, problems are : Problem set: 0 solved, 34 unsolved in 1224 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 31/31 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 34/34 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2164ms problems are : Problem set: 0 solved, 34 unsolved
Search for dead transitions found 0 dead transitions in 2165ms
Starting structural reductions in SI_LTL mode, iteration 1 : 31/145 places, 56/207 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2359 ms. Remains : 31/145 places, 56/207 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(F(p0)) U (F(p0)&&G(!p1)))))'
Stuttering acceptance computed with spot in 275 ms :[(OR (NOT p0) p1), (NOT p0), (NOT p0), (OR (NOT p0) p1), p1]
Running random walk in product with property : ErlangenMainframeV1-PT-bP02C02-LTLFireability-02
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA ErlangenMainframeV1-PT-bP02C02-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV1-PT-bP02C02-LTLFireability-02 finished in 2690 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(p0))&&(G(p1)||(p1&&F(p2))))))'
Support contains 5 out of 145 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 145/145 places, 207/207 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 130 transition count 189
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 130 transition count 189
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 41 place count 119 transition count 161
Ensure Unique test removed 1 places
Iterating global reduction 0 with 12 rules applied. Total rules applied 53 place count 118 transition count 161
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 59 place count 112 transition count 150
Iterating global reduction 0 with 6 rules applied. Total rules applied 65 place count 112 transition count 150
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 69 place count 108 transition count 137
Iterating global reduction 0 with 4 rules applied. Total rules applied 73 place count 108 transition count 137
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 75 place count 106 transition count 135
Iterating global reduction 0 with 2 rules applied. Total rules applied 77 place count 106 transition count 135
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 79 place count 104 transition count 133
Iterating global reduction 0 with 2 rules applied. Total rules applied 81 place count 104 transition count 133
Applied a total of 81 rules in 34 ms. Remains 104 /145 variables (removed 41) and now considering 133/207 (removed 74) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6230098727190107493.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5719856345062941786.kers'
[2026-05-31 20:50:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6230098727190107493.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5719856345062941786.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 133 rows 104 cols 354 entries
Finished phase 1 with 94 SingleSign rule and 1 generalized
[2026-05-31 20:50:25] [INFO ] Computed 9 invariants in 1 ms
Computed 9 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-5719856345062941786.kers
Total runtime 2 ms.
[2026-05-31 20:50:25] [INFO ] Implicit Places using invariants in 91 ms returned [13]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 97 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 103/145 places, 133/207 transitions.
Applied a total of 0 rules in 5 ms. Remains 103 /103 variables (removed 0) and now considering 133/133 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 136 ms. Remains : 103/145 places, 133/207 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(p0))&&(G(p1)||(p1&&F(p2))))))'
Stuttering acceptance computed with spot in 300 ms :[true, (OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : ErlangenMainframeV1-PT-bP02C02-LTLFireability-05
Product exploration explored 100000 steps with 0 reset in 273 ms.
Entered a terminal (fully accepting) state of product in 49 steps with 0 reset in 0 ms.
FORMULA ErlangenMainframeV1-PT-bP02C02-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV1-PT-bP02C02-LTLFireability-05 finished in 762 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0) U p1) U X(p2)))'
Support contains 6 out of 145 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 145/145 places, 207/207 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 130 transition count 189
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 130 transition count 189
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 38 place count 122 transition count 172
Iterating global reduction 0 with 8 rules applied. Total rules applied 46 place count 122 transition count 172
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 49 place count 119 transition count 164
Iterating global reduction 0 with 3 rules applied. Total rules applied 52 place count 119 transition count 164
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 54 place count 117 transition count 157
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 117 transition count 157
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 116 transition count 156
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 116 transition count 156
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 115 transition count 155
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 115 transition count 155
Applied a total of 60 rules in 21 ms. Remains 115 /145 variables (removed 30) and now considering 155/207 (removed 52) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15303894850348694247.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15895045536313137010.kers'
[2026-05-31 20:50:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15303894850348694247.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15895045536313137010.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 155 rows 115 cols 481 entries
Finished phase 1 with 103 SingleSign rule and 2 generalized
[2026-05-31 20:50:26] [INFO ] Computed 10 invariants in 1 ms
Computed 10 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15895045536313137010.kers
Total runtime 2 ms.
[2026-05-31 20:50:26] [INFO ] Implicit Places using invariants in 106 ms returned [19]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 108 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 114/145 places, 155/207 transitions.
Applied a total of 0 rules in 2 ms. Remains 114 /114 variables (removed 0) and now considering 155/155 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 131 ms. Remains : 114/145 places, 155/207 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0) U p1) U X(p2)))'
Stuttering acceptance computed with spot in 273 ms :[(NOT p2), (AND p1 (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p0), (NOT p1)]
Running random walk in product with property : ErlangenMainframeV1-PT-bP02C02-LTLFireability-06
Product exploration explored 100000 steps with 1 reset in 416 ms.
Stack based approach found an accepted trace after 33 steps with 0 reset with depth 34 and stack size 34 in 1 ms.
FORMULA ErlangenMainframeV1-PT-bP02C02-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property ErlangenMainframeV1-PT-bP02C02-LTLFireability-06 finished in 882 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(F(p0))))))'
Support contains 1 out of 145 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 145/145 places, 207/207 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 130 transition count 189
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 130 transition count 189
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 41 place count 119 transition count 169
Ensure Unique test removed 1 places
Iterating global reduction 0 with 12 rules applied. Total rules applied 53 place count 118 transition count 169
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 58 place count 113 transition count 159
Iterating global reduction 0 with 5 rules applied. Total rules applied 63 place count 113 transition count 159
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 66 place count 110 transition count 142
Iterating global reduction 0 with 3 rules applied. Total rules applied 69 place count 110 transition count 142
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 71 place count 108 transition count 140
Iterating global reduction 0 with 2 rules applied. Total rules applied 73 place count 108 transition count 140
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 75 place count 106 transition count 138
Iterating global reduction 0 with 2 rules applied. Total rules applied 77 place count 106 transition count 138
Applied a total of 77 rules in 10 ms. Remains 106 /145 variables (removed 39) and now considering 138/207 (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-14150355477860882389.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16436866910540353490.kers'
[2026-05-31 20:50:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14150355477860882389.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16436866910540353490.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 138 rows 106 cols 380 entries
Finished phase 1 with 96 SingleSign rule and 1 generalized
[2026-05-31 20:50:27] [INFO ] Computed 9 invariants in 1 ms
Computed 9 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-16436866910540353490.kers
Total runtime 2 ms.
[2026-05-31 20:50:27] [INFO ] Implicit Places using invariants in 86 ms returned [13]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 88 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 105/145 places, 138/207 transitions.
Applied a total of 0 rules in 2 ms. Remains 105 /105 variables (removed 0) and now considering 138/138 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 101 ms. Remains : 105/145 places, 138/207 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(F(p0))))))'
Stuttering acceptance computed with spot in 229 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ErlangenMainframeV1-PT-bP02C02-LTLFireability-07
Product exploration explored 100000 steps with 20000 reset in 113 ms.
Product exploration explored 100000 steps with 20000 reset in 284 ms.
Computed a total of 13 stabilizing places and 13 stable transitions
Computed a total of 13 stabilizing places and 13 stable transitions
Knowledge based reduction with 1 factoid took 79 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
RANDOM walk for 13867 steps (4 resets) in 70 ms. (195 steps per ms) remains 0/1 properties
Knowledge based reduction with 1 factoid took 88 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 248 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Knowledge-based reduction took 469 ms.
Stuttering acceptance computed with spot in 248 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 138/138 transitions.
Applied a total of 0 rules in 1 ms. Remains 105 /105 variables (removed 0) and now considering 138/138 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11098476191012940186.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7001602142077209829.kers'
[2026-05-31 20:50:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11098476191012940186.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7001602142077209829.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 138 rows 105 cols 377 entries
Finished phase 1 with 97 SingleSign rule and 0 generalized
[2026-05-31 20:50:28] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7001602142077209829.kers
Total runtime 2 ms.
[2026-05-31 20:50:28] [INFO ] Implicit Places using invariants in 94 ms returned []
[2026-05-31 20:50:28] [INFO ] Invariant cache hit.
[2026-05-31 20:50:29] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 234 ms to find 0 implicit places.
Running 137 sub problems to find dead transitions.
[2026-05-31 20:50:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 1 (OVERLAPS) 1/105 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 4 (OVERLAPS) 138/243 variables, 105/114 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/243 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 6 (OVERLAPS) 0/243 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 137 unsolved
No progress, stopping.
After SMT solving in domain Real declared 243/243 variables, and 114 constraints, problems are : Problem set: 0 solved, 137 unsolved in 6016 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 137/137 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 137 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 1 (OVERLAPS) 1/105 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 4 (OVERLAPS) 138/243 variables, 105/114 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/243 variables, 137/251 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/243 variables, 1/252 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/243 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 8 (OVERLAPS) 0/243 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 137 unsolved
No progress, stopping.
After SMT solving in domain Int declared 243/243 variables, and 252 constraints, problems are : Problem set: 0 solved, 137 unsolved in 13124 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 137/137 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 19158ms problems are : Problem set: 0 solved, 137 unsolved
Search for dead transitions found 0 dead transitions in 19159ms
Finished structural reductions in LTL mode , in 1 iterations and 19395 ms. Remains : 105/105 places, 138/138 transitions.
Computed a total of 13 stabilizing places and 13 stable transitions
Computed a total of 13 stabilizing places and 13 stable transitions
Knowledge based reduction with 1 factoid took 46 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
RANDOM walk for 13727 steps (4 resets) in 29 ms. (457 steps per ms) remains 0/1 properties
Knowledge based reduction with 1 factoid took 56 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 179 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Knowledge-based reduction took 299 ms.
Stuttering acceptance computed with spot in 245 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 248 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 20000 reset in 106 ms.
Product exploration explored 100000 steps with 20000 reset in 115 ms.
Spot run failed in 155 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin18065980480683600907
[2026-05-31 20:50:49] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18065980480683600907
Running compilation step : cd /tmp/ltsmin18065980480683600907;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 695 ms.
Running link step : cd /tmp/ltsmin18065980480683600907;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin18065980480683600907;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased4529638804887751421.hoa' '--buchi-type=spotba'
LTSmin run took 47 ms.
FORMULA ErlangenMainframeV1-PT-bP02C02-LTLFireability-07 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ErlangenMainframeV1-PT-bP02C02-LTLFireability-07 finished in 22954 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)||G(p1)))'
Support contains 2 out of 145 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 145/145 places, 207/207 transitions.
Graph (trivial) has 133 edges and 145 vertex of which 11 / 145 are part of one of the 5 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 33 place count 138 transition count 167
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 1 with 51 rules applied. Total rules applied 84 place count 106 transition count 148
Reduce places removed 11 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 12 rules applied. Total rules applied 96 place count 95 transition count 147
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 99 place count 94 transition count 145
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 100 place count 93 transition count 145
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 9 Pre rules applied. Total rules applied 100 place count 93 transition count 136
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 118 place count 84 transition count 136
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 128 place count 74 transition count 123
Iterating global reduction 5 with 10 rules applied. Total rules applied 138 place count 74 transition count 123
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 138 place count 74 transition count 120
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 144 place count 71 transition count 120
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 151 place count 64 transition count 85
Ensure Unique test removed 1 places
Iterating global reduction 5 with 8 rules applied. Total rules applied 159 place count 63 transition count 85
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 161 place count 61 transition count 79
Iterating global reduction 5 with 2 rules applied. Total rules applied 163 place count 61 transition count 79
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 5 with 38 rules applied. Total rules applied 201 place count 42 transition count 60
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 203 place count 40 transition count 57
Iterating global reduction 5 with 2 rules applied. Total rules applied 205 place count 40 transition count 57
Performed 8 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 221 place count 32 transition count 78
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 5 with 14 rules applied. Total rules applied 235 place count 32 transition count 64
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 237 place count 30 transition count 58
Iterating global reduction 6 with 2 rules applied. Total rules applied 239 place count 30 transition count 58
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 246 place count 30 transition count 51
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 248 place count 29 transition count 61
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 7 with 14 rules applied. Total rules applied 262 place count 29 transition count 47
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 263 place count 28 transition count 46
Applied a total of 263 rules in 44 ms. Remains 28 /145 variables (removed 117) and now considering 46/207 (removed 161) transitions.
[2026-05-31 20:50:50] [INFO ] Flow matrix only has 39 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-4267834608848067782.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7339786407156419052.kers'
[2026-05-31 20:50:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4267834608848067782.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7339786407156419052.kers]
Normalized transition count is 38 out of 39 initially.
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 38 rows 25 cols 107 entries
Finished phase 1 with 19 SingleSign rule and 0 generalized
[2026-05-31 20:50:50] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7339786407156419052.kers
Total runtime 1 ms.
[2026-05-31 20:50:50] [INFO ] Implicit Places using invariants in 50 ms returned [18]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 53 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 27/145 places, 46/207 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 26 transition count 45
Applied a total of 2 rules in 4 ms. Remains 26 /27 variables (removed 1) and now considering 45/46 (removed 1) transitions.
[2026-05-31 20:50:50] [INFO ] Flow matrix only has 38 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-2853683951211520894.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13015076269599049821.kers'
[2026-05-31 20:50:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2853683951211520894.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13015076269599049821.kers]
Normalized transition count is 37 out of 38 initially.
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 37 rows 23 cols 100 entries
Finished phase 1 with 18 SingleSign rule and 0 generalized
[2026-05-31 20:50:50] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-13015076269599049821.kers
Total runtime 0 ms.
[2026-05-31 20:50:50] [INFO ] Implicit Places using invariants in 44 ms returned []
[2026-05-31 20:50:50] [INFO ] Flow matrix only has 38 transitions (discarded 7 similar events)
[2026-05-31 20:50:50] [INFO ] Invariant cache hit.
[2026-05-31 20:50:50] [INFO ] State equation strengthened by 4 read => feed constraints.
[2026-05-31 20:50:50] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 26/145 places, 45/207 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 217 ms. Remains : 26/145 places, 45/207 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)||G(p1)))'
Stuttering acceptance computed with spot in 169 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : ErlangenMainframeV1-PT-bP02C02-LTLFireability-08
Product exploration explored 100000 steps with 0 reset in 155 ms.
Product exploration explored 100000 steps with 0 reset in 251 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Negative knowledge disproves property using: (X (X p1))
Knowledge based reduction with 9 factoid took 68 ms. Proved property starting from automaton with 4 states, 9 edges and 2 AP (stutter insensitive
Knowledge-based reduction took 75 ms.
FORMULA ErlangenMainframeV1-PT-bP02C02-LTLFireability-08 FALSE TECHNIQUES NEGATIVE_KNOWLEDGE
Treatment of property ErlangenMainframeV1-PT-bP02C02-LTLFireability-08 finished in 901 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((F(p0)||(!p1&&X(X(p2))))) U (p3&&G((F(p0)||(!p1&&X(X(p2)))))))))'
Support contains 6 out of 145 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 145/145 places, 207/207 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 131 transition count 190
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 131 transition count 190
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 39 place count 120 transition count 162
Ensure Unique test removed 1 places
Iterating global reduction 0 with 12 rules applied. Total rules applied 51 place count 119 transition count 162
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 57 place count 113 transition count 151
Iterating global reduction 0 with 6 rules applied. Total rules applied 63 place count 113 transition count 151
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 67 place count 109 transition count 138
Iterating global reduction 0 with 4 rules applied. Total rules applied 71 place count 109 transition count 138
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 73 place count 107 transition count 136
Iterating global reduction 0 with 2 rules applied. Total rules applied 75 place count 107 transition count 136
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 77 place count 105 transition count 134
Iterating global reduction 0 with 2 rules applied. Total rules applied 79 place count 105 transition count 134
Applied a total of 79 rules in 12 ms. Remains 105 /145 variables (removed 40) and now considering 134/207 (removed 73) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8385789418024392174.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14573804272156987834.kers'
[2026-05-31 20:50:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8385789418024392174.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14573804272156987834.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 134 rows 105 cols 356 entries
Finished phase 1 with 95 SingleSign rule and 1 generalized
[2026-05-31 20:50:51] [INFO ] Computed 9 invariants in 1 ms
Computed 9 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-14573804272156987834.kers
Total runtime 2 ms.
[2026-05-31 20:50:51] [INFO ] Implicit Places using invariants in 85 ms returned [13]
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 : 104/145 places, 134/207 transitions.
Applied a total of 0 rules in 2 ms. Remains 104 /104 variables (removed 0) and now considering 134/134 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 100 ms. Remains : 104/145 places, 134/207 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((F(p0)||(!p1&&X(X(p2))))) U (p3&&G((F(p0)||(!p1&&X(X(p2)))))))))'
Stuttering acceptance computed with spot in 331 ms :[(OR (NOT p3) (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (OR (NOT p3) (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ErlangenMainframeV1-PT-bP02C02-LTLFireability-09
Product exploration explored 100000 steps with 0 reset in 169 ms.
Stack based approach found an accepted trace after 45 steps with 0 reset with depth 46 and stack size 46 in 1 ms.
FORMULA ErlangenMainframeV1-PT-bP02C02-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property ErlangenMainframeV1-PT-bP02C02-LTLFireability-09 finished in 673 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 U X((X(X(p1))||G(p2))))))'
Support contains 3 out of 145 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 145/145 places, 207/207 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 130 transition count 189
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 130 transition count 189
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 42 place count 118 transition count 160
Ensure Unique test removed 1 places
Iterating global reduction 0 with 13 rules applied. Total rules applied 55 place count 117 transition count 160
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 61 place count 111 transition count 149
Iterating global reduction 0 with 6 rules applied. Total rules applied 67 place count 111 transition count 149
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 70 place count 108 transition count 138
Iterating global reduction 0 with 3 rules applied. Total rules applied 73 place count 108 transition count 138
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 75 place count 106 transition count 136
Iterating global reduction 0 with 2 rules applied. Total rules applied 77 place count 106 transition count 136
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 79 place count 104 transition count 134
Iterating global reduction 0 with 2 rules applied. Total rules applied 81 place count 104 transition count 134
Applied a total of 81 rules in 11 ms. Remains 104 /145 variables (removed 41) and now considering 134/207 (removed 73) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2223640410609057413.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8662106753334974143.kers'
[2026-05-31 20:50:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2223640410609057413.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8662106753334974143.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 134 rows 104 cols 356 entries
Finished phase 1 with 94 SingleSign rule and 1 generalized
[2026-05-31 20:50:51] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-8662106753334974143.kers
Total runtime 1 ms.
[2026-05-31 20:50:51] [INFO ] Implicit Places using invariants in 77 ms returned [13]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 79 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 103/145 places, 134/207 transitions.
Applied a total of 0 rules in 2 ms. Remains 103 /103 variables (removed 0) and now considering 134/134 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 92 ms. Remains : 103/145 places, 134/207 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(X(p1))||G(p2))))))'
Stuttering acceptance computed with spot in 770 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p1), true, (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : ErlangenMainframeV1-PT-bP02C02-LTLFireability-10
Product exploration explored 100000 steps with 0 reset in 140 ms.
Product exploration explored 100000 steps with 0 reset in 180 ms.
Computed a total of 13 stabilizing places and 13 stable transitions
Computed a total of 13 stabilizing places and 13 stable transitions
Detected a total of 13/103 stabilizing places and 13/134 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge based reduction with 6 factoid took 166 ms. Reduced automaton from 15 states, 28 edges and 3 AP (stutter sensitive) to 15 states, 28 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 259 ms. (153 steps per ms) remains 1/8 properties
BEST_FIRST walk for 40002 steps (8 resets) in 166 ms. (239 steps per ms) remains 1/1 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16772610818122521842.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7952001672739046632.kers'
[2026-05-31 20:50:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16772610818122521842.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7952001672739046632.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 134 rows 103 cols 353 entries
Finished phase 1 with 95 SingleSign rule and 0 generalized
[2026-05-31 20:50:53] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7952001672739046632.kers
Total runtime 1 ms.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 83/86 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 17/103 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 134/237 variables, 103/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/237 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 237/237 variables, and 111 constraints, problems are : Problem set: 0 solved, 1 unsolved in 184 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 83/86 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 17/103 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 134/237 variables, 103/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/237 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/237 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/237 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 237/237 variables, and 113 constraints, problems are : Problem set: 0 solved, 1 unsolved in 269 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 471ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 17 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=17 )
Parikh walk visited 1 properties in 7 ms.
Knowledge based reduction with 6 factoid took 306 ms. Reduced automaton from 15 states, 28 edges and 3 AP (stutter sensitive) to 15 states, 28 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 757 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p1), true, (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p2)]
Knowledge-based reduction took 1844 ms.
Stuttering acceptance computed with spot in 760 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p1), true, (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p2)]
Support contains 3 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 134/134 transitions.
Applied a total of 0 rules in 1 ms. Remains 103 /103 variables (removed 0) and now considering 134/134 (removed 0) transitions.
[2026-05-31 20:50:55] [INFO ] Invariant cache hit.
[2026-05-31 20:50:55] [INFO ] Implicit Places using invariants in 90 ms returned []
[2026-05-31 20:50:55] [INFO ] Invariant cache hit.
[2026-05-31 20:50:55] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 256 ms to find 0 implicit places.
Running 133 sub problems to find dead transitions.
[2026-05-31 20:50:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 1 (OVERLAPS) 1/103 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 4 (OVERLAPS) 134/237 variables, 103/112 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 6 (OVERLAPS) 0/237 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 133 unsolved
No progress, stopping.
After SMT solving in domain Real declared 237/237 variables, and 112 constraints, problems are : Problem set: 0 solved, 133 unsolved in 8241 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 133/133 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 133 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 1 (OVERLAPS) 1/103 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 4 (OVERLAPS) 134/237 variables, 103/112 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 133/245 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 2/247 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/237 variables, 1/248 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/237 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 9 (OVERLAPS) 0/237 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 133 unsolved
No progress, stopping.
After SMT solving in domain Int declared 237/237 variables, and 248 constraints, problems are : Problem set: 0 solved, 133 unsolved in 14789 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 133/133 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 23051ms problems are : Problem set: 0 solved, 133 unsolved
Search for dead transitions found 0 dead transitions in 23053ms
Finished structural reductions in LTL mode , in 1 iterations and 23311 ms. Remains : 103/103 places, 134/134 transitions.
Computed a total of 13 stabilizing places and 13 stable transitions
Computed a total of 13 stabilizing places and 13 stable transitions
Detected a total of 13/103 stabilizing places and 13/134 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge based reduction with 6 factoid took 125 ms. Reduced automaton from 15 states, 28 edges and 3 AP (stutter sensitive) to 15 states, 28 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 190 ms. (209 steps per ms) remains 1/8 properties
BEST_FIRST walk for 40002 steps (8 resets) in 62 ms. (634 steps per ms) remains 1/1 properties
[2026-05-31 20:51:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 83/86 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 17/103 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 134/237 variables, 103/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/237 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 237/237 variables, and 111 constraints, problems are : Problem set: 0 solved, 1 unsolved in 148 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 83/86 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 17/103 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 134/237 variables, 103/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/237 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/237 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/237 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 237/237 variables, and 113 constraints, problems are : Problem set: 0 solved, 1 unsolved in 256 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 408ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 17 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=17 )
Parikh walk visited 1 properties in 1 ms.
Knowledge based reduction with 6 factoid took 268 ms. Reduced automaton from 15 states, 28 edges and 3 AP (stutter sensitive) to 15 states, 28 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 634 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p1), true, (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p2)]
Knowledge-based reduction took 1536 ms.
Stuttering acceptance computed with spot in 673 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p1), true, (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 737 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p1), true, (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p2)]
Product exploration explored 100000 steps with 0 reset in 134 ms.
Product exploration explored 100000 steps with 0 reset in 157 ms.
Spot run failed in 83 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin9935066209923885696
[2026-05-31 20:51:22] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9935066209923885696
Running compilation step : cd /tmp/ltsmin9935066209923885696;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 499 ms.
Running link step : cd /tmp/ltsmin9935066209923885696;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin9935066209923885696;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased11511119473748808858.hoa' '--buchi-type=spotba'
LTSmin run took 46 ms.
FORMULA ErlangenMainframeV1-PT-bP02C02-LTLFireability-10 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ErlangenMainframeV1-PT-bP02C02-LTLFireability-10 finished in 31150 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((p0||G(p1))) U X(p2))))'
Support contains 3 out of 145 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 145/145 places, 207/207 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 130 transition count 189
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 130 transition count 189
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 42 place count 118 transition count 160
Ensure Unique test removed 1 places
Iterating global reduction 0 with 13 rules applied. Total rules applied 55 place count 117 transition count 160
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 60 place count 112 transition count 151
Iterating global reduction 0 with 5 rules applied. Total rules applied 65 place count 112 transition count 151
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 69 place count 108 transition count 138
Iterating global reduction 0 with 4 rules applied. Total rules applied 73 place count 108 transition count 138
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 75 place count 106 transition count 136
Iterating global reduction 0 with 2 rules applied. Total rules applied 77 place count 106 transition count 136
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 79 place count 104 transition count 134
Iterating global reduction 0 with 2 rules applied. Total rules applied 81 place count 104 transition count 134
Applied a total of 81 rules in 9 ms. Remains 104 /145 variables (removed 41) and now considering 134/207 (removed 73) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11018959020641192471.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1863848784142221733.kers'
[2026-05-31 20:51:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11018959020641192471.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1863848784142221733.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 134 rows 104 cols 356 entries
Finished phase 1 with 94 SingleSign rule and 1 generalized
[2026-05-31 20:51:23] [INFO ] Computed 9 invariants in 1 ms
Computed 9 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1863848784142221733.kers
Total runtime 1 ms.
[2026-05-31 20:51:23] [INFO ] Implicit Places using invariants in 91 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 93 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 103/145 places, 134/207 transitions.
Applied a total of 0 rules in 1 ms. Remains 103 /103 variables (removed 0) and now considering 134/134 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 103 ms. Remains : 103/145 places, 134/207 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((p0||G(p1))) U X(p2))))'
Stuttering acceptance computed with spot in 454 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), true, (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ErlangenMainframeV1-PT-bP02C02-LTLFireability-11
Product exploration explored 100000 steps with 0 reset in 158 ms.
Product exploration explored 100000 steps with 2 reset in 180 ms.
Computed a total of 13 stabilizing places and 13 stable transitions
Computed a total of 13 stabilizing places and 13 stable transitions
Detected a total of 13/103 stabilizing places and 13/134 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge based reduction with 16 factoid took 97 ms. Reduced automaton from 9 states, 21 edges and 3 AP (stutter sensitive) to 8 states, 17 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 108 ms. (366 steps per ms) remains 3/11 properties
BEST_FIRST walk for 40002 steps (8 resets) in 48 ms. (816 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (8 resets) in 41 ms. (952 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40001 steps (8 resets) in 73 ms. (540 steps per ms) remains 1/2 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6921186105340336593.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2362009906469600501.kers'
[2026-05-31 20:51:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6921186105340336593.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2362009906469600501.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 134 rows 103 cols 353 entries
Finished phase 1 with 95 SingleSign rule and 0 generalized
[2026-05-31 20:51:24] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-2362009906469600501.kers
Total runtime 1 ms.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 25/27 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 76/103 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 134/237 variables, 103/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/237 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 237/237 variables, and 111 constraints, problems are : Problem set: 0 solved, 1 unsolved in 119 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 25/27 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 76/103 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 134/237 variables, 103/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/237 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/237 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 237/237 variables, and 112 constraints, problems are : Problem set: 0 solved, 1 unsolved in 126 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 250ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 46 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=46 )
Parikh walk visited 1 properties in 1 ms.
Negative knowledge disproves property using: (G (OR p0 p1))
Knowledge based reduction with 16 factoid took 110 ms. Proved property starting from automaton with 8 states, 17 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 578 ms.
FORMULA ErlangenMainframeV1-PT-bP02C02-LTLFireability-11 FALSE TECHNIQUES NEGATIVE_KNOWLEDGE
Treatment of property ErlangenMainframeV1-PT-bP02C02-LTLFireability-11 finished in 1529 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||G(p1)))))'
Support contains 2 out of 145 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 145/145 places, 207/207 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 131 transition count 190
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 131 transition count 190
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 39 place count 120 transition count 162
Ensure Unique test removed 1 places
Iterating global reduction 0 with 12 rules applied. Total rules applied 51 place count 119 transition count 162
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 56 place count 114 transition count 152
Iterating global reduction 0 with 5 rules applied. Total rules applied 61 place count 114 transition count 152
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 64 place count 111 transition count 143
Iterating global reduction 0 with 3 rules applied. Total rules applied 67 place count 111 transition count 143
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 68 place count 110 transition count 142
Iterating global reduction 0 with 1 rules applied. Total rules applied 69 place count 110 transition count 142
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 70 place count 109 transition count 141
Iterating global reduction 0 with 1 rules applied. Total rules applied 71 place count 109 transition count 141
Applied a total of 71 rules in 12 ms. Remains 109 /145 variables (removed 36) and now considering 141/207 (removed 66) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17104325880867468336.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7800811870799072209.kers'
[2026-05-31 20:51:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17104325880867468336.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7800811870799072209.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 141 rows 109 cols 386 entries
Finished phase 1 with 99 SingleSign rule and 1 generalized
[2026-05-31 20:51:24] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7800811870799072209.kers
Total runtime 1 ms.
[2026-05-31 20:51:24] [INFO ] Implicit Places using invariants in 83 ms returned [13]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 84 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 108/145 places, 141/207 transitions.
Applied a total of 0 rules in 1 ms. Remains 108 /108 variables (removed 0) and now considering 141/141 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 97 ms. Remains : 108/145 places, 141/207 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||G(p1)))))'
Stuttering acceptance computed with spot in 146 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ErlangenMainframeV1-PT-bP02C02-LTLFireability-12
Product exploration explored 100000 steps with 0 reset in 84 ms.
Product exploration explored 100000 steps with 0 reset in 84 ms.
Computed a total of 13 stabilizing places and 13 stable transitions
Computed a total of 13 stabilizing places and 13 stable transitions
Knowledge based reduction with 9 factoid took 63 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
RANDOM walk for 13568 steps (3 resets) in 22 ms. (589 steps per ms) remains 0/1 properties
Negative knowledge disproves property using: (G p1)
Knowledge based reduction with 9 factoid took 32 ms. Proved property starting from automaton with 4 states, 5 edges and 1 AP (stutter sensitive
Knowledge-based reduction took 115 ms.
FORMULA ErlangenMainframeV1-PT-bP02C02-LTLFireability-12 FALSE TECHNIQUES NEGATIVE_KNOWLEDGE
Treatment of property ErlangenMainframeV1-PT-bP02C02-LTLFireability-12 finished in 560 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)&&F((p1||X(p2))))))'
Support contains 5 out of 145 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 145/145 places, 207/207 transitions.
Graph (trivial) has 132 edges and 145 vertex of which 11 / 145 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 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 33 place count 138 transition count 167
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 1 with 51 rules applied. Total rules applied 84 place count 106 transition count 148
Reduce places removed 11 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 12 rules applied. Total rules applied 96 place count 95 transition count 147
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 99 place count 94 transition count 145
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 100 place count 93 transition count 145
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 9 Pre rules applied. Total rules applied 100 place count 93 transition count 136
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 118 place count 84 transition count 136
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 127 place count 75 transition count 127
Iterating global reduction 5 with 9 rules applied. Total rules applied 136 place count 75 transition count 127
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 136 place count 75 transition count 124
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 142 place count 72 transition count 124
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 148 place count 66 transition count 96
Iterating global reduction 5 with 6 rules applied. Total rules applied 154 place count 66 transition count 96
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 156 place count 64 transition count 86
Iterating global reduction 5 with 2 rules applied. Total rules applied 158 place count 64 transition count 86
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 5 with 38 rules applied. Total rules applied 196 place count 45 transition count 67
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 197 place count 44 transition count 65
Iterating global reduction 5 with 1 rules applied. Total rules applied 198 place count 44 transition count 65
Performed 7 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 212 place count 37 transition count 97
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 222 place count 37 transition count 87
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 223 place count 36 transition count 79
Iterating global reduction 6 with 1 rules applied. Total rules applied 224 place count 36 transition count 79
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 225 place count 36 transition count 78
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 227 place count 36 transition count 76
Applied a total of 227 rules in 29 ms. Remains 36 /145 variables (removed 109) and now considering 76/207 (removed 131) transitions.
[2026-05-31 20:51:25] [INFO ] Flow matrix only has 69 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-13378856483394987877.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-665203338240934995.kers'
[2026-05-31 20:51:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13378856483394987877.kers, --Pflows, --basisKERS=/tmp/petrispot-output-665203338240934995.kers]
Normalized transition count is 68 out of 69 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 68 rows 36 cols 334 entries
Finished phase 1 with 24 SingleSign rule and 2 generalized
[2026-05-31 20:51:25] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-665203338240934995.kers
Total runtime 1 ms.
[2026-05-31 20:51:25] [INFO ] Implicit Places using invariants in 57 ms returned []
[2026-05-31 20:51:25] [INFO ] Flow matrix only has 69 transitions (discarded 7 similar events)
[2026-05-31 20:51:25] [INFO ] Invariant cache hit.
[2026-05-31 20:51:25] [INFO ] State equation strengthened by 22 read => feed constraints.
[2026-05-31 20:51:25] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
[2026-05-31 20:51:25] [INFO ] Redundant transitions in 1 ms returned []
Running 64 sub problems to find dead transitions.
[2026-05-31 20:51:25] [INFO ] Flow matrix only has 69 transitions (discarded 7 similar events)
[2026-05-31 20:51:25] [INFO ] Invariant cache hit.
[2026-05-31 20:51:25] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (OVERLAPS) 1/36 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/36 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 68/104 variables, 36/46 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/104 variables, 21/67 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/104 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (OVERLAPS) 1/105 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/105 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 9 (OVERLAPS) 0/105 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Real declared 105/105 variables, and 68 constraints, problems are : Problem set: 0 solved, 64 unsolved in 2320 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 36/36 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 64 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (OVERLAPS) 1/36 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/36 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 68/104 variables, 36/46 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/104 variables, 21/67 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/104 variables, 64/131 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (OVERLAPS) 1/105 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/105 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 10 (OVERLAPS) 0/105 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Int declared 105/105 variables, and 132 constraints, problems are : Problem set: 0 solved, 64 unsolved in 3164 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 36/36 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5504ms problems are : Problem set: 0 solved, 64 unsolved
Search for dead transitions found 0 dead transitions in 5505ms
Starting structural reductions in SI_LTL mode, iteration 1 : 36/145 places, 76/207 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5705 ms. Remains : 36/145 places, 76/207 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)&&F((p1||X(p2))))))'
Stuttering acceptance computed with spot in 115 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ErlangenMainframeV1-PT-bP02C02-LTLFireability-13
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA ErlangenMainframeV1-PT-bP02C02-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV1-PT-bP02C02-LTLFireability-13 finished in 5849 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 1 out of 145 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 145/145 places, 207/207 transitions.
Graph (trivial) has 136 edges and 145 vertex of which 11 / 145 are part of one of the 5 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 33 place count 138 transition count 167
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 53 rules applied. Total rules applied 86 place count 106 transition count 146
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 98 place count 94 transition count 146
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 98 place count 94 transition count 135
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 120 place count 83 transition count 135
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 130 place count 73 transition count 122
Iterating global reduction 3 with 10 rules applied. Total rules applied 140 place count 73 transition count 122
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 140 place count 73 transition count 119
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 146 place count 70 transition count 119
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 154 place count 62 transition count 83
Ensure Unique test removed 2 places
Iterating global reduction 3 with 10 rules applied. Total rules applied 164 place count 60 transition count 83
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 167 place count 57 transition count 75
Iterating global reduction 3 with 3 rules applied. Total rules applied 170 place count 57 transition count 75
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 208 place count 38 transition count 56
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 210 place count 36 transition count 53
Iterating global reduction 3 with 2 rules applied. Total rules applied 212 place count 36 transition count 53
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 230 place count 27 transition count 71
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 244 place count 27 transition count 57
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 247 place count 24 transition count 51
Iterating global reduction 4 with 3 rules applied. Total rules applied 250 place count 24 transition count 51
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 4 with 11 rules applied. Total rules applied 261 place count 24 transition count 40
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 263 place count 23 transition count 46
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 5 with 11 rules applied. Total rules applied 274 place count 23 transition count 35
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 275 place count 22 transition count 34
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 276 place count 21 transition count 34
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 6 with 5 rules applied. Total rules applied 281 place count 21 transition count 29
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 6 with 2 rules applied. Total rules applied 283 place count 21 transition count 27
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 285 place count 19 transition count 27
Applied a total of 285 rules in 24 ms. Remains 19 /145 variables (removed 126) and now considering 27/207 (removed 180) transitions.
[2026-05-31 20:51:31] [INFO ] Flow matrix only has 25 transitions (discarded 2 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1643535566615521062.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13763779775762521274.kers'
[2026-05-31 20:51:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1643535566615521062.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13763779775762521274.kers]
Normalized transition count is 24 out of 25 initially.
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 24 rows 14 cols 49 entries
Finished phase 1 with 12 SingleSign rule and 0 generalized
[2026-05-31 20:51:31] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-13763779775762521274.kers
Total runtime 1 ms.
[2026-05-31 20:51:31] [INFO ] Implicit Places using invariants in 36 ms returned []
[2026-05-31 20:51:31] [INFO ] Flow matrix only has 25 transitions (discarded 2 similar events)
[2026-05-31 20:51:31] [INFO ] Invariant cache hit.
[2026-05-31 20:51:31] [INFO ] State equation strengthened by 3 read => feed constraints.
[2026-05-31 20:51:31] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
[2026-05-31 20:51:31] [INFO ] Redundant transitions in 1 ms returned []
Running 12 sub problems to find dead transitions.
[2026-05-31 20:51:31] [INFO ] Flow matrix only has 25 transitions (discarded 2 similar events)
[2026-05-31 20:51:31] [INFO ] Invariant cache hit.
[2026-05-31 20:51:31] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/14 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 5/19 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 24/43 variables, 19/26 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 3/29 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 0/43 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 43/44 variables, and 29 constraints, problems are : Problem set: 0 solved, 12 unsolved in 250 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 19/19 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/14 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 5/19 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 24/43 variables, 19/26 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 3/29 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 12/41 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/43 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 0/43 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 43/44 variables, and 41 constraints, problems are : Problem set: 0 solved, 12 unsolved in 218 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 19/19 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 472ms problems are : Problem set: 0 solved, 12 unsolved
Search for dead transitions found 0 dead transitions in 472ms
Starting structural reductions in SI_LTL mode, iteration 1 : 19/145 places, 27/207 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 597 ms. Remains : 19/145 places, 27/207 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 45 ms :[(NOT p0)]
Running random walk in product with property : ErlangenMainframeV1-PT-bP02C02-LTLFireability-15
Product exploration explored 100000 steps with 0 reset in 229 ms.
Product exploration explored 100000 steps with 0 reset in 296 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 3 factoid took 53 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
RANDOM walk for 100 steps (4 resets) in 5 ms. (16 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 72 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Knowledge-based reduction took 180 ms.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Support contains 1 out of 19 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 19/19 places, 27/27 transitions.
Applied a total of 0 rules in 1 ms. Remains 19 /19 variables (removed 0) and now considering 27/27 (removed 0) transitions.
[2026-05-31 20:51:32] [INFO ] Flow matrix only has 25 transitions (discarded 2 similar events)
[2026-05-31 20:51:32] [INFO ] Invariant cache hit.
[2026-05-31 20:51:32] [INFO ] Implicit Places using invariants in 35 ms returned []
[2026-05-31 20:51:32] [INFO ] Flow matrix only has 25 transitions (discarded 2 similar events)
[2026-05-31 20:51:32] [INFO ] Invariant cache hit.
[2026-05-31 20:51:32] [INFO ] State equation strengthened by 3 read => feed constraints.
[2026-05-31 20:51:32] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
[2026-05-31 20:51:32] [INFO ] Redundant transitions in 0 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 85 ms. Remains : 19/19 places, 27/27 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 3 factoid took 44 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
RANDOM walk for 304 steps (22 resets) in 5 ms. (50 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 53 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Knowledge-based reduction took 144 ms.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 49 ms.
Product exploration explored 100000 steps with 0 reset in 296 ms.
Built C files in :
/tmp/ltsmin8063168099630415439
[2026-05-31 20:51:33] [INFO ] Computing symmetric may disable matrix : 27 transitions.
[2026-05-31 20:51:33] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-31 20:51:33] [INFO ] Computing symmetric may enable matrix : 27 transitions.
[2026-05-31 20:51:33] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-31 20:51:33] [INFO ] Computing Do-Not-Accords matrix : 27 transitions.
[2026-05-31 20:51:33] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-31 20:51:33] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8063168099630415439
Running compilation step : cd /tmp/ltsmin8063168099630415439;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 146 ms.
Running link step : cd /tmp/ltsmin8063168099630415439;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin8063168099630415439;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13663144864471039379.hoa' '--buchi-type=spotba'
LTSmin run took 22 ms.
FORMULA ErlangenMainframeV1-PT-bP02C02-LTLFireability-15 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ErlangenMainframeV1-PT-bP02C02-LTLFireability-15 finished in 2345 ms.
All properties solved by simple procedures.
Total runtime 128088 ms.

BK_STOP 1780260693400

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

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