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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 20M
-rw-r--r-- 1 mcc users 7.8K May 27 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K May 27 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 27 08:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K May 27 08:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K May 27 10:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 27 10:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 27 10:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 27 10:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 26 18:17 NewModel
-rw-r--r-- 1 mcc users 12K May 27 08:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 121K May 27 08:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K May 27 08:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K May 27 08:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 27 10:34 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 27 10:34 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 20M 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-bP08C08-LTLFireability-00
FORMULA_NAME ErlangenMainframeV1-PT-bP08C08-LTLFireability-01
FORMULA_NAME ErlangenMainframeV1-PT-bP08C08-LTLFireability-02
FORMULA_NAME ErlangenMainframeV1-PT-bP08C08-LTLFireability-03
FORMULA_NAME ErlangenMainframeV1-PT-bP08C08-LTLFireability-04
FORMULA_NAME ErlangenMainframeV1-PT-bP08C08-LTLFireability-05
FORMULA_NAME ErlangenMainframeV1-PT-bP08C08-LTLFireability-06
FORMULA_NAME ErlangenMainframeV1-PT-bP08C08-LTLFireability-07
FORMULA_NAME ErlangenMainframeV1-PT-bP08C08-LTLFireability-08
FORMULA_NAME ErlangenMainframeV1-PT-bP08C08-LTLFireability-09
FORMULA_NAME ErlangenMainframeV1-PT-bP08C08-LTLFireability-10
FORMULA_NAME ErlangenMainframeV1-PT-bP08C08-LTLFireability-11
FORMULA_NAME ErlangenMainframeV1-PT-bP08C08-LTLFireability-12
FORMULA_NAME ErlangenMainframeV1-PT-bP08C08-LTLFireability-13
FORMULA_NAME ErlangenMainframeV1-PT-bP08C08-LTLFireability-14
FORMULA_NAME ErlangenMainframeV1-PT-bP08C08-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1780277881142

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-bP08C08
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-06-01 01:38:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-06-01 01:38:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-06-01 01:38:05] [INFO ] Load time of PNML (sax parser for PT used): 1495 ms
[2026-06-01 01:38:05] [INFO ] Transformed 313 places.
[2026-06-01 01:38:05] [INFO ] Transformed 20019 transitions.
[2026-06-01 01:38:05] [INFO ] Found NUPN structural information;
[2026-06-01 01:38:05] [INFO ] Parsed PT model containing 313 places and 20019 transitions and 381427 arcs in 2071 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 32 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA ErlangenMainframeV1-PT-bP08C08-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV1-PT-bP08C08-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 53 out of 313 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 20019/20019 transitions.
Discarding 71 places :
Symmetric choice reduction at 0 with 71 rule applications. Total rules 71 place count 242 transition count 19948
Iterating global reduction 0 with 71 rules applied. Total rules applied 142 place count 242 transition count 19948
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 187 place count 197 transition count 19903
Iterating global reduction 0 with 45 rules applied. Total rules applied 232 place count 197 transition count 19903
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 235 place count 194 transition count 19900
Iterating global reduction 0 with 3 rules applied. Total rules applied 238 place count 194 transition count 19900
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 241 place count 191 transition count 19881
Iterating global reduction 0 with 3 rules applied. Total rules applied 244 place count 191 transition count 19881
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 247 place count 188 transition count 19878
Iterating global reduction 0 with 3 rules applied. Total rules applied 250 place count 188 transition count 19878
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 253 place count 185 transition count 19875
Iterating global reduction 0 with 3 rules applied. Total rules applied 256 place count 185 transition count 19875
Applied a total of 256 rules in 1081 ms. Remains 185 /313 variables (removed 128) and now considering 19875/20019 (removed 144) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2006099616983877406.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11495550588285476563.kers'
[2026-06-01 01:38:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2006099616983877406.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11495550588285476563.kers]
Culled 0 columns in 63 ms.
// Phase 1: matrix 19875 rows 185 cols 381063 entries
Finished phase 1 with 160 SingleSign rule and 3 generalized
[2026-06-01 01:38:08] [INFO ] Computed 22 invariants in 228 ms
Computed 22 P flows in 230 ms.
Exported basis to /tmp/petrispot-output-11495550588285476563.kers
Total runtime 285 ms.
[2026-06-01 01:38:08] [INFO ] Implicit Places using invariants in 920 ms returned []
Implicit Place search using SMT only with invariants took 970 ms to find 0 implicit places.
Running 19874 sub problems to find dead transitions.
[2026-06-01 01:38:09] [INFO ] Invariant cache hit.
Excessive predecessor constraint size, skipping predecessor.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 19874 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 184/20060 variables, and 8 constraints, problems are : Problem set: 0 solved, 19874 unsolved in 30642 ms.
Refiners :[Positive P Invariants (semi-flows): 0/14 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/185 constraints, PredecessorRefiner: 19874/158 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 19874 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 19874 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 184/20060 variables, and 8 constraints, problems are : Problem set: 0 solved, 19874 unsolved in 30554 ms.
Refiners :[Positive P Invariants (semi-flows): 0/14 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/185 constraints, PredecessorRefiner: 19716/158 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 114900ms problems are : Problem set: 0 solved, 19874 unsolved
Search for dead transitions found 0 dead transitions in 115252ms
Starting structural reductions in LTL mode, iteration 1 : 185/313 places, 19875/20019 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 117590 ms. Remains : 185/313 places, 19875/20019 transitions.
Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 19875/19875 transitions.
Applied a total of 0 rules in 150 ms. Remains 185 /185 variables (removed 0) and now considering 19875/19875 (removed 0) transitions.
[2026-06-01 01:40:04] [INFO ] Invariant cache hit.
[2026-06-01 01:40:04] [INFO ] Implicit Places using invariants in 124 ms returned []
Implicit Place search using SMT only with invariants took 125 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 286 ms. Remains : 185/185 places, 19875/19875 transitions.
Support contains 53 out of 185 places after structural reductions.
[2026-06-01 01:40:08] [INFO ] Flatten gal took : 3270 ms
[2026-06-01 01:40:11] [INFO ] Flatten gal took : 2618 ms
[2026-06-01 01:40:15] [INFO ] Input system was already deterministic with 19875 transitions.
Reduction of identical properties reduced properties to check from 38 to 37
RANDOM walk for 40000 steps (8 resets) in 15029 ms. (2 steps per ms) remains 36/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 94 ms. (42 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (8 resets) in 292 ms. (13 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 315 ms. (12 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 52 ms. (75 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 79 ms. (50 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 58 ms. (67 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 49 ms. (80 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 50 ms. (78 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 59 ms. (66 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 51 ms. (77 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (8 resets) in 35 ms. (111 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 43 ms. (90 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 40 ms. (97 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 46 ms. (85 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 52 ms. (75 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 47 ms. (83 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 69 ms. (57 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 36/36 properties
Interrupted probabilistic random walk after 218450 steps, run timeout after 12001 ms. (steps per millisecond=18 ) properties seen :0 out of 36
Probabilistic random walk after 218450 steps, saw 43286 distinct states, run finished after 12011 ms. (steps per millisecond=18 ) properties seen :0
[2026-06-01 01:40:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 36 unsolved
Problem AtomicPropp20 is UNSAT
At refinement iteration 1 (OVERLAPS) 36/88 variables, 10/10 constraints. Problems are: Problem set: 1 solved, 35 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 35 unsolved
At refinement iteration 3 (OVERLAPS) 61/149 variables, 4/14 constraints. Problems are: Problem set: 1 solved, 35 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 149/20060 variables, and 14 constraints, problems are : Problem set: 1 solved, 35 unsolved in 5087 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 0/8 constraints, State Equation: 0/185 constraints, PredecessorRefiner: 36/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 35 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 35 unsolved
Problem AtomicPropp11 is UNSAT
At refinement iteration 1 (OVERLAPS) 36/88 variables, 10/10 constraints. Problems are: Problem set: 2 solved, 34 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/10 constraints. Problems are: Problem set: 2 solved, 34 unsolved
At refinement iteration 3 (OVERLAPS) 61/149 variables, 4/14 constraints. Problems are: Problem set: 2 solved, 34 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 149/20060 variables, and 14 constraints, problems are : Problem set: 2 solved, 34 unsolved in 5238 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 0/8 constraints, State Equation: 0/185 constraints, PredecessorRefiner: 35/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10804ms problems are : Problem set: 2 solved, 34 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 52 out of 185 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 185/185 places, 19875/19875 transitions.
Graph (trivial) has 122 edges and 185 vertex of which 9 / 185 are part of one of the 4 SCC in 44 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 27 place count 180 transition count 19839
Reduce places removed 26 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 35 rules applied. Total rules applied 62 place count 154 transition count 19830
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 68 place count 148 transition count 19830
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 68 place count 148 transition count 19816
Deduced a syphon composed of 14 places in 12 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 96 place count 134 transition count 19816
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 6 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 152 place count 106 transition count 19788
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 158 place count 106 transition count 19782
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 161 place count 103 transition count 19775
Iterating global reduction 4 with 3 rules applied. Total rules applied 164 place count 103 transition count 19775
Performed 7 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 7 places in 7 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 178 place count 96 transition count 19804
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 190 place count 96 transition count 19792
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 192 place count 94 transition count 19786
Iterating global reduction 5 with 2 rules applied. Total rules applied 194 place count 94 transition count 19786
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 204 place count 94 transition count 19776
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 206 place count 93 transition count 19789
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 207 place count 93 transition count 19788
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 7 with 8 rules applied. Total rules applied 215 place count 93 transition count 19780
Free-agglomeration rule applied 3 times.
Iterating global reduction 7 with 3 rules applied. Total rules applied 218 place count 93 transition count 19777
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 221 place count 90 transition count 19777
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 222 place count 90 transition count 19776
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 8 with 1 rules applied. Total rules applied 223 place count 90 transition count 19782
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 226 place count 89 transition count 19780
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 9 with 13 rules applied. Total rules applied 239 place count 89 transition count 19767
Partial Post-agglomeration rule applied 8 times.
Drop transitions (Partial Post agglomeration) removed 8 transitions
Iterating global reduction 9 with 8 rules applied. Total rules applied 247 place count 89 transition count 19767
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 9 with 8 rules applied. Total rules applied 255 place count 89 transition count 19759
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 256 place count 88 transition count 19758
Applied a total of 256 rules in 99331 ms. Remains 88 /185 variables (removed 97) and now considering 19758/19875 (removed 117) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 99333 ms. Remains : 88/185 places, 19758/19875 transitions.
Successfully simplified 2 atomic propositions for a total of 14 simplifications.
FORMULA ErlangenMainframeV1-PT-bP08C08-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 19 stabilizing places and 19 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' '!(((F(G(p0)) U G(p1)) U X(X((X(p0)&&G(p2))))))'
Support contains 20 out of 185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 19875/19875 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 169 transition count 13315
Ensure Unique test removed 7 places
Iterating global reduction 0 with 23 rules applied. Total rules applied 39 place count 162 transition count 13315
Applied a total of 39 rules in 472 ms. Remains 162 /185 variables (removed 23) and now considering 13315/19875 (removed 6560) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15311678278757368112.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11535302166099724706.kers'
[2026-06-01 01:42:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15311678278757368112.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11535302166099724706.kers]
Culled 0 columns in 29 ms.
// Phase 1: matrix 13315 rows 162 cols 171122 entries
Finished phase 1 with 146 SingleSign rule and 1 generalized
[2026-06-01 01:42:24] [INFO ] Computed 15 invariants in 108 ms
Computed 15 P flows in 109 ms.
Exported basis to /tmp/petrispot-output-11535302166099724706.kers
Total runtime 134 ms.
[2026-06-01 01:42:25] [INFO ] Implicit Places using invariants in 1730 ms returned [70]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1747 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 161/185 places, 13315/19875 transitions.
Applied a total of 0 rules in 39 ms. Remains 161 /161 variables (removed 0) and now considering 13315/13315 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2260 ms. Remains : 161/185 places, 13315/19875 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)) U G(p1)) U X(X((X(p0)&&G(p2))))))'
Stuttering acceptance computed with spot in 1088 ms :[(OR (NOT p2) (NOT p0)), (AND (NOT p0) p1), (OR (NOT p2) (NOT p0)), (AND (NOT p0) p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) p1), (OR (NOT p2) (NOT p0)), (NOT p0), (AND (NOT p0) p1 p2), (AND (NOT p0) p1 (NOT p2)), (NOT p1), (AND (NOT p0) (NOT p1) p2), (AND (NOT p1) (NOT p2)), (AND (NOT p0) p1 p2), (AND p1 (NOT p2) (NOT p0)), (NOT p2), (NOT p0)]
Running random walk in product with property : ErlangenMainframeV1-PT-bP08C08-LTLFireability-00
Product exploration timeout after 43920 steps with 2 reset in 10001 ms.
Stack based approach found an accepted trace after 65 steps with 0 reset with depth 66 and stack size 66 in 6 ms.
FORMULA ErlangenMainframeV1-PT-bP08C08-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property ErlangenMainframeV1-PT-bP08C08-LTLFireability-00 finished in 13621 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p0))&&((!p1 U (p2||G(!p1))) U ((!p3&&(!p1 U (p2||G(!p1))))||G((!p1 U (p2||G(!p1)))))))))'
Support contains 28 out of 185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 19875/19875 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 177 transition count 13570
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 177 transition count 13570
Applied a total of 16 rules in 595 ms. Remains 177 /185 variables (removed 8) and now considering 13570/19875 (removed 6305) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16334432273704697618.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16386255173366022836.kers'
[2026-06-01 01:42:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16334432273704697618.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16386255173366022836.kers]
Culled 0 columns in 76 ms.
// Phase 1: matrix 13570 rows 177 cols 267573 entries
Finished phase 1 with 153 SingleSign rule and 2 generalized
[2026-06-01 01:42:37] [INFO ] Computed 22 invariants in 252 ms
Computed 22 P flows in 253 ms.
Exported basis to /tmp/petrispot-output-16386255173366022836.kers
Total runtime 296 ms.
[2026-06-01 01:42:40] [INFO ] Implicit Places using invariants in 2946 ms returned []
Implicit Place search using SMT only with invariants took 2948 ms to find 0 implicit places.
Running 13569 sub problems to find dead transitions.
[2026-06-01 01:42:40] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/176 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 13569 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 176/13747 variables, and 8 constraints, problems are : Problem set: 0 solved, 13569 unsolved in 30422 ms.
Refiners :[Positive P Invariants (semi-flows): 0/14 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/177 constraints, PredecessorRefiner: 13569/167 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13569 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/176 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 13569 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 176/13747 variables, and 8 constraints, problems are : Problem set: 0 solved, 13569 unsolved in 30374 ms.
Refiners :[Positive P Invariants (semi-flows): 0/14 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/177 constraints, PredecessorRefiner: 13402/167 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 91376ms problems are : Problem set: 0 solved, 13569 unsolved
Search for dead transitions found 0 dead transitions in 91499ms
Starting structural reductions in LTL mode, iteration 1 : 177/185 places, 13570/19875 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 95116 ms. Remains : 177/185 places, 13570/19875 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p0))&&((!p1 U (p2||G(!p1))) U ((!p3&&(!p1 U (p2||G(!p1))))||G((!p1 U (p2||G(!p1)))))))))'
Stuttering acceptance computed with spot in 323 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), true, (NOT p0), (AND (NOT p2) p1), (AND p1 (NOT p2))]
Running random walk in product with property : ErlangenMainframeV1-PT-bP08C08-LTLFireability-01
Product exploration timeout after 45210 steps with 0 reset in 10003 ms.
Stack based approach found an accepted trace after 56 steps with 0 reset with depth 57 and stack size 57 in 4 ms.
FORMULA ErlangenMainframeV1-PT-bP08C08-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property ErlangenMainframeV1-PT-bP08C08-LTLFireability-01 finished in 105579 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(((X(p0)&&G(p1)) U (G(p2) U X(p3))))))'
Support contains 30 out of 185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 19875/19875 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 177 transition count 13570
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 177 transition count 13570
Applied a total of 16 rules in 383 ms. Remains 177 /185 variables (removed 8) and now considering 13570/19875 (removed 6305) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1904830027829941757.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11465734448364035985.kers'
[2026-06-01 01:44:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1904830027829941757.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11465734448364035985.kers]
Culled 0 columns in 76 ms.
// Phase 1: matrix 13570 rows 177 cols 267573 entries
Finished phase 1 with 153 SingleSign rule and 2 generalized
[2026-06-01 01:44:23] [INFO ] Computed 22 invariants in 265 ms
Computed 22 P flows in 266 ms.
Exported basis to /tmp/petrispot-output-11465734448364035985.kers
Total runtime 337 ms.
[2026-06-01 01:44:25] [INFO ] Implicit Places using invariants in 2501 ms returned []
Implicit Place search using SMT only with invariants took 2504 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 177/185 places, 13570/19875 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2889 ms. Remains : 177/185 places, 13570/19875 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)&&G(p1)) U (G(p2) U X(p3))))))'
Stuttering acceptance computed with spot in 656 ms :[(NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (NOT p3), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) p1 (NOT p3))), true, (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ErlangenMainframeV1-PT-bP08C08-LTLFireability-02
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA ErlangenMainframeV1-PT-bP08C08-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV1-PT-bP08C08-LTLFireability-02 finished in 3692 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((X(X(p0))||(p1&&G(p2)))))))'
Support contains 16 out of 185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 19875/19875 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 169 transition count 13315
Ensure Unique test removed 7 places
Iterating global reduction 0 with 23 rules applied. Total rules applied 39 place count 162 transition count 13315
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 41 place count 160 transition count 6025
Iterating global reduction 0 with 2 rules applied. Total rules applied 43 place count 160 transition count 6025
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 44 place count 159 transition count 6023
Iterating global reduction 0 with 1 rules applied. Total rules applied 45 place count 159 transition count 6023
Applied a total of 45 rules in 1072 ms. Remains 159 /185 variables (removed 26) and now considering 6023/19875 (removed 13852) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14966145217652464673.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8043856816193770321.kers'
[2026-06-01 01:44:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14966145217652464673.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8043856816193770321.kers]
Culled 0 columns in 22 ms.
// Phase 1: matrix 6023 rows 159 cols 76348 entries
Finished phase 1 with 143 SingleSign rule and 1 generalized
[2026-06-01 01:44:27] [INFO ] Computed 15 invariants in 74 ms
Computed 15 P flows in 75 ms.
Exported basis to /tmp/petrispot-output-8043856816193770321.kers
Total runtime 85 ms.
[2026-06-01 01:44:29] [INFO ] Implicit Places using invariants in 1717 ms returned [67]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1731 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 158/185 places, 6023/19875 transitions.
Applied a total of 0 rules in 30 ms. Remains 158 /158 variables (removed 0) and now considering 6023/6023 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2834 ms. Remains : 158/185 places, 6023/19875 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((X(X(p0))||(G(p1)&&p2))))))'
Stuttering acceptance computed with spot in 449 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), true, (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : ErlangenMainframeV1-PT-bP08C08-LTLFireability-04
Product exploration explored 100000 steps with 16691 reset in 852 ms.
Product exploration explored 100000 steps with 16676 reset in 464 ms.
Computed a total of 19 stabilizing places and 19 stable transitions
Computed a total of 19 stabilizing places and 19 stable transitions
Knowledge based reduction with 5 factoid took 101 ms. Reduced automaton from 9 states, 14 edges and 3 AP (stutter sensitive) to 9 states, 14 edges and 3 AP (stutter sensitive).
Reduction of identical properties reduced properties to check from 7 to 6
RANDOM walk for 40000 steps (8 resets) in 5540 ms. (7 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 2662 ms. (15 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 2259 ms. (17 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 2531 ms. (15 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (8 resets) in 2747 ms. (14 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 2510 ms. (15 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (8 resets) in 2736 ms. (14 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 820523 steps, run timeout after 18001 ms. (steps per millisecond=45 ) properties seen :0 out of 6
Probabilistic random walk after 820523 steps, saw 115163 distinct states, run finished after 18002 ms. (steps per millisecond=45 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1442825648316976164.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15923803644629916015.kers'
[2026-06-01 01:44:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1442825648316976164.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15923803644629916015.kers]
Culled 0 columns in 12 ms.
// Phase 1: matrix 6023 rows 158 cols 70515 entries
Finished phase 1 with 144 SingleSign rule and 0 generalized
[2026-06-01 01:44:55] [INFO ] Computed 14 invariants in 47 ms
Computed 14 P flows in 47 ms.
Exported basis to /tmp/petrispot-output-15923803644629916015.kers
Total runtime 61 ms.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem apf2 is UNSAT
At refinement iteration 1 (OVERLAPS) 83/99 variables, 10/10 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 59/158 variables, 4/14 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 0/14 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 6023/6181 variables, 158/172 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/6181 variables, 0/172 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/6181 variables, 0/172 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 6181/6181 variables, and 172 constraints, problems are : Problem set: 1 solved, 5 unsolved in 3840 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 6/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 83/99 variables, 10/10 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 59/158 variables, 4/14 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 0/14 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 6023/6181 variables, 158/172 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/6181 variables, 0/172 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/6181 variables, 0/172 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
Error getting values : (error "Timeout of Z3 solver reached")
After SMT solving in domain Int declared 6181/6181 variables, and 172 constraints, problems are : Problem set: 1 solved, 5 unsolved in 5012 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 5/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8974ms problems are : Problem set: 1 solved, 5 unsolved
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 16 out of 158 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 158/158 places, 6023/6023 transitions.
Graph (trivial) has 132 edges and 158 vertex of which 9 / 158 are part of one of the 4 SCC in 1 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 28 place count 153 transition count 5986
Reduce places removed 27 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 36 rules applied. Total rules applied 64 place count 126 transition count 5977
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 70 place count 120 transition count 5977
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 70 place count 120 transition count 5963
Deduced a syphon composed of 14 places in 3 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 98 place count 106 transition count 5963
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 2 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 3 with 68 rules applied. Total rules applied 166 place count 72 transition count 5929
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 172 place count 72 transition count 5923
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 175 place count 69 transition count 5916
Iterating global reduction 4 with 3 rules applied. Total rules applied 178 place count 69 transition count 5916
Performed 7 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 192 place count 62 transition count 5934
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 204 place count 62 transition count 5922
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 206 place count 60 transition count 5918
Iterating global reduction 5 with 2 rules applied. Total rules applied 208 place count 60 transition count 5918
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 218 place count 60 transition count 5908
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 220 place count 59 transition count 5921
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 221 place count 59 transition count 5920
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 7 with 8 rules applied. Total rules applied 229 place count 59 transition count 5912
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 231 place count 58 transition count 5925
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 232 place count 58 transition count 5924
Free-agglomeration rule applied 7 times.
Iterating global reduction 7 with 7 rules applied. Total rules applied 239 place count 58 transition count 5917
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 246 place count 51 transition count 5917
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 8 with 9 rules applied. Total rules applied 255 place count 51 transition count 5908
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 8 with 1 rules applied. Total rules applied 256 place count 51 transition count 5914
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 259 place count 50 transition count 5912
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 9 with 13 rules applied. Total rules applied 272 place count 50 transition count 5899
Partial Post-agglomeration rule applied 6 times.
Drop transitions (Partial Post agglomeration) removed 6 transitions
Iterating global reduction 9 with 6 rules applied. Total rules applied 278 place count 50 transition count 5899
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 9 with 6 rules applied. Total rules applied 284 place count 50 transition count 5893
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 285 place count 49 transition count 5892
Applied a total of 285 rules in 19936 ms. Remains 49 /158 variables (removed 109) and now considering 5892/6023 (removed 131) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19936 ms. Remains : 49/158 places, 5892/6023 transitions.
RANDOM walk for 40000 steps (8 resets) in 7239 ms. (5 steps per ms) remains 3/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 1821 ms. (21 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (8 resets) in 2116 ms. (18 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 1751 ms. (22 steps per ms) remains 3/3 properties
[2026-06-01 01:45:28] [INFO ] Flow matrix only has 5888 transitions (discarded 4 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-830481907906794193.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16413930472809302396.kers'
[2026-06-01 01:45:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-830481907906794193.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16413930472809302396.kers]
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 15 ms.
// Phase 1: matrix 5888 rows 46 cols 97381 entries
Finished phase 1 with 35 SingleSign rule and 0 generalized
[2026-06-01 01:45:28] [INFO ] Computed 14 invariants in 48 ms
Computed 14 P flows in 48 ms.
Exported basis to /tmp/petrispot-output-16413930472809302396.kers
Total runtime 67 ms.
[2026-06-01 01:45:28] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 32/42 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 3/45 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 5885/5930 variables, 45/57 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/5930 variables, 24/81 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/5930 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 7/5937 variables, 4/85 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/5937 variables, 2/87 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/5937 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/5937 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/5937 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5937/5937 variables, and 88 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2835 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 49/49 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 3/0 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/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 32/42 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 3/45 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 5885/5930 variables, 45/57 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/5930 variables, 24/81 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/5930 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 7/5937 variables, 4/85 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/5937 variables, 2/87 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/5937 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/5937 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/5937 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 5937/5937 variables, and 88 constraints, problems are : Problem set: 0 solved, 3 unsolved in 5067 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 49/49 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8068ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Finished Parikh walk after 23 steps, including 0 resets, run visited all 3 properties in 4 ms. (steps per millisecond=5 )
Parikh walk visited 3 properties in 18 ms.
Found 1 invariant AP formulas.
Knowledge based reduction with 6 factoid took 191 ms. Reduced automaton from 9 states, 14 edges and 3 AP (stutter sensitive) to 9 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 426 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Knowledge-based reduction took 66170 ms.
Stuttering acceptance computed with spot in 368 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 16 out of 158 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 6023/6023 transitions.
Applied a total of 0 rules in 18 ms. Remains 158 /158 variables (removed 0) and now considering 6023/6023 (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-647952149269632817.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16289644902115466199.kers'
[2026-06-01 01:45:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-647952149269632817.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16289644902115466199.kers]
Culled 0 columns in 20 ms.
// Phase 1: matrix 6023 rows 158 cols 70515 entries
Finished phase 1 with 144 SingleSign rule and 0 generalized
[2026-06-01 01:45:37] [INFO ] Computed 14 invariants in 67 ms
Computed 14 P flows in 68 ms.
Exported basis to /tmp/petrispot-output-16289644902115466199.kers
Total runtime 78 ms.
[2026-06-01 01:45:39] [INFO ] Implicit Places using invariants in 1623 ms returned []
[2026-06-01 01:45:39] [INFO ] Invariant cache hit.
[2026-06-01 01:45:42] [INFO ] Implicit Places using invariants and state equation in 3466 ms returned []
Implicit Place search using SMT with State Equation took 5103 ms to find 0 implicit places.
Running 6022 sub problems to find dead transitions.
[2026-06-01 01:45:42] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 157/6181 variables, and 0 constraints, problems are : Problem set: 0 solved, 6022 unsolved in 30164 ms.
Refiners :[Positive P Invariants (semi-flows): 0/14 constraints, State Equation: 0/158 constraints, PredecessorRefiner: 6022/166 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6022 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 157/6181 variables, and 0 constraints, problems are : Problem set: 0 solved, 6022 unsolved in 30169 ms.
Refiners :[Positive P Invariants (semi-flows): 0/14 constraints, State Equation: 0/158 constraints, PredecessorRefiner: 5856/166 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 72047ms problems are : Problem set: 0 solved, 6022 unsolved
Search for dead transitions found 0 dead transitions in 72089ms
Finished structural reductions in LTL mode , in 1 iterations and 77236 ms. Remains : 158/158 places, 6023/6023 transitions.
Computed a total of 19 stabilizing places and 19 stable transitions
Computed a total of 19 stabilizing places and 19 stable transitions
Knowledge based reduction with 5 factoid took 105 ms. Reduced automaton from 9 states, 13 edges and 3 AP (stutter sensitive) to 9 states, 13 edges and 3 AP (stutter sensitive).
Reduction of identical properties reduced properties to check from 5 to 4
RANDOM walk for 40000 steps (8 resets) in 4822 ms. (8 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 2401 ms. (16 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 2599 ms. (15 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (8 resets) in 2258 ms. (17 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (8 resets) in 2626 ms. (15 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 501242 steps, run timeout after 12001 ms. (steps per millisecond=41 ) properties seen :0 out of 4
Probabilistic random walk after 501242 steps, saw 76711 distinct states, run finished after 12009 ms. (steps per millisecond=41 ) properties seen :0
[2026-06-01 01:47:11] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 83/99 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 59/158 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 6023/6181 variables, 158/172 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/6181 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/6181 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 6181/6181 variables, and 172 constraints, problems are : Problem set: 0 solved, 4 unsolved in 3656 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 4/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 83/99 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 59/158 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 6023/6181 variables, 158/172 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/6181 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/6181 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 6181/6181 variables, and 172 constraints, problems are : Problem set: 0 solved, 4 unsolved in 5035 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 4/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8729ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 3 properties in 296 ms.
Support contains 10 out of 158 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 158/158 places, 6023/6023 transitions.
Graph (trivial) has 138 edges and 158 vertex of which 9 / 158 are part of one of the 4 SCC in 1 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 28 place count 153 transition count 5986
Reduce places removed 27 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 36 rules applied. Total rules applied 64 place count 126 transition count 5977
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 70 place count 120 transition count 5977
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 70 place count 120 transition count 5963
Deduced a syphon composed of 14 places in 5 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 98 place count 106 transition count 5963
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 104 place count 100 transition count 643
Iterating global reduction 3 with 6 rules applied. Total rules applied 110 place count 100 transition count 643
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 113 place count 97 transition count 637
Iterating global reduction 3 with 3 rules applied. Total rules applied 116 place count 97 transition count 637
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 182 place count 64 transition count 604
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 188 place count 64 transition count 598
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 191 place count 61 transition count 591
Iterating global reduction 4 with 3 rules applied. Total rules applied 194 place count 61 transition count 591
Performed 10 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 214 place count 51 transition count 609
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 226 place count 51 transition count 597
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 228 place count 49 transition count 593
Iterating global reduction 5 with 2 rules applied. Total rules applied 230 place count 49 transition count 593
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 240 place count 49 transition count 583
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 242 place count 48 transition count 596
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 243 place count 48 transition count 595
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 7 with 11 rules applied. Total rules applied 254 place count 48 transition count 584
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 256 place count 47 transition count 597
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 257 place count 47 transition count 596
Free-agglomeration rule applied 8 times.
Iterating global reduction 7 with 8 rules applied. Total rules applied 265 place count 47 transition count 588
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 273 place count 39 transition count 588
Drop transitions (Redundant composition of simpler transitions.) removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 8 with 17 rules applied. Total rules applied 290 place count 39 transition count 571
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 8 with 1 rules applied. Total rules applied 291 place count 39 transition count 577
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 294 place count 38 transition count 575
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 9 with 13 rules applied. Total rules applied 307 place count 38 transition count 562
Partial Post-agglomeration rule applied 3 times.
Drop transitions (Partial Post agglomeration) removed 3 transitions
Iterating global reduction 9 with 3 rules applied. Total rules applied 310 place count 38 transition count 562
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 9 with 3 rules applied. Total rules applied 313 place count 38 transition count 559
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 314 place count 37 transition count 558
Applied a total of 314 rules in 1025 ms. Remains 37 /158 variables (removed 121) and now considering 558/6023 (removed 5465) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1025 ms. Remains : 37/158 places, 558/6023 transitions.
RANDOM walk for 1208 steps (0 resets) in 20 ms. (57 steps per ms) remains 0/1 properties
Knowledge based reduction with 5 factoid took 124 ms. Reduced automaton from 9 states, 13 edges and 3 AP (stutter sensitive) to 9 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 343 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Knowledge-based reduction took 27128 ms.
Stuttering acceptance computed with spot in 460 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 451 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 16647 reset in 626 ms.
Product exploration explored 100000 steps with 16620 reset in 477 ms.
Spot run failed in 171 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/ltsmin1932215968465808664
[2026-06-01 01:47:24] [INFO ] Built C files in 258ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1932215968465808664
Running compilation step : cd /tmp/ltsmin1932215968465808664;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1932215968465808664;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1932215968465808664;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 16 out of 158 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 6023/6023 transitions.
Applied a total of 0 rules in 22 ms. Remains 158 /158 variables (removed 0) and now considering 6023/6023 (removed 0) transitions.
[2026-06-01 01:47:27] [INFO ] Invariant cache hit.
[2026-06-01 01:47:28] [INFO ] Implicit Places using invariants in 1115 ms returned []
[2026-06-01 01:47:28] [INFO ] Invariant cache hit.
[2026-06-01 01:47:32] [INFO ] Implicit Places using invariants and state equation in 3508 ms returned []
Implicit Place search using SMT with State Equation took 4628 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 4651 ms. Remains : 158/158 places, 6023/6023 transitions.
Built C files in :
/tmp/ltsmin13097624641806925759
[2026-06-01 01:47:32] [INFO ] Built C files in 115ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13097624641806925759
Running compilation step : cd /tmp/ltsmin13097624641806925759;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13097624641806925759;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13097624641806925759;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2026-06-01 01:47:37] [INFO ] Flatten gal took : 565 ms
[2026-06-01 01:47:38] [INFO ] Flatten gal took : 517 ms
[2026-06-01 01:47:38] [INFO ] Time to serialize gal into /tmp/LTL5786222009649321310.gal : 166 ms
[2026-06-01 01:47:38] [INFO ] Time to serialize properties into /tmp/LTL17693089283110849015.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5786222009649321310.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1996431101472312257.hoa' '-atoms' '/tmp/LTL17693089283110849015.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL17693089283110849015.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1996431101472312257.hoa
Detected timeout of ITS tools.
[2026-06-01 01:47:55] [INFO ] Flatten gal took : 497 ms
[2026-06-01 01:47:56] [INFO ] Flatten gal took : 789 ms
[2026-06-01 01:47:56] [INFO ] Time to serialize gal into /tmp/LTL483030122586757426.gal : 73 ms
[2026-06-01 01:47:56] [INFO ] Time to serialize properties into /tmp/LTL6702825149503232485.ltl : 6 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL483030122586757426.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6702825149503232485.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...274
Read 1 LTL properties
Checking formula 0 : !((X(X(G((X(X("(((((p15==0)||(p45==0))||((p53==0)||(p72==0)))||(((p102==0)||(p121==0))||((p129==0)||(p152==0))))||((p199==0)||(p295==0...428
Formula 0 simplified : XXF(XX!"(((((p15==0)||(p45==0))||((p53==0)||(p72==0)))||(((p102==0)||(p121==0))||((p129==0)||(p152==0))))||((p199==0)||(p295==0)))" ...414
Detected timeout of ITS tools.
[2026-06-01 01:48:12] [INFO ] Flatten gal took : 844 ms
[2026-06-01 01:48:12] [INFO ] Applying decomposition
[2026-06-01 01:48:12] [INFO ] Flatten gal took : 546 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph2001283899041205778.txt' '-o' '/tmp/graph2001283899041205778.bin' '-w' '/tmp/graph2001283899041205778.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph2001283899041205778.bin' '-l' '-1' '-v' '-w' '/tmp/graph2001283899041205778.weights' '-q' '0' '-e' '0.001'
[2026-06-01 01:48:14] [INFO ] Decomposing Gal with order
[2026-06-01 01:48:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-06-01 01:48:17] [INFO ] Removed a total of 16704 redundant transitions.
[2026-06-01 01:48:17] [INFO ] Flatten gal took : 2220 ms
[2026-06-01 01:48:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 716 labels/synchronizations in 270 ms.
[2026-06-01 01:48:17] [INFO ] Time to serialize gal into /tmp/LTL8423779959923165991.gal : 16 ms
[2026-06-01 01:48:17] [INFO ] Time to serialize properties into /tmp/LTL2544124630176958462.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8423779959923165991.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2544124630176958462.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(X(G((X(X("(((((i3.u25.p15==0)||(i3.u25.p45==0))||((u42.p53==0)||(i3.u25.p72==0)))||(((i3.u25.p102==0)||(i3.u25.p121==0))||((i3.u2...617
Formula 0 simplified : XXF(XX!"(((((i3.u25.p15==0)||(i3.u25.p45==0))||((u42.p53==0)||(i3.u25.p72==0)))||(((i3.u25.p102==0)||(i3.u25.p121==0))||((i3.u25.p12...603
Detected timeout of ITS tools.
Treatment of property ErlangenMainframeV1-PT-bP08C08-LTLFireability-04 finished in 246774 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(((p1 U p2)&&p0)))))'
Support contains 18 out of 185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 19875/19875 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 169 transition count 13315
Ensure Unique test removed 7 places
Iterating global reduction 0 with 23 rules applied. Total rules applied 39 place count 162 transition count 13315
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 40 place count 161 transition count 8941
Iterating global reduction 0 with 1 rules applied. Total rules applied 41 place count 161 transition count 8941
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 42 place count 160 transition count 8939
Iterating global reduction 0 with 1 rules applied. Total rules applied 43 place count 160 transition count 8939
Applied a total of 43 rules in 953 ms. Remains 160 /185 variables (removed 25) and now considering 8939/19875 (removed 10936) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9450078782661048336.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18013571261646166681.kers'
[2026-06-01 01:48:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9450078782661048336.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18013571261646166681.kers]
Culled 0 columns in 19 ms.
// Phase 1: matrix 8939 rows 160 cols 114256 entries
Finished phase 1 with 144 SingleSign rule and 1 generalized
[2026-06-01 01:48:34] [INFO ] Computed 15 invariants in 69 ms
Computed 15 P flows in 70 ms.
Exported basis to /tmp/petrispot-output-18013571261646166681.kers
Total runtime 85 ms.
[2026-06-01 01:48:35] [INFO ] Implicit Places using invariants in 1888 ms returned [68]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1896 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 159/185 places, 8939/19875 transitions.
Applied a total of 0 rules in 29 ms. Remains 159 /159 variables (removed 0) and now considering 8939/8939 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2878 ms. Remains : 159/185 places, 8939/19875 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(((p1 U p2)&&p0)))))'
Stuttering acceptance computed with spot in 174 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), true, (NOT p2)]
Running random walk in product with property : ErlangenMainframeV1-PT-bP08C08-LTLFireability-05
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ErlangenMainframeV1-PT-bP08C08-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV1-PT-bP08C08-LTLFireability-05 finished in 3103 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(p1)))'
Support contains 10 out of 185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 19875/19875 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 177 transition count 13570
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 177 transition count 13570
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 169 transition count 960
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 169 transition count 960
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 34 place count 167 transition count 956
Iterating global reduction 0 with 2 rules applied. Total rules applied 36 place count 167 transition count 956
Applied a total of 36 rules in 1573 ms. Remains 167 /185 variables (removed 18) and now considering 956/19875 (removed 18919) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7904841637924506294.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14637965832890066041.kers'
[2026-06-01 01:48:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7904841637924506294.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14637965832890066041.kers]
Culled 0 columns in 4 ms.
// Phase 1: matrix 956 rows 167 cols 15365 entries
Finished phase 1 with 143 SingleSign rule and 2 generalized
[2026-06-01 01:48:37] [INFO ] Computed 22 invariants in 14 ms
Computed 22 P flows in 14 ms.
Exported basis to /tmp/petrispot-output-14637965832890066041.kers
Total runtime 18 ms.
[2026-06-01 01:48:38] [INFO ] Implicit Places using invariants in 456 ms returned []
[2026-06-01 01:48:38] [INFO ] Invariant cache hit.
[2026-06-01 01:48:39] [INFO ] Implicit Places using invariants and state equation in 928 ms returned []
Implicit Place search using SMT with State Equation took 1387 ms to find 0 implicit places.
Running 955 sub problems to find dead transitions.
[2026-06-01 01:48:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 955 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/166 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 955 unsolved
At refinement iteration 2 (OVERLAPS) 1/167 variables, 14/22 constraints. Problems are: Problem set: 0 solved, 955 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 167/1123 variables, and 23 constraints, problems are : Problem set: 0 solved, 955 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/167 constraints, PredecessorRefiner: 955/165 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 955 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 955 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/166 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 955 unsolved
At refinement iteration 2 (OVERLAPS) 1/167 variables, 14/22 constraints. Problems are: Problem set: 0 solved, 955 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/167 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 955 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 955 unsolved
At refinement iteration 5 (OVERLAPS) 956/1123 variables, 167/190 constraints. Problems are: Problem set: 0 solved, 955 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1123 variables, 165/355 constraints. Problems are: Problem set: 0 solved, 955 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1123/1123 variables, and 355 constraints, problems are : Problem set: 0 solved, 955 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 167/167 constraints, PredecessorRefiner: 955/165 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61543ms problems are : Problem set: 0 solved, 955 unsolved
Search for dead transitions found 0 dead transitions in 61548ms
Starting structural reductions in LTL mode, iteration 1 : 167/185 places, 956/19875 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64512 ms. Remains : 167/185 places, 956/19875 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(p1)))'
Stuttering acceptance computed with spot in 117 ms :[(NOT p1), true, (NOT p1), (NOT p1)]
Running random walk in product with property : ErlangenMainframeV1-PT-bP08C08-LTLFireability-07
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ErlangenMainframeV1-PT-bP08C08-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV1-PT-bP08C08-LTLFireability-07 finished in 64668 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Support contains 19 out of 185 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 185/185 places, 19875/19875 transitions.
Graph (trivial) has 139 edges and 185 vertex of which 9 / 185 are part of one of the 4 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 179 transition count 19845
Reduce places removed 23 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 32 rules applied. Total rules applied 56 place count 156 transition count 19836
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 62 place count 150 transition count 19836
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 62 place count 150 transition count 19823
Deduced a syphon composed of 13 places in 10 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 88 place count 137 transition count 19823
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 96 place count 129 transition count 13518
Iterating global reduction 3 with 8 rules applied. Total rules applied 104 place count 129 transition count 13518
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 107 place count 126 transition count 4284
Iterating global reduction 3 with 3 rules applied. Total rules applied 110 place count 126 transition count 4284
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 190 place count 86 transition count 4244
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 196 place count 86 transition count 4238
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 199 place count 83 transition count 4231
Iterating global reduction 4 with 3 rules applied. Total rules applied 202 place count 83 transition count 4231
Performed 6 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 214 place count 77 transition count 4249
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 226 place count 77 transition count 4237
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 228 place count 75 transition count 4233
Iterating global reduction 5 with 2 rules applied. Total rules applied 230 place count 75 transition count 4233
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 240 place count 75 transition count 4223
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 242 place count 74 transition count 4236
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 6 with 11 rules applied. Total rules applied 253 place count 74 transition count 4225
Partial Post-agglomeration rule applied 5 times.
Drop transitions (Partial Post agglomeration) removed 5 transitions
Iterating global reduction 6 with 5 rules applied. Total rules applied 258 place count 74 transition count 4225
Applied a total of 258 rules in 3338 ms. Remains 74 /185 variables (removed 111) and now considering 4225/19875 (removed 15650) transitions.
[2026-06-01 01:49:44] [INFO ] Flow matrix only has 4208 transitions (discarded 17 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5226078920069052096.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5545792810720889574.kers'
[2026-06-01 01:49:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5226078920069052096.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5545792810720889574.kers]
Normalized transition count is 4207 out of 4208 initially.
Culled 0 columns in 14 ms.
// Phase 1: matrix 4207 rows 74 cols 82684 entries
Finished phase 1 with 50 SingleSign rule and 2 generalized
[2026-06-01 01:49:44] [INFO ] Computed 22 invariants in 52 ms
Computed 22 P flows in 52 ms.
Exported basis to /tmp/petrispot-output-5545792810720889574.kers
Total runtime 65 ms.
[2026-06-01 01:49:45] [INFO ] Implicit Places using invariants in 1232 ms returned []
[2026-06-01 01:49:45] [INFO ] Flow matrix only has 4208 transitions (discarded 17 similar events)
[2026-06-01 01:49:45] [INFO ] Invariant cache hit.
[2026-06-01 01:49:47] [INFO ] State equation strengthened by 11 read => feed constraints.
[2026-06-01 01:49:48] [INFO ] Implicit Places using invariants and state equation in 3276 ms returned []
Implicit Place search using SMT with State Equation took 4527 ms to find 0 implicit places.
[2026-06-01 01:49:49] [INFO ] Redundant transitions in 566 ms returned []
Running 4217 sub problems to find dead transitions.
[2026-06-01 01:49:49] [INFO ] Flow matrix only has 4208 transitions (discarded 17 similar events)
[2026-06-01 01:49:49] [INFO ] Invariant cache hit.
[2026-06-01 01:49:49] [INFO ] State equation strengthened by 11 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 4217 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 73/4282 variables, and 8 constraints, problems are : Problem set: 0 solved, 4217 unsolved in 30123 ms.
Refiners :[Positive P Invariants (semi-flows): 0/14 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/74 constraints, ReadFeed: 0/11 constraints, PredecessorRefiner: 4217/34 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4217 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 4217 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 73/4282 variables, and 8 constraints, problems are : Problem set: 0 solved, 4217 unsolved in 30116 ms.
Refiners :[Positive P Invariants (semi-flows): 0/14 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/74 constraints, ReadFeed: 0/11 constraints, PredecessorRefiner: 4183/34 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 67503ms problems are : Problem set: 0 solved, 4217 unsolved
Search for dead transitions found 0 dead transitions in 67522ms
Starting structural reductions in SI_LTL mode, iteration 1 : 74/185 places, 4225/19875 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 75976 ms. Remains : 74/185 places, 4225/19875 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p0)||p1))))'
Stuttering acceptance computed with spot in 96 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ErlangenMainframeV1-PT-bP08C08-LTLFireability-08
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 1 ms.
FORMULA ErlangenMainframeV1-PT-bP08C08-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV1-PT-bP08C08-LTLFireability-08 finished in 76132 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 9 out of 185 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 185/185 places, 19875/19875 transitions.
Graph (trivial) has 150 edges and 185 vertex of which 11 / 185 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 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 25 place count 178 transition count 19843
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 33 rules applied. Total rules applied 58 place count 154 transition count 19834
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 64 place count 148 transition count 19834
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 64 place count 148 transition count 19822
Deduced a syphon composed of 12 places in 11 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 88 place count 136 transition count 19822
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 96 place count 128 transition count 13517
Iterating global reduction 3 with 8 rules applied. Total rules applied 104 place count 128 transition count 13517
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 112 place count 120 transition count 907
Iterating global reduction 3 with 8 rules applied. Total rules applied 120 place count 120 transition count 907
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 121 place count 119 transition count 905
Iterating global reduction 3 with 1 rules applied. Total rules applied 122 place count 119 transition count 905
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 44
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 210 place count 75 transition count 861
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 216 place count 75 transition count 855
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 219 place count 72 transition count 848
Iterating global reduction 4 with 3 rules applied. Total rules applied 222 place count 72 transition count 848
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 4 with 14 rules applied. Total rules applied 236 place count 65 transition count 866
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 248 place count 65 transition count 854
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 250 place count 63 transition count 850
Iterating global reduction 5 with 2 rules applied. Total rules applied 252 place count 63 transition count 850
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 262 place count 63 transition count 840
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 264 place count 62 transition count 853
Drop transitions (Redundant composition of simpler transitions.) removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 6 with 15 rules applied. Total rules applied 279 place count 62 transition count 838
Applied a total of 279 rules in 2265 ms. Remains 62 /185 variables (removed 123) and now considering 838/19875 (removed 19037) transitions.
[2026-06-01 01:50:59] [INFO ] Flow matrix only has 820 transitions (discarded 18 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1753233662967575999.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8075303738394699995.kers'
[2026-06-01 01:50:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1753233662967575999.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8075303738394699995.kers]
Normalized transition count is 819 out of 820 initially.
Culled 0 columns in 2 ms.
// Phase 1: matrix 819 rows 62 cols 15102 entries
Finished phase 1 with 38 SingleSign rule and 2 generalized
[2026-06-01 01:50:59] [INFO ] Computed 22 invariants in 9 ms
Computed 22 P flows in 10 ms.
Exported basis to /tmp/petrispot-output-8075303738394699995.kers
Total runtime 14 ms.
[2026-06-01 01:50:59] [INFO ] Implicit Places using invariants in 522 ms returned []
[2026-06-01 01:50:59] [INFO ] Flow matrix only has 820 transitions (discarded 18 similar events)
[2026-06-01 01:50:59] [INFO ] Invariant cache hit.
[2026-06-01 01:51:00] [INFO ] State equation strengthened by 22 read => feed constraints.
[2026-06-01 01:51:00] [INFO ] Implicit Places using invariants and state equation in 961 ms returned []
Implicit Place search using SMT with State Equation took 1486 ms to find 0 implicit places.
[2026-06-01 01:51:00] [INFO ] Redundant transitions in 17 ms returned []
Running 830 sub problems to find dead transitions.
[2026-06-01 01:51:00] [INFO ] Flow matrix only has 820 transitions (discarded 18 similar events)
[2026-06-01 01:51:00] [INFO ] Invariant cache hit.
[2026-06-01 01:51:00] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 830 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 830 unsolved
At refinement iteration 2 (OVERLAPS) 1/62 variables, 14/22 constraints. Problems are: Problem set: 0 solved, 830 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 830 unsolved
At refinement iteration 4 (OVERLAPS) 819/881 variables, 62/84 constraints. Problems are: Problem set: 0 solved, 830 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/881 variables, 21/105 constraints. Problems are: Problem set: 0 solved, 830 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 881/882 variables, and 105 constraints, problems are : Problem set: 0 solved, 830 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 62/62 constraints, ReadFeed: 21/22 constraints, PredecessorRefiner: 830/31 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 830 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 830 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 830 unsolved
At refinement iteration 2 (OVERLAPS) 1/62 variables, 14/22 constraints. Problems are: Problem set: 0 solved, 830 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 830 unsolved
At refinement iteration 4 (OVERLAPS) 819/881 variables, 62/84 constraints. Problems are: Problem set: 0 solved, 830 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/881 variables, 21/105 constraints. Problems are: Problem set: 0 solved, 830 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/881 variables, 31/136 constraints. Problems are: Problem set: 0 solved, 830 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 881/882 variables, and 136 constraints, problems are : Problem set: 0 solved, 830 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 62/62 constraints, ReadFeed: 21/22 constraints, PredecessorRefiner: 830/31 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61125ms problems are : Problem set: 0 solved, 830 unsolved
Search for dead transitions found 0 dead transitions in 61128ms
Starting structural reductions in SI_LTL mode, iteration 1 : 62/185 places, 838/19875 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 64905 ms. Remains : 62/185 places, 838/19875 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : ErlangenMainframeV1-PT-bP08C08-LTLFireability-10
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA ErlangenMainframeV1-PT-bP08C08-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV1-PT-bP08C08-LTLFireability-10 finished in 64983 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)) U G((F(!p1)||G(!p2))))))'
Support contains 26 out of 185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 19875/19875 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 177 transition count 13570
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 177 transition count 13570
Applied a total of 16 rules in 541 ms. Remains 177 /185 variables (removed 8) and now considering 13570/19875 (removed 6305) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4352531422370985128.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17096214180237438982.kers'
[2026-06-01 01:52:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4352531422370985128.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17096214180237438982.kers]
Culled 0 columns in 44 ms.
// Phase 1: matrix 13570 rows 177 cols 267573 entries
Finished phase 1 with 153 SingleSign rule and 2 generalized
[2026-06-01 01:52:02] [INFO ] Computed 22 invariants in 163 ms
Computed 22 P flows in 165 ms.
Exported basis to /tmp/petrispot-output-17096214180237438982.kers
Total runtime 207 ms.
[2026-06-01 01:52:05] [INFO ] Implicit Places using invariants in 2734 ms returned []
Implicit Place search using SMT only with invariants took 2738 ms to find 0 implicit places.
Running 13569 sub problems to find dead transitions.
[2026-06-01 01:52:05] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/176 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 13569 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 176/13747 variables, and 8 constraints, problems are : Problem set: 0 solved, 13569 unsolved in 30352 ms.
Refiners :[Positive P Invariants (semi-flows): 0/14 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/177 constraints, PredecessorRefiner: 13569/167 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13569 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/176 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 13569 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 176/13747 variables, and 8 constraints, problems are : Problem set: 0 solved, 13569 unsolved in 30352 ms.
Refiners :[Positive P Invariants (semi-flows): 0/14 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/177 constraints, PredecessorRefiner: 13402/167 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 93514ms problems are : Problem set: 0 solved, 13569 unsolved
Search for dead transitions found 0 dead transitions in 93620ms
Starting structural reductions in LTL mode, iteration 1 : 177/185 places, 13570/19875 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 96976 ms. Remains : 177/185 places, 13570/19875 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)) U G((F(!p1)||G(!p2))))))'
Stuttering acceptance computed with spot in 344 ms :[(AND p1 p2), (AND p1 p2), (AND p1 p2), (AND p1 p2), (AND p1 (NOT p0)), (AND p1 (NOT p0) (NOT p2))]
Running random walk in product with property : ErlangenMainframeV1-PT-bP08C08-LTLFireability-11
Product exploration timeout after 46250 steps with 0 reset in 10002 ms.
Product exploration timeout after 44840 steps with 0 reset in 10003 ms.
Computed a total of 19 stabilizing places and 19 stable transitions
Computed a total of 19 stabilizing places and 19 stable transitions
Knowledge based reduction with 15 factoid took 72 ms. Reduced automaton from 6 states, 18 edges and 3 AP (stutter sensitive) to 5 states, 17 edges and 3 AP (stutter insensitive).
RANDOM walk for 40000 steps (8 resets) in 11487 ms. (3 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (8 resets) in 5044 ms. (7 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (8 resets) in 3954 ms. (10 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (8 resets) in 4942 ms. (8 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (8 resets) in 5588 ms. (7 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 3978 ms. (10 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (8 resets) in 5777 ms. (6 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40000 steps (8 resets) in 5043 ms. (7 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40000 steps (8 resets) in 5197 ms. (7 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 1109489 steps, run timeout after 48001 ms. (steps per millisecond=23 ) properties seen :0 out of 8
Probabilistic random walk after 1109489 steps, saw 150402 distinct states, run finished after 48002 ms. (steps per millisecond=23 ) properties seen :0
[2026-06-01 01:55:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem apf1 is UNSAT
Problem apf2 is UNSAT
At refinement iteration 1 (OVERLAPS) 84/110 variables, 10/10 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 0/10 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 59/169 variables, 4/14 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/169 variables, 0/14 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 8/177 variables, 8/22 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/177 variables, 0/22 constraints. Problems are: Problem set: 2 solved, 6 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 13747/13747 variables, and 199 constraints, problems are : Problem set: 2 solved, 6 unsolved in 5013 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 177/177 constraints, PredecessorRefiner: 8/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 84/110 variables, 10/10 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 0/10 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 59/169 variables, 4/14 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/169 variables, 0/14 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 8/177 variables, 8/22 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/177 variables, 0/22 constraints. Problems are: Problem set: 2 solved, 6 unsolved
SMT process timed out in 10121ms, After SMT, problems are : Problem set: 2 solved, 6 unsolved
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 26 out of 177 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 177/177 places, 13570/13570 transitions.
Graph (trivial) has 132 edges and 177 vertex of which 9 / 177 are part of one of the 4 SCC in 0 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 27 place count 172 transition count 13534
Reduce places removed 26 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 35 rules applied. Total rules applied 62 place count 146 transition count 13525
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 68 place count 140 transition count 13525
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 68 place count 140 transition count 13511
Deduced a syphon composed of 14 places in 7 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 96 place count 126 transition count 13511
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 4 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 166 place count 91 transition count 13476
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 172 place count 91 transition count 13470
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 175 place count 88 transition count 13463
Iterating global reduction 4 with 3 rules applied. Total rules applied 178 place count 88 transition count 13463
Performed 7 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 7 places in 4 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 192 place count 81 transition count 13495
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 204 place count 81 transition count 13483
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 206 place count 79 transition count 13477
Iterating global reduction 5 with 2 rules applied. Total rules applied 208 place count 79 transition count 13477
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 218 place count 79 transition count 13467
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 220 place count 78 transition count 13480
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 221 place count 78 transition count 13479
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 7 with 8 rules applied. Total rules applied 229 place count 78 transition count 13471
Free-agglomeration rule applied 6 times.
Iterating global reduction 7 with 6 rules applied. Total rules applied 235 place count 78 transition count 13465
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 241 place count 72 transition count 13465
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 8 with 8 rules applied. Total rules applied 249 place count 72 transition count 13457
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 8 with 1 rules applied. Total rules applied 250 place count 72 transition count 13463
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 253 place count 71 transition count 13461
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 9 with 13 rules applied. Total rules applied 266 place count 71 transition count 13448
Partial Post-agglomeration rule applied 4 times.
Drop transitions (Partial Post agglomeration) removed 4 transitions
Iterating global reduction 9 with 4 rules applied. Total rules applied 270 place count 71 transition count 13448
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 9 with 4 rules applied. Total rules applied 274 place count 71 transition count 13444
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 275 place count 70 transition count 13443
Applied a total of 275 rules in 9252 ms. Remains 70 /177 variables (removed 107) and now considering 13443/13570 (removed 127) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9254 ms. Remains : 70/177 places, 13443/13570 transitions.
RANDOM walk for 40000 steps (8 resets) in 8323 ms. (4 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 4683 ms. (8 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 3790 ms. (10 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 3776 ms. (10 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 4404 ms. (9 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 1641 ms. (24 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (8 resets) in 4591 ms. (8 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 511534 steps, run timeout after 24001 ms. (steps per millisecond=21 ) properties seen :0 out of 6
Probabilistic random walk after 511534 steps, saw 79474 distinct states, run finished after 24001 ms. (steps per millisecond=21 ) properties seen :0
[2026-06-01 01:55:55] [INFO ] Flow matrix only has 13441 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-3044660541489725066.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13451829693240185499.kers'
[2026-06-01 01:55:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3044660541489725066.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13451829693240185499.kers]
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 44 ms.
// Phase 1: matrix 13441 rows 67 cols 267251 entries
Finished phase 1 with 46 SingleSign rule and 2 generalized
[2026-06-01 01:55:56] [INFO ] Computed 22 invariants in 184 ms
Computed 22 P flows in 185 ms.
Exported basis to /tmp/petrispot-output-13451829693240185499.kers
Total runtime 236 ms.
[2026-06-01 01:55:56] [INFO ] State equation strengthened by 28 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 14/40 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 23/63 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 3/66 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 13438/13504 variables, 66/86 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/13504 variables, 27/113 constraints. Problems are: Problem set: 0 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/13504 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 7/13511 variables, 4/117 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/13511 variables, 2/119 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/13511 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/13511 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 0/13511 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13511/13511 variables, and 120 constraints, problems are : Problem set: 0 solved, 6 unsolved in 24928 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 70/70 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 6/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 14/40 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 23/63 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 3/66 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 13438/13504 variables, 66/86 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/13504 variables, 27/113 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/13504 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 7/13511 variables, 4/117 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/13511 variables, 2/119 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/13511 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/13511 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 0/13511 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
After SMT solving in domain Int declared 13511/13511 variables, and 120 constraints, problems are : Problem set: 0 solved, 6 unsolved in 45044 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 70/70 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 6/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 70355ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 26 out of 70 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 70/70 places, 13443/13443 transitions.
Applied a total of 0 rules in 1161 ms. Remains 70 /70 variables (removed 0) and now considering 13443/13443 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1161 ms. Remains : 70/70 places, 13443/13443 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 70/70 places, 13443/13443 transitions.
Applied a total of 0 rules in 942 ms. Remains 70 /70 variables (removed 0) and now considering 13443/13443 (removed 0) transitions.
[2026-06-01 01:57:08] [INFO ] Flow matrix only has 13441 transitions (discarded 2 similar events)
[2026-06-01 01:57:08] [INFO ] Invariant cache hit.
[2026-06-01 01:57:11] [INFO ] Implicit Places using invariants in 3456 ms returned [55]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 3484 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 69/70 places, 13443/13443 transitions.
Applied a total of 0 rules in 922 ms. Remains 69 /69 variables (removed 0) and now considering 13443/13443 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 5354 ms. Remains : 69/70 places, 13443/13443 transitions.
Found 2 invariant AP formulas.
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 17 factoid took 14 ms. Proved property starting from automaton with 5 states, 17 edges and 3 AP (stutter insensitive
Knowledge-based reduction took 193405 ms.
FORMULA ErlangenMainframeV1-PT-bP08C08-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ErlangenMainframeV1-PT-bP08C08-LTLFireability-11 finished in 310877 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))))) U ((p1 U p2) U p3)))'
Support contains 28 out of 185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 19875/19875 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 181 transition count 14610
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 181 transition count 14610
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 180 transition count 10236
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 180 transition count 10236
Applied a total of 10 rules in 419 ms. Remains 180 /185 variables (removed 5) and now considering 10236/19875 (removed 9639) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11042198650328628295.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6977660022363255169.kers'
[2026-06-01 01:57:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11042198650328628295.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6977660022363255169.kers]
Culled 0 columns in 32 ms.
// Phase 1: matrix 10236 rows 180 cols 198813 entries
Finished phase 1 with 155 SingleSign rule and 3 generalized
[2026-06-01 01:57:13] [INFO ] Computed 22 invariants in 122 ms
Computed 22 P flows in 123 ms.
Exported basis to /tmp/petrispot-output-6977660022363255169.kers
Total runtime 172 ms.
[2026-06-01 01:57:15] [INFO ] Implicit Places using invariants in 2074 ms returned []
Implicit Place search using SMT only with invariants took 2079 ms to find 0 implicit places.
Running 10235 sub problems to find dead transitions.
[2026-06-01 01:57:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 10235 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 179/10416 variables, and 8 constraints, problems are : Problem set: 0 solved, 10235 unsolved in 30156 ms.
Refiners :[Positive P Invariants (semi-flows): 0/14 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/180 constraints, PredecessorRefiner: 10235/158 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10235 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 10235 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 179/10416 variables, and 8 constraints, problems are : Problem set: 0 solved, 10235 unsolved in 30164 ms.
Refiners :[Positive P Invariants (semi-flows): 0/14 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/180 constraints, PredecessorRefiner: 10077/158 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 80376ms problems are : Problem set: 0 solved, 10235 unsolved
Search for dead transitions found 0 dead transitions in 80414ms
Starting structural reductions in LTL mode, iteration 1 : 180/185 places, 10236/19875 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 82937 ms. Remains : 180/185 places, 10236/19875 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))))) U ((p1 U p2) U p3)))'
Stuttering acceptance computed with spot in 415 ms :[(NOT p3), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ErlangenMainframeV1-PT-bP08C08-LTLFireability-12
Product exploration timeout after 68660 steps with 0 reset in 10001 ms.
Stack based approach found an accepted trace after 26 steps with 0 reset with depth 27 and stack size 27 in 1 ms.
FORMULA ErlangenMainframeV1-PT-bP08C08-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property ErlangenMainframeV1-PT-bP08C08-LTLFireability-12 finished in 93476 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&(X(X(p2))||p1))))'
Support contains 17 out of 185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 19875/19875 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 169 transition count 13315
Ensure Unique test removed 7 places
Iterating global reduction 0 with 23 rules applied. Total rules applied 39 place count 162 transition count 13315
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 41 place count 160 transition count 6025
Iterating global reduction 0 with 2 rules applied. Total rules applied 43 place count 160 transition count 6025
Applied a total of 43 rules in 976 ms. Remains 160 /185 variables (removed 25) and now considering 6025/19875 (removed 13850) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1554593327625152726.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2405295187396323925.kers'
[2026-06-01 01:58:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1554593327625152726.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2405295187396323925.kers]
Culled 0 columns in 12 ms.
// Phase 1: matrix 6025 rows 160 cols 76352 entries
Finished phase 1 with 144 SingleSign rule and 1 generalized
[2026-06-01 01:58:47] [INFO ] Computed 15 invariants in 44 ms
Computed 15 P flows in 44 ms.
Exported basis to /tmp/petrispot-output-2405295187396323925.kers
Total runtime 63 ms.
[2026-06-01 01:58:48] [INFO ] Implicit Places using invariants in 1118 ms returned [69]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1135 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 159/185 places, 6025/19875 transitions.
Applied a total of 0 rules in 23 ms. Remains 159 /159 variables (removed 0) and now considering 6025/6025 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2136 ms. Remains : 159/185 places, 6025/19875 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&(X(X(p2))||p1))))'
Stuttering acceptance computed with spot in 237 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2), (NOT p2), true]
Running random walk in product with property : ErlangenMainframeV1-PT-bP08C08-LTLFireability-13
Product exploration explored 100000 steps with 0 reset in 9811 ms.
Stack based approach found an accepted trace after 51 steps with 0 reset with depth 52 and stack size 52 in 1 ms.
FORMULA ErlangenMainframeV1-PT-bP08C08-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property ErlangenMainframeV1-PT-bP08C08-LTLFireability-13 finished in 12239 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 X(p1)) U X((p2||G(F(p0))))))'
Support contains 25 out of 185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 19875/19875 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 177 transition count 13570
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 177 transition count 13570
Applied a total of 16 rules in 364 ms. Remains 177 /185 variables (removed 8) and now considering 13570/19875 (removed 6305) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11300665999500617486.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10421678669506667001.kers'
[2026-06-01 01:58:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11300665999500617486.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10421678669506667001.kers]
Culled 0 columns in 76 ms.
// Phase 1: matrix 13570 rows 177 cols 267573 entries
Finished phase 1 with 153 SingleSign rule and 2 generalized
[2026-06-01 01:58:59] [INFO ] Computed 22 invariants in 277 ms
Computed 22 P flows in 278 ms.
Exported basis to /tmp/petrispot-output-10421678669506667001.kers
Total runtime 343 ms.
[2026-06-01 01:59:02] [INFO ] Implicit Places using invariants in 3120 ms returned []
Implicit Place search using SMT only with invariants took 3122 ms to find 0 implicit places.
Running 13569 sub problems to find dead transitions.
[2026-06-01 01:59:02] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/176 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 13569 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 176/13747 variables, and 8 constraints, problems are : Problem set: 0 solved, 13569 unsolved in 30347 ms.
Refiners :[Positive P Invariants (semi-flows): 0/14 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/177 constraints, PredecessorRefiner: 13569/167 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13569 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/176 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 13569 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 176/13747 variables, and 8 constraints, problems are : Problem set: 0 solved, 13569 unsolved in 30353 ms.
Refiners :[Positive P Invariants (semi-flows): 0/14 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/177 constraints, PredecessorRefiner: 13402/167 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 92387ms problems are : Problem set: 0 solved, 13569 unsolved
Search for dead transitions found 0 dead transitions in 92461ms
Starting structural reductions in LTL mode, iteration 1 : 177/185 places, 13570/19875 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 95981 ms. Remains : 177/185 places, 13570/19875 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 X(p1)) U X((G(F(p0))||p2))))'
Stuttering acceptance computed with spot in 379 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ErlangenMainframeV1-PT-bP08C08-LTLFireability-14
Product exploration timeout after 44770 steps with 0 reset in 10001 ms.
Stack based approach found an accepted trace after 37 steps with 0 reset with depth 38 and stack size 38 in 1 ms.
FORMULA ErlangenMainframeV1-PT-bP08C08-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property ErlangenMainframeV1-PT-bP08C08-LTLFireability-14 finished in 106488 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(G(p1)))))'
Support contains 16 out of 185 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 185/185 places, 19875/19875 transitions.
Graph (trivial) has 150 edges and 185 vertex of which 11 / 185 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 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 25 place count 178 transition count 19843
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 33 rules applied. Total rules applied 58 place count 154 transition count 19834
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 64 place count 148 transition count 19834
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 64 place count 148 transition count 19822
Deduced a syphon composed of 12 places in 17 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 88 place count 136 transition count 19822
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 89 place count 135 transition count 17635
Iterating global reduction 3 with 1 rules applied. Total rules applied 90 place count 135 transition count 17635
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 91 place count 134 transition count 13261
Iterating global reduction 3 with 1 rules applied. Total rules applied 92 place count 134 transition count 13261
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
Deduced a syphon composed of 46 places in 3 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 3 with 92 rules applied. Total rules applied 184 place count 88 transition count 13215
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 190 place count 88 transition count 13209
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 193 place count 85 transition count 13202
Iterating global reduction 4 with 3 rules applied. Total rules applied 196 place count 85 transition count 13202
Performed 6 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 6 places in 3 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 208 place count 79 transition count 13220
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 220 place count 79 transition count 13208
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 222 place count 77 transition count 13204
Iterating global reduction 5 with 2 rules applied. Total rules applied 224 place count 77 transition count 13204
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 234 place count 77 transition count 13194
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 236 place count 76 transition count 13207
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 6 with 9 rules applied. Total rules applied 245 place count 76 transition count 13198
Applied a total of 245 rules in 23707 ms. Remains 76 /185 variables (removed 109) and now considering 13198/19875 (removed 6677) transitions.
[2026-06-01 02:01:08] [INFO ] Flow matrix only has 13180 transitions (discarded 18 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4294469284860599265.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4517309071028476642.kers'
[2026-06-01 02:01:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4294469284860599265.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4517309071028476642.kers]
Normalized transition count is 13179 out of 13180 initially.
Culled 0 columns in 44 ms.
// Phase 1: matrix 13179 rows 76 cols 253978 entries
Finished phase 1 with 51 SingleSign rule and 3 generalized
[2026-06-01 02:01:09] [INFO ] Computed 22 invariants in 177 ms
Computed 22 P flows in 178 ms.
Exported basis to /tmp/petrispot-output-4517309071028476642.kers
Total runtime 257 ms.
[2026-06-01 02:01:14] [INFO ] Implicit Places using invariants in 5445 ms returned []
Implicit Place search using SMT only with invariants took 5448 ms to find 0 implicit places.
Running 13190 sub problems to find dead transitions.
[2026-06-01 02:01:14] [INFO ] Flow matrix only has 13180 transitions (discarded 18 similar events)
[2026-06-01 02:01:14] [INFO ] Invariant cache hit.
[2026-06-01 02:01:14] [INFO ] State equation strengthened by 28 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 13190 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 75/13256 variables, and 8 constraints, problems are : Problem set: 0 solved, 13190 unsolved in 30212 ms.
Refiners :[Positive P Invariants (semi-flows): 0/14 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/76 constraints, ReadFeed: 0/28 constraints, PredecessorRefiner: 13190/19 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13190 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 13190 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 75/13256 variables, and 8 constraints, problems are : Problem set: 0 solved, 13190 unsolved in 30278 ms.
Refiners :[Positive P Invariants (semi-flows): 0/14 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/76 constraints, ReadFeed: 0/28 constraints, PredecessorRefiner: 13171/19 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 90160ms problems are : Problem set: 0 solved, 13190 unsolved
Search for dead transitions found 0 dead transitions in 90235ms
Starting structural reductions in SI_LTL mode, iteration 1 : 76/185 places, 13198/19875 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 119430 ms. Remains : 76/185 places, 13198/19875 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(G(p1)))))'
Stuttering acceptance computed with spot in 114 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ErlangenMainframeV1-PT-bP08C08-LTLFireability-15
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA ErlangenMainframeV1-PT-bP08C08-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV1-PT-bP08C08-LTLFireability-15 finished in 119612 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((X(X(p0))||(p1&&G(p2)))))))'
Spot run failed in 56 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
[2026-06-01 02:02:47] [INFO ] Flatten gal took : 2612 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin548762846710765445
[2026-06-01 02:02:48] [INFO ] Too many transitions (19875) to apply POR reductions. Disabling POR matrices.
[2026-06-01 02:02:49] [INFO ] Built C files in 514ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin548762846710765445
Running compilation step : cd /tmp/ltsmin548762846710765445;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2026-06-01 02:02:50] [INFO ] Applying decomposition
[2026-06-01 02:02:52] [INFO ] Flatten gal took : 2211 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph2342460375839081879.txt' '-o' '/tmp/graph2342460375839081879.bin' '-w' '/tmp/graph2342460375839081879.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph2342460375839081879.bin' '-l' '-1' '-v' '-w' '/tmp/graph2342460375839081879.weights' '-q' '0' '-e' '0.001'
[2026-06-01 02:02:59] [INFO ] Decomposing Gal with order
[2026-06-01 02:02:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-06-01 02:03:04] [INFO ] Removed a total of 159702 redundant transitions.
[2026-06-01 02:03:04] [INFO ] Flatten gal took : 4098 ms
[2026-06-01 02:03:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 134 labels/synchronizations in 1476 ms.
[2026-06-01 02:03:07] [INFO ] Time to serialize gal into /tmp/LTLFireability5795703976064391978.gal : 152 ms
[2026-06-01 02:03:07] [INFO ] Time to serialize properties into /tmp/LTLFireability13325271731111844105.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability5795703976064391978.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability13325271731111844105.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(X(G((X(X("(((((i6.u6.p15==0)||(i6.u12.p45==0))||((i6.u37.p53==0)||(i5.u16.p72==0)))||(((i6.u55.p102==0)||(i6.u24.p121==0))||((i6....628
Formula 0 simplified : XXF(XX!"(((((i6.u6.p15==0)||(i6.u12.p45==0))||((i6.u37.p53==0)||(i5.u16.p72==0)))||(((i6.u55.p102==0)||(i6.u24.p121==0))||((i6.u26.p...614
Compilation finished in 554124 ms.
Running link step : cd /tmp/ltsmin548762846710765445;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 518 ms.
Running LTSmin : cd /tmp/ltsmin548762846710765445;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' 'X(X([]((X(X((LTLAPp0==true)))||((LTLAPp1==true)&&[]((LTLAPp2==true)))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2026-06-01 02:31:39] [INFO ] Applying decomposition
[2026-06-01 02:32:12] [INFO ] Flatten gal took : 32573 ms
[2026-06-01 02:32:17] [INFO ] Decomposing Gal with order
[2026-06-01 02:32:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-06-01 02:32:28] [INFO ] Removed a total of 190277 redundant transitions.
[2026-06-01 02:32:28] [INFO ] Flatten gal took : 8636 ms
[2026-06-01 02:32:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 362 labels/synchronizations in 872 ms.
[2026-06-01 02:32:30] [INFO ] Time to serialize gal into /tmp/LTLFireability11545924161772189471.gal : 11 ms
[2026-06-01 02:32:30] [INFO ] Time to serialize properties into /tmp/LTLFireability6272987332464395211.ltl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability11545924161772189471.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability6272987332464395211.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(X(G((X(X("(((((i0.i0.i0.i0.i0.i0.i0.i0.u9.p15==0)||(i0.i0.i0.i0.i0.i0.i0.i0.u10.p45==0))||((i0.i0.i0.i0.i0.i0.i0.u11.p53==0)||(i0...959
Formula 0 simplified : XXF(XX!"(((((i0.i0.i0.i0.i0.i0.i0.i0.u9.p15==0)||(i0.i0.i0.i0.i0.i0.i0.i0.u10.p45==0))||((i0.i0.i0.i0.i0.i0.i0.u11.p53==0)||(i0.i0.i...945
Reverse transition relation is NOT exact ! Due to transitions i0.t19626, i0.i0.u16.t92, i0.i0.u16.t13276, i0.i0.u16.t13277, i0.i0.i0.t93, i0.i0.i0.u15.t97,...1072
41 unique states visited
38 strongly connected components in search stack
42 transitions explored
38 items max in DFS search stack
17285 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,172.917,1736892,1,0,2.38242e+06,30100,3182,1.24244e+07,970,259236,554591
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ErlangenMainframeV1-PT-bP08C08-LTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 3459906 ms.

BK_STOP 1780281344450

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

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