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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.7M
-rw-r--r-- 1 mcc users 8.7K May 27 09:32 CTLCardinality.txt
-rw-r--r-- 1 mcc users 99K May 27 09:32 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 27 09:32 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K May 27 09:32 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 27 10:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 27 10:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 27 10:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 27 10:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 26 18:17 NewModel
-rw-r--r-- 1 mcc users 13K May 27 09:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 130K May 27 09:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K May 27 09:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 46K May 27 09:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 27 10:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 27 10:43 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 6.3M May 26 18:17 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1780389532183

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ErlangenMainframeV2-PT-bP07C07
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-06-02 08:38:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-06-02 08:38:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-06-02 08:38:55] [INFO ] Load time of PNML (sax parser for PT used): 1001 ms
[2026-06-02 08:38:55] [INFO ] Transformed 299 places.
[2026-06-02 08:38:55] [INFO ] Transformed 6883 transitions.
[2026-06-02 08:38:55] [INFO ] Found NUPN structural information;
[2026-06-02 08:38:55] [INFO ] Parsed PT model containing 299 places and 6883 transitions and 127701 arcs in 1286 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 18 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA ErlangenMainframeV2-PT-bP07C07-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Initial state reduction rules removed 1 formulas.
FORMULA ErlangenMainframeV2-PT-bP07C07-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 53 out of 299 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 299/299 places, 6883/6883 transitions.
Discarding 69 places :
Symmetric choice reduction at 0 with 69 rule applications. Total rules 69 place count 230 transition count 6814
Iterating global reduction 0 with 69 rules applied. Total rules applied 138 place count 230 transition count 6814
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 179 place count 189 transition count 6773
Iterating global reduction 0 with 41 rules applied. Total rules applied 220 place count 189 transition count 6773
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 223 place count 186 transition count 6770
Iterating global reduction 0 with 3 rules applied. Total rules applied 226 place count 186 transition count 6770
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 227 place count 185 transition count 6761
Iterating global reduction 0 with 1 rules applied. Total rules applied 228 place count 185 transition count 6761
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 229 place count 184 transition count 6760
Iterating global reduction 0 with 1 rules applied. Total rules applied 230 place count 184 transition count 6760
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 231 place count 183 transition count 6759
Iterating global reduction 0 with 1 rules applied. Total rules applied 232 place count 183 transition count 6759
Applied a total of 232 rules in 571 ms. Remains 183 /299 variables (removed 116) and now considering 6759/6883 (removed 124) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9906073726187839370.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1689756052635290026.kers'
[2026-06-02 08:38:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9906073726187839370.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1689756052635290026.kers]
Culled 0 columns in 39 ms.
// Phase 1: matrix 6759 rows 183 cols 127417 entries
Finished phase 1 with 158 SingleSign rule and 3 generalized
[2026-06-02 08:38:57] [INFO ] Computed 22 invariants in 134 ms
Computed 22 P flows in 136 ms.
Exported basis to /tmp/petrispot-output-1689756052635290026.kers
Total runtime 170 ms.
[2026-06-02 08:38:57] [INFO ] Implicit Places using invariants in 828 ms returned []
[2026-06-02 08:38:57] [INFO ] Invariant cache hit.
[2026-06-02 08:39:01] [INFO ] Implicit Places using invariants and state equation in 3726 ms returned []
Implicit Place search using SMT with State Equation took 4632 ms to find 0 implicit places.
Running 6758 sub problems to find dead transitions.
[2026-06-02 08:39:01] [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/182 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 6758 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 182/6942 variables, and 8 constraints, problems are : Problem set: 0 solved, 6758 unsolved in 30400 ms.
Refiners :[Positive P Invariants (semi-flows): 0/14 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/183 constraints, PredecessorRefiner: 6758/164 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6758 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/182 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 6758 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 182/6942 variables, and 8 constraints, problems are : Problem set: 0 solved, 6758 unsolved in 30219 ms.
Refiners :[Positive P Invariants (semi-flows): 0/14 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/183 constraints, PredecessorRefiner: 6594/164 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 74061ms problems are : Problem set: 0 solved, 6758 unsolved
Search for dead transitions found 0 dead transitions in 74269ms
Starting structural reductions in LTL mode, iteration 1 : 183/299 places, 6759/6883 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 79620 ms. Remains : 183/299 places, 6759/6883 transitions.
Starting structural reductions in LTL mode, iteration 0 : 183/183 places, 6759/6759 transitions.
Applied a total of 0 rules in 56 ms. Remains 183 /183 variables (removed 0) and now considering 6759/6759 (removed 0) transitions.
[2026-06-02 08:40:16] [INFO ] Invariant cache hit.
[2026-06-02 08:40:16] [INFO ] Implicit Places using invariants in 198 ms returned []
[2026-06-02 08:40:16] [INFO ] Invariant cache hit.
[2026-06-02 08:40:19] [INFO ] Implicit Places using invariants and state equation in 3529 ms returned []
Implicit Place search using SMT with State Equation took 3731 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 3796 ms. Remains : 183/183 places, 6759/6759 transitions.
Support contains 53 out of 183 places after structural reductions.
[2026-06-02 08:40:22] [INFO ] Flatten gal took : 1611 ms
[2026-06-02 08:40:23] [INFO ] Flatten gal took : 1004 ms
[2026-06-02 08:40:25] [INFO ] Input system was already deterministic with 6759 transitions.
Support contains 50 out of 183 places (down from 53) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 9029 ms. (4 steps per ms) remains 31/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 93 ms. (42 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 318 ms. (12 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 194 ms. (20 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 149 ms. (26 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 80 ms. (49 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 38 ms. (102 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (8 resets) in 32 ms. (121 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (8 resets) in 29 ms. (133 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 33 ms. (117 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (8 resets) in 35 ms. (111 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (8 resets) in 32 ms. (121 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 39 ms. (100 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 87 ms. (45 steps per ms) remains 31/31 properties
Interrupted probabilistic random walk after 199271 steps, run timeout after 6001 ms. (steps per millisecond=33 ) properties seen :1 out of 31
Probabilistic random walk after 199271 steps, saw 30048 distinct states, run finished after 6008 ms. (steps per millisecond=33 ) properties seen :1
[2026-06-02 08:40:34] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 28/75 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (OVERLAPS) 66/141 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/141 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (OVERLAPS) 42/183 variables, 8/23 constraints. Problems are: Problem set: 0 solved, 30 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 183/6942 variables, and 23 constraints, problems are : Problem set: 0 solved, 30 unsolved in 5041 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/183 constraints, PredecessorRefiner: 30/0 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 30 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 28/75 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (OVERLAPS) 66/141 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/141 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (OVERLAPS) 42/183 variables, 8/23 constraints. Problems are: Problem set: 0 solved, 30 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 183/6942 variables, and 23 constraints, problems are : Problem set: 0 solved, 30 unsolved in 5084 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/183 constraints, PredecessorRefiner: 30/0 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10328ms problems are : Problem set: 0 solved, 30 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 47 out of 183 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 6759/6759 transitions.
Graph (trivial) has 122 edges and 183 vertex of which 9 / 183 are part of one of the 4 SCC in 11 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 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 29 place count 178 transition count 6721
Reduce places removed 28 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 45 rules applied. Total rules applied 74 place count 150 transition count 6704
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 84 place count 140 transition count 6704
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 84 place count 140 transition count 6691
Deduced a syphon composed of 13 places in 4 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 110 place count 127 transition count 6691
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 112 place count 125 transition count 6681
Iterating global reduction 3 with 2 rules applied. Total rules applied 114 place count 125 transition count 6681
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 3 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 164 place count 100 transition count 6656
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 166 place count 100 transition count 6654
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 169 place count 97 transition count 6647
Iterating global reduction 4 with 3 rules applied. Total rules applied 172 place count 97 transition count 6647
Performed 7 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 7 places in 6 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 186 place count 90 transition count 6675
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 198 place count 90 transition count 6663
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 200 place count 88 transition count 6657
Iterating global reduction 5 with 2 rules applied. Total rules applied 202 place count 88 transition count 6657
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 212 place count 88 transition count 6647
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 214 place count 87 transition count 6660
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 215 place count 87 transition count 6659
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 223 place count 87 transition count 6651
Free-agglomeration rule applied 3 times.
Iterating global reduction 7 with 3 rules applied. Total rules applied 226 place count 87 transition count 6648
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 229 place count 84 transition count 6648
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 230 place count 84 transition count 6647
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 8 with 1 rules applied. Total rules applied 231 place count 84 transition count 6653
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 234 place count 83 transition count 6651
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 247 place count 83 transition count 6638
Partial Post-agglomeration rule applied 7 times.
Drop transitions (Partial Post agglomeration) removed 7 transitions
Iterating global reduction 9 with 7 rules applied. Total rules applied 254 place count 83 transition count 6638
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 9 with 7 rules applied. Total rules applied 261 place count 83 transition count 6631
Applied a total of 261 rules in 14021 ms. Remains 83 /183 variables (removed 100) and now considering 6631/6759 (removed 128) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14023 ms. Remains : 83/183 places, 6631/6759 transitions.
RANDOM walk for 40000 steps (8 resets) in 6515 ms. (6 steps per ms) remains 29/30 properties
BEST_FIRST walk for 4001 steps (8 resets) in 169 ms. (23 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 89 ms. (44 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 148 ms. (26 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4001 steps (8 resets) in 156 ms. (25 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (8 resets) in 140 ms. (28 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 158 ms. (25 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4001 steps (8 resets) in 166 ms. (23 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 104 ms. (38 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4001 steps (8 resets) in 181 ms. (21 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 97 ms. (40 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 201 ms. (19 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 203 ms. (19 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 101 ms. (39 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 86 ms. (46 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 79 ms. (50 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (8 resets) in 144 ms. (27 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (8 resets) in 165 ms. (24 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4001 steps (8 resets) in 173 ms. (22 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 145 ms. (27 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (8 resets) in 183 ms. (21 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (8 resets) in 91 ms. (43 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (8 resets) in 86 ms. (46 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 97 ms. (40 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 176 ms. (22 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (8 resets) in 189 ms. (21 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 201 ms. (19 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4001 steps (8 resets) in 187 ms. (21 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 103 ms. (38 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 93 ms. (42 steps per ms) remains 29/29 properties
Interrupted probabilistic random walk after 205203 steps, run timeout after 9001 ms. (steps per millisecond=22 ) properties seen :2 out of 29
Probabilistic random walk after 205203 steps, saw 40703 distinct states, run finished after 9002 ms. (steps per millisecond=22 ) properties seen :2
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8444841089167246980.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16083050496963020776.kers'
[2026-06-02 08:41:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8444841089167246980.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16083050496963020776.kers]
Culled 0 columns in 35 ms.
// Phase 1: matrix 6631 rows 83 cols 127081 entries
Finished phase 1 with 58 SingleSign rule and 3 generalized
[2026-06-02 08:41:10] [INFO ] Computed 22 invariants in 124 ms
Computed 22 P flows in 125 ms.
Exported basis to /tmp/petrispot-output-16083050496963020776.kers
Total runtime 165 ms.
[2026-06-02 08:41:10] [INFO ] State equation strengthened by 31 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (OVERLAPS) 6/53 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 4 (OVERLAPS) 8/61 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 6 (OVERLAPS) 22/83 variables, 8/23 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/83 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 8 (OVERLAPS) 6631/6714 variables, 83/106 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/6714 variables, 31/137 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/6714 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 11 (OVERLAPS) 0/6714 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Real declared 6714/6714 variables, and 137 constraints, problems are : Problem set: 0 solved, 27 unsolved in 41223 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 83/83 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 27/0 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 27 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (OVERLAPS) 6/53 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 4 (OVERLAPS) 8/61 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 6 (OVERLAPS) 22/83 variables, 8/23 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/83 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 8 (OVERLAPS) 6631/6714 variables, 83/106 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/6714 variables, 31/137 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/6714 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 27 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 6714/6714 variables, and 137 constraints, problems are : Problem set: 0 solved, 27 unsolved in 45047 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 83/83 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 27/0 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 86600ms problems are : Problem set: 0 solved, 27 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 47 out of 83 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 6631/6631 transitions.
Applied a total of 0 rules in 1550 ms. Remains 83 /83 variables (removed 0) and now considering 6631/6631 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1551 ms. Remains : 83/83 places, 6631/6631 transitions.
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(p0)||X(p1)))'
Support contains 19 out of 183 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 183/183 places, 6759/6759 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 174 transition count 4690
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 174 transition count 4690
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 22 place count 170 transition count 2258
Iterating global reduction 0 with 4 rules applied. Total rules applied 26 place count 170 transition count 2258
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 29 place count 167 transition count 2254
Iterating global reduction 0 with 3 rules applied. Total rules applied 32 place count 167 transition count 2254
Applied a total of 32 rules in 221 ms. Remains 167 /183 variables (removed 16) and now considering 2254/6759 (removed 4505) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3761450273277321288.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15047943668112210597.kers'
[2026-06-02 08:42:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3761450273277321288.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15047943668112210597.kers]
Culled 0 columns in 11 ms.
// Phase 1: matrix 2254 rows 167 cols 41683 entries
Finished phase 1 with 143 SingleSign rule and 2 generalized
[2026-06-02 08:42:39] [INFO ] Computed 22 invariants in 40 ms
Computed 22 P flows in 41 ms.
Exported basis to /tmp/petrispot-output-15047943668112210597.kers
Total runtime 51 ms.
[2026-06-02 08:42:40] [INFO ] Implicit Places using invariants in 980 ms returned []
[2026-06-02 08:42:40] [INFO ] Invariant cache hit.
[2026-06-02 08:42:42] [INFO ] Implicit Places using invariants and state equation in 1958 ms returned []
Implicit Place search using SMT with State Equation took 2947 ms to find 0 implicit places.
Running 2253 sub problems to find dead transitions.
[2026-06-02 08:42:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2253 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 166/2421 variables, and 8 constraints, problems are : Problem set: 0 solved, 2253 unsolved in 30078 ms.
Refiners :[Positive P Invariants (semi-flows): 0/14 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/167 constraints, PredecessorRefiner: 2253/157 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2253 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2253 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 166/2421 variables, and 8 constraints, problems are : Problem set: 0 solved, 2253 unsolved in 30111 ms.
Refiners :[Positive P Invariants (semi-flows): 0/14 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/167 constraints, PredecessorRefiner: 2096/157 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 63593ms problems are : Problem set: 0 solved, 2253 unsolved
Search for dead transitions found 0 dead transitions in 63624ms
Starting structural reductions in LTL mode, iteration 1 : 167/183 places, 2254/6759 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 66808 ms. Remains : 167/183 places, 2254/6759 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X(p1)))'
Stuttering acceptance computed with spot in 790 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : ErlangenMainframeV2-PT-bP07C07-LTLFireability-00
Product exploration explored 100000 steps with 0 reset in 5720 ms.
Stack based approach found an accepted trace after 89 steps with 0 reset with depth 90 and stack size 90 in 2 ms.
FORMULA ErlangenMainframeV2-PT-bP07C07-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property ErlangenMainframeV2-PT-bP07C07-LTLFireability-00 finished in 73489 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 10 out of 183 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 183/183 places, 6759/6759 transitions.
Graph (trivial) has 137 edges and 183 vertex of which 9 / 183 are part of one of the 4 SCC in 5 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 27 place count 177 transition count 6726
Reduce places removed 26 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 43 rules applied. Total rules applied 70 place count 151 transition count 6709
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 80 place count 141 transition count 6709
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 80 place count 141 transition count 6697
Deduced a syphon composed of 12 places in 5 ms
Ensure Unique test removed 1 places
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 25 rules applied. Total rules applied 105 place count 128 transition count 6697
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 121 place count 112 transition count 4501
Ensure Unique test removed 7 places
Iterating global reduction 3 with 23 rules applied. Total rules applied 144 place count 105 transition count 4501
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 151 place count 98 transition count 383
Iterating global reduction 3 with 7 rules applied. Total rules applied 158 place count 98 transition count 383
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 159 place count 97 transition count 381
Iterating global reduction 3 with 1 rules applied. Total rules applied 160 place count 97 transition count 381
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 226 place count 64 transition count 348
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 228 place count 64 transition count 346
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 231 place count 61 transition count 339
Iterating global reduction 4 with 3 rules applied. Total rules applied 234 place count 61 transition count 339
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 248 place count 54 transition count 357
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 260 place count 54 transition count 345
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 262 place count 52 transition count 341
Iterating global reduction 5 with 2 rules applied. Total rules applied 264 place count 52 transition count 341
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 274 place count 52 transition count 331
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 276 place count 51 transition count 344
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 6 with 14 rules applied. Total rules applied 290 place count 51 transition count 330
Partial Post-agglomeration rule applied 6 times.
Drop transitions (Partial Post agglomeration) removed 6 transitions
Iterating global reduction 6 with 6 rules applied. Total rules applied 296 place count 51 transition count 330
Applied a total of 296 rules in 867 ms. Remains 51 /183 variables (removed 132) and now considering 330/6759 (removed 6429) transitions.
[2026-06-02 08:43:53] [INFO ] Flow matrix only has 315 transitions (discarded 15 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10197576367758625329.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4624116168434362295.kers'
[2026-06-02 08:43:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10197576367758625329.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4624116168434362295.kers]
Normalized transition count is 314 out of 315 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 314 rows 51 cols 5404 entries
Finished phase 1 with 37 SingleSign rule and 0 generalized
[2026-06-02 08:43:53] [INFO ] Computed 14 invariants in 3 ms
Computed 14 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-4624116168434362295.kers
Total runtime 5 ms.
[2026-06-02 08:43:54] [INFO ] Implicit Places using invariants in 108 ms returned []
[2026-06-02 08:43:54] [INFO ] Flow matrix only has 315 transitions (discarded 15 similar events)
[2026-06-02 08:43:54] [INFO ] Invariant cache hit.
[2026-06-02 08:43:54] [INFO ] State equation strengthened by 11 read => feed constraints.
[2026-06-02 08:43:54] [INFO ] Implicit Places using invariants and state equation in 314 ms returned []
Implicit Place search using SMT with State Equation took 425 ms to find 0 implicit places.
[2026-06-02 08:43:54] [INFO ] Redundant transitions in 43 ms returned []
Running 322 sub problems to find dead transitions.
[2026-06-02 08:43:54] [INFO ] Flow matrix only has 315 transitions (discarded 15 similar events)
[2026-06-02 08:43:54] [INFO ] Invariant cache hit.
[2026-06-02 08:43:54] [INFO ] State equation strengthened by 11 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 1 (OVERLAPS) 1/51 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 3 (OVERLAPS) 314/365 variables, 51/65 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/365 variables, 10/75 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/365 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 6 (OVERLAPS) 1/366 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/366 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 322 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 366/366 variables, and 76 constraints, problems are : Problem set: 0 solved, 322 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 51/51 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 322/38 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 322 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 1 (OVERLAPS) 1/51 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 3 (OVERLAPS) 314/365 variables, 51/65 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/365 variables, 10/75 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/365 variables, 38/113 constraints. Problems are: Problem set: 0 solved, 322 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 365/366 variables, and 114 constraints, problems are : Problem set: 0 solved, 322 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 51/51 constraints, ReadFeed: 10/11 constraints, PredecessorRefiner: 322/38 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60761ms problems are : Problem set: 0 solved, 322 unsolved
Search for dead transitions found 0 dead transitions in 60762ms
Starting structural reductions in SI_LTL mode, iteration 1 : 51/183 places, 330/6759 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 62113 ms. Remains : 51/183 places, 330/6759 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Stuttering acceptance computed with spot in 59 ms :[(NOT p0)]
Running random walk in product with property : ErlangenMainframeV2-PT-bP07C07-LTLFireability-02
Product exploration explored 100000 steps with 0 reset in 1235 ms.
Product exploration explored 100000 steps with 0 reset in 1090 ms.
Computed a total of 2 stabilizing places and 9 stable transitions
Computed a total of 2 stabilizing places and 9 stable transitions
Knowledge based reduction with 3 factoid took 63 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
RANDOM walk for 40000 steps (8 resets) in 2418 ms. (16 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (8 resets) in 438 ms. (91 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1254984 steps, run timeout after 3001 ms. (steps per millisecond=418 ) properties seen :0 out of 1
Probabilistic random walk after 1254984 steps, saw 175115 distinct states, run finished after 3001 ms. (steps per millisecond=418 ) properties seen :0
[2026-06-02 08:45:01] [INFO ] Flow matrix only has 315 transitions (discarded 15 similar events)
[2026-06-02 08:45:01] [INFO ] Invariant cache hit.
[2026-06-02 08:45:01] [INFO ] State equation strengthened by 11 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 28/38 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 13/51 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 314/365 variables, 51/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 10/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/366 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/366 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/366 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 366/366 variables, and 76 constraints, problems are : Problem set: 0 solved, 1 unsolved in 357 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 51/51 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 28/38 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 13/51 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 314/365 variables, 51/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 10/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/366 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/366 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/366 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 366/366 variables, and 76 constraints, problems are : Problem set: 0 solved, 1 unsolved in 312 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 51/51 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 678ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 428 steps, including 24 resets, run visited all 1 properties in 5 ms. (steps per millisecond=85 )
Parikh walk visited 1 properties in 12 ms.
Knowledge based reduction with 3 factoid took 78 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Knowledge-based reduction took 4689 ms.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Support contains 10 out of 51 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 51/51 places, 330/330 transitions.
Applied a total of 0 rules in 15 ms. Remains 51 /51 variables (removed 0) and now considering 330/330 (removed 0) transitions.
[2026-06-02 08:45:02] [INFO ] Flow matrix only has 315 transitions (discarded 15 similar events)
[2026-06-02 08:45:02] [INFO ] Invariant cache hit.
[2026-06-02 08:45:02] [INFO ] Implicit Places using invariants in 136 ms returned []
[2026-06-02 08:45:02] [INFO ] Flow matrix only has 315 transitions (discarded 15 similar events)
[2026-06-02 08:45:02] [INFO ] Invariant cache hit.
[2026-06-02 08:45:02] [INFO ] State equation strengthened by 11 read => feed constraints.
[2026-06-02 08:45:02] [INFO ] Implicit Places using invariants and state equation in 350 ms returned []
Implicit Place search using SMT with State Equation took 493 ms to find 0 implicit places.
[2026-06-02 08:45:02] [INFO ] Redundant transitions in 25 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 554 ms. Remains : 51/51 places, 330/330 transitions.
Computed a total of 2 stabilizing places and 9 stable transitions
Computed a total of 2 stabilizing places and 9 stable transitions
Knowledge based reduction with 3 factoid took 68 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
RANDOM walk for 40000 steps (8 resets) in 990 ms. (40 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (8 resets) in 487 ms. (81 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1174926 steps, run timeout after 3001 ms. (steps per millisecond=391 ) properties seen :0 out of 1
Probabilistic random walk after 1174926 steps, saw 164395 distinct states, run finished after 3001 ms. (steps per millisecond=391 ) properties seen :0
[2026-06-02 08:45:06] [INFO ] Flow matrix only has 315 transitions (discarded 15 similar events)
[2026-06-02 08:45:06] [INFO ] Invariant cache hit.
[2026-06-02 08:45:06] [INFO ] State equation strengthened by 11 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 28/38 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 13/51 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 314/365 variables, 51/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 10/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/366 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/366 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/366 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 366/366 variables, and 76 constraints, problems are : Problem set: 0 solved, 1 unsolved in 351 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 51/51 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 28/38 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 13/51 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 314/365 variables, 51/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 10/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/366 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/366 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/366 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 366/366 variables, and 76 constraints, problems are : Problem set: 0 solved, 1 unsolved in 324 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 51/51 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 685ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 438 steps, including 24 resets, run visited all 1 properties in 8 ms. (steps per millisecond=54 )
Parikh walk visited 1 properties in 8 ms.
Knowledge based reduction with 3 factoid took 86 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Knowledge-based reduction took 4323 ms.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 1106 ms.
Product exploration explored 100000 steps with 0 reset in 866 ms.
Built C files in :
/tmp/ltsmin15005607771561532178
[2026-06-02 08:45:09] [INFO ] Computing symmetric may disable matrix : 330 transitions.
[2026-06-02 08:45:09] [INFO ] Computation of Complete disable matrix. took 60 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-06-02 08:45:09] [INFO ] Computing symmetric may enable matrix : 330 transitions.
[2026-06-02 08:45:09] [INFO ] Computation of Complete enable matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-06-02 08:45:09] [INFO ] Computing Do-Not-Accords matrix : 330 transitions.
[2026-06-02 08:45:09] [INFO ] Computation of Completed DNA matrix. took 17 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-06-02 08:45:09] [INFO ] Built C files in 197ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15005607771561532178
Running compilation step : cd /tmp/ltsmin15005607771561532178;'/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/ltsmin15005607771561532178;'/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/ltsmin15005607771561532178;'/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 10 out of 51 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 51/51 places, 330/330 transitions.
Applied a total of 0 rules in 41 ms. Remains 51 /51 variables (removed 0) and now considering 330/330 (removed 0) transitions.
[2026-06-02 08:45:12] [INFO ] Flow matrix only has 315 transitions (discarded 15 similar events)
[2026-06-02 08:45:12] [INFO ] Invariant cache hit.
[2026-06-02 08:45:12] [INFO ] Implicit Places using invariants in 182 ms returned []
[2026-06-02 08:45:12] [INFO ] Flow matrix only has 315 transitions (discarded 15 similar events)
[2026-06-02 08:45:12] [INFO ] Invariant cache hit.
[2026-06-02 08:45:13] [INFO ] State equation strengthened by 11 read => feed constraints.
[2026-06-02 08:45:13] [INFO ] Implicit Places using invariants and state equation in 356 ms returned []
Implicit Place search using SMT with State Equation took 543 ms to find 0 implicit places.
[2026-06-02 08:45:13] [INFO ] Redundant transitions in 12 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 607 ms. Remains : 51/51 places, 330/330 transitions.
Built C files in :
/tmp/ltsmin5267490108624466238
[2026-06-02 08:45:13] [INFO ] Computing symmetric may disable matrix : 330 transitions.
[2026-06-02 08:45:13] [INFO ] Computation of Complete disable matrix. took 40 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-06-02 08:45:13] [INFO ] Computing symmetric may enable matrix : 330 transitions.
[2026-06-02 08:45:13] [INFO ] Computation of Complete enable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-06-02 08:45:13] [INFO ] Computing Do-Not-Accords matrix : 330 transitions.
[2026-06-02 08:45:13] [INFO ] Computation of Completed DNA matrix. took 26 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-06-02 08:45:13] [INFO ] Built C files in 180ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5267490108624466238
Running compilation step : cd /tmp/ltsmin5267490108624466238;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2510 ms.
Running link step : cd /tmp/ltsmin5267490108624466238;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 95 ms.
Running LTSmin : cd /tmp/ltsmin5267490108624466238;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11483152005070434474.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-06-02 08:45:29] [INFO ] Flatten gal took : 68 ms
[2026-06-02 08:45:29] [INFO ] Flatten gal took : 71 ms
[2026-06-02 08:45:30] [INFO ] Time to serialize gal into /tmp/LTL4502425036831175096.gal : 37 ms
[2026-06-02 08:45:30] [INFO ] Time to serialize properties into /tmp/LTL8007541354369307480.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/LTL4502425036831175096.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15248806494272007746.hoa' '-atoms' '/tmp/LTL8007541354369307480.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/LTL8007541354369307480.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15248806494272007746.hoa
Reverse transition relation is NOT exact ! Due to transitions t124, t71.t72.t74.t82.t88.t75.t80, Intersection with reachable at each step enabled. (destro...196
Detected timeout of ITS tools.
[2026-06-02 08:45:45] [INFO ] Flatten gal took : 36 ms
[2026-06-02 08:45:45] [INFO ] Flatten gal took : 35 ms
[2026-06-02 08:45:45] [INFO ] Time to serialize gal into /tmp/LTL18281603111735236283.gal : 9 ms
[2026-06-02 08:45:45] [INFO ] Time to serialize properties into /tmp/LTL8821167494214729218.ltl : 5 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/LTL18281603111735236283.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8821167494214729218.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...276
Read 1 LTL properties
Checking formula 0 : !((F(G("(((((p2==0)||(p31==0))||((p39==0)||(p62==0)))||(((p81==0)||(p107==0))||((p119==0)||(p145==0))))||((p185==0)||(p292==0)))"))))
Formula 0 simplified : GF!"(((((p2==0)||(p31==0))||((p39==0)||(p62==0)))||(((p81==0)||(p107==0))||((p119==0)||(p145==0))))||((p185==0)||(p292==0)))"
Reverse transition relation is NOT exact ! Due to transitions t124, t71.t72.t74.t82.t88.t75.t80, Intersection with reachable at each step enabled. (destro...196
Detected timeout of ITS tools.
[2026-06-02 08:46:01] [INFO ] Flatten gal took : 71 ms
[2026-06-02 08:46:01] [INFO ] Applying decomposition
[2026-06-02 08:46:01] [INFO ] Flatten gal took : 65 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/graph16753498114985173078.txt' '-o' '/tmp/graph16753498114985173078.bin' '-w' '/tmp/graph16753498114985173078.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph16753498114985173078.bin' '-l' '-1' '-v' '-w' '/tmp/graph16753498114985173078.weights' '-q' '0' '-e' '0.001'
[2026-06-02 08:46:01] [INFO ] Decomposing Gal with order
[2026-06-02 08:46:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-06-02 08:46:01] [INFO ] Removed a total of 3481 redundant transitions.
[2026-06-02 08:46:02] [INFO ] Flatten gal took : 335 ms
[2026-06-02 08:46:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 38 labels/synchronizations in 84 ms.
[2026-06-02 08:46:02] [INFO ] Time to serialize gal into /tmp/LTL13413546611056830858.gal : 10 ms
[2026-06-02 08:46:02] [INFO ] Time to serialize properties into /tmp/LTL1995222217094714604.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/LTL13413546611056830858.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1995222217094714604.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F(G("(((((i0.u0.p2==0)||(i0.u2.p31==0))||((i0.u3.p39==0)||(i0.u5.p62==0)))||(((i0.u7.p81==0)||(i0.u9.p107==0))||((i0.u11.p119==0)||...218
Formula 0 simplified : GF!"(((((i0.u0.p2==0)||(i0.u2.p31==0))||((i0.u3.p39==0)||(i0.u5.p62==0)))||(((i0.u7.p81==0)||(i0.u9.p107==0))||((i0.u11.p119==0)||(i...212
Reverse transition relation is NOT exact ! Due to transitions t71_t72_t74_t82_t88_t75_t80, i0.u0.t124, Intersection with reachable at each step enabled. (...202
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
69 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.737309,41504,1,0,55676,133,3651,121182,159,374,37200
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ErlangenMainframeV2-PT-bP07C07-LTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property ErlangenMainframeV2-PT-bP07C07-LTLFireability-02 finished in 129961 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 10 out of 183 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 183/183 places, 6759/6759 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 167 transition count 4563
Ensure Unique test removed 7 places
Iterating global reduction 0 with 23 rules applied. Total rules applied 39 place count 160 transition count 4563
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 48 place count 151 transition count 443
Iterating global reduction 0 with 9 rules applied. Total rules applied 57 place count 151 transition count 443
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 63 place count 145 transition count 433
Iterating global reduction 0 with 6 rules applied. Total rules applied 69 place count 145 transition count 433
Applied a total of 69 rules in 480 ms. Remains 145 /183 variables (removed 38) and now considering 433/6759 (removed 6326) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14225796912649255425.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5585691305092265642.kers'
[2026-06-02 08:46:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14225796912649255425.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5585691305092265642.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 433 rows 145 cols 3826 entries
Finished phase 1 with 129 SingleSign rule and 1 generalized
[2026-06-02 08:46:03] [INFO ] Computed 15 invariants in 5 ms
Computed 15 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-5585691305092265642.kers
Total runtime 7 ms.
[2026-06-02 08:46:03] [INFO ] Implicit Places using invariants in 255 ms returned [54]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 260 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 144/183 places, 433/6759 transitions.
Applied a total of 0 rules in 5 ms. Remains 144 /144 variables (removed 0) and now considering 433/433 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 747 ms. Remains : 144/183 places, 433/6759 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Stuttering acceptance computed with spot in 156 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ErlangenMainframeV2-PT-bP07C07-LTLFireability-03
Product exploration explored 100000 steps with 33333 reset in 542 ms.
Product exploration explored 100000 steps with 33333 reset in 267 ms.
Computed a total of 19 stabilizing places and 19 stable transitions
Computed a total of 19 stabilizing places and 19 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 2 factoid took 19 ms. Proved property starting from automaton with 3 states, 3 edges and 1 AP (stutter sensitive
Knowledge-based reduction took 27 ms.
FORMULA ErlangenMainframeV2-PT-bP07C07-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ErlangenMainframeV2-PT-bP07C07-LTLFireability-03 finished in 1785 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p1)||p0))))'
Support contains 20 out of 183 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 183/183 places, 6759/6759 transitions.
Graph (trivial) has 128 edges and 183 vertex of which 9 / 183 are part of one of the 4 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 27 place count 177 transition count 6726
Reduce places removed 26 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 43 rules applied. Total rules applied 70 place count 151 transition count 6709
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 80 place count 141 transition count 6709
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 80 place count 141 transition count 6697
Deduced a syphon composed of 12 places in 4 ms
Ensure Unique test removed 1 places
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 25 rules applied. Total rules applied 105 place count 128 transition count 6697
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 121 place count 112 transition count 4501
Ensure Unique test removed 7 places
Iterating global reduction 3 with 23 rules applied. Total rules applied 144 place count 105 transition count 4501
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 145 place count 104 transition count 3043
Iterating global reduction 3 with 1 rules applied. Total rules applied 146 place count 104 transition count 3043
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 206 place count 74 transition count 3013
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 208 place count 74 transition count 3011
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 211 place count 71 transition count 3004
Iterating global reduction 4 with 3 rules applied. Total rules applied 214 place count 71 transition count 3004
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 226 place count 65 transition count 3022
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 238 place count 65 transition count 3010
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 240 place count 63 transition count 3006
Iterating global reduction 5 with 2 rules applied. Total rules applied 242 place count 63 transition count 3006
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 252 place count 63 transition count 2996
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 254 place count 62 transition count 3009
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 263 place count 62 transition count 3000
Partial Post-agglomeration rule applied 11 times.
Drop transitions (Partial Post agglomeration) removed 11 transitions
Iterating global reduction 6 with 11 rules applied. Total rules applied 274 place count 62 transition count 3000
Applied a total of 274 rules in 818 ms. Remains 62 /183 variables (removed 121) and now considering 3000/6759 (removed 3759) transitions.
[2026-06-02 08:46:05] [INFO ] Flow matrix only has 2985 transitions (discarded 15 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13529406024960141399.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14395958664574434688.kers'
[2026-06-02 08:46:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13529406024960141399.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14395958664574434688.kers]
Normalized transition count is 2984 out of 2985 initially.
Culled 0 columns in 10 ms.
// Phase 1: matrix 2984 rows 62 cols 58650 entries
Finished phase 1 with 48 SingleSign rule and 0 generalized
[2026-06-02 08:46:05] [INFO ] Computed 14 invariants in 31 ms
Computed 14 P flows in 32 ms.
Exported basis to /tmp/petrispot-output-14395958664574434688.kers
Total runtime 41 ms.
[2026-06-02 08:46:05] [INFO ] Implicit Places using invariants in 320 ms returned []
[2026-06-02 08:46:05] [INFO ] Flow matrix only has 2985 transitions (discarded 15 similar events)
[2026-06-02 08:46:05] [INFO ] Invariant cache hit.
[2026-06-02 08:46:07] [INFO ] State equation strengthened by 11 read => feed constraints.
[2026-06-02 08:46:07] [INFO ] Implicit Places using invariants and state equation in 1770 ms returned []
Implicit Place search using SMT with State Equation took 2095 ms to find 0 implicit places.
[2026-06-02 08:46:08] [INFO ] Redundant transitions in 328 ms returned []
Running 2992 sub problems to find dead transitions.
[2026-06-02 08:46:08] [INFO ] Flow matrix only has 2985 transitions (discarded 15 similar events)
[2026-06-02 08:46:08] [INFO ] Invariant cache hit.
[2026-06-02 08:46:08] [INFO ] State equation strengthened by 11 read => feed constraints.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2992 unsolved
SMT process timed out in 35094ms, After SMT, problems are : Problem set: 0 solved, 2992 unsolved
Search for dead transitions found 0 dead transitions in 35114ms
Starting structural reductions in SI_LTL mode, iteration 1 : 62/183 places, 3000/6759 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 38390 ms. Remains : 62/183 places, 3000/6759 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p1)||p0))))'
Stuttering acceptance computed with spot in 127 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ErlangenMainframeV2-PT-bP07C07-LTLFireability-05
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 1 ms.
FORMULA ErlangenMainframeV2-PT-bP07C07-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV2-PT-bP07C07-LTLFireability-05 finished in 38593 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)||X(p1)||G(p2)))))'
Support contains 20 out of 183 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 183/183 places, 6759/6759 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 174 transition count 4690
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 174 transition count 4690
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 23 place count 169 transition count 1610
Iterating global reduction 0 with 5 rules applied. Total rules applied 28 place count 169 transition count 1610
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 30 place count 167 transition count 1608
Iterating global reduction 0 with 2 rules applied. Total rules applied 32 place count 167 transition count 1608
Applied a total of 32 rules in 238 ms. Remains 167 /183 variables (removed 16) and now considering 1608/6759 (removed 5151) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-486183217431320989.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12184732058469318726.kers'
[2026-06-02 08:46:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-486183217431320989.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12184732058469318726.kers]
Culled 0 columns in 8 ms.
// Phase 1: matrix 1608 rows 167 cols 28727 entries
Finished phase 1 with 143 SingleSign rule and 2 generalized
[2026-06-02 08:46:43] [INFO ] Computed 22 invariants in 27 ms
Computed 22 P flows in 28 ms.
Exported basis to /tmp/petrispot-output-12184732058469318726.kers
Total runtime 35 ms.
[2026-06-02 08:46:44] [INFO ] Implicit Places using invariants in 675 ms returned []
[2026-06-02 08:46:44] [INFO ] Invariant cache hit.
[2026-06-02 08:46:45] [INFO ] Implicit Places using invariants and state equation in 1583 ms returned []
Implicit Place search using SMT with State Equation took 2285 ms to find 0 implicit places.
Running 1607 sub problems to find dead transitions.
[2026-06-02 08:46:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1607 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/166 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1607 unsolved
At refinement iteration 2 (OVERLAPS) 1/167 variables, 14/22 constraints. Problems are: Problem set: 0 solved, 1607 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 167/1775 variables, and 22 constraints, problems are : Problem set: 0 solved, 1607 unsolved in 30065 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/167 constraints, PredecessorRefiner: 1607/159 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1607 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1607 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/166 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1607 unsolved
At refinement iteration 2 (OVERLAPS) 1/167 variables, 14/22 constraints. Problems are: Problem set: 0 solved, 1607 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 167/1775 variables, and 22 constraints, problems are : Problem set: 0 solved, 1607 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/167 constraints, PredecessorRefiner: 1448/159 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62325ms problems are : Problem set: 0 solved, 1607 unsolved
Search for dead transitions found 0 dead transitions in 62336ms
Starting structural reductions in LTL mode, iteration 1 : 167/183 places, 1608/6759 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64871 ms. Remains : 167/183 places, 1608/6759 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)||X(p1)||G(p2)))))'
Stuttering acceptance computed with spot in 161 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : ErlangenMainframeV2-PT-bP07C07-LTLFireability-06
Product exploration explored 100000 steps with 33333 reset in 882 ms.
Product exploration explored 100000 steps with 33333 reset in 869 ms.
Computed a total of 19 stabilizing places and 19 stable transitions
Computed a total of 19 stabilizing places and 19 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 8 factoid took 13 ms. Proved property starting from automaton with 3 states, 6 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 36 ms.
FORMULA ErlangenMainframeV2-PT-bP07C07-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ErlangenMainframeV2-PT-bP07C07-LTLFireability-06 finished in 66887 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((G(p0)||X(p1))) U X((F(p3)&&p2))))'
Support contains 28 out of 183 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 183/183 places, 6759/6759 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 174 transition count 4690
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 174 transition count 4690
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 172 transition count 4688
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 172 transition count 4688
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 24 place count 170 transition count 4686
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 170 transition count 4686
Applied a total of 26 rules in 127 ms. Remains 170 /183 variables (removed 13) and now considering 4686/6759 (removed 2073) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13167991271352273564.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17305776009576897115.kers'
[2026-06-02 08:47:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13167991271352273564.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17305776009576897115.kers]
Culled 0 columns in 15 ms.
// Phase 1: matrix 4686 rows 170 cols 90287 entries
Finished phase 1 with 146 SingleSign rule and 2 generalized
[2026-06-02 08:47:50] [INFO ] Computed 22 invariants in 54 ms
Computed 22 P flows in 55 ms.
Exported basis to /tmp/petrispot-output-17305776009576897115.kers
Total runtime 69 ms.
[2026-06-02 08:47:51] [INFO ] Implicit Places using invariants in 648 ms returned []
[2026-06-02 08:47:51] [INFO ] Invariant cache hit.
[2026-06-02 08:47:54] [INFO ] Implicit Places using invariants and state equation in 2948 ms returned []
Implicit Place search using SMT with State Equation took 3598 ms to find 0 implicit places.
Running 4685 sub problems to find dead transitions.
[2026-06-02 08:47:54] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 4685 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 169/4856 variables, and 8 constraints, problems are : Problem set: 0 solved, 4685 unsolved in 30093 ms.
Refiners :[Positive P Invariants (semi-flows): 0/14 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/170 constraints, PredecessorRefiner: 4685/159 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4685 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 4685 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 169/4856 variables, and 8 constraints, problems are : Problem set: 0 solved, 4685 unsolved in 30097 ms.
Refiners :[Positive P Invariants (semi-flows): 0/14 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/170 constraints, PredecessorRefiner: 4526/159 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 67683ms problems are : Problem set: 0 solved, 4685 unsolved
Search for dead transitions found 0 dead transitions in 67712ms
Starting structural reductions in LTL mode, iteration 1 : 170/183 places, 4686/6759 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 71466 ms. Remains : 170/183 places, 4686/6759 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((G(p0)||X(p1))) U X((F(p3)&&p2))))'
Stuttering acceptance computed with spot in 396 ms :[(OR (NOT p3) (NOT p2)), (OR (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), true, (NOT p3), (AND (NOT p0) p1)]
Running random walk in product with property : ErlangenMainframeV2-PT-bP07C07-LTLFireability-07
Entered a terminal (fully accepting) state of product in 6 steps with 0 reset in 1 ms.
FORMULA ErlangenMainframeV2-PT-bP07C07-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV2-PT-bP07C07-LTLFireability-07 finished in 71937 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((G(p0) U X(p1))&&F((G(F(p3))&&p2)))))'
Support contains 28 out of 183 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 183/183 places, 6759/6759 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 181 transition count 6749
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 181 transition count 6749
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 179 transition count 6747
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 179 transition count 6747
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 177 transition count 6745
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 177 transition count 6745
Applied a total of 12 rules in 132 ms. Remains 177 /183 variables (removed 6) and now considering 6745/6759 (removed 14) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-582767203076145520.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7527993554788694553.kers'
[2026-06-02 08:49:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-582767203076145520.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7527993554788694553.kers]
Culled 0 columns in 21 ms.
// Phase 1: matrix 6745 rows 177 cols 127349 entries
Finished phase 1 with 152 SingleSign rule and 3 generalized
[2026-06-02 08:49:02] [INFO ] Computed 22 invariants in 86 ms
Computed 22 P flows in 87 ms.
Exported basis to /tmp/petrispot-output-7527993554788694553.kers
Total runtime 111 ms.
[2026-06-02 08:49:03] [INFO ] Implicit Places using invariants in 1359 ms returned []
[2026-06-02 08:49:03] [INFO ] Invariant cache hit.
[2026-06-02 08:49:08] [INFO ] Implicit Places using invariants and state equation in 4547 ms returned []
Implicit Place search using SMT with State Equation took 5914 ms to find 0 implicit places.
Running 6744 sub problems to find dead transitions.
[2026-06-02 08:49:08] [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, 6744 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 176/6922 variables, and 8 constraints, problems are : Problem set: 0 solved, 6744 unsolved in 30146 ms.
Refiners :[Positive P Invariants (semi-flows): 0/14 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/177 constraints, PredecessorRefiner: 6744/150 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6744 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/176 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 6744 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 176/6922 variables, and 8 constraints, problems are : Problem set: 0 solved, 6744 unsolved in 30123 ms.
Refiners :[Positive P Invariants (semi-flows): 0/14 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/177 constraints, PredecessorRefiner: 6594/150 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 72460ms problems are : Problem set: 0 solved, 6744 unsolved
Search for dead transitions found 0 dead transitions in 72488ms
Starting structural reductions in LTL mode, iteration 1 : 177/183 places, 6745/6759 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 78552 ms. Remains : 177/183 places, 6745/6759 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((G(p0) U X(p1))&&F((G(F(p3))&&p2)))))'
Stuttering acceptance computed with spot in 379 ms :[(OR (NOT p3) (NOT p2) (NOT p1)), (OR (NOT p3) (NOT p2) (NOT p1)), (NOT p1), (NOT p3), (NOT p3), (NOT p2), (NOT p1), true, (NOT p0)]
Running random walk in product with property : ErlangenMainframeV2-PT-bP07C07-LTLFireability-08
Product exploration timeout after 93270 steps with 0 reset in 10001 ms.
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA ErlangenMainframeV2-PT-bP07C07-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV2-PT-bP07C07-LTLFireability-08 finished in 89031 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&&X(X(G(p2))))))||p0)))'
Support contains 17 out of 183 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 183/183 places, 6759/6759 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 167 transition count 4563
Ensure Unique test removed 7 places
Iterating global reduction 0 with 23 rules applied. Total rules applied 39 place count 160 transition count 4563
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 42 place count 157 transition count 3103
Iterating global reduction 0 with 3 rules applied. Total rules applied 45 place count 157 transition count 3103
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 48 place count 154 transition count 3099
Iterating global reduction 0 with 3 rules applied. Total rules applied 51 place count 154 transition count 3099
Applied a total of 51 rules in 135 ms. Remains 154 /183 variables (removed 29) and now considering 3099/6759 (removed 3660) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13915685960300405293.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18120308941524512617.kers'
[2026-06-02 08:50:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13915685960300405293.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18120308941524512617.kers]
Culled 0 columns in 10 ms.
// Phase 1: matrix 3099 rows 154 cols 38418 entries
Finished phase 1 with 138 SingleSign rule and 1 generalized
[2026-06-02 08:50:31] [INFO ] Computed 15 invariants in 38 ms
Computed 15 P flows in 39 ms.
Exported basis to /tmp/petrispot-output-18120308941524512617.kers
Total runtime 49 ms.
[2026-06-02 08:50:32] [INFO ] Implicit Places using invariants in 645 ms returned [62]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 653 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 153/183 places, 3099/6759 transitions.
Applied a total of 0 rules in 14 ms. Remains 153 /153 variables (removed 0) and now considering 3099/3099 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 803 ms. Remains : 153/183 places, 3099/6759 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&&X(X(G(p2))))))||p0)))'
Stuttering acceptance computed with spot in 226 ms :[true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : ErlangenMainframeV2-PT-bP07C07-LTLFireability-09
Product exploration explored 100000 steps with 50000 reset in 450 ms.
Product exploration explored 100000 steps with 50000 reset in 455 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 3 factoid took 52 ms. Proved property starting from automaton with 6 states, 9 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 73 ms.
FORMULA ErlangenMainframeV2-PT-bP07C07-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ErlangenMainframeV2-PT-bP07C07-LTLFireability-09 finished in 2065 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 24 out of 183 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 183/183 places, 6759/6759 transitions.
Graph (trivial) has 131 edges and 183 vertex of which 9 / 183 are part of one of the 4 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 27 place count 177 transition count 6726
Reduce places removed 26 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 43 rules applied. Total rules applied 70 place count 151 transition count 6709
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 80 place count 141 transition count 6709
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 80 place count 141 transition count 6698
Deduced a syphon composed of 11 places in 4 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 102 place count 130 transition count 6698
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 111 place count 121 transition count 4629
Iterating global reduction 3 with 9 rules applied. Total rules applied 120 place count 121 transition count 4629
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 3 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 186 place count 88 transition count 4596
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 188 place count 88 transition count 4594
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 191 place count 85 transition count 4587
Iterating global reduction 4 with 3 rules applied. Total rules applied 194 place count 85 transition count 4587
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 206 place count 79 transition count 4605
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 218 place count 79 transition count 4593
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 220 place count 77 transition count 4589
Iterating global reduction 5 with 2 rules applied. Total rules applied 222 place count 77 transition count 4589
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 232 place count 77 transition count 4579
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 234 place count 76 transition count 4592
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 242 place count 76 transition count 4584
Partial Post-agglomeration rule applied 7 times.
Drop transitions (Partial Post agglomeration) removed 7 transitions
Iterating global reduction 6 with 7 rules applied. Total rules applied 249 place count 76 transition count 4584
Applied a total of 249 rules in 1347 ms. Remains 76 /183 variables (removed 107) and now considering 4584/6759 (removed 2175) transitions.
[2026-06-02 08:50:34] [INFO ] Flow matrix only has 4569 transitions (discarded 15 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3159301743123715184.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1837146708547408423.kers'
[2026-06-02 08:50:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3159301743123715184.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1837146708547408423.kers]
Normalized transition count is 4568 out of 4569 initially.
Culled 0 columns in 15 ms.
// Phase 1: matrix 4568 rows 76 cols 90114 entries
Finished phase 1 with 52 SingleSign rule and 2 generalized
[2026-06-02 08:50:34] [INFO ] Computed 22 invariants in 57 ms
Computed 22 P flows in 58 ms.
Exported basis to /tmp/petrispot-output-1837146708547408423.kers
Total runtime 72 ms.
[2026-06-02 08:50:35] [INFO ] Implicit Places using invariants in 1118 ms returned []
[2026-06-02 08:50:35] [INFO ] Flow matrix only has 4569 transitions (discarded 15 similar events)
[2026-06-02 08:50:35] [INFO ] Invariant cache hit.
[2026-06-02 08:50:38] [INFO ] State equation strengthened by 11 read => feed constraints.
[2026-06-02 08:50:39] [INFO ] Implicit Places using invariants and state equation in 3828 ms returned []
Implicit Place search using SMT with State Equation took 4950 ms to find 0 implicit places.
[2026-06-02 08:50:40] [INFO ] Redundant transitions in 964 ms returned []
Running 4576 sub problems to find dead transitions.
[2026-06-02 08:50:40] [INFO ] Flow matrix only has 4569 transitions (discarded 15 similar events)
[2026-06-02 08:50:40] [INFO ] Invariant cache hit.
[2026-06-02 08:50:40] [INFO ] State equation strengthened by 11 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 4576 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 75/4645 variables, and 8 constraints, problems are : Problem set: 0 solved, 4576 unsolved in 30085 ms.
Refiners :[Positive P Invariants (semi-flows): 0/14 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/76 constraints, ReadFeed: 0/11 constraints, PredecessorRefiner: 4576/36 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4576 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 4576 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 75/4645 variables, and 8 constraints, problems are : Problem set: 0 solved, 4576 unsolved in 30130 ms.
Refiners :[Positive P Invariants (semi-flows): 0/14 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/76 constraints, ReadFeed: 0/11 constraints, PredecessorRefiner: 4540/36 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 67253ms problems are : Problem set: 0 solved, 4576 unsolved
Search for dead transitions found 0 dead transitions in 67271ms
Starting structural reductions in SI_LTL mode, iteration 1 : 76/183 places, 4584/6759 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 74552 ms. Remains : 76/183 places, 4584/6759 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 58 ms :[(NOT p0)]
Running random walk in product with property : ErlangenMainframeV2-PT-bP07C07-LTLFireability-10
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 2 ms.
FORMULA ErlangenMainframeV2-PT-bP07C07-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV2-PT-bP07C07-LTLFireability-10 finished in 74669 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(X(X(F(X(p0)))))||F((X(G(p0)) U p1))))'
Support contains 19 out of 183 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 183/183 places, 6759/6759 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 174 transition count 4690
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 174 transition count 4690
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 22 place count 170 transition count 2258
Iterating global reduction 0 with 4 rules applied. Total rules applied 26 place count 170 transition count 2258
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 29 place count 167 transition count 2254
Iterating global reduction 0 with 3 rules applied. Total rules applied 32 place count 167 transition count 2254
Applied a total of 32 rules in 207 ms. Remains 167 /183 variables (removed 16) and now considering 2254/6759 (removed 4505) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-533840985450323849.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4598186027618713305.kers'
[2026-06-02 08:51:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-533840985450323849.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4598186027618713305.kers]
Culled 0 columns in 11 ms.
// Phase 1: matrix 2254 rows 167 cols 41683 entries
Finished phase 1 with 143 SingleSign rule and 2 generalized
[2026-06-02 08:51:48] [INFO ] Computed 22 invariants in 41 ms
Computed 22 P flows in 42 ms.
Exported basis to /tmp/petrispot-output-4598186027618713305.kers
Total runtime 52 ms.
[2026-06-02 08:51:49] [INFO ] Implicit Places using invariants in 873 ms returned []
[2026-06-02 08:51:49] [INFO ] Invariant cache hit.
[2026-06-02 08:51:51] [INFO ] Implicit Places using invariants and state equation in 2005 ms returned []
Implicit Place search using SMT with State Equation took 2880 ms to find 0 implicit places.
Running 2253 sub problems to find dead transitions.
[2026-06-02 08:51:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2253 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 166/2421 variables, and 8 constraints, problems are : Problem set: 0 solved, 2253 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 0/14 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/167 constraints, PredecessorRefiner: 2253/157 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2253 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2253 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/166 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2253 unsolved
At refinement iteration 2 (OVERLAPS) 1/167 variables, 14/22 constraints. Problems are: Problem set: 0 solved, 2253 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 167/2421 variables, and 22 constraints, problems are : Problem set: 0 solved, 2253 unsolved in 30052 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/167 constraints, PredecessorRefiner: 2096/157 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 63274ms problems are : Problem set: 0 solved, 2253 unsolved
Search for dead transitions found 0 dead transitions in 63284ms
Starting structural reductions in LTL mode, iteration 1 : 167/183 places, 2254/6759 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 66378 ms. Remains : 167/183 places, 2254/6759 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(X(X(F(X(p0)))))||F((X(G(p0)) U p1))))'
Stuttering acceptance computed with spot in 217 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ErlangenMainframeV2-PT-bP07C07-LTLFireability-11
Product exploration explored 100000 steps with 0 reset in 5057 ms.
Stack based approach found an accepted trace after 50 steps with 0 reset with depth 51 and stack size 51 in 1 ms.
FORMULA ErlangenMainframeV2-PT-bP07C07-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property ErlangenMainframeV2-PT-bP07C07-LTLFireability-11 finished in 71710 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 9 out of 183 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 183/183 places, 6759/6759 transitions.
Graph (trivial) has 146 edges and 183 vertex of which 11 / 183 are part of one of the 5 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 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 176 transition count 6724
Reduce places removed 27 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 44 rules applied. Total rules applied 72 place count 149 transition count 6707
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 82 place count 139 transition count 6707
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 82 place count 139 transition count 6697
Deduced a syphon composed of 10 places in 4 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 102 place count 129 transition count 6697
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 111 place count 120 transition count 4628
Iterating global reduction 3 with 9 rules applied. Total rules applied 120 place count 120 transition count 4628
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 127 place count 113 transition count 510
Iterating global reduction 3 with 7 rules applied. Total rules applied 134 place count 113 transition count 510
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 136 place count 111 transition count 506
Iterating global reduction 3 with 2 rules applied. Total rules applied 138 place count 111 transition count 506
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 214 place count 73 transition count 468
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 216 place count 73 transition count 466
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 219 place count 70 transition count 459
Iterating global reduction 4 with 3 rules applied. Total rules applied 222 place count 70 transition count 459
Performed 8 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 238 place count 62 transition count 477
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 250 place count 62 transition count 465
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 252 place count 60 transition count 461
Iterating global reduction 5 with 2 rules applied. Total rules applied 254 place count 60 transition count 461
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 264 place count 60 transition count 451
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 266 place count 59 transition count 464
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 6 with 13 rules applied. Total rules applied 279 place count 59 transition count 451
Applied a total of 279 rules in 544 ms. Remains 59 /183 variables (removed 124) and now considering 451/6759 (removed 6308) transitions.
[2026-06-02 08:53:00] [INFO ] Flow matrix only has 435 transitions (discarded 16 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16543049912634006790.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2201360536501438582.kers'
[2026-06-02 08:53:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16543049912634006790.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2201360536501438582.kers]
Normalized transition count is 434 out of 435 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 1 ms.
// Phase 1: matrix 434 rows 58 cols 7286 entries
Finished phase 1 with 35 SingleSign rule and 2 generalized
[2026-06-02 08:53:00] [INFO ] Computed 22 invariants in 4 ms
Computed 22 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-2201360536501438582.kers
Total runtime 7 ms.
[2026-06-02 08:53:00] [INFO ] Implicit Places using invariants in 385 ms returned []
[2026-06-02 08:53:00] [INFO ] Flow matrix only has 435 transitions (discarded 16 similar events)
[2026-06-02 08:53:00] [INFO ] Invariant cache hit.
[2026-06-02 08:53:00] [INFO ] State equation strengthened by 24 read => feed constraints.
[2026-06-02 08:53:01] [INFO ] Implicit Places using invariants and state equation in 716 ms returned []
Implicit Place search using SMT with State Equation took 1103 ms to find 0 implicit places.
[2026-06-02 08:53:01] [INFO ] Redundant transitions in 10 ms returned []
Running 443 sub problems to find dead transitions.
[2026-06-02 08:53:01] [INFO ] Flow matrix only has 435 transitions (discarded 16 similar events)
[2026-06-02 08:53:01] [INFO ] Invariant cache hit.
[2026-06-02 08:53:01] [INFO ] State equation strengthened by 24 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 2 (OVERLAPS) 1/59 variables, 14/22 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 5 (OVERLAPS) 434/493 variables, 59/82 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/493 variables, 23/105 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/493 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 8 (OVERLAPS) 1/494 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 443 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 494/494 variables, and 106 constraints, problems are : Problem set: 0 solved, 443 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 59/59 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 443/29 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 443 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 2 (OVERLAPS) 1/59 variables, 14/22 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 5 (OVERLAPS) 434/493 variables, 59/82 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/493 variables, 23/105 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/493 variables, 29/134 constraints. Problems are: Problem set: 0 solved, 443 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 493/494 variables, and 134 constraints, problems are : Problem set: 0 solved, 443 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 59/59 constraints, ReadFeed: 23/24 constraints, PredecessorRefiner: 443/29 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60720ms problems are : Problem set: 0 solved, 443 unsolved
Search for dead transitions found 0 dead transitions in 60722ms
Starting structural reductions in SI_LTL mode, iteration 1 : 59/183 places, 451/6759 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 62389 ms. Remains : 59/183 places, 451/6759 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ErlangenMainframeV2-PT-bP07C07-LTLFireability-12
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA ErlangenMainframeV2-PT-bP07C07-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV2-PT-bP07C07-LTLFireability-12 finished in 62502 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(F(p0)))&&F((F(p1)&&X((G(!p2)||(!p2&&F(!p3))))))))'
Support contains 30 out of 183 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 183/183 places, 6759/6759 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 174 transition count 4690
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 174 transition count 4690
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 172 transition count 4688
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 172 transition count 4688
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 24 place count 170 transition count 4686
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 170 transition count 4686
Applied a total of 26 rules in 123 ms. Remains 170 /183 variables (removed 13) and now considering 4686/6759 (removed 2073) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17499184710761630756.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4761081624245122167.kers'
[2026-06-02 08:54:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17499184710761630756.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4761081624245122167.kers]
Culled 0 columns in 15 ms.
// Phase 1: matrix 4686 rows 170 cols 90287 entries
Finished phase 1 with 146 SingleSign rule and 2 generalized
[2026-06-02 08:54:02] [INFO ] Computed 22 invariants in 56 ms
Computed 22 P flows in 57 ms.
Exported basis to /tmp/petrispot-output-4761081624245122167.kers
Total runtime 71 ms.
[2026-06-02 08:54:02] [INFO ] Implicit Places using invariants in 462 ms returned []
[2026-06-02 08:54:02] [INFO ] Invariant cache hit.
[2026-06-02 08:54:05] [INFO ] Implicit Places using invariants and state equation in 2495 ms returned []
Implicit Place search using SMT with State Equation took 2959 ms to find 0 implicit places.
Running 4685 sub problems to find dead transitions.
[2026-06-02 08:54:05] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 4685 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 169/4856 variables, and 8 constraints, problems are : Problem set: 0 solved, 4685 unsolved in 30145 ms.
Refiners :[Positive P Invariants (semi-flows): 0/14 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/170 constraints, PredecessorRefiner: 4685/159 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4685 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 4685 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 169/4856 variables, and 8 constraints, problems are : Problem set: 0 solved, 4685 unsolved in 30153 ms.
Refiners :[Positive P Invariants (semi-flows): 0/14 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/170 constraints, PredecessorRefiner: 4526/159 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 67479ms problems are : Problem set: 0 solved, 4685 unsolved
Search for dead transitions found 0 dead transitions in 67500ms
Starting structural reductions in LTL mode, iteration 1 : 170/183 places, 4686/6759 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 70594 ms. Remains : 170/183 places, 4686/6759 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(F(p0)))&&F((F(p1)&&X((G(p2)||(p2&&F(p3))))))))'
Stuttering acceptance computed with spot in 442 ms :[(OR (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (NOT p1), (NOT p2), (NOT p0), (AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : ErlangenMainframeV2-PT-bP07C07-LTLFireability-13
Product exploration explored 100000 steps with 39979 reset in 2053 ms.
Product exploration explored 100000 steps with 39933 reset in 1830 ms.
Computed a total of 19 stabilizing places and 19 stable transitions
Computed a total of 19 stabilizing places and 19 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 14 factoid took 19 ms. Proved property starting from automaton with 7 states, 13 edges and 4 AP (stutter sensitive
Knowledge-based reduction took 79 ms.
FORMULA ErlangenMainframeV2-PT-bP07C07-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ErlangenMainframeV2-PT-bP07C07-LTLFireability-13 finished in 75129 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 p1) U X((F(p2)&&G(p3))))))'
Support contains 25 out of 183 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 183/183 places, 6759/6759 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 174 transition count 4690
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 174 transition count 4690
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 22 place count 170 transition count 2258
Iterating global reduction 0 with 4 rules applied. Total rules applied 26 place count 170 transition count 2258
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 30 place count 166 transition count 2252
Iterating global reduction 0 with 4 rules applied. Total rules applied 34 place count 166 transition count 2252
Applied a total of 34 rules in 123 ms. Remains 166 /183 variables (removed 17) and now considering 2252/6759 (removed 4507) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13419088849113745984.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12606822547115111204.kers'
[2026-06-02 08:55:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13419088849113745984.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12606822547115111204.kers]
Culled 0 columns in 11 ms.
// Phase 1: matrix 2252 rows 166 cols 41679 entries
Finished phase 1 with 142 SingleSign rule and 2 generalized
[2026-06-02 08:55:17] [INFO ] Computed 22 invariants in 40 ms
Computed 22 P flows in 41 ms.
Exported basis to /tmp/petrispot-output-12606822547115111204.kers
Total runtime 51 ms.
[2026-06-02 08:55:18] [INFO ] Implicit Places using invariants in 542 ms returned []
[2026-06-02 08:55:18] [INFO ] Invariant cache hit.
[2026-06-02 08:55:19] [INFO ] Implicit Places using invariants and state equation in 1482 ms returned []
Implicit Place search using SMT with State Equation took 2027 ms to find 0 implicit places.
Running 2251 sub problems to find dead transitions.
[2026-06-02 08:55:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2251 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 165/2418 variables, and 8 constraints, problems are : Problem set: 0 solved, 2251 unsolved in 30070 ms.
Refiners :[Positive P Invariants (semi-flows): 0/14 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/166 constraints, PredecessorRefiner: 2251/155 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2251 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2251 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 165/2418 variables, and 8 constraints, problems are : Problem set: 0 solved, 2251 unsolved in 30077 ms.
Refiners :[Positive P Invariants (semi-flows): 0/14 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/166 constraints, PredecessorRefiner: 2096/155 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 63274ms problems are : Problem set: 0 solved, 2251 unsolved
Search for dead transitions found 0 dead transitions in 63288ms
Starting structural reductions in LTL mode, iteration 1 : 166/183 places, 2252/6759 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65447 ms. Remains : 166/183 places, 2252/6759 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 p1) U X((F(p2)&&G(p3))))))'
Stuttering acceptance computed with spot in 774 ms :[(OR (NOT p3) (NOT p2)), (OR (NOT p3) (NOT p2)), (OR (NOT p3) (NOT p2)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2)) (AND p0 (NOT p3)) (AND p0 (NOT p2))), (NOT p2), (NOT p3), (AND (NOT p2) p0), (AND p0 (NOT p3)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p3)), (AND (NOT p2) p0), p0, p0, (NOT p1)]
Running random walk in product with property : ErlangenMainframeV2-PT-bP07C07-LTLFireability-14
Product exploration explored 100000 steps with 0 reset in 4886 ms.
Product exploration explored 100000 steps with 0 reset in 4521 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 13 factoid took 213 ms. Reduced automaton from 14 states, 38 edges and 4 AP (stutter sensitive) to 14 states, 38 edges and 4 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 2334 ms. (17 steps per ms) remains 10/15 properties
BEST_FIRST walk for 40000 steps (8 resets) in 2135 ms. (18 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (8 resets) in 1754 ms. (22 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (8 resets) in 1480 ms. (27 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (8 resets) in 2013 ms. (19 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (8 resets) in 1964 ms. (20 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (8 resets) in 2388 ms. (16 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (8 resets) in 1835 ms. (21 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (8 resets) in 1322 ms. (30 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (8 resets) in 1301 ms. (30 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (8 resets) in 1486 ms. (26 steps per ms) remains 10/10 properties
[2026-06-02 08:56:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem apf1 is UNSAT
Problem apf12 is UNSAT
At refinement iteration 1 (OVERLAPS) 30/55 variables, 10/10 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 1/11 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 0/11 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 63/118 variables, 4/15 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/118 variables, 0/15 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 48/166 variables, 8/23 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/166 variables, 0/23 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 2252/2418 variables, 166/189 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2418 variables, 0/189 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 0/2418 variables, 0/189 constraints. Problems are: Problem set: 2 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2418/2418 variables, and 189 constraints, problems are : Problem set: 2 solved, 8 unsolved in 4710 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 166/166 constraints, PredecessorRefiner: 10/0 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 30/55 variables, 10/10 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 1/11 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 0/11 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 63/118 variables, 4/15 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/118 variables, 0/15 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 48/166 variables, 8/23 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/166 variables, 0/23 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 2252/2418 variables, 166/189 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2418 variables, 0/189 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 0/2418 variables, 0/189 constraints. Problems are: Problem set: 2 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2418/2418 variables, and 189 constraints, problems are : Problem set: 2 solved, 8 unsolved in 4220 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 166/166 constraints, PredecessorRefiner: 8/0 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8974ms problems are : Problem set: 2 solved, 8 unsolved
Fused 8 Parikh solutions to 3 different solutions.
Parikh walk visited 7 properties in 799 ms.
Support contains 9 out of 166 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 166/166 places, 2252/2252 transitions.
Graph (trivial) has 138 edges and 166 vertex of which 11 / 166 are part of one of the 5 SCC in 4 ms
Free SCC test removed 6 places
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 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 160 transition count 2214
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 134 transition count 2205
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 68 place count 128 transition count 2205
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 68 place count 128 transition count 2192
Deduced a syphon composed of 13 places in 2 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 94 place count 115 transition count 2192
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 99 place count 110 transition count 504
Iterating global reduction 3 with 5 rules applied. Total rules applied 104 place count 110 transition count 504
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 106 place count 108 transition count 500
Iterating global reduction 3 with 2 rules applied. Total rules applied 108 place count 108 transition count 500
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 178 place count 73 transition count 465
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 184 place count 73 transition count 459
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 187 place count 70 transition count 452
Iterating global reduction 4 with 3 rules applied. Total rules applied 190 place count 70 transition count 452
Performed 10 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 210 place count 60 transition count 470
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 222 place count 60 transition count 458
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 224 place count 58 transition count 454
Iterating global reduction 5 with 2 rules applied. Total rules applied 226 place count 58 transition count 454
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 236 place count 58 transition count 444
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 238 place count 57 transition count 457
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 239 place count 57 transition count 456
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 7 with 10 rules applied. Total rules applied 249 place count 57 transition count 446
Free-agglomeration rule applied 12 times.
Iterating global reduction 7 with 12 rules applied. Total rules applied 261 place count 57 transition count 434
Reduce places removed 12 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 7 with 28 rules applied. Total rules applied 289 place count 45 transition count 418
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 297 place count 45 transition count 410
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 8 with 1 rules applied. Total rules applied 298 place count 45 transition count 416
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 301 place count 44 transition count 414
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 9 with 9 rules applied. Total rules applied 310 place count 44 transition count 405
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 311 place count 43 transition count 404
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 313 place count 41 transition count 404
Applied a total of 313 rules in 299 ms. Remains 41 /166 variables (removed 125) and now considering 404/2252 (removed 1848) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 299 ms. Remains : 41/166 places, 404/2252 transitions.
RANDOM walk for 13701 steps (2 resets) in 244 ms. (55 steps per ms) remains 0/1 properties
Found 2 invariant AP formulas.
Knowledge based reduction with 15 factoid took 375 ms. Reduced automaton from 14 states, 38 edges and 4 AP (stutter sensitive) to 12 states, 31 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 673 ms :[(OR (NOT p3) (NOT p2)), (OR (NOT p3) (NOT p2)), (OR (NOT p3) (NOT p2)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2)) (AND p0 (NOT p3)) (AND p0 (NOT p2))), (NOT p2), (NOT p3), (AND (NOT p2) p0), (AND (NOT p1) (NOT p2)), (AND (NOT p2) p0), p0, p0, (NOT p1)]
[2026-06-02 08:56:51] [INFO ] Invariant cache hit.
[2026-06-02 08:56:53] [INFO ] [Real]Absence check using 14 positive place invariants in 10 ms returned unsat
Proved EG (NOT p3) asserting that LTL formula F !(NOT p3) is false.
[2026-06-02 08:56:53] [INFO ] Invariant cache hit.
[2026-06-02 08:56:55] [INFO ] [Real]Absence check using 14 positive place invariants in 10 ms returned sat
[2026-06-02 08:56:55] [INFO ] [Real]Absence check using 14 positive and 8 generalized place invariants in 5 ms returned sat
[2026-06-02 08:56:56] [INFO ] [Real]Absence check using state equation in 892 ms returned sat
[2026-06-02 08:56:56] [INFO ] Solution in real domain found non-integer solution.
[2026-06-02 08:56:58] [INFO ] [Nat]Absence check using 14 positive place invariants in 7 ms returned sat
[2026-06-02 08:56:58] [INFO ] [Nat]Absence check using 14 positive and 8 generalized place invariants in 5 ms returned sat
[2026-06-02 08:56:59] [INFO ] [Nat]Absence check using state equation in 937 ms returned sat
[2026-06-02 08:57:01] [INFO ] Computed and/alt/rep : 164/314/164 causal constraints (skipped 2087 transitions) in 1562 ms.
[2026-06-02 08:57:05] [INFO ] Added : 134 causal constraints over 27 iterations in 5327 ms. Result :sat
Could not prove EG (NOT p2)
Negative knowledge disproves property using: (F p3)
Knowledge-based reduction took 32259 ms.
FORMULA ErlangenMainframeV2-PT-bP07C07-LTLFireability-14 FALSE TECHNIQUES NEGATIVE_KNOWLEDGE
Treatment of property ErlangenMainframeV2-PT-bP07C07-LTLFireability-14 finished in 108057 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 14 out of 183 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 183/183 places, 6759/6759 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 179 transition count 5534
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 179 transition count 5534
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 175 transition count 3102
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 175 transition count 3102
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 20 place count 171 transition count 3096
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 171 transition count 3096
Applied a total of 24 rules in 236 ms. Remains 171 /183 variables (removed 12) and now considering 3096/6759 (removed 3663) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11069056959314355507.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4456285001673468092.kers'
[2026-06-02 08:57:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11069056959314355507.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4456285001673468092.kers]
Culled 0 columns in 16 ms.
// Phase 1: matrix 3096 rows 171 cols 56871 entries
Finished phase 1 with 146 SingleSign rule and 3 generalized
[2026-06-02 08:57:05] [INFO ] Computed 22 invariants in 54 ms
Computed 22 P flows in 55 ms.
Exported basis to /tmp/petrispot-output-4456285001673468092.kers
Total runtime 64 ms.
[2026-06-02 08:57:07] [INFO ] Implicit Places using invariants in 1678 ms returned []
[2026-06-02 08:57:07] [INFO ] Invariant cache hit.
[2026-06-02 08:57:10] [INFO ] Implicit Places using invariants and state equation in 3210 ms returned []
Implicit Place search using SMT with State Equation took 4908 ms to find 0 implicit places.
Running 3095 sub problems to find dead transitions.
[2026-06-02 08:57:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3095 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 170/3267 variables, and 8 constraints, problems are : Problem set: 0 solved, 3095 unsolved in 30094 ms.
Refiners :[Positive P Invariants (semi-flows): 0/14 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/171 constraints, PredecessorRefiner: 3095/146 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3095 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3095 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 170/3267 variables, and 8 constraints, problems are : Problem set: 0 solved, 3095 unsolved in 30089 ms.
Refiners :[Positive P Invariants (semi-flows): 0/14 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/171 constraints, PredecessorRefiner: 2949/146 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 64962ms problems are : Problem set: 0 solved, 3095 unsolved
Search for dead transitions found 0 dead transitions in 64981ms
Starting structural reductions in LTL mode, iteration 1 : 171/183 places, 3096/6759 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 70141 ms. Remains : 171/183 places, 3096/6759 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Stuttering acceptance computed with spot in 148 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ErlangenMainframeV2-PT-bP07C07-LTLFireability-15
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ErlangenMainframeV2-PT-bP07C07-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV2-PT-bP07C07-LTLFireability-15 finished in 70347 ms.
All properties solved by simple procedures.
Total runtime 1161172 ms.

BK_STOP 1780390695819

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ErlangenMainframeV2-PT-bP07C07"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5973"
echo " Executing tool itstools"
echo " Input is ErlangenMainframeV2-PT-bP07C07, 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-178021499200260"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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