About the Execution of ITS-Tools for ErlangenMainframeV1-PT-bP06C06
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 2070.640 | 986771.00 | 1185161.00 | 3174.70 | TTFFFFFTFFFFFFFT | normal |
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-178021499100092.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5973
Executing tool itstools
Input is ErlangenMainframeV1-PT-bP06C06, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r338-smll-178021499100092
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.1M
-rw-r--r-- 1 mcc users 5.1K May 27 08:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 48K May 27 08:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 27 08:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K May 27 08:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 27 10:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 27 10:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 27 10:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 27 10:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 26 18:17 NewModel
-rw-r--r-- 1 mcc users 9.4K May 27 08:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 93K May 27 08:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K May 27 08:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K May 27 08:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 27 10:33 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 27 10:33 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 1.8M May 26 18:17 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME ErlangenMainframeV1-PT-bP06C06-LTLFireability-00
FORMULA_NAME ErlangenMainframeV1-PT-bP06C06-LTLFireability-01
FORMULA_NAME ErlangenMainframeV1-PT-bP06C06-LTLFireability-02
FORMULA_NAME ErlangenMainframeV1-PT-bP06C06-LTLFireability-03
FORMULA_NAME ErlangenMainframeV1-PT-bP06C06-LTLFireability-04
FORMULA_NAME ErlangenMainframeV1-PT-bP06C06-LTLFireability-05
FORMULA_NAME ErlangenMainframeV1-PT-bP06C06-LTLFireability-06
FORMULA_NAME ErlangenMainframeV1-PT-bP06C06-LTLFireability-07
FORMULA_NAME ErlangenMainframeV1-PT-bP06C06-LTLFireability-08
FORMULA_NAME ErlangenMainframeV1-PT-bP06C06-LTLFireability-09
FORMULA_NAME ErlangenMainframeV1-PT-bP06C06-LTLFireability-10
FORMULA_NAME ErlangenMainframeV1-PT-bP06C06-LTLFireability-11
FORMULA_NAME ErlangenMainframeV1-PT-bP06C06-LTLFireability-12
FORMULA_NAME ErlangenMainframeV1-PT-bP06C06-LTLFireability-13
FORMULA_NAME ErlangenMainframeV1-PT-bP06C06-LTLFireability-14
FORMULA_NAME ErlangenMainframeV1-PT-bP06C06-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1780268947295
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ErlangenMainframeV1-PT-bP06C06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-31 23:09:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-31 23:09:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-31 23:09:09] [INFO ] Load time of PNML (sax parser for PT used): 431 ms
[2026-05-31 23:09:09] [INFO ] Transformed 273 places.
[2026-05-31 23:09:10] [INFO ] Transformed 2487 transitions.
[2026-05-31 23:09:10] [INFO ] Found NUPN structural information;
[2026-05-31 23:09:10] [INFO ] Parsed PT model containing 273 places and 2487 transitions and 34329 arcs in 645 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ErlangenMainframeV1-PT-bP06C06-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV1-PT-bP06C06-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV1-PT-bP06C06-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 43 out of 273 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 273/273 places, 2487/2487 transitions.
Discarding 61 places :
Symmetric choice reduction at 0 with 61 rule applications. Total rules 61 place count 212 transition count 2426
Iterating global reduction 0 with 61 rules applied. Total rules applied 122 place count 212 transition count 2426
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 158 place count 176 transition count 2390
Iterating global reduction 0 with 36 rules applied. Total rules applied 194 place count 176 transition count 2390
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 197 place count 173 transition count 2387
Iterating global reduction 0 with 3 rules applied. Total rules applied 200 place count 173 transition count 2387
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 203 place count 170 transition count 2368
Iterating global reduction 0 with 3 rules applied. Total rules applied 206 place count 170 transition count 2368
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 209 place count 167 transition count 2365
Iterating global reduction 0 with 3 rules applied. Total rules applied 212 place count 167 transition count 2365
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 215 place count 164 transition count 2362
Iterating global reduction 0 with 3 rules applied. Total rules applied 218 place count 164 transition count 2362
Applied a total of 218 rules in 230 ms. Remains 164 /273 variables (removed 109) and now considering 2362/2487 (removed 125) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-399519988732487158.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9560755194263101556.kers'
[2026-05-31 23:09:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-399519988732487158.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9560755194263101556.kers]
Culled 0 columns in 5 ms.
// Phase 1: matrix 2362 rows 164 cols 34003 entries
Finished phase 1 with 143 SingleSign rule and 3 generalized
[2026-05-31 23:09:10] [INFO ] Computed 18 invariants in 21 ms
Computed 18 P flows in 22 ms.
Exported basis to /tmp/petrispot-output-9560755194263101556.kers
Total runtime 28 ms.
[2026-05-31 23:09:11] [INFO ] Implicit Places using invariants in 388 ms returned []
[2026-05-31 23:09:11] [INFO ] Invariant cache hit.
[2026-05-31 23:09:12] [INFO ] Implicit Places using invariants and state equation in 1541 ms returned []
Implicit Place search using SMT with State Equation took 2001 ms to find 0 implicit places.
Running 2361 sub problems to find dead transitions.
[2026-05-31 23:09:12] [INFO ] Invariant cache hit.
Excessive predecessor constraint size, skipping predecessor.
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2361 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 163/2526 variables, and 6 constraints, problems are : Problem set: 0 solved, 2361 unsolved in 30124 ms.
Refiners :[Positive P Invariants (semi-flows): 0/12 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/164 constraints, PredecessorRefiner: 2361/147 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2361 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2361 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2361 unsolved
At refinement iteration 2 (OVERLAPS) 1/164 variables, 12/18 constraints. Problems are: Problem set: 0 solved, 2361 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 164/2526 variables, and 19 constraints, problems are : Problem set: 0 solved, 2361 unsolved in 30096 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/164 constraints, PredecessorRefiner: 2214/147 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 64008ms problems are : Problem set: 0 solved, 2361 unsolved
Search for dead transitions found 0 dead transitions in 64094ms
Starting structural reductions in LTL mode, iteration 1 : 164/273 places, 2362/2487 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 66416 ms. Remains : 164/273 places, 2362/2487 transitions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 2362/2362 transitions.
Applied a total of 0 rules in 19 ms. Remains 164 /164 variables (removed 0) and now considering 2362/2362 (removed 0) transitions.
[2026-05-31 23:10:16] [INFO ] Invariant cache hit.
[2026-05-31 23:10:16] [INFO ] Implicit Places using invariants in 122 ms returned []
[2026-05-31 23:10:16] [INFO ] Invariant cache hit.
[2026-05-31 23:10:17] [INFO ] Implicit Places using invariants and state equation in 1034 ms returned []
Implicit Place search using SMT with State Equation took 1162 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 1183 ms. Remains : 164/164 places, 2362/2362 transitions.
Support contains 43 out of 164 places after structural reductions.
[2026-05-31 23:10:19] [INFO ] Flatten gal took : 784 ms
[2026-05-31 23:10:19] [INFO ] Flatten gal took : 320 ms
[2026-05-31 23:10:20] [INFO ] Input system was already deterministic with 2362 transitions.
RANDOM walk for 40000 steps (8 resets) in 5902 ms. (6 steps per ms) remains 31/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 47 ms. (83 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 51 ms. (77 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 89 ms. (44 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 39 ms. (100 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (8 resets) in 32 ms. (121 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 31/31 properties
Interrupted probabilistic random walk after 233311 steps, run timeout after 3001 ms. (steps per millisecond=77 ) properties seen :0 out of 31
Probabilistic random walk after 233311 steps, saw 36943 distinct states, run finished after 3007 ms. (steps per millisecond=77 ) properties seen :0
[2026-05-31 23:10:25] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 31 unsolved
Problem AtomicPropp17 is UNSAT
At refinement iteration 1 (OVERLAPS) 34/75 variables, 8/8 constraints. Problems are: Problem set: 1 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 30 unsolved
At refinement iteration 3 (OVERLAPS) 61/136 variables, 4/12 constraints. Problems are: Problem set: 1 solved, 30 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/136 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 30 unsolved
At refinement iteration 5 (OVERLAPS) 28/164 variables, 6/18 constraints. Problems are: Problem set: 1 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/164 variables, 0/18 constraints. Problems are: Problem set: 1 solved, 30 unsolved
At refinement iteration 7 (OVERLAPS) 2362/2526 variables, 164/182 constraints. Problems are: Problem set: 1 solved, 30 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2526/2526 variables, and 182 constraints, problems are : Problem set: 1 solved, 30 unsolved in 5017 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 164/164 constraints, PredecessorRefiner: 31/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 30 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 34/75 variables, 8/8 constraints. Problems are: Problem set: 1 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 30 unsolved
At refinement iteration 3 (OVERLAPS) 61/136 variables, 4/12 constraints. Problems are: Problem set: 1 solved, 30 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/136 variables, 1/13 constraints. Problems are: Problem set: 1 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/136 variables, 0/13 constraints. Problems are: Problem set: 1 solved, 30 unsolved
At refinement iteration 6 (OVERLAPS) 28/164 variables, 6/19 constraints. Problems are: Problem set: 1 solved, 30 unsolved
SMT process timed out in 11210ms, After SMT, problems are : Problem set: 1 solved, 30 unsolved
Fused 30 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 41 out of 164 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 164/164 places, 2362/2362 transitions.
Graph (trivial) has 114 edges and 164 vertex of which 9 / 164 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 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 25 place count 159 transition count 2328
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 33 rules applied. Total rules applied 58 place count 135 transition count 2319
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 64 place count 129 transition count 2319
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 129 transition count 2305
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 92 place count 115 transition count 2305
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 93 place count 114 transition count 2304
Iterating global reduction 3 with 1 rules applied. Total rules applied 94 place count 114 transition count 2304
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 2 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 142 place count 90 transition count 2280
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 148 place count 90 transition count 2274
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 151 place count 87 transition count 2267
Iterating global reduction 4 with 3 rules applied. Total rules applied 154 place count 87 transition count 2267
Performed 7 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 7 places in 5 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 168 place count 80 transition count 2294
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 180 place count 80 transition count 2282
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 182 place count 78 transition count 2276
Iterating global reduction 5 with 2 rules applied. Total rules applied 184 place count 78 transition count 2276
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 194 place count 78 transition count 2266
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 196 place count 77 transition count 2279
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 197 place count 77 transition count 2278
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 205 place count 77 transition count 2270
Free-agglomeration rule applied 4 times.
Iterating global reduction 7 with 4 rules applied. Total rules applied 209 place count 77 transition count 2266
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 213 place count 73 transition count 2266
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 214 place count 73 transition count 2265
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 8 with 1 rules applied. Total rules applied 215 place count 73 transition count 2271
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 218 place count 72 transition count 2269
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 231 place count 72 transition count 2256
Partial Post-agglomeration rule applied 5 times.
Drop transitions (Partial Post agglomeration) removed 5 transitions
Iterating global reduction 9 with 5 rules applied. Total rules applied 236 place count 72 transition count 2256
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 9 with 5 rules applied. Total rules applied 241 place count 72 transition count 2251
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 242 place count 71 transition count 2250
Applied a total of 242 rules in 2729 ms. Remains 71 /164 variables (removed 93) and now considering 2250/2362 (removed 112) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2730 ms. Remains : 71/164 places, 2250/2362 transitions.
RANDOM walk for 40000 steps (8 resets) in 4483 ms. (8 steps per ms) remains 26/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 44 ms. (88 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4001 steps (8 resets) in 76 ms. (51 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 54 ms. (72 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4001 steps (8 resets) in 52 ms. (75 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 114 ms. (34 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4001 steps (8 resets) in 100 ms. (39 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4001 steps (8 resets) in 108 ms. (36 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 59 ms. (66 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (8 resets) in 110 ms. (36 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (8 resets) in 56 ms. (70 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (8 resets) in 95 ms. (41 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (8 resets) in 86 ms. (46 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 73 ms. (54 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 84 ms. (47 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 37 ms. (105 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4001 steps (8 resets) in 36 ms. (108 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (8 resets) in 81 ms. (48 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 38 ms. (102 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 81 ms. (48 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (8 resets) in 69 ms. (57 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4000 steps (8 resets) in 40 ms. (97 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 33 ms. (117 steps per ms) remains 26/26 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17004108602379497584.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15073362634091864984.kers'
[2026-05-31 23:10:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17004108602379497584.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15073362634091864984.kers]
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 8 ms.
// Phase 1: matrix 2250 rows 68 cols 33719 entries
Finished phase 1 with 50 SingleSign rule and 3 generalized
[2026-05-31 23:10:41] [INFO ] Computed 18 invariants in 29 ms
Computed 18 P flows in 30 ms.
Exported basis to /tmp/petrispot-output-15073362634091864984.kers
Total runtime 37 ms.
[2026-05-31 23:10:41] [INFO ] State equation strengthened by 21 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (OVERLAPS) 6/46 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (OVERLAPS) 18/64 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (OVERLAPS) 3/67 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 7 (OVERLAPS) 2247/2314 variables, 67/83 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2314 variables, 20/103 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2314 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 10 (OVERLAPS) 7/2321 variables, 4/107 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2321 variables, 2/109 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2321 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2321 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 14 (OVERLAPS) 0/2321 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2321/2321 variables, and 110 constraints, problems are : Problem set: 0 solved, 26 unsolved in 9045 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 71/71 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 26/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 26 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (OVERLAPS) 6/46 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (OVERLAPS) 18/64 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (OVERLAPS) 3/67 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 7 (OVERLAPS) 2247/2314 variables, 67/83 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2314 variables, 20/103 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2314 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 10 (OVERLAPS) 7/2321 variables, 4/107 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2321 variables, 2/109 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2321 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2321 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 14 (OVERLAPS) 0/2321 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2321/2321 variables, and 110 constraints, problems are : Problem set: 0 solved, 26 unsolved in 23286 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 71/71 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 26/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 32480ms problems are : Problem set: 0 solved, 26 unsolved
Fused 26 Parikh solutions to 23 different solutions.
Parikh walk visited 3 properties in 725 ms.
Support contains 39 out of 71 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 71/71 places, 2250/2250 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 71 transition count 2249
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 70 transition count 2249
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 3 place count 70 transition count 2249
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 70 transition count 2248
Applied a total of 4 rules in 435 ms. Remains 70 /71 variables (removed 1) and now considering 2248/2250 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 435 ms. Remains : 70/71 places, 2248/2250 transitions.
RANDOM walk for 40000 steps (8 resets) in 1465 ms. (27 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 32 ms. (121 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (8 resets) in 35 ms. (111 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 63 ms. (62 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 48 ms. (81 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 34 ms. (114 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 32 ms. (121 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (8 resets) in 62 ms. (63 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (8 resets) in 72 ms. (54 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 32 ms. (121 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4001 steps (8 resets) in 67 ms. (58 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 34 ms. (114 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 36 ms. (108 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (8 resets) in 64 ms. (61 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (8 resets) in 64 ms. (61 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 62 ms. (63 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (8 resets) in 35 ms. (111 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (8 resets) in 73 ms. (54 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4001 steps (8 resets) in 73 ms. (54 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 63 ms. (62 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (8 resets) in 39 ms. (100 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 23/23 properties
Interrupted probabilistic random walk after 185569 steps, run timeout after 3001 ms. (steps per millisecond=61 ) properties seen :1 out of 23
Probabilistic random walk after 185569 steps, saw 37830 distinct states, run finished after 3001 ms. (steps per millisecond=61 ) properties seen :1
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15987044480775857990.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9586673499945550788.kers'
[2026-05-31 23:11:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15987044480775857990.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9586673499945550788.kers]
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 9 ms.
// Phase 1: matrix 2248 rows 67 cols 33715 entries
Finished phase 1 with 49 SingleSign rule and 3 generalized
[2026-05-31 23:11:18] [INFO ] Computed 18 invariants in 35 ms
Computed 18 P flows in 36 ms.
Exported basis to /tmp/petrispot-output-9586673499945550788.kers
Total runtime 41 ms.
[2026-05-31 23:11:18] [INFO ] State equation strengthened by 21 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 7/44 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (OVERLAPS) 19/63 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (OVERLAPS) 3/66 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (OVERLAPS) 2245/2311 variables, 66/82 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2311 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2311 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 10 (OVERLAPS) 7/2318 variables, 4/106 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2318 variables, 2/108 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2318 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2318 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 14 (OVERLAPS) 0/2318 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2318/2318 variables, and 109 constraints, problems are : Problem set: 0 solved, 22 unsolved in 5052 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 70/70 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 22/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 22 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 7/44 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (OVERLAPS) 19/63 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (OVERLAPS) 3/66 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (OVERLAPS) 2245/2311 variables, 66/82 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2311 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2311 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 10 (OVERLAPS) 7/2318 variables, 4/106 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2318 variables, 2/108 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2318 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2318 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 14 (OVERLAPS) 0/2318 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2318/2318 variables, and 109 constraints, problems are : Problem set: 0 solved, 22 unsolved in 15026 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 70/70 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 22/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 20201ms problems are : Problem set: 0 solved, 22 unsolved
Fused 22 Parikh solutions to 20 different solutions.
Parikh walk visited 5 properties in 802 ms.
Support contains 35 out of 70 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 70/70 places, 2248/2248 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 70 transition count 2246
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 68 transition count 2246
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 68 transition count 2244
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 66 transition count 2244
Applied a total of 8 rules in 392 ms. Remains 66 /70 variables (removed 4) and now considering 2244/2248 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 393 ms. Remains : 66/70 places, 2244/2248 transitions.
RANDOM walk for 40000 steps (8 resets) in 1416 ms. (28 steps per ms) remains 14/17 properties
BEST_FIRST walk for 40003 steps (8 resets) in 281 ms. (141 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 284 ms. (140 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (8 resets) in 315 ms. (126 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (8 resets) in 285 ms. (139 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (8 resets) in 282 ms. (141 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 286 ms. (139 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (8 resets) in 653 ms. (61 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (8 resets) in 280 ms. (142 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 287 ms. (138 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (8 resets) in 659 ms. (60 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (8 resets) in 275 ms. (144 steps per ms) remains 13/14 properties
BEST_FIRST walk for 40002 steps (8 resets) in 277 ms. (143 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (8 resets) in 645 ms. (61 steps per ms) remains 13/13 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11719078058907974636.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10604980252550366799.kers'
[2026-05-31 23:11:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11719078058907974636.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10604980252550366799.kers]
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 5 ms.
// Phase 1: matrix 2244 rows 63 cols 33707 entries
Finished phase 1 with 45 SingleSign rule and 3 generalized
[2026-05-31 23:11:41] [INFO ] Computed 18 invariants in 20 ms
Computed 18 P flows in 21 ms.
Exported basis to /tmp/petrispot-output-10604980252550366799.kers
Total runtime 25 ms.
[2026-05-31 23:11:41] [INFO ] State equation strengthened by 21 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 7/38 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 21/59 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 3/62 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/62 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 2241/2303 variables, 62/78 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2303 variables, 20/98 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2303 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (OVERLAPS) 7/2310 variables, 4/102 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2310 variables, 2/104 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2310 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2310 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 14 (OVERLAPS) 0/2310 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2310/2310 variables, and 105 constraints, problems are : Problem set: 0 solved, 13 unsolved in 3994 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 66/66 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 13/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 7/38 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 21/59 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 3/62 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/62 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 2241/2303 variables, 62/78 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2303 variables, 20/98 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2303 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (OVERLAPS) 7/2310 variables, 4/102 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2310 variables, 2/104 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2310 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2310 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 14 (OVERLAPS) 0/2310 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2310/2310 variables, and 105 constraints, problems are : Problem set: 0 solved, 13 unsolved in 7601 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 66/66 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 13/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 11695ms problems are : Problem set: 0 solved, 13 unsolved
Fused 13 Parikh solutions to 11 different solutions.
Parikh walk visited 7 properties in 3463 ms.
Support contains 24 out of 66 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 66/66 places, 2244/2244 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 66 transition count 2242
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 64 transition count 2242
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 10 place count 61 transition count 2242
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 13 place count 61 transition count 2239
Free-agglomeration rule applied 4 times.
Iterating global reduction 0 with 4 rules applied. Total rules applied 17 place count 61 transition count 2235
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 21 place count 57 transition count 2235
Applied a total of 21 rules in 696 ms. Remains 57 /66 variables (removed 9) and now considering 2235/2244 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 696 ms. Remains : 57/66 places, 2235/2244 transitions.
RANDOM walk for 40000 steps (8 resets) in 3241 ms. (12 steps per ms) remains 4/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 457 ms. (87 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 527 ms. (75 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 404 ms. (98 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 622 ms. (64 steps per ms) remains 4/4 properties
[2026-05-31 23:11:58] [INFO ] Flow matrix only has 2233 transitions (discarded 2 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5115105347838969344.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-993769714438216304.kers'
[2026-05-31 23:11:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5115105347838969344.kers, --Pflows, --basisKERS=/tmp/petrispot-output-993769714438216304.kers]
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 5 ms.
// Phase 1: matrix 2233 rows 54 cols 32229 entries
Finished phase 1 with 36 SingleSign rule and 3 generalized
[2026-05-31 23:11:58] [INFO ] Computed 18 invariants in 18 ms
Computed 18 P flows in 19 ms.
Exported basis to /tmp/petrispot-output-993769714438216304.kers
Total runtime 24 ms.
[2026-05-31 23:11:58] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 11/33 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 17/50 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 3/53 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/53 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 2230/2283 variables, 53/69 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2283 variables, 21/90 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/2283 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 7/2290 variables, 4/94 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2290 variables, 2/96 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2290 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2290 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/2290 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2290/2290 variables, and 97 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2006 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 57/57 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 4/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 11/33 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 17/50 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 3/53 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/53 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 2230/2283 variables, 53/69 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2283 variables, 21/90 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2283 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 7/2290 variables, 4/94 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2290 variables, 2/96 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2290 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2290 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/2290 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2290/2290 variables, and 97 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2992 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 57/57 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 4/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5057ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 3 properties in 663 ms.
Support contains 7 out of 57 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 57/57 places, 2235/2235 transitions.
Graph (trivial) has 12 edges and 57 vertex of which 2 / 57 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 1 place count 56 transition count 2231
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 54 transition count 2231
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 11 place count 48 transition count 1566
Iterating global reduction 0 with 6 rules applied. Total rules applied 17 place count 48 transition count 1566
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 21 place count 44 transition count 396
Iterating global reduction 0 with 4 rules applied. Total rules applied 25 place count 44 transition count 396
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 31 place count 41 transition count 396
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 34 place count 41 transition count 393
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 1 with 7 rules applied. Total rules applied 41 place count 41 transition count 386
Free-agglomeration rule applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 43 place count 41 transition count 384
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 45 place count 39 transition count 384
Applied a total of 45 rules in 126 ms. Remains 39 /57 variables (removed 18) and now considering 384/2235 (removed 1851) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 126 ms. Remains : 39/57 places, 384/2235 transitions.
FORMULA ErlangenMainframeV1-PT-bP06C06-LTLFireability-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA ErlangenMainframeV1-PT-bP06C06-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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' '!((((p0||X(!p1)) U p1) U X(X(!p2))))'
Support contains 18 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 2362/2362 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 159 transition count 1847
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 159 transition count 1847
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 158 transition count 1846
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 158 transition count 1846
Applied a total of 12 rules in 27 ms. Remains 158 /164 variables (removed 6) and now considering 1846/2362 (removed 516) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15025345346271866390.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18187548003238123250.kers'
[2026-05-31 23:12:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15025345346271866390.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18187548003238123250.kers]
Culled 0 columns in 7 ms.
// Phase 1: matrix 1846 rows 158 cols 26815 entries
Finished phase 1 with 137 SingleSign rule and 3 generalized
[2026-05-31 23:12:05] [INFO ] Computed 18 invariants in 26 ms
Computed 18 P flows in 27 ms.
Exported basis to /tmp/petrispot-output-18187548003238123250.kers
Total runtime 31 ms.
[2026-05-31 23:12:05] [INFO ] Implicit Places using invariants in 506 ms returned []
[2026-05-31 23:12:05] [INFO ] Invariant cache hit.
[2026-05-31 23:12:07] [INFO ] Implicit Places using invariants and state equation in 1417 ms returned []
Implicit Place search using SMT with State Equation took 1926 ms to find 0 implicit places.
Running 1845 sub problems to find dead transitions.
[2026-05-31 23:12:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1845 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 157/2004 variables, and 6 constraints, problems are : Problem set: 0 solved, 1845 unsolved in 30081 ms.
Refiners :[Positive P Invariants (semi-flows): 0/12 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/158 constraints, PredecessorRefiner: 1845/151 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1845 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1845 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1845 unsolved
At refinement iteration 2 (OVERLAPS) 1/158 variables, 12/18 constraints. Problems are: Problem set: 0 solved, 1845 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 158/2004 variables, and 19 constraints, problems are : Problem set: 0 solved, 1845 unsolved in 30064 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/158 constraints, PredecessorRefiner: 1694/151 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 63426ms problems are : Problem set: 0 solved, 1845 unsolved
Search for dead transitions found 0 dead transitions in 63442ms
Starting structural reductions in LTL mode, iteration 1 : 158/164 places, 1846/2362 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65413 ms. Remains : 158/164 places, 1846/2362 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((((X(!p0)||p1) U p0) U X(X(!p2))))'
Stuttering acceptance computed with spot in 887 ms :[p2, (AND p0 p2), (AND (NOT p0) p2), p2, p2, true, (AND p0 p2), (AND (NOT p0) p2), (AND p2 p0), (AND (NOT p0) p2), p2, p0, (NOT p0)]
Running random walk in product with property : ErlangenMainframeV1-PT-bP06C06-LTLFireability-00
Product exploration explored 100000 steps with 37530 reset in 693 ms.
Product exploration explored 100000 steps with 37454 reset in 404 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 21 ms. Proved property starting from automaton with 13 states, 23 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 66 ms.
FORMULA ErlangenMainframeV1-PT-bP06C06-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ErlangenMainframeV1-PT-bP06C06-LTLFireability-00 finished in 67598 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&&X(X(X((X(p1) U ((!p2&&X(p1))||X(G(p1)))))))))))'
Support contains 15 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 2362/2362 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 162 transition count 2360
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 162 transition count 2360
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 161 transition count 2359
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 161 transition count 2359
Applied a total of 6 rules in 31 ms. Remains 161 /164 variables (removed 3) and now considering 2359/2362 (removed 3) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14849583052862851347.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13795383159444310155.kers'
[2026-05-31 23:13:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14849583052862851347.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13795383159444310155.kers]
Culled 0 columns in 5 ms.
// Phase 1: matrix 2359 rows 161 cols 33997 entries
Finished phase 1 with 140 SingleSign rule and 3 generalized
[2026-05-31 23:13:12] [INFO ] Computed 18 invariants in 20 ms
Computed 18 P flows in 21 ms.
Exported basis to /tmp/petrispot-output-13795383159444310155.kers
Total runtime 29 ms.
[2026-05-31 23:13:13] [INFO ] Implicit Places using invariants in 806 ms returned []
[2026-05-31 23:13:13] [INFO ] Invariant cache hit.
[2026-05-31 23:13:15] [INFO ] Implicit Places using invariants and state equation in 2070 ms returned []
Implicit Place search using SMT with State Equation took 2879 ms to find 0 implicit places.
Running 2358 sub problems to find dead transitions.
[2026-05-31 23:13:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2358 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 160/2520 variables, and 6 constraints, problems are : Problem set: 0 solved, 2358 unsolved in 30092 ms.
Refiners :[Positive P Invariants (semi-flows): 0/12 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/161 constraints, PredecessorRefiner: 2358/144 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2358 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2358 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/160 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2358 unsolved
SMT process timed out in 64120ms, After SMT, problems are : Problem set: 0 solved, 2358 unsolved
Search for dead transitions found 0 dead transitions in 64138ms
Starting structural reductions in LTL mode, iteration 1 : 161/164 places, 2359/2362 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 67060 ms. Remains : 161/164 places, 2359/2362 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((X(X(X((X(p0) U ((!p1&&X(p0))||X(G(p0)))))))&&p2))))'
Stuttering acceptance computed with spot in 1524 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ErlangenMainframeV1-PT-bP06C06-LTLFireability-02
Product exploration explored 100000 steps with 0 reset in 3480 ms.
Stack based approach found an accepted trace after 93 steps with 0 reset with depth 94 and stack size 94 in 2 ms.
FORMULA ErlangenMainframeV1-PT-bP06C06-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property ErlangenMainframeV1-PT-bP06C06-LTLFireability-02 finished in 72215 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 U (p1||G(!p0))))))'
Support contains 15 out of 164 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 164/164 places, 2362/2362 transitions.
Graph (trivial) has 129 edges and 164 vertex of which 9 / 164 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 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 158 transition count 2332
Reduce places removed 23 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 32 rules applied. Total rules applied 56 place count 135 transition count 2323
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 62 place count 129 transition count 2323
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 62 place count 129 transition count 2310
Deduced a syphon composed of 13 places in 2 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 88 place count 116 transition count 2310
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 95 place count 109 transition count 1644
Iterating global reduction 3 with 7 rules applied. Total rules applied 102 place count 109 transition count 1644
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 1 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 3 with 68 rules applied. Total rules applied 170 place count 75 transition count 1610
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 176 place count 75 transition count 1604
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 179 place count 72 transition count 1597
Iterating global reduction 4 with 3 rules applied. Total rules applied 182 place count 72 transition count 1597
Performed 6 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 194 place count 66 transition count 1615
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 206 place count 66 transition count 1603
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 208 place count 64 transition count 1599
Iterating global reduction 5 with 2 rules applied. Total rules applied 210 place count 64 transition count 1599
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 220 place count 64 transition count 1589
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 222 place count 63 transition count 1602
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 230 place count 63 transition count 1594
Partial Post-agglomeration rule applied 3 times.
Drop transitions (Partial Post agglomeration) removed 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 233 place count 63 transition count 1594
Applied a total of 233 rules in 670 ms. Remains 63 /164 variables (removed 101) and now considering 1594/2362 (removed 768) transitions.
[2026-05-31 23:14:25] [INFO ] Flow matrix only has 1581 transitions (discarded 13 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8972870070785414954.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12536553917384183427.kers'
[2026-05-31 23:14:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8972870070785414954.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12536553917384183427.kers]
Normalized transition count is 1580 out of 1581 initially.
Culled 0 columns in 4 ms.
// Phase 1: matrix 1580 rows 63 cols 24508 entries
Finished phase 1 with 43 SingleSign rule and 2 generalized
[2026-05-31 23:14:25] [INFO ] Computed 18 invariants in 20 ms
Computed 18 P flows in 21 ms.
Exported basis to /tmp/petrispot-output-12536553917384183427.kers
Total runtime 24 ms.
[2026-05-31 23:14:25] [INFO ] Implicit Places using invariants in 384 ms returned []
[2026-05-31 23:14:25] [INFO ] Flow matrix only has 1581 transitions (discarded 13 similar events)
[2026-05-31 23:14:25] [INFO ] Invariant cache hit.
[2026-05-31 23:14:26] [INFO ] State equation strengthened by 11 read => feed constraints.
[2026-05-31 23:14:27] [INFO ] Implicit Places using invariants and state equation in 1399 ms returned []
Implicit Place search using SMT with State Equation took 1786 ms to find 0 implicit places.
[2026-05-31 23:14:27] [INFO ] Redundant transitions in 245 ms returned []
Running 1586 sub problems to find dead transitions.
[2026-05-31 23:14:27] [INFO ] Flow matrix only has 1581 transitions (discarded 13 similar events)
[2026-05-31 23:14:27] [INFO ] Invariant cache hit.
[2026-05-31 23:14:27] [INFO ] State equation strengthened by 11 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1586 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1586 unsolved
At refinement iteration 2 (OVERLAPS) 1/63 variables, 12/18 constraints. Problems are: Problem set: 0 solved, 1586 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 63/1644 variables, and 18 constraints, problems are : Problem set: 0 solved, 1586 unsolved in 30056 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/63 constraints, ReadFeed: 0/11 constraints, PredecessorRefiner: 1586/30 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1586 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1586 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1586 unsolved
At refinement iteration 2 (OVERLAPS) 1/63 variables, 12/18 constraints. Problems are: Problem set: 0 solved, 1586 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 63/1644 variables, and 18 constraints, problems are : Problem set: 0 solved, 1586 unsolved in 30052 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/63 constraints, ReadFeed: 0/11 constraints, PredecessorRefiner: 1556/30 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62765ms problems are : Problem set: 0 solved, 1586 unsolved
Search for dead transitions found 0 dead transitions in 62774ms
Starting structural reductions in SI_LTL mode, iteration 1 : 63/164 places, 1594/2362 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 65493 ms. Remains : 63/164 places, 1594/2362 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 U (G(!p0)||p1)))))'
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : ErlangenMainframeV1-PT-bP06C06-LTLFireability-03
Product exploration explored 100000 steps with 0 reset in 3212 ms.
Product exploration explored 100000 steps with 0 reset in 3131 ms.
Computed a total of 2 stabilizing places and 9 stable transitions
Computed a total of 2 stabilizing places and 9 stable transitions
Knowledge based reduction with 9 factoid took 57 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
RANDOM walk for 40000 steps (8 resets) in 2890 ms. (13 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (8 resets) in 1394 ms. (28 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (8 resets) in 805 ms. (49 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (8 resets) in 994 ms. (40 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (8 resets) in 1236 ms. (32 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 659518 steps, run timeout after 6001 ms. (steps per millisecond=109 ) properties seen :3 out of 4
Probabilistic random walk after 659518 steps, saw 110303 distinct states, run finished after 6001 ms. (steps per millisecond=109 ) properties seen :3
[2026-05-31 23:15:45] [INFO ] Flow matrix only has 1581 transitions (discarded 13 similar events)
[2026-05-31 23:15:45] [INFO ] Invariant cache hit.
[2026-05-31 23:15:45] [INFO ] State equation strengthened by 11 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 29/44 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 13/57 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/63 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/63 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1580/1643 variables, 63/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1643 variables, 10/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1643 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/1644 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1644 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/1644 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1644/1644 variables, and 92 constraints, problems are : Problem set: 0 solved, 1 unsolved in 760 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 63/63 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 29/44 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 13/57 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/63 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/63 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1580/1643 variables, 63/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1643 variables, 10/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1643 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/1644 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1644 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/1644 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1644/1644 variables, and 92 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1039 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 63/63 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1815ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 85 steps, including 3 resets, run visited all 1 properties in 4 ms. (steps per millisecond=21 )
Parikh walk visited 1 properties in 11 ms.
Knowledge based reduction with 9 factoid took 145 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 104 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Knowledge-based reduction took 10306 ms.
Stuttering acceptance computed with spot in 108 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Support contains 15 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 1594/1594 transitions.
Applied a total of 0 rules in 84 ms. Remains 63 /63 variables (removed 0) and now considering 1594/1594 (removed 0) transitions.
[2026-05-31 23:15:47] [INFO ] Flow matrix only has 1581 transitions (discarded 13 similar events)
[2026-05-31 23:15:47] [INFO ] Invariant cache hit.
[2026-05-31 23:15:47] [INFO ] Implicit Places using invariants in 520 ms returned []
[2026-05-31 23:15:47] [INFO ] Flow matrix only has 1581 transitions (discarded 13 similar events)
[2026-05-31 23:15:47] [INFO ] Invariant cache hit.
[2026-05-31 23:15:48] [INFO ] State equation strengthened by 11 read => feed constraints.
[2026-05-31 23:15:49] [INFO ] Implicit Places using invariants and state equation in 1332 ms returned []
Implicit Place search using SMT with State Equation took 1856 ms to find 0 implicit places.
[2026-05-31 23:15:49] [INFO ] Redundant transitions in 111 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2061 ms. Remains : 63/63 places, 1594/1594 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 9 factoid took 67 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
RANDOM walk for 40000 steps (8 resets) in 2369 ms. (16 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (8 resets) in 1258 ms. (31 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (8 resets) in 779 ms. (51 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (8 resets) in 878 ms. (45 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (8 resets) in 1786 ms. (22 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 249229 steps, run timeout after 3001 ms. (steps per millisecond=83 ) properties seen :3 out of 4
Probabilistic random walk after 249229 steps, saw 51527 distinct states, run finished after 3001 ms. (steps per millisecond=83 ) properties seen :3
[2026-05-31 23:15:54] [INFO ] Flow matrix only has 1581 transitions (discarded 13 similar events)
[2026-05-31 23:15:54] [INFO ] Invariant cache hit.
[2026-05-31 23:15:54] [INFO ] State equation strengthened by 11 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 29/44 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 13/57 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/63 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/63 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1580/1643 variables, 63/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1643 variables, 10/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1643 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/1644 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1644 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/1644 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1644/1644 variables, and 92 constraints, problems are : Problem set: 0 solved, 1 unsolved in 856 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 63/63 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 29/44 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 13/57 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/63 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/63 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1580/1643 variables, 63/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1643 variables, 10/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1643 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/1644 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1644 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/1644 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1644/1644 variables, and 92 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1072 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 63/63 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1942ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 274 steps, including 12 resets, run visited all 1 properties in 9 ms. (steps per millisecond=30 )
Parikh walk visited 1 properties in 9 ms.
Knowledge based reduction with 9 factoid took 131 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 114 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Knowledge-based reduction took 7282 ms.
Stuttering acceptance computed with spot in 105 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 104 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 3227 ms.
Product exploration explored 100000 steps with 0 reset in 2797 ms.
Built C files in :
/tmp/ltsmin4408369999461365746
[2026-05-31 23:16:02] [INFO ] Too many transitions (1594) to apply POR reductions. Disabling POR matrices.
[2026-05-31 23:16:03] [INFO ] Built C files in 119ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4408369999461365746
Running compilation step : cd /tmp/ltsmin4408369999461365746;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4408369999461365746;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4408369999461365746;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 15 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 1594/1594 transitions.
Applied a total of 0 rules in 79 ms. Remains 63 /63 variables (removed 0) and now considering 1594/1594 (removed 0) transitions.
[2026-05-31 23:16:06] [INFO ] Flow matrix only has 1581 transitions (discarded 13 similar events)
[2026-05-31 23:16:06] [INFO ] Invariant cache hit.
[2026-05-31 23:16:06] [INFO ] Implicit Places using invariants in 522 ms returned []
[2026-05-31 23:16:06] [INFO ] Flow matrix only has 1581 transitions (discarded 13 similar events)
[2026-05-31 23:16:06] [INFO ] Invariant cache hit.
[2026-05-31 23:16:07] [INFO ] State equation strengthened by 11 read => feed constraints.
[2026-05-31 23:16:08] [INFO ] Implicit Places using invariants and state equation in 1420 ms returned []
Implicit Place search using SMT with State Equation took 1944 ms to find 0 implicit places.
[2026-05-31 23:16:08] [INFO ] Redundant transitions in 102 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2137 ms. Remains : 63/63 places, 1594/1594 transitions.
Built C files in :
/tmp/ltsmin6383418806104743453
[2026-05-31 23:16:08] [INFO ] Too many transitions (1594) to apply POR reductions. Disabling POR matrices.
[2026-05-31 23:16:08] [INFO ] Built C files in 54ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6383418806104743453
Running compilation step : cd /tmp/ltsmin6383418806104743453;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6383418806104743453;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6383418806104743453;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2026-05-31 23:16:12] [INFO ] Flatten gal took : 199 ms
[2026-05-31 23:16:12] [INFO ] Flatten gal took : 205 ms
[2026-05-31 23:16:12] [INFO ] Time to serialize gal into /tmp/LTL16998270683553605506.gal : 78 ms
[2026-05-31 23:16:12] [INFO ] Time to serialize properties into /tmp/LTL247319886705162512.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/LTL16998270683553605506.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15208141414332891420.hoa' '-atoms' '/tmp/LTL247319886705162512.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL247319886705162512.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15208141414332891420.hoa
Detected timeout of ITS tools.
[2026-05-31 23:16:27] [INFO ] Flatten gal took : 178 ms
[2026-05-31 23:16:28] [INFO ] Flatten gal took : 266 ms
[2026-05-31 23:16:28] [INFO ] Time to serialize gal into /tmp/LTL1104560822604114907.gal : 50 ms
[2026-05-31 23:16:28] [INFO ] Time to serialize properties into /tmp/LTL4973931414476472204.ltl : 12 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/LTL1104560822604114907.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4973931414476472204.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...275
Read 1 LTL properties
Checking formula 0 : !((G(F((!("((((p13==1)&&(p32==1))&&((p62==1)&&(p70==1)))&&(((p93==1)&&(p119==1))&&((p159==1)&&(p266==1))))"))U((G(!("((((p13==1)&&(p32...435
Formula 0 simplified : FG("((((p13==1)&&(p32==1))&&((p62==1)&&(p70==1)))&&(((p93==1)&&(p119==1))&&((p159==1)&&(p266==1))))" M !"((!((((p16==1)&&(p35==1))&&...317
Detected timeout of ITS tools.
[2026-05-31 23:16:43] [INFO ] Flatten gal took : 250 ms
[2026-05-31 23:16:43] [INFO ] Applying decomposition
[2026-05-31 23:16:43] [INFO ] Flatten gal took : 161 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/graph14738931993766149813.txt' '-o' '/tmp/graph14738931993766149813.bin' '-w' '/tmp/graph14738931993766149813.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph14738931993766149813.bin' '-l' '-1' '-v' '-w' '/tmp/graph14738931993766149813.weights' '-q' '0' '-e' '0.001'
[2026-05-31 23:16:44] [INFO ] Decomposing Gal with order
[2026-05-31 23:16:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-31 23:16:45] [INFO ] Removed a total of 12704 redundant transitions.
[2026-05-31 23:16:45] [INFO ] Flatten gal took : 594 ms
[2026-05-31 23:16:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 60 labels/synchronizations in 125 ms.
[2026-05-31 23:16:45] [INFO ] Time to serialize gal into /tmp/LTL4171334723307994626.gal : 7 ms
[2026-05-31 23:16:45] [INFO ] Time to serialize properties into /tmp/LTL10227739770649485175.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/LTL4171334723307994626.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10227739770649485175.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 : !((G(F((!("((((i0.u1.p13==1)&&(i0.u3.p32==1))&&((i0.u5.p62==1)&&(i1.u6.p70==1)))&&(((i0.u9.p93==1)&&(i0.u11.p119==1))&&((i1.u14.p159==...632
Formula 0 simplified : FG("((((i0.u1.p13==1)&&(i0.u3.p32==1))&&((i0.u5.p62==1)&&(i1.u6.p70==1)))&&(((i0.u9.p93==1)&&(i0.u11.p119==1))&&((i1.u14.p159==1)&&(...463
Reverse transition relation is NOT exact ! Due to transitions t67_t68_t71_t79_t85_t72_t77, Intersection with reachable at each step enabled. (destroyed/re...190
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
630 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,6.35054,89764,1,0,95242,7874,6827,379304,344,43580,369418
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ErlangenMainframeV1-PT-bP06C06-LTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property ErlangenMainframeV1-PT-bP06C06-LTLFireability-03 finished in 147299 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(!(!G((X(!X(G(p0))) U p1))||p2)) U p3))'
Support contains 21 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 2362/2362 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 156 transition count 1695
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 156 transition count 1695
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 155 transition count 1694
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 155 transition count 1694
Applied a total of 18 rules in 24 ms. Remains 155 /164 variables (removed 9) and now considering 1694/2362 (removed 668) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5965725633027921655.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17042349149930691967.kers'
[2026-05-31 23:16:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5965725633027921655.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17042349149930691967.kers]
Culled 0 columns in 4 ms.
// Phase 1: matrix 1694 rows 155 cols 24687 entries
Finished phase 1 with 135 SingleSign rule and 2 generalized
[2026-05-31 23:16:52] [INFO ] Computed 18 invariants in 14 ms
Computed 18 P flows in 15 ms.
Exported basis to /tmp/petrispot-output-17042349149930691967.kers
Total runtime 18 ms.
[2026-05-31 23:16:52] [INFO ] Implicit Places using invariants in 292 ms returned []
[2026-05-31 23:16:52] [INFO ] Invariant cache hit.
[2026-05-31 23:16:53] [INFO ] Implicit Places using invariants and state equation in 1146 ms returned []
Implicit Place search using SMT with State Equation took 1446 ms to find 0 implicit places.
Running 1693 sub problems to find dead transitions.
[2026-05-31 23:16:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1693 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/154 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1693 unsolved
At refinement iteration 2 (OVERLAPS) 1/155 variables, 12/18 constraints. Problems are: Problem set: 0 solved, 1693 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 155/1849 variables, and 19 constraints, problems are : Problem set: 0 solved, 1693 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/155 constraints, PredecessorRefiner: 1693/151 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1693 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1693 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/154 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1693 unsolved
At refinement iteration 2 (OVERLAPS) 1/155 variables, 12/18 constraints. Problems are: Problem set: 0 solved, 1693 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 1693 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 155/1849 variables, and 19 constraints, problems are : Problem set: 0 solved, 1693 unsolved in 30058 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/155 constraints, PredecessorRefiner: 1542/151 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62437ms problems are : Problem set: 0 solved, 1693 unsolved
Search for dead transitions found 0 dead transitions in 62446ms
Starting structural reductions in LTL mode, iteration 1 : 155/164 places, 1694/2362 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63927 ms. Remains : 155/164 places, 1694/2362 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(!(!G((X(!X(G(p0))) U p1))||p2)) U p3))'
Stuttering acceptance computed with spot in 249 ms :[(NOT p3), true, (OR (NOT p1) p0), (OR (NOT p1) p2), p0]
Running random walk in product with property : ErlangenMainframeV1-PT-bP06C06-LTLFireability-05
Product exploration explored 100000 steps with 0 reset in 2986 ms.
Stack based approach found an accepted trace after 81 steps with 0 reset with depth 82 and stack size 82 in 1 ms.
FORMULA ErlangenMainframeV1-PT-bP06C06-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property ErlangenMainframeV1-PT-bP06C06-LTLFireability-05 finished in 67228 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)&&((p1 U X(p2))||(G(p3)&&X(F(p2))))))'
Support contains 16 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 2362/2362 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 157 transition count 1696
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 157 transition count 1696
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 154 transition count 885
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 154 transition count 885
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 153 transition count 883
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 153 transition count 883
Applied a total of 22 rules in 26 ms. Remains 153 /164 variables (removed 11) and now considering 883/2362 (removed 1479) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-661012345438597157.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11620187966828273505.kers'
[2026-05-31 23:17:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-661012345438597157.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11620187966828273505.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 883 rows 153 cols 11725 entries
Finished phase 1 with 133 SingleSign rule and 2 generalized
[2026-05-31 23:17:59] [INFO ] Computed 18 invariants in 11 ms
Computed 18 P flows in 12 ms.
Exported basis to /tmp/petrispot-output-11620187966828273505.kers
Total runtime 14 ms.
[2026-05-31 23:17:59] [INFO ] Implicit Places using invariants in 337 ms returned []
[2026-05-31 23:17:59] [INFO ] Invariant cache hit.
[2026-05-31 23:18:00] [INFO ] Implicit Places using invariants and state equation in 812 ms returned []
Implicit Place search using SMT with State Equation took 1152 ms to find 0 implicit places.
Running 882 sub problems to find dead transitions.
[2026-05-31 23:18:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 882 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/152 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 882 unsolved
At refinement iteration 2 (OVERLAPS) 1/153 variables, 12/18 constraints. Problems are: Problem set: 0 solved, 882 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 882 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 153/1036 variables, and 20 constraints, problems are : Problem set: 0 solved, 882 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/153 constraints, PredecessorRefiner: 882/150 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 882 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 882 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/152 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 882 unsolved
At refinement iteration 2 (OVERLAPS) 1/153 variables, 12/18 constraints. Problems are: Problem set: 0 solved, 882 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 882 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 882 unsolved
At refinement iteration 5 (OVERLAPS) 883/1036 variables, 153/173 constraints. Problems are: Problem set: 0 solved, 882 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1036 variables, 150/323 constraints. Problems are: Problem set: 0 solved, 882 unsolved
SMT process timed out in 61813ms, After SMT, problems are : Problem set: 0 solved, 882 unsolved
Search for dead transitions found 0 dead transitions in 61822ms
Starting structural reductions in LTL mode, iteration 1 : 153/164 places, 883/2362 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63004 ms. Remains : 153/164 places, 883/2362 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&((p1 U X(p2))||(G(p3)&&X(F(p2))))))'
Stuttering acceptance computed with spot in 379 ms :[(OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2), (AND (NOT p3) (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p2) (NOT p3)), true, (NOT p3)]
Running random walk in product with property : ErlangenMainframeV1-PT-bP06C06-LTLFireability-06
Entered a terminal (fully accepting) state of product in 3 steps with 1 reset in 0 ms.
FORMULA ErlangenMainframeV1-PT-bP06C06-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV1-PT-bP06C06-LTLFireability-06 finished in 63443 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 8 out of 164 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 164/164 places, 2362/2362 transitions.
Graph (trivial) has 130 edges and 164 vertex of which 9 / 164 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 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 158 transition count 2332
Reduce places removed 23 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 32 rules applied. Total rules applied 56 place count 135 transition count 2323
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 62 place count 129 transition count 2323
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 62 place count 129 transition count 2309
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 90 place count 115 transition count 2309
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 103 place count 102 transition count 1580
Ensure Unique test removed 6 places
Iterating global reduction 3 with 19 rules applied. Total rules applied 122 place count 96 transition count 1580
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 128 place count 90 transition count 250
Iterating global reduction 3 with 6 rules applied. Total rules applied 134 place count 90 transition count 250
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 135 place count 89 transition count 248
Iterating global reduction 3 with 1 rules applied. Total rules applied 136 place count 89 transition count 248
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 198 place count 58 transition count 217
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 204 place count 58 transition count 211
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 207 place count 55 transition count 204
Iterating global reduction 4 with 3 rules applied. Total rules applied 210 place count 55 transition count 204
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 224 place count 48 transition count 222
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 236 place count 48 transition count 210
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 238 place count 46 transition count 206
Iterating global reduction 5 with 2 rules applied. Total rules applied 240 place count 46 transition count 206
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 250 place count 46 transition count 196
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 252 place count 45 transition count 209
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 6 with 13 rules applied. Total rules applied 265 place count 45 transition count 196
Partial Post-agglomeration rule applied 5 times.
Drop transitions (Partial Post agglomeration) removed 5 transitions
Iterating global reduction 6 with 5 rules applied. Total rules applied 270 place count 45 transition count 196
Applied a total of 270 rules in 201 ms. Remains 45 /164 variables (removed 119) and now considering 196/2362 (removed 2166) transitions.
[2026-05-31 23:19:03] [INFO ] Flow matrix only has 183 transitions (discarded 13 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5565091073781464154.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12488221298776140854.kers'
[2026-05-31 23:19:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5565091073781464154.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12488221298776140854.kers]
Normalized transition count is 182 out of 183 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 182 rows 45 cols 2300 entries
Finished phase 1 with 33 SingleSign rule and 0 generalized
[2026-05-31 23:19:03] [INFO ] Computed 12 invariants in 1 ms
Computed 12 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-12488221298776140854.kers
Total runtime 3 ms.
[2026-05-31 23:19:03] [INFO ] Implicit Places using invariants in 78 ms returned []
[2026-05-31 23:19:03] [INFO ] Flow matrix only has 183 transitions (discarded 13 similar events)
[2026-05-31 23:19:03] [INFO ] Invariant cache hit.
[2026-05-31 23:19:03] [INFO ] State equation strengthened by 11 read => feed constraints.
[2026-05-31 23:19:03] [INFO ] Implicit Places using invariants and state equation in 158 ms returned []
Implicit Place search using SMT with State Equation took 239 ms to find 0 implicit places.
[2026-05-31 23:19:03] [INFO ] Redundant transitions in 2 ms returned []
Running 188 sub problems to find dead transitions.
[2026-05-31 23:19:03] [INFO ] Flow matrix only has 183 transitions (discarded 13 similar events)
[2026-05-31 23:19:03] [INFO ] Invariant cache hit.
[2026-05-31 23:19:03] [INFO ] State equation strengthened by 11 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 1 (OVERLAPS) 1/45 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 3 (OVERLAPS) 182/227 variables, 45/57 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/227 variables, 10/67 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/227 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 6 (OVERLAPS) 1/228 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/228 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 8 (OVERLAPS) 0/228 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/228 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 10 (OVERLAPS) 0/228 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 188 unsolved
No progress, stopping.
After SMT solving in domain Real declared 228/228 variables, and 69 constraints, problems are : Problem set: 0 solved, 188 unsolved in 14530 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 45/45 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 188/188 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 188 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 1 (OVERLAPS) 1/45 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 4 (OVERLAPS) 182/227 variables, 45/58 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/227 variables, 10/68 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/227 variables, 188/256 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/227 variables, 2/258 constraints. Problems are: Problem set: 0 solved, 188 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 227/228 variables, and 258 constraints, problems are : Problem set: 0 solved, 188 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 45/45 constraints, ReadFeed: 10/11 constraints, PredecessorRefiner: 188/188 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 44888ms problems are : Problem set: 0 solved, 188 unsolved
Search for dead transitions found 0 dead transitions in 44889ms
Starting structural reductions in SI_LTL mode, iteration 1 : 45/164 places, 196/2362 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 45339 ms. Remains : 45/164 places, 196/2362 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 60 ms :[(NOT p0)]
Running random walk in product with property : ErlangenMainframeV1-PT-bP06C06-LTLFireability-08
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA ErlangenMainframeV1-PT-bP06C06-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV1-PT-bP06C06-LTLFireability-08 finished in 45437 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 164 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 164/164 places, 2362/2362 transitions.
Graph (trivial) has 130 edges and 164 vertex of which 9 / 164 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 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 158 transition count 2332
Reduce places removed 23 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 32 rules applied. Total rules applied 56 place count 135 transition count 2323
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 62 place count 129 transition count 2323
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 62 place count 129 transition count 2309
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 90 place count 115 transition count 2309
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 103 place count 102 transition count 1580
Ensure Unique test removed 6 places
Iterating global reduction 3 with 19 rules applied. Total rules applied 122 place count 96 transition count 1580
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 128 place count 90 transition count 250
Iterating global reduction 3 with 6 rules applied. Total rules applied 134 place count 90 transition count 250
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 135 place count 89 transition count 248
Iterating global reduction 3 with 1 rules applied. Total rules applied 136 place count 89 transition count 248
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 200 place count 57 transition count 216
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 206 place count 57 transition count 210
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 209 place count 54 transition count 203
Iterating global reduction 4 with 3 rules applied. Total rules applied 212 place count 54 transition count 203
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 226 place count 47 transition count 221
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 238 place count 47 transition count 209
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 240 place count 45 transition count 205
Iterating global reduction 5 with 2 rules applied. Total rules applied 242 place count 45 transition count 205
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 252 place count 45 transition count 195
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 254 place count 44 transition count 208
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 266 place count 44 transition count 196
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 270 place count 44 transition count 196
Applied a total of 270 rules in 118 ms. Remains 44 /164 variables (removed 120) and now considering 196/2362 (removed 2166) transitions.
[2026-05-31 23:19:48] [INFO ] Flow matrix only has 183 transitions (discarded 13 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6475432372267532601.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1426845023181423988.kers'
[2026-05-31 23:19:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6475432372267532601.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1426845023181423988.kers]
Normalized transition count is 182 out of 183 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 182 rows 44 cols 2302 entries
Finished phase 1 with 32 SingleSign rule and 0 generalized
[2026-05-31 23:19:48] [INFO ] Computed 12 invariants in 1 ms
Computed 12 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-1426845023181423988.kers
Total runtime 2 ms.
[2026-05-31 23:19:48] [INFO ] Implicit Places using invariants in 104 ms returned []
[2026-05-31 23:19:48] [INFO ] Flow matrix only has 183 transitions (discarded 13 similar events)
[2026-05-31 23:19:48] [INFO ] Invariant cache hit.
[2026-05-31 23:19:48] [INFO ] State equation strengthened by 11 read => feed constraints.
[2026-05-31 23:19:48] [INFO ] Implicit Places using invariants and state equation in 211 ms returned []
Implicit Place search using SMT with State Equation took 317 ms to find 0 implicit places.
[2026-05-31 23:19:48] [INFO ] Redundant transitions in 1 ms returned []
Running 188 sub problems to find dead transitions.
[2026-05-31 23:19:48] [INFO ] Flow matrix only has 183 transitions (discarded 13 similar events)
[2026-05-31 23:19:48] [INFO ] Invariant cache hit.
[2026-05-31 23:19:48] [INFO ] State equation strengthened by 11 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 1 (OVERLAPS) 1/44 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 3 (OVERLAPS) 182/226 variables, 44/56 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/226 variables, 10/66 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/226 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 6 (OVERLAPS) 1/227 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/227 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 8 (OVERLAPS) 0/227 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 188 unsolved
No progress, stopping.
After SMT solving in domain Real declared 227/227 variables, and 67 constraints, problems are : Problem set: 0 solved, 188 unsolved in 10087 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 44/44 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 188/188 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 188 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 1 (OVERLAPS) 1/44 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 3 (OVERLAPS) 182/226 variables, 44/56 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/226 variables, 10/66 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/226 variables, 188/254 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/226 variables, 2/256 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/226 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 188 unsolved
SMT process timed out in 40422ms, After SMT, problems are : Problem set: 0 solved, 188 unsolved
Search for dead transitions found 0 dead transitions in 40424ms
Starting structural reductions in SI_LTL mode, iteration 1 : 44/164 places, 196/2362 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 40871 ms. Remains : 44/164 places, 196/2362 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 82 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ErlangenMainframeV1-PT-bP06C06-LTLFireability-09
Product exploration explored 100000 steps with 0 reset in 397 ms.
Product exploration explored 100000 steps with 0 reset in 439 ms.
Computed a total of 2 stabilizing places and 9 stable transitions
Computed a total of 2 stabilizing places and 9 stable transitions
Knowledge based reduction with 3 factoid took 49 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 40000 steps (8 resets) in 231 ms. (172 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 137 ms. (289 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 903590 steps, run visited all 1 properties in 1674 ms. (steps per millisecond=539 )
Probabilistic random walk after 903590 steps, saw 131736 distinct states, run finished after 1680 ms. (steps per millisecond=537 ) properties seen :1
Knowledge based reduction with 3 factoid took 56 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Knowledge-based reduction took 1975 ms.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Support contains 8 out of 44 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 44/44 places, 196/196 transitions.
Applied a total of 0 rules in 4 ms. Remains 44 /44 variables (removed 0) and now considering 196/196 (removed 0) transitions.
[2026-05-31 23:20:32] [INFO ] Flow matrix only has 183 transitions (discarded 13 similar events)
[2026-05-31 23:20:32] [INFO ] Invariant cache hit.
[2026-05-31 23:20:32] [INFO ] Implicit Places using invariants in 63 ms returned []
[2026-05-31 23:20:32] [INFO ] Flow matrix only has 183 transitions (discarded 13 similar events)
[2026-05-31 23:20:32] [INFO ] Invariant cache hit.
[2026-05-31 23:20:32] [INFO ] State equation strengthened by 11 read => feed constraints.
[2026-05-31 23:20:32] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 204 ms to find 0 implicit places.
[2026-05-31 23:20:32] [INFO ] Redundant transitions in 1 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 215 ms. Remains : 44/44 places, 196/196 transitions.
Computed a total of 2 stabilizing places and 9 stable transitions
Computed a total of 2 stabilizing places and 9 stable transitions
Knowledge based reduction with 3 factoid took 47 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 40000 steps (8 resets) in 214 ms. (186 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (8 resets) in 221 ms. (180 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 903590 steps, run visited all 1 properties in 1592 ms. (steps per millisecond=567 )
Probabilistic random walk after 903590 steps, saw 131736 distinct states, run finished after 1592 ms. (steps per millisecond=567 ) properties seen :1
Knowledge based reduction with 3 factoid took 59 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Knowledge-based reduction took 1924 ms.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 614 ms.
Product exploration explored 100000 steps with 0 reset in 398 ms.
Built C files in :
/tmp/ltsmin8391657839402852477
[2026-05-31 23:20:35] [INFO ] Computing symmetric may disable matrix : 196 transitions.
[2026-05-31 23:20:35] [INFO ] Computation of Complete disable matrix. took 16 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-31 23:20:35] [INFO ] Computing symmetric may enable matrix : 196 transitions.
[2026-05-31 23:20:35] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-31 23:20:35] [INFO ] Computing Do-Not-Accords matrix : 196 transitions.
[2026-05-31 23:20:35] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-31 23:20:35] [INFO ] Built C files in 58ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8391657839402852477
Running compilation step : cd /tmp/ltsmin8391657839402852477;'/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 1145 ms.
Running link step : cd /tmp/ltsmin8391657839402852477;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 56 ms.
Running LTSmin : cd /tmp/ltsmin8391657839402852477;'/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/stateBased16760882379976389324.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 8 out of 44 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 44/44 places, 196/196 transitions.
Applied a total of 0 rules in 4 ms. Remains 44 /44 variables (removed 0) and now considering 196/196 (removed 0) transitions.
[2026-05-31 23:20:50] [INFO ] Flow matrix only has 183 transitions (discarded 13 similar events)
[2026-05-31 23:20:50] [INFO ] Invariant cache hit.
[2026-05-31 23:20:50] [INFO ] Implicit Places using invariants in 72 ms returned []
[2026-05-31 23:20:50] [INFO ] Flow matrix only has 183 transitions (discarded 13 similar events)
[2026-05-31 23:20:50] [INFO ] Invariant cache hit.
[2026-05-31 23:20:50] [INFO ] State equation strengthened by 11 read => feed constraints.
[2026-05-31 23:20:50] [INFO ] Implicit Places using invariants and state equation in 172 ms returned []
Implicit Place search using SMT with State Equation took 250 ms to find 0 implicit places.
[2026-05-31 23:20:50] [INFO ] Redundant transitions in 1 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 262 ms. Remains : 44/44 places, 196/196 transitions.
Built C files in :
/tmp/ltsmin12124116924950642732
[2026-05-31 23:20:50] [INFO ] Computing symmetric may disable matrix : 196 transitions.
[2026-05-31 23:20:50] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-31 23:20:50] [INFO ] Computing symmetric may enable matrix : 196 transitions.
[2026-05-31 23:20:50] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-31 23:20:50] [INFO ] Computing Do-Not-Accords matrix : 196 transitions.
[2026-05-31 23:20:50] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-31 23:20:50] [INFO ] Built C files in 41ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12124116924950642732
Running compilation step : cd /tmp/ltsmin12124116924950642732;'/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 1025 ms.
Running link step : cd /tmp/ltsmin12124116924950642732;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin12124116924950642732;'/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/stateBased8541366622398636961.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-31 23:21:05] [INFO ] Flatten gal took : 23 ms
[2026-05-31 23:21:05] [INFO ] Flatten gal took : 18 ms
[2026-05-31 23:21:05] [INFO ] Time to serialize gal into /tmp/LTL3893078750561823898.gal : 4 ms
[2026-05-31 23:21:05] [INFO ] Time to serialize properties into /tmp/LTL12408400093620056183.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/LTL3893078750561823898.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3372547394765640179.hoa' '-atoms' '/tmp/LTL12408400093620056183.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL12408400093620056183.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3372547394765640179.hoa
Reverse transition relation is NOT exact ! Due to transitions t67.t68.t71.t79.t85.t72.t77, Intersection with reachable at each step enabled. (destroyed/re...190
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
193 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,2.06974,49732,1,0,234,100535,416,166,9029,71680,419
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ErlangenMainframeV1-PT-bP06C06-LTLFireability-09 FALSE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property ErlangenMainframeV1-PT-bP06C06-LTLFireability-09 finished in 79807 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X((G(p1)||X(G(p2))))))'
Support contains 15 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 2362/2362 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 156 transition count 1695
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 156 transition count 1695
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 20 place count 152 transition count 668
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 152 transition count 668
Applied a total of 24 rules in 34 ms. Remains 152 /164 variables (removed 12) and now considering 668/2362 (removed 1694) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6133479894964211013.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7017521403423073773.kers'
[2026-05-31 23:21:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6133479894964211013.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7017521403423073773.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 668 rows 152 cols 8271 entries
Finished phase 1 with 132 SingleSign rule and 2 generalized
[2026-05-31 23:21:08] [INFO ] Computed 18 invariants in 5 ms
Computed 18 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-7017521403423073773.kers
Total runtime 8 ms.
[2026-05-31 23:21:08] [INFO ] Implicit Places using invariants in 201 ms returned []
[2026-05-31 23:21:08] [INFO ] Invariant cache hit.
[2026-05-31 23:21:08] [INFO ] Implicit Places using invariants and state equation in 605 ms returned []
Implicit Place search using SMT with State Equation took 807 ms to find 0 implicit places.
Running 667 sub problems to find dead transitions.
[2026-05-31 23:21:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 667 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/151 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 667 unsolved
At refinement iteration 2 (OVERLAPS) 1/152 variables, 12/18 constraints. Problems are: Problem set: 0 solved, 667 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/152 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 667 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 152/820 variables, and 19 constraints, problems are : Problem set: 0 solved, 667 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/152 constraints, PredecessorRefiner: 667/153 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 667 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 667 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/151 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 667 unsolved
At refinement iteration 2 (OVERLAPS) 1/152 variables, 12/18 constraints. Problems are: Problem set: 0 solved, 667 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/152 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 667 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/152 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 667 unsolved
At refinement iteration 5 (OVERLAPS) 668/820 variables, 152/171 constraints. Problems are: Problem set: 0 solved, 667 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/820 variables, 153/324 constraints. Problems are: Problem set: 0 solved, 667 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 820/820 variables, and 326 constraints, problems are : Problem set: 0 solved, 667 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 152/152 constraints, PredecessorRefiner: 667/153 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61129ms problems are : Problem set: 0 solved, 667 unsolved
Search for dead transitions found 0 dead transitions in 61132ms
Starting structural reductions in LTL mode, iteration 1 : 152/164 places, 668/2362 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61977 ms. Remains : 152/164 places, 668/2362 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X((G(p1)||X(G(p2))))))'
Stuttering acceptance computed with spot in 451 ms :[true, (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Running random walk in product with property : ErlangenMainframeV1-PT-bP06C06-LTLFireability-10
Product exploration explored 100000 steps with 0 reset in 983 ms.
Product exploration explored 100000 steps with 0 reset in 1270 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 26 factoid took 80 ms. Reduced automaton from 11 states, 35 edges and 3 AP (stutter sensitive) to 6 states, 11 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 572 ms. (69 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (8 resets) in 365 ms. (109 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (8 resets) in 364 ms. (109 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (8 resets) in 334 ms. (119 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (8 resets) in 312 ms. (127 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (8 resets) in 289 ms. (137 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (8 resets) in 326 ms. (122 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 482226 steps, run timeout after 3001 ms. (steps per millisecond=160 ) properties seen :0 out of 6
Probabilistic random walk after 482226 steps, saw 78505 distinct states, run finished after 3001 ms. (steps per millisecond=160 ) properties seen :0
[2026-05-31 23:22:16] [INFO ] Invariant cache hit.
Problem apf1 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 59/66 variables, 7/7 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 80/146 variables, 5/12 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 6/152 variables, 6/18 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/152 variables, 0/18 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 668/820 variables, 152/170 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/820 variables, 0/170 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 0/820 variables, 0/170 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 820/820 variables, and 170 constraints, problems are : Problem set: 1 solved, 5 unsolved in 815 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 152/152 constraints, PredecessorRefiner: 5/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/7 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 59/66 variables, 7/7 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 80/146 variables, 5/12 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 5 unsolved
Problem apf0 is UNSAT
At refinement iteration 5 (OVERLAPS) 6/152 variables, 6/18 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/152 variables, 0/18 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 668/820 variables, 152/170 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/820 variables, 0/170 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 0/820 variables, 0/170 constraints. Problems are: Problem set: 2 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 820/820 variables, and 170 constraints, problems are : Problem set: 2 solved, 4 unsolved in 731 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 152/152 constraints, PredecessorRefiner: 5/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1573ms problems are : Problem set: 2 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 136 ms.
Support contains 7 out of 152 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 152/152 places, 668/668 transitions.
Graph (trivial) has 136 edges and 152 vertex of which 11 / 152 are part of one of the 5 SCC in 1 ms
Free SCC test removed 6 places
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 26 place count 146 transition count 631
Reduce places removed 25 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 34 rules applied. Total rules applied 60 place count 121 transition count 622
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 66 place count 115 transition count 622
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 66 place count 115 transition count 609
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 92 place count 102 transition count 609
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 95 place count 99 transition count 305
Iterating global reduction 3 with 3 rules applied. Total rules applied 98 place count 99 transition count 305
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 99 place count 98 transition count 303
Iterating global reduction 3 with 1 rules applied. Total rules applied 100 place count 98 transition count 303
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 170 place count 63 transition count 268
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 176 place count 63 transition count 262
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 179 place count 60 transition count 255
Iterating global reduction 4 with 3 rules applied. Total rules applied 182 place count 60 transition count 255
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -22
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 196 place count 53 transition count 277
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 206 place count 53 transition count 267
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 208 place count 51 transition count 262
Iterating global reduction 5 with 2 rules applied. Total rules applied 210 place count 51 transition count 262
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 214 place count 51 transition count 258
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
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 50 transition count 262
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 6 with 14 rules applied. Total rules applied 230 place count 50 transition count 248
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
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 232 place count 49 transition count 252
Free-agglomeration rule applied 11 times.
Iterating global reduction 6 with 11 rules applied. Total rules applied 243 place count 49 transition count 241
Reduce places removed 11 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 6 with 24 rules applied. Total rules applied 267 place count 38 transition count 228
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 268 place count 37 transition count 163
Iterating global reduction 7 with 1 rules applied. Total rules applied 269 place count 37 transition count 163
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 275 place count 37 transition count 157
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 278 place count 37 transition count 154
Free-agglomeration rule applied 1 times.
Iterating global reduction 8 with 1 rules applied. Total rules applied 279 place count 37 transition count 153
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 281 place count 36 transition count 152
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 282 place count 35 transition count 151
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 284 place count 33 transition count 151
Applied a total of 284 rules in 79 ms. Remains 33 /152 variables (removed 119) and now considering 151/668 (removed 517) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 79 ms. Remains : 33/152 places, 151/668 transitions.
RANDOM walk for 6313 steps (0 resets) in 132 ms. (47 steps per ms) remains 0/4 properties
Found 2 invariant AP formulas.
Negative knowledge disproves property using: (G p2)
Knowledge based reduction with 28 factoid took 49 ms. Proved property starting from automaton with 6 states, 11 edges and 2 AP (stutter sensitive
Knowledge-based reduction took 5929 ms.
FORMULA ErlangenMainframeV1-PT-bP06C06-LTLFireability-10 FALSE TECHNIQUES NEGATIVE_KNOWLEDGE
Treatment of property ErlangenMainframeV1-PT-bP06C06-LTLFireability-10 finished in 70652 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 G(p1))&&X((p2||X(X(G(p3)))))))'
Support contains 22 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 2362/2362 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 156 transition count 1695
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 156 transition count 1695
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 155 transition count 1694
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 155 transition count 1694
Applied a total of 18 rules in 22 ms. Remains 155 /164 variables (removed 9) and now considering 1694/2362 (removed 668) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14862208873622094122.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5887606887805062508.kers'
[2026-05-31 23:22:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14862208873622094122.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5887606887805062508.kers]
Culled 0 columns in 5 ms.
// Phase 1: matrix 1694 rows 155 cols 24687 entries
Finished phase 1 with 135 SingleSign rule and 2 generalized
[2026-05-31 23:22:18] [INFO ] Computed 18 invariants in 19 ms
Computed 18 P flows in 20 ms.
Exported basis to /tmp/petrispot-output-5887606887805062508.kers
Total runtime 23 ms.
[2026-05-31 23:22:19] [INFO ] Implicit Places using invariants in 284 ms returned []
[2026-05-31 23:22:19] [INFO ] Invariant cache hit.
[2026-05-31 23:22:20] [INFO ] Implicit Places using invariants and state equation in 1011 ms returned []
Implicit Place search using SMT with State Equation took 1297 ms to find 0 implicit places.
Running 1693 sub problems to find dead transitions.
[2026-05-31 23:22:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1693 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 154/1849 variables, and 6 constraints, problems are : Problem set: 0 solved, 1693 unsolved in 30054 ms.
Refiners :[Positive P Invariants (semi-flows): 0/12 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/155 constraints, PredecessorRefiner: 1693/151 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1693 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1693 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/154 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1693 unsolved
At refinement iteration 2 (OVERLAPS) 1/155 variables, 12/18 constraints. Problems are: Problem set: 0 solved, 1693 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 155/1849 variables, and 19 constraints, problems are : Problem set: 0 solved, 1693 unsolved in 30063 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/155 constraints, PredecessorRefiner: 1542/151 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62451ms problems are : Problem set: 0 solved, 1693 unsolved
Search for dead transitions found 0 dead transitions in 62456ms
Starting structural reductions in LTL mode, iteration 1 : 155/164 places, 1694/2362 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63781 ms. Remains : 155/164 places, 1694/2362 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 G(p1))&&X((p2||X(X(G(p3)))))))'
Stuttering acceptance computed with spot in 336 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), true, (AND p1 p0), (NOT p1), (NOT p1), (AND (NOT p2) (NOT p3)), (NOT p3), (NOT p3)]
Running random walk in product with property : ErlangenMainframeV1-PT-bP06C06-LTLFireability-11
Product exploration explored 100000 steps with 0 reset in 2939 ms.
Product exploration explored 100000 steps with 1 reset in 3143 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 14 factoid took 78 ms. Reduced automaton from 8 states, 19 edges and 4 AP (stutter sensitive) to 8 states, 16 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 1391 ms. (28 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (8 resets) in 941 ms. (42 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (8 resets) in 840 ms. (47 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (8 resets) in 970 ms. (41 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (8 resets) in 734 ms. (54 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (8 resets) in 767 ms. (52 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (8 resets) in 667 ms. (59 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (8 resets) in 697 ms. (57 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 610264 steps, run timeout after 6001 ms. (steps per millisecond=101 ) properties seen :0 out of 7
Probabilistic random walk after 610264 steps, saw 99418 distinct states, run finished after 6001 ms. (steps per millisecond=101 ) properties seen :0
[2026-05-31 23:23:37] [INFO ] Invariant cache hit.
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, 7 unsolved
Problem apf1 is UNSAT
At refinement iteration 1 (OVERLAPS) 69/84 variables, 8/8 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 59/143 variables, 4/12 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 12/155 variables, 6/18 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/155 variables, 0/18 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 1694/1849 variables, 155/173 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1849 variables, 0/173 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 0/1849 variables, 0/173 constraints. Problems are: Problem set: 1 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1849/1849 variables, and 173 constraints, problems are : Problem set: 1 solved, 6 unsolved in 2012 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 7/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 69/84 variables, 8/8 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 59/143 variables, 4/12 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 12/155 variables, 6/18 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/155 variables, 0/18 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 1694/1849 variables, 155/173 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1849 variables, 0/173 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 0/1849 variables, 0/173 constraints. Problems are: Problem set: 1 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1849/1849 variables, and 173 constraints, problems are : Problem set: 1 solved, 6 unsolved in 2522 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 6/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4556ms problems are : Problem set: 1 solved, 6 unsolved
Fused 6 Parikh solutions to 3 different solutions.
Finished Parikh walk after 84 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=28 )
Parikh walk visited 6 properties in 443 ms.
Found 1 invariant AP formulas.
Negative knowledge disproves property using: (G (NOT p0))
Knowledge based reduction with 15 factoid took 46 ms. Proved property starting from automaton with 8 states, 16 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 13294 ms.
FORMULA ErlangenMainframeV1-PT-bP06C06-LTLFireability-11 FALSE TECHNIQUES NEGATIVE_KNOWLEDGE
Treatment of property ErlangenMainframeV1-PT-bP06C06-LTLFireability-11 finished in 83548 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 8 out of 164 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 164/164 places, 2362/2362 transitions.
Graph (trivial) has 130 edges and 164 vertex of which 9 / 164 are part of one of the 4 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 158 transition count 2332
Reduce places removed 23 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 32 rules applied. Total rules applied 56 place count 135 transition count 2323
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 62 place count 129 transition count 2323
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 62 place count 129 transition count 2309
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 90 place count 115 transition count 2309
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 103 place count 102 transition count 1580
Ensure Unique test removed 6 places
Iterating global reduction 3 with 19 rules applied. Total rules applied 122 place count 96 transition count 1580
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 128 place count 90 transition count 250
Iterating global reduction 3 with 6 rules applied. Total rules applied 134 place count 90 transition count 250
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 137 place count 87 transition count 244
Iterating global reduction 3 with 3 rules applied. Total rules applied 140 place count 87 transition count 244
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 200 place count 57 transition count 214
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 206 place count 57 transition count 208
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 209 place count 54 transition count 201
Iterating global reduction 4 with 3 rules applied. Total rules applied 212 place count 54 transition count 201
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 230 place count 45 transition count 219
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 242 place count 45 transition count 207
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 244 place count 43 transition count 203
Iterating global reduction 5 with 2 rules applied. Total rules applied 246 place count 43 transition count 203
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 256 place count 43 transition count 193
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 258 place count 42 transition count 206
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 6 with 10 rules applied. Total rules applied 268 place count 42 transition count 196
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 270 place count 42 transition count 196
Applied a total of 270 rules in 187 ms. Remains 42 /164 variables (removed 122) and now considering 196/2362 (removed 2166) transitions.
[2026-05-31 23:23:42] [INFO ] Flow matrix only has 183 transitions (discarded 13 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1327082211371091622.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10745885410253365009.kers'
[2026-05-31 23:23:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1327082211371091622.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10745885410253365009.kers]
Normalized transition count is 182 out of 183 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 182 rows 42 cols 2314 entries
Finished phase 1 with 30 SingleSign rule and 0 generalized
[2026-05-31 23:23:42] [INFO ] Computed 12 invariants in 2 ms
Computed 12 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-10745885410253365009.kers
Total runtime 3 ms.
[2026-05-31 23:23:42] [INFO ] Implicit Places using invariants in 87 ms returned []
[2026-05-31 23:23:42] [INFO ] Flow matrix only has 183 transitions (discarded 13 similar events)
[2026-05-31 23:23:42] [INFO ] Invariant cache hit.
[2026-05-31 23:23:42] [INFO ] State equation strengthened by 11 read => feed constraints.
[2026-05-31 23:23:42] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 255 ms to find 0 implicit places.
[2026-05-31 23:23:42] [INFO ] Redundant transitions in 2 ms returned []
Running 188 sub problems to find dead transitions.
[2026-05-31 23:23:42] [INFO ] Flow matrix only has 183 transitions (discarded 13 similar events)
[2026-05-31 23:23:42] [INFO ] Invariant cache hit.
[2026-05-31 23:23:42] [INFO ] State equation strengthened by 11 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 1 (OVERLAPS) 1/42 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 3 (OVERLAPS) 182/224 variables, 42/54 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/224 variables, 10/64 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/224 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 6 (OVERLAPS) 1/225 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/225 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 8 (OVERLAPS) 0/225 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/225 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 10 (OVERLAPS) 0/225 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 188 unsolved
No progress, stopping.
After SMT solving in domain Real declared 225/225 variables, and 66 constraints, problems are : Problem set: 0 solved, 188 unsolved in 15237 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 42/42 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 188/188 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 188 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 1 (OVERLAPS) 1/42 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 4 (OVERLAPS) 182/224 variables, 42/55 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/224 variables, 10/65 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/224 variables, 188/253 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/224 variables, 1/254 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/224 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 188 unsolved
SMT process timed out in 45709ms, After SMT, problems are : Problem set: 0 solved, 188 unsolved
Search for dead transitions found 0 dead transitions in 45710ms
Starting structural reductions in SI_LTL mode, iteration 1 : 42/164 places, 196/2362 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 46161 ms. Remains : 42/164 places, 196/2362 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 41 ms :[(NOT p0)]
Running random walk in product with property : ErlangenMainframeV1-PT-bP06C06-LTLFireability-12
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 1 ms.
FORMULA ErlangenMainframeV1-PT-bP06C06-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV1-PT-bP06C06-LTLFireability-12 finished in 46234 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)||(X(F(p2))&&p1))))'
Support contains 19 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 2362/2362 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 156 transition count 1695
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 156 transition count 1695
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 154 transition count 1208
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 154 transition count 1208
Applied a total of 20 rules in 23 ms. Remains 154 /164 variables (removed 10) and now considering 1208/2362 (removed 1154) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15869912587809892407.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-26778884040530734.kers'
[2026-05-31 23:24:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15869912587809892407.kers, --Pflows, --basisKERS=/tmp/petrispot-output-26778884040530734.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 1208 rows 154 cols 16911 entries
Finished phase 1 with 134 SingleSign rule and 2 generalized
[2026-05-31 23:24:28] [INFO ] Computed 18 invariants in 10 ms
Computed 18 P flows in 10 ms.
Exported basis to /tmp/petrispot-output-26778884040530734.kers
Total runtime 13 ms.
[2026-05-31 23:24:28] [INFO ] Implicit Places using invariants in 226 ms returned []
[2026-05-31 23:24:28] [INFO ] Invariant cache hit.
[2026-05-31 23:24:29] [INFO ] Implicit Places using invariants and state equation in 846 ms returned []
Implicit Place search using SMT with State Equation took 1075 ms to find 0 implicit places.
Running 1207 sub problems to find dead transitions.
[2026-05-31 23:24:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1207 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/153 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1207 unsolved
At refinement iteration 2 (OVERLAPS) 1/154 variables, 12/18 constraints. Problems are: Problem set: 0 solved, 1207 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 154/1362 variables, and 19 constraints, problems are : Problem set: 0 solved, 1207 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/154 constraints, PredecessorRefiner: 1207/151 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1207 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1207 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/153 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1207 unsolved
At refinement iteration 2 (OVERLAPS) 1/154 variables, 12/18 constraints. Problems are: Problem set: 0 solved, 1207 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 1207 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 154/1362 variables, and 19 constraints, problems are : Problem set: 0 solved, 1207 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/154 constraints, PredecessorRefiner: 1056/151 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62056ms problems are : Problem set: 0 solved, 1207 unsolved
Search for dead transitions found 0 dead transitions in 62062ms
Starting structural reductions in LTL mode, iteration 1 : 154/164 places, 1208/2362 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63165 ms. Remains : 154/164 places, 1208/2362 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)||(X(F(p2))&&p1))))'
Stuttering acceptance computed with spot in 118 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ErlangenMainframeV1-PT-bP06C06-LTLFireability-14
Product exploration explored 100000 steps with 0 reset in 2128 ms.
Stack based approach found an accepted trace after 46 steps with 0 reset with depth 47 and stack size 47 in 1 ms.
FORMULA ErlangenMainframeV1-PT-bP06C06-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property ErlangenMainframeV1-PT-bP06C06-LTLFireability-14 finished in 65464 ms.
All properties solved by simple procedures.
Total runtime 984645 ms.
BK_STOP 1780269934066
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ErlangenMainframeV1-PT-bP06C06"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5973"
echo " Executing tool itstools"
echo " Input is ErlangenMainframeV1-PT-bP06C06, 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-178021499100092"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ErlangenMainframeV1-PT-bP06C06.tgz
mv ErlangenMainframeV1-PT-bP06C06 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 '
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 ;