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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 984K
-rw-r--r-- 1 mcc users 6.7K May 27 09:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K May 27 09:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 27 09:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 27 09:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 27 10:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 27 10:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 27 10:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 27 10:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 26 18:17 NewModel
-rw-r--r-- 1 mcc users 8.5K May 27 09:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 82K May 27 09:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K May 27 09:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K May 27 09:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 27 10:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 27 10:42 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 610K 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-bP05C05-LTLFireability-00
FORMULA_NAME ErlangenMainframeV2-PT-bP05C05-LTLFireability-01
FORMULA_NAME ErlangenMainframeV2-PT-bP05C05-LTLFireability-02
FORMULA_NAME ErlangenMainframeV2-PT-bP05C05-LTLFireability-03
FORMULA_NAME ErlangenMainframeV2-PT-bP05C05-LTLFireability-04
FORMULA_NAME ErlangenMainframeV2-PT-bP05C05-LTLFireability-05
FORMULA_NAME ErlangenMainframeV2-PT-bP05C05-LTLFireability-06
FORMULA_NAME ErlangenMainframeV2-PT-bP05C05-LTLFireability-07
FORMULA_NAME ErlangenMainframeV2-PT-bP05C05-LTLFireability-08
FORMULA_NAME ErlangenMainframeV2-PT-bP05C05-LTLFireability-09
FORMULA_NAME ErlangenMainframeV2-PT-bP05C05-LTLFireability-10
FORMULA_NAME ErlangenMainframeV2-PT-bP05C05-LTLFireability-11
FORMULA_NAME ErlangenMainframeV2-PT-bP05C05-LTLFireability-12
FORMULA_NAME ErlangenMainframeV2-PT-bP05C05-LTLFireability-13
FORMULA_NAME ErlangenMainframeV2-PT-bP05C05-LTLFireability-14
FORMULA_NAME ErlangenMainframeV2-PT-bP05C05-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1780377929140

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-bP05C05
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-06-02 05:25:31] [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 05:25:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-06-02 05:25:31] [INFO ] Load time of PNML (sax parser for PT used): 384 ms
[2026-06-02 05:25:32] [INFO ] Transformed 259 places.
[2026-06-02 05:25:32] [INFO ] Transformed 1015 transitions.
[2026-06-02 05:25:32] [INFO ] Found NUPN structural information;
[2026-06-02 05:25:32] [INFO ] Parsed PT model containing 259 places and 1015 transitions and 11939 arcs in 597 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 4 formulas.
FORMULA ErlangenMainframeV2-PT-bP05C05-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV2-PT-bP05C05-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV2-PT-bP05C05-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV2-PT-bP05C05-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 45 out of 259 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 259/259 places, 1015/1015 transitions.
Discarding 61 places :
Symmetric choice reduction at 0 with 61 rule applications. Total rules 61 place count 198 transition count 954
Iterating global reduction 0 with 61 rules applied. Total rules applied 122 place count 198 transition count 954
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 154 place count 166 transition count 922
Iterating global reduction 0 with 32 rules applied. Total rules applied 186 place count 166 transition count 922
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 189 place count 163 transition count 919
Iterating global reduction 0 with 3 rules applied. Total rules applied 192 place count 163 transition count 919
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 194 place count 161 transition count 904
Iterating global reduction 0 with 2 rules applied. Total rules applied 196 place count 161 transition count 904
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 198 place count 159 transition count 902
Iterating global reduction 0 with 2 rules applied. Total rules applied 200 place count 159 transition count 902
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 202 place count 157 transition count 900
Iterating global reduction 0 with 2 rules applied. Total rules applied 204 place count 157 transition count 900
Applied a total of 204 rules in 229 ms. Remains 157 /259 variables (removed 102) and now considering 900/1015 (removed 115) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11043409008125560933.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4234149982401407124.kers'
[2026-06-02 05:25:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11043409008125560933.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4234149982401407124.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 900 rows 157 cols 11649 entries
Finished phase 1 with 136 SingleSign rule and 3 generalized
[2026-06-02 05:25:32] [INFO ] Computed 18 invariants in 7 ms
Computed 18 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-4234149982401407124.kers
Total runtime 13 ms.
[2026-06-02 05:25:33] [INFO ] Implicit Places using invariants in 432 ms returned []
[2026-06-02 05:25:33] [INFO ] Invariant cache hit.
[2026-06-02 05:25:33] [INFO ] Implicit Places using invariants and state equation in 754 ms returned []
Implicit Place search using SMT with State Equation took 1257 ms to find 0 implicit places.
Running 899 sub problems to find dead transitions.
[2026-06-02 05:25:34] [INFO ] Invariant cache hit.
Excessive predecessor constraint size, skipping predecessor.
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 899 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 899 unsolved
At refinement iteration 2 (OVERLAPS) 1/157 variables, 12/18 constraints. Problems are: Problem set: 0 solved, 899 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 157/1057 variables, and 18 constraints, problems are : Problem set: 0 solved, 899 unsolved in 30091 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/157 constraints, PredecessorRefiner: 899/152 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 899 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 899 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 899 unsolved
At refinement iteration 2 (OVERLAPS) 1/157 variables, 12/18 constraints. Problems are: Problem set: 0 solved, 899 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 899 unsolved
At refinement iteration 4 (OVERLAPS) 900/1057 variables, 157/175 constraints. Problems are: Problem set: 0 solved, 899 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1057 variables, 152/327 constraints. Problems are: Problem set: 0 solved, 899 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1057/1057 variables, and 327 constraints, problems are : Problem set: 0 solved, 899 unsolved in 30051 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 899/152 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61866ms problems are : Problem set: 0 solved, 899 unsolved
Search for dead transitions found 0 dead transitions in 61916ms
Starting structural reductions in LTL mode, iteration 1 : 157/259 places, 900/1015 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63488 ms. Remains : 157/259 places, 900/1015 transitions.
Starting structural reductions in LTL mode, iteration 0 : 157/157 places, 900/900 transitions.
Applied a total of 0 rules in 11 ms. Remains 157 /157 variables (removed 0) and now considering 900/900 (removed 0) transitions.
[2026-06-02 05:26:35] [INFO ] Invariant cache hit.
[2026-06-02 05:26:36] [INFO ] Implicit Places using invariants in 108 ms returned []
[2026-06-02 05:26:36] [INFO ] Invariant cache hit.
[2026-06-02 05:26:36] [INFO ] Implicit Places using invariants and state equation in 571 ms returned []
Implicit Place search using SMT with State Equation took 682 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 696 ms. Remains : 157/157 places, 900/900 transitions.
Support contains 45 out of 157 places after structural reductions.
[2026-06-02 05:26:37] [INFO ] Flatten gal took : 488 ms
[2026-06-02 05:26:37] [INFO ] Flatten gal took : 182 ms
[2026-06-02 05:26:38] [INFO ] Input system was already deterministic with 900 transitions.
RANDOM walk for 40000 steps (8 resets) in 4032 ms. (9 steps per ms) remains 25/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 44 ms. (88 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (8 resets) in 19 ms. (200 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 31 ms. (125 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (8 resets) in 42 ms. (93 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (8 resets) in 41 ms. (95 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 24/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (8 resets) in 12 ms. (307 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 24/24 properties
[2026-06-02 05:26:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 41/80 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 24 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 48/128 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (OVERLAPS) 29/157 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/157 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (OVERLAPS) 900/1057 variables, 157/175 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1057 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 9 (OVERLAPS) 0/1057 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1057/1057 variables, and 175 constraints, problems are : Problem set: 0 solved, 24 unsolved in 1618 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 24/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 24 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 41/80 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (OVERLAPS) 48/128 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (OVERLAPS) 29/157 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/157 variables, 8/27 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/157 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 24 unsolved
SMT process timed out in 6744ms, After SMT, problems are : Problem set: 0 solved, 24 unsolved
Fused 24 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 39 out of 157 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 900/900 transitions.
Graph (trivial) has 110 edges and 157 vertex of which 9 / 157 are part of one of the 4 SCC in 12 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 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 23 place count 152 transition count 868
Reduce places removed 22 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 35 rules applied. Total rules applied 58 place count 130 transition count 855
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 66 place count 122 transition count 855
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 66 place count 122 transition count 841
Deduced a syphon composed of 14 places in 2 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 94 place count 108 transition count 841
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 95 place count 107 transition count 837
Iterating global reduction 3 with 1 rules applied. Total rules applied 96 place count 107 transition count 837
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 138 place count 86 transition count 816
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 142 place count 86 transition count 812
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 145 place count 83 transition count 805
Iterating global reduction 4 with 3 rules applied. Total rules applied 148 place count 83 transition count 805
Performed 7 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 162 place count 76 transition count 831
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 174 place count 76 transition count 819
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 176 place count 74 transition count 813
Iterating global reduction 5 with 2 rules applied. Total rules applied 178 place count 74 transition count 813
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 188 place count 74 transition count 803
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 190 place count 73 transition count 816
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 191 place count 73 transition count 815
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 199 place count 73 transition count 807
Free-agglomeration rule applied 3 times.
Iterating global reduction 7 with 3 rules applied. Total rules applied 202 place count 73 transition count 804
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 205 place count 70 transition count 804
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 206 place count 70 transition count 803
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 8 with 1 rules applied. Total rules applied 207 place count 70 transition count 809
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 210 place count 69 transition count 807
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 223 place count 69 transition count 794
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 225 place count 69 transition count 794
Partial Post-agglomeration rule applied 4 times.
Drop transitions (Partial Post agglomeration) removed 4 transitions
Iterating global reduction 9 with 4 rules applied. Total rules applied 229 place count 69 transition count 794
Applied a total of 229 rules in 984 ms. Remains 69 /157 variables (removed 88) and now considering 794/900 (removed 106) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 985 ms. Remains : 69/157 places, 794/900 transitions.
RANDOM walk for 40000 steps (8 resets) in 2850 ms. (14 steps per ms) remains 20/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 60 ms. (65 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (8 resets) in 47 ms. (83 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4001 steps (8 resets) in 45 ms. (86 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4000 steps (8 resets) in 54 ms. (72 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4001 steps (8 resets) in 45 ms. (86 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (8 resets) in 47 ms. (83 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (8 resets) in 47 ms. (83 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 53 ms. (74 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4001 steps (8 resets) in 52 ms. (75 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 51 ms. (77 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (8 resets) in 55 ms. (71 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4001 steps (8 resets) in 62 ms. (63 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4001 steps (8 resets) in 48 ms. (81 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4001 steps (8 resets) in 49 ms. (80 steps per ms) remains 20/20 properties
[2026-06-02 05:26:48] [INFO ] Flow matrix only has 791 transitions (discarded 3 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13529632839199752394.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5197341489778378094.kers'
[2026-06-02 05:26:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13529632839199752394.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5197341489778378094.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 791 rows 69 cols 11391 entries
Finished phase 1 with 48 SingleSign rule and 3 generalized
[2026-06-02 05:26:48] [INFO ] Computed 18 invariants in 6 ms
Computed 18 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-5197341489778378094.kers
Total runtime 9 ms.
[2026-06-02 05:26:48] [INFO ] State equation strengthened by 21 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 7/45 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 6/51 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 18/69 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (OVERLAPS) 791/860 variables, 69/87 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/860 variables, 21/108 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/860 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 10 (OVERLAPS) 0/860 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 860/860 variables, and 108 constraints, problems are : Problem set: 0 solved, 20 unsolved in 1032 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 69/69 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 20/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 7/45 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 6/51 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 18/69 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/69 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 791/860 variables, 69/88 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/860 variables, 21/109 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/860 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 11 (OVERLAPS) 0/860 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 860/860 variables, and 109 constraints, problems are : Problem set: 0 solved, 20 unsolved in 3483 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 69/69 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 20/0 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4574ms problems are : Problem set: 0 solved, 20 unsolved
Fused 20 Parikh solutions to 19 different solutions.
Finished Parikh walk after 43 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=21 )
Parikh walk visited 20 properties in 1390 ms.
Computed a total of 17 stabilizing places and 17 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U (X(X((X(p1)||G(p2))))||F(p3))))'
Support contains 17 out of 157 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 157/157 places, 900/900 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 150 transition count 684
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 150 transition count 684
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 148 transition count 521
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 148 transition count 521
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 147 transition count 520
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 147 transition count 520
Applied a total of 20 rules in 41 ms. Remains 147 /157 variables (removed 10) and now considering 520/900 (removed 380) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10127821589633745652.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2379102992893236491.kers'
[2026-06-02 05:26:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10127821589633745652.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2379102992893236491.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 520 rows 147 cols 6073 entries
Finished phase 1 with 127 SingleSign rule and 2 generalized
[2026-06-02 05:26:54] [INFO ] Computed 18 invariants in 12 ms
Computed 18 P flows in 12 ms.
Exported basis to /tmp/petrispot-output-2379102992893236491.kers
Total runtime 13 ms.
[2026-06-02 05:26:55] [INFO ] Implicit Places using invariants in 227 ms returned []
[2026-06-02 05:26:55] [INFO ] Invariant cache hit.
[2026-06-02 05:26:55] [INFO ] Implicit Places using invariants and state equation in 408 ms returned []
Implicit Place search using SMT with State Equation took 639 ms to find 0 implicit places.
Running 519 sub problems to find dead transitions.
[2026-06-02 05:26:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 2 (OVERLAPS) 1/147 variables, 12/18 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 4 (OVERLAPS) 520/667 variables, 147/165 constraints. Problems are: Problem set: 0 solved, 519 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 667/667 variables, and 165 constraints, problems are : Problem set: 0 solved, 519 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 147/147 constraints, PredecessorRefiner: 519/145 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 519 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 2 (OVERLAPS) 1/147 variables, 12/18 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 4 (OVERLAPS) 520/667 variables, 147/165 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/667 variables, 145/310 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/667 variables, 4/314 constraints. Problems are: Problem set: 0 solved, 519 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 667/667 variables, and 314 constraints, problems are : Problem set: 0 solved, 519 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 147/147 constraints, PredecessorRefiner: 519/145 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60546ms problems are : Problem set: 0 solved, 519 unsolved
Search for dead transitions found 0 dead transitions in 60550ms
Starting structural reductions in LTL mode, iteration 1 : 147/157 places, 520/900 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61234 ms. Remains : 147/157 places, 520/900 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U (X(X((X(p1)||G(p2))))||F(p3))))'
Stuttering acceptance computed with spot in 1084 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p3) (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p0) (NOT p1)), (AND (NOT p3) (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p3) (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p3) (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p0)), (AND (NOT p3) (NOT p0) (NOT p2))]
Running random walk in product with property : ErlangenMainframeV2-PT-bP05C05-LTLFireability-00
Product exploration explored 100000 steps with 0 reset in 1672 ms.
Stack based approach found an accepted trace after 97 steps with 1 reset with depth 52 and stack size 52 in 1 ms.
FORMULA ErlangenMainframeV2-PT-bP05C05-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property ErlangenMainframeV2-PT-bP05C05-LTLFireability-00 finished in 64162 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((X(p1)||p0))||X(p2))))'
Support contains 12 out of 157 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 157/157 places, 900/900 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 155 transition count 895
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 155 transition count 895
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 154 transition count 894
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 154 transition count 894
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 153 transition count 893
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 153 transition count 893
Applied a total of 8 rules in 24 ms. Remains 153 /157 variables (removed 4) and now considering 893/900 (removed 7) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2736570672689170784.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17475268524937622562.kers'
[2026-06-02 05:27:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2736570672689170784.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17475268524937622562.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 893 rows 153 cols 11619 entries
Finished phase 1 with 132 SingleSign rule and 3 generalized
[2026-06-02 05:27:58] [INFO ] Computed 18 invariants in 9 ms
Computed 18 P flows in 10 ms.
Exported basis to /tmp/petrispot-output-17475268524937622562.kers
Total runtime 12 ms.
[2026-06-02 05:27:59] [INFO ] Implicit Places using invariants in 425 ms returned []
[2026-06-02 05:27:59] [INFO ] Invariant cache hit.
[2026-06-02 05:28:00] [INFO ] Implicit Places using invariants and state equation in 860 ms returned []
Implicit Place search using SMT with State Equation took 1297 ms to find 0 implicit places.
Running 892 sub problems to find dead transitions.
[2026-06-02 05:28:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 892 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/152 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 892 unsolved
At refinement iteration 2 (OVERLAPS) 1/153 variables, 12/18 constraints. Problems are: Problem set: 0 solved, 892 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 153/1046 variables, and 18 constraints, problems are : Problem set: 0 solved, 892 unsolved in 30049 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/153 constraints, PredecessorRefiner: 892/145 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 892 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 892 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/152 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 892 unsolved
At refinement iteration 2 (OVERLAPS) 1/153 variables, 12/18 constraints. Problems are: Problem set: 0 solved, 892 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 892 unsolved
At refinement iteration 4 (OVERLAPS) 893/1046 variables, 153/171 constraints. Problems are: Problem set: 0 solved, 892 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1046 variables, 145/316 constraints. Problems are: Problem set: 0 solved, 892 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1046/1046 variables, and 316 constraints, problems are : Problem set: 0 solved, 892 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 892/145 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61441ms problems are : Problem set: 0 solved, 892 unsolved
Search for dead transitions found 0 dead transitions in 61447ms
Starting structural reductions in LTL mode, iteration 1 : 153/157 places, 893/900 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62779 ms. Remains : 153/157 places, 893/900 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((X(p1)||p0))||X(p2))))'
Stuttering acceptance computed with spot in 241 ms :[true, (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ErlangenMainframeV2-PT-bP05C05-LTLFireability-01
Product exploration explored 100000 steps with 33333 reset in 660 ms.
Product exploration explored 100000 steps with 33333 reset in 401 ms.
Computed a total of 17 stabilizing places and 17 stable transitions
Computed a total of 17 stabilizing places and 17 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 10 factoid took 16 ms. Proved property starting from automaton with 7 states, 14 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 41 ms.
FORMULA ErlangenMainframeV2-PT-bP05C05-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ErlangenMainframeV2-PT-bP05C05-LTLFireability-01 finished in 64164 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 8 out of 157 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 157/157 places, 900/900 transitions.
Graph (trivial) has 124 edges and 157 vertex of which 9 / 157 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 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 22 place count 151 transition count 872
Reduce places removed 21 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 34 rules applied. Total rules applied 56 place count 130 transition count 859
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 64 place count 122 transition count 859
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 64 place count 122 transition count 845
Deduced a syphon composed of 14 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 29 rules applied. Total rules applied 93 place count 107 transition count 845
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 104 place count 96 transition count 599
Ensure Unique test removed 4 places
Iterating global reduction 3 with 15 rules applied. Total rules applied 119 place count 92 transition count 599
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 124 place count 87 transition count 208
Ensure Unique test removed 1 places
Iterating global reduction 3 with 6 rules applied. Total rules applied 130 place count 86 transition count 208
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 132 place count 84 transition count 174
Iterating global reduction 3 with 2 rules applied. Total rules applied 134 place count 84 transition count 174
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 190 place count 56 transition count 146
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 194 place count 56 transition count 142
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 197 place count 53 transition count 135
Iterating global reduction 4 with 3 rules applied. Total rules applied 200 place count 53 transition count 135
Performed 7 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 214 place count 46 transition count 153
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 226 place count 46 transition count 141
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 228 place count 44 transition count 137
Iterating global reduction 5 with 2 rules applied. Total rules applied 230 place count 44 transition count 137
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 240 place count 44 transition count 127
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 242 place count 43 transition count 140
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 6 with 12 rules applied. Total rules applied 254 place count 43 transition count 128
Partial Post-agglomeration rule applied 4 times.
Drop transitions (Partial Post agglomeration) removed 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 258 place count 43 transition count 128
Applied a total of 258 rules in 135 ms. Remains 43 /157 variables (removed 114) and now considering 128/900 (removed 772) transitions.
[2026-06-02 05:29:03] [INFO ] Flow matrix only has 117 transitions (discarded 11 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-399019264846438517.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12853320888424783768.kers'
[2026-06-02 05:29:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-399019264846438517.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12853320888424783768.kers]
Normalized transition count is 116 out of 117 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 116 rows 43 cols 1268 entries
Finished phase 1 with 31 SingleSign rule and 0 generalized
[2026-06-02 05:29:03] [INFO ] Computed 12 invariants in 0 ms
Computed 12 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-12853320888424783768.kers
Total runtime 5 ms.
[2026-06-02 05:29:03] [INFO ] Implicit Places using invariants in 80 ms returned []
[2026-06-02 05:29:03] [INFO ] Flow matrix only has 117 transitions (discarded 11 similar events)
[2026-06-02 05:29:03] [INFO ] Invariant cache hit.
[2026-06-02 05:29:03] [INFO ] State equation strengthened by 11 read => feed constraints.
[2026-06-02 05:29:03] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 175 ms to find 0 implicit places.
[2026-06-02 05:29:03] [INFO ] Redundant transitions in 4 ms returned []
Running 120 sub problems to find dead transitions.
[2026-06-02 05:29:03] [INFO ] Flow matrix only has 117 transitions (discarded 11 similar events)
[2026-06-02 05:29:03] [INFO ] Invariant cache hit.
[2026-06-02 05:29:03] [INFO ] State equation strengthened by 11 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (OVERLAPS) 1/43 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (OVERLAPS) 116/159 variables, 43/55 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 10/65 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/159 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (OVERLAPS) 1/160 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (OVERLAPS) 0/160 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/160 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 10 (OVERLAPS) 0/160 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 160/160 variables, and 67 constraints, problems are : Problem set: 0 solved, 120 unsolved in 7512 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 43/43 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 120 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (OVERLAPS) 1/43 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 116/159 variables, 43/56 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/159 variables, 10/66 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/159 variables, 120/186 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/159 variables, 1/187 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/159 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 9 (OVERLAPS) 1/160 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/160 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 11 (OVERLAPS) 0/160 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Int declared 160/160 variables, and 188 constraints, problems are : Problem set: 0 solved, 120 unsolved in 26093 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 43/43 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 33714ms problems are : Problem set: 0 solved, 120 unsolved
Search for dead transitions found 0 dead transitions in 33714ms
Starting structural reductions in SI_LTL mode, iteration 1 : 43/157 places, 128/900 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 34035 ms. Remains : 43/157 places, 128/900 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 72 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ErlangenMainframeV2-PT-bP05C05-LTLFireability-05
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 1 ms.
FORMULA ErlangenMainframeV2-PT-bP05C05-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV2-PT-bP05C05-LTLFireability-05 finished in 34136 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 9 out of 157 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 157/157 places, 900/900 transitions.
Graph (trivial) has 123 edges and 157 vertex of which 9 / 157 are part of one of the 4 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 22 place count 151 transition count 872
Reduce places removed 21 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 34 rules applied. Total rules applied 56 place count 130 transition count 859
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 64 place count 122 transition count 859
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 64 place count 122 transition count 846
Deduced a syphon composed of 13 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 27 rules applied. Total rules applied 91 place count 108 transition count 846
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 101 place count 98 transition count 601
Ensure Unique test removed 4 places
Iterating global reduction 3 with 14 rules applied. Total rules applied 115 place count 94 transition count 601
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 119 place count 90 transition count 211
Iterating global reduction 3 with 4 rules applied. Total rules applied 123 place count 90 transition count 211
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 126 place count 87 transition count 205
Iterating global reduction 3 with 3 rules applied. Total rules applied 129 place count 87 transition count 205
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 52 rules applied. Total rules applied 181 place count 61 transition count 179
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 185 place count 61 transition count 175
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 188 place count 58 transition count 168
Iterating global reduction 4 with 3 rules applied. Total rules applied 191 place count 58 transition count 168
Performed 9 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 209 place count 49 transition count 186
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 221 place count 49 transition count 174
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 223 place count 47 transition count 170
Iterating global reduction 5 with 2 rules applied. Total rules applied 225 place count 47 transition count 170
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 235 place count 47 transition count 160
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 237 place count 46 transition count 173
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 246 place count 46 transition count 164
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 248 place count 46 transition count 164
Applied a total of 248 rules in 87 ms. Remains 46 /157 variables (removed 111) and now considering 164/900 (removed 736) transitions.
[2026-06-02 05:29:37] [INFO ] Flow matrix only has 153 transitions (discarded 11 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3912054996542052615.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1139564927533103705.kers'
[2026-06-02 05:29:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3912054996542052615.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1139564927533103705.kers]
Normalized transition count is 152 out of 153 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 152 rows 46 cols 1340 entries
Finished phase 1 with 31 SingleSign rule and 2 generalized
[2026-06-02 05:29:37] [INFO ] Computed 13 invariants in 0 ms
Computed 13 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-1139564927533103705.kers
Total runtime 2 ms.
[2026-06-02 05:29:37] [INFO ] Implicit Places using invariants in 61 ms returned [36]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 64 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 45/157 places, 164/900 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 44 transition count 163
Applied a total of 2 rules in 8 ms. Remains 44 /45 variables (removed 1) and now considering 163/164 (removed 1) transitions.
[2026-06-02 05:29:37] [INFO ] Flow matrix only has 152 transitions (discarded 11 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12549200529062409013.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13482049134909078372.kers'
[2026-06-02 05:29:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12549200529062409013.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13482049134909078372.kers]
Normalized transition count is 151 out of 152 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 151 rows 44 cols 1618 entries
Finished phase 1 with 32 SingleSign rule and 0 generalized
[2026-06-02 05:29:37] [INFO ] Computed 12 invariants in 1 ms
Computed 12 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13482049134909078372.kers
Total runtime 1 ms.
[2026-06-02 05:29:37] [INFO ] Implicit Places using invariants in 55 ms returned []
[2026-06-02 05:29:37] [INFO ] Flow matrix only has 152 transitions (discarded 11 similar events)
[2026-06-02 05:29:37] [INFO ] Invariant cache hit.
[2026-06-02 05:29:37] [INFO ] State equation strengthened by 11 read => feed constraints.
[2026-06-02 05:29:37] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 185 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 44/157 places, 163/900 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 346 ms. Remains : 44/157 places, 163/900 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 54 ms :[(NOT p0)]
Running random walk in product with property : ErlangenMainframeV2-PT-bP05C05-LTLFireability-06
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 1 ms.
FORMULA ErlangenMainframeV2-PT-bP05C05-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV2-PT-bP05C05-LTLFireability-06 finished in 431 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0) U p1)||X((G(p2)||F(p3)))))'
Support contains 15 out of 157 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 157/157 places, 900/900 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 146 transition count 654
Ensure Unique test removed 4 places
Iterating global reduction 0 with 15 rules applied. Total rules applied 26 place count 142 transition count 654
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 29 place count 139 transition count 490
Ensure Unique test removed 1 places
Iterating global reduction 0 with 4 rules applied. Total rules applied 33 place count 138 transition count 490
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 34 place count 137 transition count 489
Iterating global reduction 0 with 1 rules applied. Total rules applied 35 place count 137 transition count 489
Applied a total of 35 rules in 21 ms. Remains 137 /157 variables (removed 20) and now considering 489/900 (removed 411) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10059563228207382498.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9540408426139801330.kers'
[2026-06-02 05:29:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10059563228207382498.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9540408426139801330.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 489 rows 137 cols 4014 entries
Finished phase 1 with 123 SingleSign rule and 1 generalized
[2026-06-02 05:29:37] [INFO ] Computed 13 invariants in 4 ms
Computed 13 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-9540408426139801330.kers
Total runtime 6 ms.
[2026-06-02 05:29:37] [INFO ] Implicit Places using invariants in 143 ms returned [45]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 146 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 136/157 places, 489/900 transitions.
Applied a total of 0 rules in 3 ms. Remains 136 /136 variables (removed 0) and now considering 489/489 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 172 ms. Remains : 136/157 places, 489/900 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0) U p1)||X((G(p2)||F(p3)))))'
Stuttering acceptance computed with spot in 323 ms :[(NOT p3), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3))), (AND (NOT p3) (NOT p0))]
Running random walk in product with property : ErlangenMainframeV2-PT-bP05C05-LTLFireability-07
Product exploration explored 100000 steps with 0 reset in 967 ms.
Product exploration explored 100000 steps with 0 reset in 1328 ms.
Computed a total of 17 stabilizing places and 17 stable transitions
Computed a total of 17 stabilizing places and 17 stable transitions
Knowledge based reduction with 31 factoid took 95 ms. Reduced automaton from 7 states, 20 edges and 4 AP (stutter sensitive) to 11 states, 46 edges and 4 AP (stutter insensitive).
RANDOM walk for 40000 steps (8 resets) in 1540 ms. (25 steps per ms) remains 16/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (8 resets) in 21 ms. (181 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 31 ms. (125 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 32 ms. (121 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (8 resets) in 16 ms. (235 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (8 resets) in 28 ms. (138 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 16/16 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5060823612554390976.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12855868074583957432.kers'
[2026-06-02 05:29:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5060823612554390976.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12855868074583957432.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 489 rows 136 cols 3689 entries
Finished phase 1 with 124 SingleSign rule and 0 generalized
[2026-06-02 05:29:41] [INFO ] Computed 12 invariants in 3 ms
Computed 12 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-12855868074583957432.kers
Total runtime 4 ms.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
Problem apf8 is UNSAT
Problem apf9 is UNSAT
Problem apf17 is UNSAT
At refinement iteration 1 (OVERLAPS) 73/88 variables, 9/9 constraints. Problems are: Problem set: 3 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/9 constraints. Problems are: Problem set: 3 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 48/136 variables, 3/12 constraints. Problems are: Problem set: 3 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/136 variables, 0/12 constraints. Problems are: Problem set: 3 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 489/625 variables, 136/148 constraints. Problems are: Problem set: 3 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/625 variables, 0/148 constraints. Problems are: Problem set: 3 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 0/625 variables, 0/148 constraints. Problems are: Problem set: 3 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 625/625 variables, and 148 constraints, problems are : Problem set: 3 solved, 13 unsolved in 938 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 136/136 constraints, PredecessorRefiner: 16/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 73/88 variables, 9/9 constraints. Problems are: Problem set: 3 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 2/11 constraints. Problems are: Problem set: 3 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 0/11 constraints. Problems are: Problem set: 3 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 48/136 variables, 3/14 constraints. Problems are: Problem set: 3 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/136 variables, 0/14 constraints. Problems are: Problem set: 3 solved, 13 unsolved
At refinement iteration 6 (OVERLAPS) 489/625 variables, 136/150 constraints. Problems are: Problem set: 3 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/625 variables, 0/150 constraints. Problems are: Problem set: 3 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 0/625 variables, 0/150 constraints. Problems are: Problem set: 3 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 625/625 variables, and 150 constraints, problems are : Problem set: 3 solved, 13 unsolved in 2249 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 136/136 constraints, PredecessorRefiner: 13/0 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3227ms problems are : Problem set: 3 solved, 13 unsolved
Fused 13 Parikh solutions to 5 different solutions.
Finished Parikh walk after 117 steps, including 1 resets, run visited all 3 properties in 4 ms. (steps per millisecond=29 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 13 properties in 427 ms.
Found 3 invariant AP formulas.
Knowledge based reduction with 34 factoid took 406 ms. Reduced automaton from 11 states, 46 edges and 4 AP (stutter insensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 229 ms :[(AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2)), (NOT p3)]
Knowledge-based reduction took 5033 ms.
Stuttering acceptance computed with spot in 239 ms :[(AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2)), (NOT p3)]
Support contains 13 out of 136 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 136/136 places, 489/489 transitions.
Graph (trivial) has 111 edges and 136 vertex of which 6 / 136 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 22 place count 132 transition count 464
Reduce places removed 21 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 30 rules applied. Total rules applied 52 place count 111 transition count 455
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 58 place count 105 transition count 455
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 58 place count 105 transition count 442
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 84 place count 92 transition count 442
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 144 place count 62 transition count 412
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 151 place count 62 transition count 405
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 154 place count 59 transition count 398
Iterating global reduction 4 with 3 rules applied. Total rules applied 157 place count 59 transition count 398
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 169 place count 53 transition count 416
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 181 place count 53 transition count 404
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 183 place count 51 transition count 400
Iterating global reduction 5 with 2 rules applied. Total rules applied 185 place count 51 transition count 400
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 195 place count 51 transition count 390
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 197 place count 50 transition count 403
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 206 place count 50 transition count 394
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 212 place count 50 transition count 394
Applied a total of 212 rules in 70 ms. Remains 50 /136 variables (removed 86) and now considering 394/489 (removed 95) transitions.
[2026-06-02 05:29:45] [INFO ] Flow matrix only has 384 transitions (discarded 10 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4043613560093068109.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9727018821214584670.kers'
[2026-06-02 05:29:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4043613560093068109.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9727018821214584670.kers]
Normalized transition count is 383 out of 384 initially.
Culled 0 columns in 1 ms.
// Phase 1: matrix 383 rows 50 cols 5460 entries
Finished phase 1 with 38 SingleSign rule and 0 generalized
[2026-06-02 05:29:45] [INFO ] Computed 12 invariants in 5 ms
Computed 12 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-9727018821214584670.kers
Total runtime 8 ms.
[2026-06-02 05:29:45] [INFO ] Implicit Places using invariants in 98 ms returned []
[2026-06-02 05:29:45] [INFO ] Flow matrix only has 384 transitions (discarded 10 similar events)
[2026-06-02 05:29:45] [INFO ] Invariant cache hit.
[2026-06-02 05:29:46] [INFO ] State equation strengthened by 11 read => feed constraints.
[2026-06-02 05:29:46] [INFO ] Implicit Places using invariants and state equation in 338 ms returned []
Implicit Place search using SMT with State Equation took 440 ms to find 0 implicit places.
[2026-06-02 05:29:46] [INFO ] Redundant transitions in 35 ms returned []
Running 386 sub problems to find dead transitions.
[2026-06-02 05:29:46] [INFO ] Flow matrix only has 384 transitions (discarded 10 similar events)
[2026-06-02 05:29:46] [INFO ] Invariant cache hit.
[2026-06-02 05:29:46] [INFO ] State equation strengthened by 11 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 1 (OVERLAPS) 1/50 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 3 (OVERLAPS) 383/433 variables, 50/62 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/433 variables, 10/72 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/433 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 6 (OVERLAPS) 1/434 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/434 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 8 (OVERLAPS) 0/434 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 386 unsolved
No progress, stopping.
After SMT solving in domain Real declared 434/434 variables, and 73 constraints, problems are : Problem set: 0 solved, 386 unsolved in 26566 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 50/50 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 386/29 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 386 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 1 (OVERLAPS) 1/50 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 3 (OVERLAPS) 383/433 variables, 50/62 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/433 variables, 10/72 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/433 variables, 29/101 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/433 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 7 (OVERLAPS) 1/434 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/434 variables, 2/104 constraints. Problems are: Problem set: 0 solved, 386 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 434/434 variables, and 104 constraints, problems are : Problem set: 0 solved, 386 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 50/50 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 386/29 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 57136ms problems are : Problem set: 0 solved, 386 unsolved
Search for dead transitions found 0 dead transitions in 57138ms
Starting structural reductions in SI_LTL mode, iteration 1 : 50/136 places, 394/489 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 57693 ms. Remains : 50/136 places, 394/489 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 13 factoid took 64 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
RANDOM walk for 40000 steps (8 resets) in 2995 ms. (13 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (8 resets) in 622 ms. (64 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (8 resets) in 585 ms. (68 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (8 resets) in 405 ms. (98 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (8 resets) in 485 ms. (82 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (8 resets) in 512 ms. (77 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (8 resets) in 582 ms. (68 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 527714 steps, run timeout after 3001 ms. (steps per millisecond=175 ) properties seen :0 out of 6
Probabilistic random walk after 527714 steps, saw 83104 distinct states, run finished after 3012 ms. (steps per millisecond=175 ) properties seen :0
[2026-06-02 05:30:48] [INFO ] Flow matrix only has 384 transitions (discarded 10 similar events)
[2026-06-02 05:30:48] [INFO ] Invariant cache hit.
[2026-06-02 05:30:48] [INFO ] State equation strengthened by 11 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem apf1 is UNSAT
At refinement iteration 1 (OVERLAPS) 23/36 variables, 8/8 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 14/50 variables, 4/12 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 383/433 variables, 50/62 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/433 variables, 10/72 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/433 variables, 0/72 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 1/434 variables, 1/73 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/434 variables, 0/73 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 0/434 variables, 0/73 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 434/434 variables, and 73 constraints, problems are : Problem set: 1 solved, 5 unsolved in 543 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 50/50 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 6/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 23/36 variables, 8/8 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 14/50 variables, 4/12 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 383/433 variables, 50/62 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/433 variables, 10/72 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/433 variables, 0/72 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 1/434 variables, 1/73 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/434 variables, 0/73 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 0/434 variables, 0/73 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 434/434 variables, and 73 constraints, problems are : Problem set: 1 solved, 5 unsolved in 769 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 50/50 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 5/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1334ms problems are : Problem set: 1 solved, 5 unsolved
Fused 5 Parikh solutions to 2 different solutions.
Finished Parikh walk after 26 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=26 )
Parikh walk visited 5 properties in 79 ms.
Found 1 invariant AP formulas.
Knowledge based reduction with 14 factoid took 136 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 147 ms :[(NOT p3), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2))]
Knowledge-based reduction took 6673 ms.
Stuttering acceptance computed with spot in 133 ms :[(NOT p3), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2))]
Stuttering acceptance computed with spot in 137 ms :[(NOT p3), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2))]
Product exploration explored 100000 steps with 0 reset in 1352 ms.
Product exploration explored 100000 steps with 0 reset in 1007 ms.
Spot run failed in 114 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin16610727475479855405
[2026-06-02 05:30:52] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16610727475479855405
Running compilation step : cd /tmp/ltsmin16610727475479855405;'/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 2323 ms.
Running link step : cd /tmp/ltsmin16610727475479855405;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 57 ms.
Running LTSmin : cd /tmp/ltsmin16610727475479855405;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased10548029173194891191.hoa' '--buchi-type=spotba'
LTSmin run took 9315 ms.
FORMULA ErlangenMainframeV2-PT-bP05C05-LTLFireability-07 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ErlangenMainframeV2-PT-bP05C05-LTLFireability-07 finished in 87029 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(G(p0)) U ((p0 U p1)&&(p1||F(p2)))))))'
Support contains 15 out of 157 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 157/157 places, 900/900 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 147 transition count 658
Ensure Unique test removed 4 places
Iterating global reduction 0 with 14 rules applied. Total rules applied 24 place count 143 transition count 658
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 26 place count 141 transition count 495
Ensure Unique test removed 1 places
Iterating global reduction 0 with 3 rules applied. Total rules applied 29 place count 140 transition count 495
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 30 place count 139 transition count 493
Iterating global reduction 0 with 1 rules applied. Total rules applied 31 place count 139 transition count 493
Applied a total of 31 rules in 13 ms. Remains 139 /157 variables (removed 18) and now considering 493/900 (removed 407) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3482266834937343430.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11180392889804729120.kers'
[2026-06-02 05:31:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3482266834937343430.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11180392889804729120.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 493 rows 139 cols 4038 entries
Finished phase 1 with 125 SingleSign rule and 1 generalized
[2026-06-02 05:31:04] [INFO ] Computed 13 invariants in 3 ms
Computed 13 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-11180392889804729120.kers
Total runtime 4 ms.
[2026-06-02 05:31:04] [INFO ] Implicit Places using invariants in 109 ms returned [44]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 129 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 138/157 places, 493/900 transitions.
Applied a total of 0 rules in 3 ms. Remains 138 /138 variables (removed 0) and now considering 493/493 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 146 ms. Remains : 138/157 places, 493/900 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(G(p0)) U ((p0 U p1)&&(F(p2)||p1))))))'
Stuttering acceptance computed with spot in 297 ms :[(NOT p1), (NOT p1), (NOT p0), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ErlangenMainframeV2-PT-bP05C05-LTLFireability-08
Product exploration explored 100000 steps with 0 reset in 1029 ms.
Stack based approach found an accepted trace after 53 steps with 0 reset with depth 54 and stack size 54 in 0 ms.
FORMULA ErlangenMainframeV2-PT-bP05C05-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property ErlangenMainframeV2-PT-bP05C05-LTLFireability-08 finished in 1535 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 7 out of 157 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 157/157 places, 900/900 transitions.
Graph (trivial) has 131 edges and 157 vertex of which 11 / 157 are part of one of the 5 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 23 place count 150 transition count 870
Reduce places removed 22 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 35 rules applied. Total rules applied 58 place count 128 transition count 857
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 66 place count 120 transition count 857
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 66 place count 120 transition count 845
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 90 place count 108 transition count 845
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 96 place count 102 transition count 645
Iterating global reduction 3 with 6 rules applied. Total rules applied 102 place count 102 transition count 645
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 107 place count 97 transition count 239
Iterating global reduction 3 with 5 rules applied. Total rules applied 112 place count 97 transition count 239
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 115 place count 94 transition count 203
Iterating global reduction 3 with 3 rules applied. Total rules applied 118 place count 94 transition count 203
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 3 with 62 rules applied. Total rules applied 180 place count 63 transition count 172
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 184 place count 63 transition count 168
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 187 place count 60 transition count 161
Iterating global reduction 4 with 3 rules applied. Total rules applied 190 place count 60 transition count 161
Performed 8 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 206 place count 52 transition count 179
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 52 transition count 167
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 220 place count 50 transition count 163
Iterating global reduction 5 with 2 rules applied. Total rules applied 222 place count 50 transition count 163
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 50 transition count 153
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 234 place count 49 transition count 166
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 6 with 11 rules applied. Total rules applied 245 place count 49 transition count 155
Applied a total of 245 rules in 106 ms. Remains 49 /157 variables (removed 108) and now considering 155/900 (removed 745) transitions.
[2026-06-02 05:31:06] [INFO ] Flow matrix only has 143 transitions (discarded 12 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8335828474655819334.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17654820904443008146.kers'
[2026-06-02 05:31:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8335828474655819334.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17654820904443008146.kers]
Normalized transition count is 142 out of 143 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 142 rows 48 cols 1592 entries
Finished phase 1 with 29 SingleSign rule and 2 generalized
[2026-06-02 05:31:06] [INFO ] Computed 18 invariants in 1 ms
Computed 18 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-17654820904443008146.kers
Total runtime 3 ms.
[2026-06-02 05:31:06] [INFO ] Implicit Places using invariants in 139 ms returned []
[2026-06-02 05:31:06] [INFO ] Flow matrix only has 143 transitions (discarded 12 similar events)
[2026-06-02 05:31:06] [INFO ] Invariant cache hit.
[2026-06-02 05:31:06] [INFO ] State equation strengthened by 22 read => feed constraints.
[2026-06-02 05:31:06] [INFO ] Implicit Places using invariants and state equation in 267 ms returned []
Implicit Place search using SMT with State Equation took 409 ms to find 0 implicit places.
[2026-06-02 05:31:06] [INFO ] Redundant transitions in 2 ms returned []
Running 147 sub problems to find dead transitions.
[2026-06-02 05:31:06] [INFO ] Flow matrix only has 143 transitions (discarded 12 similar events)
[2026-06-02 05:31:06] [INFO ] Invariant cache hit.
[2026-06-02 05:31:06] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 2 (OVERLAPS) 1/49 variables, 12/18 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 5 (OVERLAPS) 142/191 variables, 49/68 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 21/89 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 8 (OVERLAPS) 1/192 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/192 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 10 (OVERLAPS) 0/192 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 147 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 90 constraints, problems are : Problem set: 0 solved, 147 unsolved in 9660 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 49/49 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 147/147 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 147 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 2 (OVERLAPS) 1/49 variables, 12/18 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 5 (OVERLAPS) 142/191 variables, 49/68 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 21/89 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 147/236 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/191 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 9 (OVERLAPS) 1/192 variables, 1/237 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/192 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 11 (OVERLAPS) 0/192 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 147 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/192 variables, and 237 constraints, problems are : Problem set: 0 solved, 147 unsolved in 22547 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 49/49 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 147/147 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 32378ms problems are : Problem set: 0 solved, 147 unsolved
Search for dead transitions found 0 dead transitions in 32379ms
Starting structural reductions in SI_LTL mode, iteration 1 : 49/157 places, 155/900 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 32908 ms. Remains : 49/157 places, 155/900 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 54 ms :[(NOT p0)]
Running random walk in product with property : ErlangenMainframeV2-PT-bP05C05-LTLFireability-09
Product exploration explored 100000 steps with 0 reset in 94 ms.
Product exploration explored 100000 steps with 0 reset in 112 ms.
Computed a total of 1 stabilizing places and 8 stable transitions
Computed a total of 1 stabilizing places and 8 stable transitions
Knowledge based reduction with 3 factoid took 67 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 38359 steps (1379 resets) in 253 ms. (151 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 77 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 42 ms :[(NOT p0)]
Knowledge-based reduction took 270 ms.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Support contains 7 out of 49 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 49/49 places, 155/155 transitions.
Applied a total of 0 rules in 9 ms. Remains 49 /49 variables (removed 0) and now considering 155/155 (removed 0) transitions.
[2026-06-02 05:31:39] [INFO ] Flow matrix only has 143 transitions (discarded 12 similar events)
[2026-06-02 05:31:39] [INFO ] Invariant cache hit.
[2026-06-02 05:31:39] [INFO ] Implicit Places using invariants in 121 ms returned []
[2026-06-02 05:31:39] [INFO ] Flow matrix only has 143 transitions (discarded 12 similar events)
[2026-06-02 05:31:39] [INFO ] Invariant cache hit.
[2026-06-02 05:31:39] [INFO ] State equation strengthened by 22 read => feed constraints.
[2026-06-02 05:31:40] [INFO ] Implicit Places using invariants and state equation in 217 ms returned []
Implicit Place search using SMT with State Equation took 343 ms to find 0 implicit places.
[2026-06-02 05:31:40] [INFO ] Redundant transitions in 1 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 361 ms. Remains : 49/49 places, 155/155 transitions.
Computed a total of 1 stabilizing places and 8 stable transitions
Computed a total of 1 stabilizing places and 8 stable transitions
Knowledge based reduction with 3 factoid took 66 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 (1464 resets) in 267 ms. (149 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (244 resets) in 108 ms. (367 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 608132 steps, run visited all 1 properties in 1116 ms. (steps per millisecond=544 )
Probabilistic random walk after 608132 steps, saw 92845 distinct states, run finished after 1122 ms. (steps per millisecond=542 ) properties seen :1
Knowledge based reduction with 3 factoid took 53 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Knowledge-based reduction took 1389 ms.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 107 ms.
Product exploration explored 100000 steps with 0 reset in 122 ms.
Built C files in :
/tmp/ltsmin16842609253069936203
[2026-06-02 05:31:41] [INFO ] Computing symmetric may disable matrix : 155 transitions.
[2026-06-02 05:31:41] [INFO ] Computation of Complete disable matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-06-02 05:31:41] [INFO ] Computing symmetric may enable matrix : 155 transitions.
[2026-06-02 05:31:41] [INFO ] Computation of Complete enable matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-06-02 05:31:41] [INFO ] Computing Do-Not-Accords matrix : 155 transitions.
[2026-06-02 05:31:41] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-06-02 05:31:41] [INFO ] Built C files in 66ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16842609253069936203
Running compilation step : cd /tmp/ltsmin16842609253069936203;'/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 898 ms.
Running link step : cd /tmp/ltsmin16842609253069936203;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin16842609253069936203;'/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/stateBased14742041754702994529.hoa' '--buchi-type=spotba'
LTSmin run took 2230 ms.
FORMULA ErlangenMainframeV2-PT-bP05C05-LTLFireability-09 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ErlangenMainframeV2-PT-bP05C05-LTLFireability-09 finished in 38854 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((F(p0) U X(!p1)))&&F(p2)))'
Support contains 12 out of 157 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 157/157 places, 900/900 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 147 transition count 658
Ensure Unique test removed 4 places
Iterating global reduction 0 with 14 rules applied. Total rules applied 24 place count 143 transition count 658
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 28 place count 139 transition count 315
Ensure Unique test removed 1 places
Iterating global reduction 0 with 5 rules applied. Total rules applied 33 place count 138 transition count 315
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 34 place count 137 transition count 267
Iterating global reduction 0 with 1 rules applied. Total rules applied 35 place count 137 transition count 267
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 36 place count 136 transition count 265
Iterating global reduction 0 with 1 rules applied. Total rules applied 37 place count 136 transition count 265
Applied a total of 37 rules in 12 ms. Remains 136 /157 variables (removed 21) and now considering 265/900 (removed 635) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5374796729523058177.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6334431206322093943.kers'
[2026-06-02 05:31:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5374796729523058177.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6334431206322093943.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 265 rows 136 cols 1530 entries
Finished phase 1 with 122 SingleSign rule and 1 generalized
[2026-06-02 05:31:45] [INFO ] Computed 13 invariants in 1 ms
Computed 13 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-6334431206322093943.kers
Total runtime 2 ms.
[2026-06-02 05:31:45] [INFO ] Implicit Places using invariants in 84 ms returned [42]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 85 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 135/157 places, 265/900 transitions.
Applied a total of 0 rules in 1 ms. Remains 135 /135 variables (removed 0) and now considering 265/265 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 99 ms. Remains : 135/157 places, 265/900 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((F(p0) U X(!p1)))&&F(p2)))'
Stuttering acceptance computed with spot in 210 ms :[(OR (NOT p2) p1), p1, (NOT p2), p1, (AND (NOT p0) p1), (NOT p0)]
Running random walk in product with property : ErlangenMainframeV2-PT-bP05C05-LTLFireability-10
Product exploration explored 100000 steps with 1 reset in 492 ms.
Stack based approach found an accepted trace after 24 steps with 0 reset with depth 25 and stack size 25 in 0 ms.
FORMULA ErlangenMainframeV2-PT-bP05C05-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property ErlangenMainframeV2-PT-bP05C05-LTLFireability-10 finished in 835 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)) U G(p1))))'
Support contains 15 out of 157 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 157/157 places, 900/900 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 151 transition count 700
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 151 transition count 700
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 148 transition count 521
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 148 transition count 521
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 147 transition count 520
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 147 transition count 520
Applied a total of 20 rules in 21 ms. Remains 147 /157 variables (removed 10) and now considering 520/900 (removed 380) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-214662490353169895.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17904997646064171210.kers'
[2026-06-02 05:31:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-214662490353169895.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17904997646064171210.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 520 rows 147 cols 6073 entries
Finished phase 1 with 127 SingleSign rule and 2 generalized
[2026-06-02 05:31:45] [INFO ] Computed 18 invariants in 6 ms
Computed 18 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-17904997646064171210.kers
Total runtime 8 ms.
[2026-06-02 05:31:46] [INFO ] Implicit Places using invariants in 218 ms returned []
[2026-06-02 05:31:46] [INFO ] Invariant cache hit.
[2026-06-02 05:31:46] [INFO ] Implicit Places using invariants and state equation in 504 ms returned []
Implicit Place search using SMT with State Equation took 725 ms to find 0 implicit places.
Running 519 sub problems to find dead transitions.
[2026-06-02 05:31:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 2 (OVERLAPS) 1/147 variables, 12/18 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 4 (OVERLAPS) 520/667 variables, 147/165 constraints. Problems are: Problem set: 0 solved, 519 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 667/667 variables, and 165 constraints, problems are : Problem set: 0 solved, 519 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 147/147 constraints, PredecessorRefiner: 519/145 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 519 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 2 (OVERLAPS) 1/147 variables, 12/18 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 4 (OVERLAPS) 520/667 variables, 147/165 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/667 variables, 145/310 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/667 variables, 9/319 constraints. Problems are: Problem set: 0 solved, 519 unsolved
SMT process timed out in 61170ms, After SMT, problems are : Problem set: 0 solved, 519 unsolved
Search for dead transitions found 0 dead transitions in 61174ms
Starting structural reductions in LTL mode, iteration 1 : 147/157 places, 520/900 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61928 ms. Remains : 147/157 places, 520/900 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)) U G(p1))))'
Stuttering acceptance computed with spot in 157 ms :[(NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : ErlangenMainframeV2-PT-bP05C05-LTLFireability-12
Product exploration explored 100000 steps with 0 reset in 1133 ms.
Stack based approach found an accepted trace after 22 steps with 0 reset with depth 23 and stack size 23 in 0 ms.
FORMULA ErlangenMainframeV2-PT-bP05C05-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property ErlangenMainframeV2-PT-bP05C05-LTLFireability-12 finished in 63273 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 15 out of 157 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 157/157 places, 900/900 transitions.
Graph (trivial) has 123 edges and 157 vertex of which 9 / 157 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 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 22 place count 151 transition count 872
Reduce places removed 21 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 34 rules applied. Total rules applied 56 place count 130 transition count 859
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 64 place count 122 transition count 859
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 64 place count 122 transition count 846
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 90 place count 109 transition count 846
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 96 place count 103 transition count 646
Iterating global reduction 3 with 6 rules applied. Total rules applied 102 place count 103 transition count 646
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 104 place count 101 transition count 468
Iterating global reduction 3 with 2 rules applied. Total rules applied 106 place count 101 transition count 468
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 107 place count 100 transition count 360
Iterating global reduction 3 with 1 rules applied. Total rules applied 108 place count 100 transition count 360
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 109 place count 99 transition count 358
Iterating global reduction 3 with 1 rules applied. Total rules applied 110 place count 99 transition count 358
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 164 place count 72 transition count 331
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 168 place count 72 transition count 327
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 171 place count 69 transition count 320
Iterating global reduction 4 with 3 rules applied. Total rules applied 174 place count 69 transition count 320
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 188 place count 62 transition count 338
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 200 place count 62 transition count 326
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 202 place count 60 transition count 322
Iterating global reduction 5 with 2 rules applied. Total rules applied 204 place count 60 transition count 322
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 214 place count 60 transition count 312
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 216 place count 59 transition count 325
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 225 place count 59 transition count 316
Partial Post-agglomeration rule applied 4 times.
Drop transitions (Partial Post agglomeration) removed 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 229 place count 59 transition count 316
Applied a total of 229 rules in 84 ms. Remains 59 /157 variables (removed 98) and now considering 316/900 (removed 584) transitions.
[2026-06-02 05:32:49] [INFO ] Flow matrix only has 305 transitions (discarded 11 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16253402421202255118.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5040045912894483868.kers'
[2026-06-02 05:32:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16253402421202255118.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5040045912894483868.kers]
Normalized transition count is 304 out of 305 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 304 rows 59 cols 4174 entries
Finished phase 1 with 39 SingleSign rule and 2 generalized
[2026-06-02 05:32:49] [INFO ] Computed 18 invariants in 2 ms
Computed 18 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-5040045912894483868.kers
Total runtime 3 ms.
[2026-06-02 05:32:49] [INFO ] Implicit Places using invariants in 105 ms returned []
[2026-06-02 05:32:49] [INFO ] Flow matrix only has 305 transitions (discarded 11 similar events)
[2026-06-02 05:32:49] [INFO ] Invariant cache hit.
[2026-06-02 05:32:49] [INFO ] State equation strengthened by 11 read => feed constraints.
[2026-06-02 05:32:49] [INFO ] Implicit Places using invariants and state equation in 227 ms returned []
Implicit Place search using SMT with State Equation took 334 ms to find 0 implicit places.
[2026-06-02 05:32:49] [INFO ] Redundant transitions in 4 ms returned []
Running 308 sub problems to find dead transitions.
[2026-06-02 05:32:49] [INFO ] Flow matrix only has 305 transitions (discarded 11 similar events)
[2026-06-02 05:32:49] [INFO ] Invariant cache hit.
[2026-06-02 05:32:49] [INFO ] State equation strengthened by 11 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 2 (OVERLAPS) 1/59 variables, 12/18 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 5 (OVERLAPS) 304/363 variables, 59/79 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/363 variables, 10/89 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/363 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 8 (OVERLAPS) 1/364 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/364 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 308 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 364/364 variables, and 90 constraints, problems are : Problem set: 0 solved, 308 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 59/59 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 308/41 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 308 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 2 (OVERLAPS) 1/59 variables, 12/18 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 5 (OVERLAPS) 304/363 variables, 59/79 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/363 variables, 10/89 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/363 variables, 41/130 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/363 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 308 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 363/364 variables, and 131 constraints, problems are : Problem set: 0 solved, 308 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 59/59 constraints, ReadFeed: 10/11 constraints, PredecessorRefiner: 308/41 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60427ms problems are : Problem set: 0 solved, 308 unsolved
Search for dead transitions found 0 dead transitions in 60429ms
Starting structural reductions in SI_LTL mode, iteration 1 : 59/157 places, 316/900 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60860 ms. Remains : 59/157 places, 316/900 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Stuttering acceptance computed with spot in 159 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ErlangenMainframeV2-PT-bP05C05-LTLFireability-13
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA ErlangenMainframeV2-PT-bP05C05-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV2-PT-bP05C05-LTLFireability-13 finished in 61061 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&X(X(X((!p1 U p2)))))))'
Support contains 17 out of 157 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 157/157 places, 900/900 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 150 transition count 684
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 150 transition count 684
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 18 place count 146 transition count 341
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 146 transition count 341
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 24 place count 144 transition count 338
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 144 transition count 338
Applied a total of 26 rules in 18 ms. Remains 144 /157 variables (removed 13) and now considering 338/900 (removed 562) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14775142464071213371.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7759706444919692382.kers'
[2026-06-02 05:33:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14775142464071213371.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7759706444919692382.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 338 rows 144 cols 3189 entries
Finished phase 1 with 124 SingleSign rule and 2 generalized
[2026-06-02 05:33:50] [INFO ] Computed 18 invariants in 4 ms
Computed 18 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-7759706444919692382.kers
Total runtime 5 ms.
[2026-06-02 05:33:50] [INFO ] Implicit Places using invariants in 159 ms returned []
[2026-06-02 05:33:50] [INFO ] Invariant cache hit.
[2026-06-02 05:33:50] [INFO ] Implicit Places using invariants and state equation in 371 ms returned []
Implicit Place search using SMT with State Equation took 549 ms to find 0 implicit places.
Running 337 sub problems to find dead transitions.
[2026-06-02 05:33:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 2 (OVERLAPS) 1/144 variables, 12/18 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/144 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 4 (OVERLAPS) 338/482 variables, 144/162 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/482 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 6 (OVERLAPS) 0/482 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 337 unsolved
No progress, stopping.
After SMT solving in domain Real declared 482/482 variables, and 162 constraints, problems are : Problem set: 0 solved, 337 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 144/144 constraints, PredecessorRefiner: 337/337 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 337 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 2 (OVERLAPS) 1/144 variables, 12/18 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/144 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 4 (OVERLAPS) 338/482 variables, 144/162 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/482 variables, 337/499 constraints. Problems are: Problem set: 0 solved, 337 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 482/482 variables, and 505 constraints, problems are : Problem set: 0 solved, 337 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 144/144 constraints, PredecessorRefiner: 337/337 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60657ms problems are : Problem set: 0 solved, 337 unsolved
Search for dead transitions found 0 dead transitions in 60659ms
Starting structural reductions in LTL mode, iteration 1 : 144/157 places, 338/900 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61238 ms. Remains : 144/157 places, 338/900 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(X((!p0 U p1))))&&p2)))'
Stuttering acceptance computed with spot in 289 ms :[(NOT p1), (NOT p1), (NOT p1), (OR (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), true]
Running random walk in product with property : ErlangenMainframeV2-PT-bP05C05-LTLFireability-14
Product exploration explored 100000 steps with 0 reset in 794 ms.
Stack based approach found an accepted trace after 67 steps with 0 reset with depth 68 and stack size 68 in 0 ms.
FORMULA ErlangenMainframeV2-PT-bP05C05-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property ErlangenMainframeV2-PT-bP05C05-LTLFireability-14 finished in 62364 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((G(p0) U X(X(X(X(!p1))))))))'
Support contains 11 out of 157 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 157/157 places, 900/900 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 146 transition count 654
Ensure Unique test removed 4 places
Iterating global reduction 0 with 15 rules applied. Total rules applied 26 place count 142 transition count 654
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 30 place count 138 transition count 382
Ensure Unique test removed 1 places
Iterating global reduction 0 with 5 rules applied. Total rules applied 35 place count 137 transition count 382
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 36 place count 136 transition count 381
Iterating global reduction 0 with 1 rules applied. Total rules applied 37 place count 136 transition count 381
Applied a total of 37 rules in 12 ms. Remains 136 /157 variables (removed 21) and now considering 381/900 (removed 519) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4768281439871788653.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1980993521293981780.kers'
[2026-06-02 05:34:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4768281439871788653.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1980993521293981780.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 381 rows 136 cols 2826 entries
Finished phase 1 with 122 SingleSign rule and 1 generalized
[2026-06-02 05:34:52] [INFO ] Computed 13 invariants in 3 ms
Computed 13 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-1980993521293981780.kers
Total runtime 4 ms.
[2026-06-02 05:34:52] [INFO ] Implicit Places using invariants in 107 ms returned [44]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 109 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 135/157 places, 381/900 transitions.
Applied a total of 0 rules in 2 ms. Remains 135 /135 variables (removed 0) and now considering 381/381 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 123 ms. Remains : 135/157 places, 381/900 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((G(p0) U X(X(X(X(!p1))))))))'
Stuttering acceptance computed with spot in 406 ms :[p1, p1, p1, p1, p1, p1, p1, true, p1, p1, p1, (NOT p0)]
Running random walk in product with property : ErlangenMainframeV2-PT-bP05C05-LTLFireability-15
Product exploration explored 100000 steps with 14295 reset in 137 ms.
Product exploration explored 100000 steps with 14234 reset in 158 ms.
Computed a total of 17 stabilizing places and 17 stable transitions
Computed a total of 17 stabilizing places and 17 stable transitions
Knowledge based reduction with 3 factoid took 77 ms. Reduced automaton from 12 states, 20 edges and 2 AP (stutter sensitive) to 12 states, 20 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 585 ms. (68 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 425 ms. (93 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (8 resets) in 496 ms. (80 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (8 resets) in 304 ms. (131 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (8 resets) in 381 ms. (104 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 583912 steps, run timeout after 3001 ms. (steps per millisecond=194 ) properties seen :0 out of 4
Probabilistic random walk after 583912 steps, saw 87682 distinct states, run finished after 3001 ms. (steps per millisecond=194 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1068016829436994420.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13776076947563087826.kers'
[2026-06-02 05:34:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1068016829436994420.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13776076947563087826.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 381 rows 135 cols 2609 entries
Finished phase 1 with 123 SingleSign rule and 0 generalized
[2026-06-02 05:34:57] [INFO ] Computed 12 invariants in 2 ms
Computed 12 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-13776076947563087826.kers
Total runtime 3 ms.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem apf2 is UNSAT
At refinement iteration 1 (OVERLAPS) 65/76 variables, 8/8 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 59/135 variables, 4/12 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 1/13 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/135 variables, 0/13 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 381/516 variables, 135/148 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/516 variables, 0/148 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/516 variables, 0/148 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 516/516 variables, and 148 constraints, problems are : Problem set: 1 solved, 3 unsolved in 560 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 135/135 constraints, PredecessorRefiner: 4/0 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 65/76 variables, 8/8 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 59/135 variables, 4/12 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 1/13 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/135 variables, 0/13 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 381/516 variables, 135/148 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/516 variables, 0/148 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/516 variables, 0/148 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 516/516 variables, and 148 constraints, problems are : Problem set: 1 solved, 3 unsolved in 412 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 135/135 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 988ms problems are : Problem set: 1 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 84 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=84 )
Parikh walk visited 3 properties in 28 ms.
Found 1 invariant AP formulas.
Knowledge based reduction with 4 factoid took 102 ms. Reduced automaton from 12 states, 20 edges and 2 AP (stutter sensitive) to 7 states, 8 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 242 ms :[true, p1, p1, p1, p1, p1, p1]
Knowledge-based reduction took 5232 ms.
Stuttering acceptance computed with spot in 252 ms :[true, p1, p1, p1, p1, p1, p1]
Support contains 8 out of 135 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 135/135 places, 381/381 transitions.
Applied a total of 0 rules in 2 ms. Remains 135 /135 variables (removed 0) and now considering 381/381 (removed 0) transitions.
[2026-06-02 05:34:58] [INFO ] Invariant cache hit.
[2026-06-02 05:34:59] [INFO ] Implicit Places using invariants in 118 ms returned []
[2026-06-02 05:34:59] [INFO ] Invariant cache hit.
[2026-06-02 05:34:59] [INFO ] Implicit Places using invariants and state equation in 327 ms returned []
Implicit Place search using SMT with State Equation took 447 ms to find 0 implicit places.
Running 380 sub problems to find dead transitions.
[2026-06-02 05:34:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 1 (OVERLAPS) 1/135 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 3 (OVERLAPS) 381/516 variables, 135/147 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/516 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 380 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 516/516 variables, and 147 constraints, problems are : Problem set: 0 solved, 380 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 135/135 constraints, PredecessorRefiner: 380/164 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 380 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 1 (OVERLAPS) 1/135 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 3 (OVERLAPS) 381/516 variables, 135/147 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/516 variables, 164/311 constraints. Problems are: Problem set: 0 solved, 380 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 516/516 variables, and 316 constraints, problems are : Problem set: 0 solved, 380 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 135/135 constraints, PredecessorRefiner: 380/164 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60589ms problems are : Problem set: 0 solved, 380 unsolved
Search for dead transitions found 0 dead transitions in 60591ms
Finished structural reductions in LTL mode , in 1 iterations and 61042 ms. Remains : 135/135 places, 381/381 transitions.
Computed a total of 17 stabilizing places and 17 stable transitions
Computed a total of 17 stabilizing places and 17 stable transitions
Knowledge based reduction with 1 factoid took 55 ms. Reduced automaton from 7 states, 8 edges and 1 AP (stutter sensitive) to 7 states, 8 edges and 1 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 342 ms. (116 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 287 ms. (138 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1365031 steps, run timeout after 3001 ms. (steps per millisecond=454 ) properties seen :0 out of 1
Probabilistic random walk after 1365031 steps, saw 199391 distinct states, run finished after 3001 ms. (steps per millisecond=454 ) properties seen :0
[2026-06-02 05:36:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 68/76 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 59/135 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 381/516 variables, 135/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/516 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/516 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 516/516 variables, and 147 constraints, problems are : Problem set: 0 solved, 1 unsolved in 245 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 135/135 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/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 68/76 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 59/135 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 381/516 variables, 135/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/516 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/516 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/516 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 516/516 variables, and 148 constraints, problems are : Problem set: 0 solved, 1 unsolved in 515 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 135/135 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 769ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 78 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=39 )
Parikh walk visited 1 properties in 1 ms.
Knowledge based reduction with 1 factoid took 73 ms. Reduced automaton from 7 states, 8 edges and 1 AP (stutter sensitive) to 7 states, 8 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 303 ms :[true, p1, p1, p1, p1, p1, p1]
Knowledge-based reduction took 4408 ms.
Stuttering acceptance computed with spot in 305 ms :[true, p1, p1, p1, p1, p1, p1]
Stuttering acceptance computed with spot in 311 ms :[true, p1, p1, p1, p1, p1, p1]
Product exploration explored 100000 steps with 0 reset in 1037 ms.
Product exploration explored 100000 steps with 0 reset in 670 ms.
Spot run failed in 56 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin8184561059106347546
[2026-06-02 05:36:06] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8184561059106347546
Running compilation step : cd /tmp/ltsmin8184561059106347546;'/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 1451 ms.
Running link step : cd /tmp/ltsmin8184561059106347546;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin8184561059106347546;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased11498198873446647743.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 8 out of 135 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 135/135 places, 381/381 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 132 transition count 229
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 132 transition count 229
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 131 transition count 227
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 131 transition count 227
Applied a total of 8 rules in 4 ms. Remains 131 /135 variables (removed 4) and now considering 227/381 (removed 154) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16896544102255450355.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11361971277045869912.kers'
[2026-06-02 05:36:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16896544102255450355.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11361971277045869912.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 227 rows 131 cols 1085 entries
Finished phase 1 with 119 SingleSign rule and 0 generalized
[2026-06-02 05:36:21] [INFO ] Computed 12 invariants in 1 ms
Computed 12 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-11361971277045869912.kers
Total runtime 3 ms.
[2026-06-02 05:36:21] [INFO ] Implicit Places using invariants in 81 ms returned []
[2026-06-02 05:36:21] [INFO ] Invariant cache hit.
[2026-06-02 05:36:22] [INFO ] Implicit Places using invariants and state equation in 171 ms returned []
Implicit Place search using SMT with State Equation took 256 ms to find 0 implicit places.
Running 226 sub problems to find dead transitions.
[2026-06-02 05:36:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 1 (OVERLAPS) 1/131 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 3 (OVERLAPS) 227/358 variables, 131/143 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/358 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 5 (OVERLAPS) 0/358 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 226 unsolved
No progress, stopping.
After SMT solving in domain Real declared 358/358 variables, and 143 constraints, problems are : Problem set: 0 solved, 226 unsolved in 17818 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 131/131 constraints, PredecessorRefiner: 226/226 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 226 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 1 (OVERLAPS) 1/131 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 3 (OVERLAPS) 227/358 variables, 131/143 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/358 variables, 226/369 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/358 variables, 3/372 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/358 variables, 2/374 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/358 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 226 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 358/358 variables, and 374 constraints, problems are : Problem set: 0 solved, 226 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 131/131 constraints, PredecessorRefiner: 226/226 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 47920ms problems are : Problem set: 0 solved, 226 unsolved
Search for dead transitions found 0 dead transitions in 47922ms
Starting structural reductions in LTL mode, iteration 1 : 131/135 places, 227/381 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48183 ms. Remains : 131/135 places, 227/381 transitions.
Built C files in :
/tmp/ltsmin2619715345726022196
[2026-06-02 05:37:09] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2619715345726022196
Running compilation step : cd /tmp/ltsmin2619715345726022196;'/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 835 ms.
Running link step : cd /tmp/ltsmin2619715345726022196;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin2619715345726022196;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased14771627825794120898.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-06-02 05:37:25] [INFO ] Flatten gal took : 17 ms
[2026-06-02 05:37:25] [INFO ] Flatten gal took : 15 ms
[2026-06-02 05:37:25] [INFO ] Time to serialize gal into /tmp/LTL15844380440456090156.gal : 8 ms
[2026-06-02 05:37:25] [INFO ] Time to serialize properties into /tmp/LTL8475136101627971981.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/LTL15844380440456090156.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17753345123468815661.hoa' '-atoms' '/tmp/LTL8475136101627971981.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL8475136101627971981.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17753345123468815661.hoa
Reverse transition relation is NOT exact ! Due to transitions t14, t19, t22, t30, t70, t73, t80, t86, t89, t92, t93, t94, t97, t98, t100, t102, t103, t107,...706
Detected timeout of ITS tools.
[2026-06-02 05:37:40] [INFO ] Flatten gal took : 50 ms
[2026-06-02 05:37:40] [INFO ] Flatten gal took : 49 ms
[2026-06-02 05:37:40] [INFO ] Time to serialize gal into /tmp/LTL13781122522393434116.gal : 17 ms
[2026-06-02 05:37:40] [INFO ] Time to serialize properties into /tmp/LTL6883093972653803668.ltl : 8 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/LTL13781122522393434116.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6883093972653803668.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 : !((X(G((G("((((p2==1)&&(p18==1))&&((p41==1)&&(p67==1)))&&(((p79==1)&&(p105==1))&&((p145==1)&&(p241==1))))"))U(X(X(X(X(!("((((p2==1)&&(...246
Formula 0 simplified : XF(F!"((((p2==1)&&(p18==1))&&((p41==1)&&(p67==1)))&&(((p79==1)&&(p105==1))&&((p145==1)&&(p241==1))))" R XXXX"((((p2==1)&&(p22==1))&&...227
Reverse transition relation is NOT exact ! Due to transitions t14, t19, t22, t30, t70, t73, t80, t86, t92, t93, t94, t97, t98, t100, t102, t103, t107, t111...1614
Detected timeout of ITS tools.
[2026-06-02 05:37:55] [INFO ] Flatten gal took : 30 ms
[2026-06-02 05:37:55] [INFO ] Applying decomposition
[2026-06-02 05:37:55] [INFO ] Flatten gal took : 29 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/graph2838241151153199081.txt' '-o' '/tmp/graph2838241151153199081.bin' '-w' '/tmp/graph2838241151153199081.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph2838241151153199081.bin' '-l' '-1' '-v' '-w' '/tmp/graph2838241151153199081.weights' '-q' '0' '-e' '0.001'
[2026-06-02 05:37:55] [INFO ] Decomposing Gal with order
[2026-06-02 05:37:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-06-02 05:37:55] [INFO ] Removed a total of 111 redundant transitions.
[2026-06-02 05:37:55] [INFO ] Flatten gal took : 124 ms
[2026-06-02 05:37:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 10 ms.
[2026-06-02 05:37:55] [INFO ] Time to serialize gal into /tmp/LTL12693505707620805151.gal : 9 ms
[2026-06-02 05:37:55] [INFO ] Time to serialize properties into /tmp/LTL5571345594939634585.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12693505707620805151.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5571345594939634585.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 : !((X(G((G("((((u18.p2==1)&&(u18.p18==1))&&((u18.p41==1)&&(u18.p67==1)))&&(((u18.p79==1)&&(u18.p105==1))&&((u18.p145==1)&&(u18.p241==1)...310
Formula 0 simplified : XF(F!"((((u18.p2==1)&&(u18.p18==1))&&((u18.p41==1)&&(u18.p67==1)))&&(((u18.p79==1)&&(u18.p105==1))&&((u18.p145==1)&&(u18.p241==1))))...291
Detected timeout of ITS tools.
Treatment of property ErlangenMainframeV2-PT-bP05C05-LTLFireability-15 finished in 198496 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((G(p0) U X(X(X(X(!p1))))))))'
Spot run failed in 54 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
[2026-06-02 05:38:11] [INFO ] Flatten gal took : 98 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin2766045284357401159
[2026-06-02 05:38:11] [INFO ] Computing symmetric may disable matrix : 900 transitions.
[2026-06-02 05:38:11] [INFO ] Applying decomposition
[2026-06-02 05:38:11] [INFO ] Flatten gal took : 79 ms
[2026-06-02 05:38:11] [INFO ] Computation of Complete disable matrix. took 108 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-06-02 05:38:11] [INFO ] Computing symmetric may enable matrix : 900 transitions.
[2026-06-02 05:38:11] [INFO ] Computation of Complete enable matrix. took 45 ms. Total solver calls (SAT/UNSAT): 0(0/0)
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/graph810762311761934780.txt' '-o' '/tmp/graph810762311761934780.bin' '-w' '/tmp/graph810762311761934780.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph810762311761934780.bin' '-l' '-1' '-v' '-w' '/tmp/graph810762311761934780.weights' '-q' '0' '-e' '0.001'
[2026-06-02 05:38:11] [INFO ] Decomposing Gal with order
[2026-06-02 05:38:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-06-02 05:38:11] [INFO ] Computing Do-Not-Accords matrix : 900 transitions.
[2026-06-02 05:38:11] [INFO ] Computation of Completed DNA matrix. took 177 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-06-02 05:38:12] [INFO ] Built C files in 758ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2766045284357401159
Running compilation step : cd /tmp/ltsmin2766045284357401159;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2026-06-02 05:38:12] [INFO ] Removed a total of 1684 redundant transitions.
[2026-06-02 05:38:12] [INFO ] Flatten gal took : 322 ms
[2026-06-02 05:38:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 654 labels/synchronizations in 69 ms.
[2026-06-02 05:38:12] [INFO ] Time to serialize gal into /tmp/LTLFireability2782609707548641749.gal : 10 ms
[2026-06-02 05:38:12] [INFO ] Time to serialize properties into /tmp/LTLFireability14384234620780024538.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/LTLFireability2782609707548641749.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability14384234620780024538.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(G((G("((((i2.u17.p2==1)&&(i0.u1.p18==1))&&((i2.u17.p41==1)&&(i2.u17.p67==1)))&&(((i2.u10.p79==1)&&(i2.u17.p105==1))&&((i2.u17.p14...354
Formula 0 simplified : XF(F!"((((i2.u17.p2==1)&&(i0.u1.p18==1))&&((i2.u17.p41==1)&&(i2.u17.p67==1)))&&(((i2.u10.p79==1)&&(i2.u17.p105==1))&&((i2.u17.p145==...335
Compilation finished in 7178 ms.
Running link step : cd /tmp/ltsmin2766045284357401159;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 70 ms.
Running LTSmin : cd /tmp/ltsmin2766045284357401159;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' 'X([](([]((LTLAPp0==true)) U X(X(X(X(!(LTLAPp1==true))))))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t19, t70, t103, t112, t121, t131, t132, t142, t143, t144, t145, t155, t159, t169, t173, t177,...673
34 unique states visited
34 strongly connected components in search stack
35 transitions explored
34 items max in DFS search stack
98754 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,987.708,7584948,1,0,670009,1.29914e+06,3661,4.37902e+07,3211,9.66947e+07,2074343
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ErlangenMainframeV2-PT-bP05C05-LTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 1832293 ms.

BK_STOP 1780379763788

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

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